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