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