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