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