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