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