{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r06-finite-markov-chain-0038"},"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-0038","number":33363,"title":{"zh-Hant":"第 33363 題：有限Markov密度","en":"Question 33363: 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":"512711a2ea0fa48ea689511f53ebe50153681f1249c9440b91c6e091a1033cfc","derivation_sha256":"673669adb3ba0a6f804ed864b975284b10e91a651f91fc24c5467304367f2ea1"}]}