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