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