{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261025-r06-finite-markov-chain-0049"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0049","number":33374,"title":{"zh-Hant":"第 33374 題：有限Markov密度","en":"Question 33374: A Conditional n-Step Entry without Inventing an Initial Law"},"family_id":"qf-mod25-markovdeep-n-step-entry","batch_id":"batch-20261013-advance-20261025-r06-finite-markov-chain-foundations","mko_ids":["mko-finite-markov-chain"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"7aed9a860a574f7ffd96f1300c6e225a12ee4d6eae96adf647402aef8ccd3d50","derivation_sha256":"c7b8121e578d38c247c039535d9a01361b56a5a7bafd3ffa8fa301b0831f4eee"}]}