{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r06-finite-markov-chain-0065"},"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-0065","number":33340,"title":{"zh-Hant":"第 33340 題：有限Markov密度","en":"Question 33340: Initial Mass Times an n-Step Entry Gives an Endpoint Joint Probability"},"family_id":"qf-mod25-markovdeep-endpoint-joint-probability","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":"d55baa5ab1040e9a628a12a70a68ce99b6e3f111d8f919c3e79dbd60f5b0970b","derivation_sha256":"510f3a7f0d01164027b9c6f5ffae70688453a8ffa49fa71a663cd0ec025fa4ad"}]}