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