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