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