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