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