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