{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"family":"qf-mod25-markovdeep-endpoint-joint-probability"},"total":25,"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-0051","number":33326,"title":{"zh-Hant":"第 33326 題：有限Markov密度","en":"Question 33326: 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":"2869d69adc872d97f9b4b064a932e72b9b48f56d254cfd2a1a9ab6e784c5b30d","derivation_sha256":"004c3c423843f95958bf56d3861863675cb5eebc8d075c827c65f1af9e3b6fe0"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0052","number":33327,"title":{"zh-Hant":"第 33327 題：有限Markov密度","en":"Question 33327: 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":"15a5b7f7dde5bf79c8fb3dec34201445bedf01a577baa0e6301c0bf2894fe93b","derivation_sha256":"ce1449660b1fca7b5aa5ffd15530543c196217f67f479fa62a72797fd135cbe7"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0053","number":33328,"title":{"zh-Hant":"第 33328 題：有限Markov密度","en":"Question 33328: 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":"0ac3a835bfd44a749256ca5c44bf2e5eebd383c0bee355ec8d5d4963bbc528ae","derivation_sha256":"1dfb8b7d16c4a9a7530233be42665000d21ba40ca01e664ee3107636f900de58"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0054","number":33329,"title":{"zh-Hant":"第 33329 題：有限Markov密度","en":"Question 33329: 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":"f389e18762b50b689309e9ada30c014e88592497ad368a8c8456667179b068bb","derivation_sha256":"b32b97b804f866b21a8263d60e79ec60475cbb0b47a1919fefb0a3b7d3d6ff6e"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0055","number":33330,"title":{"zh-Hant":"第 33330 題：有限Markov密度","en":"Question 33330: 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":"4b5faff3208b911eeab18a328bcc32e6efc389e4511b79db98bf82c5deb9c152","derivation_sha256":"13adb5efa1c88782bd20d1fab4731da783216c7afff578771bc983ae7641ead8"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0056","number":33331,"title":{"zh-Hant":"第 33331 題：有限Markov密度","en":"Question 33331: 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":"12f1a726d3af71f13944c19cea6bdc63cb29c97f7c934760c5e1d83aa7491e51","derivation_sha256":"a00ee05c26c40f2480b0fdfc2f63f96810f12b6267e9d8986e4c71de178f3441"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0057","number":33332,"title":{"zh-Hant":"第 33332 題：有限Markov密度","en":"Question 33332: 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":"c3970ddf83ac195b4bda2e4e180a43240e1b6f01a5a4ab7d185f14a77452c04c","derivation_sha256":"8cd93905edd8d3ea4920038847d4714d3b3a79f436c4939fb6174894cf996b4f"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0058","number":33333,"title":{"zh-Hant":"第 33333 題：有限Markov密度","en":"Question 33333: 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":"15bc9e8d0c99660156014bb4d5ea46d625e2beeacdc32fd41fd20811f057a969","derivation_sha256":"11913fb3a658b41ad4583c987aab90c3deacc6a7ddb38b6d89ab98f78e22d457"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0059","number":33334,"title":{"zh-Hant":"第 33334 題：有限Markov密度","en":"Question 33334: 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":"b1cc38b752a77902b9fcc6e795a4615246194672add6393fefb2e1847685fdad","derivation_sha256":"c672264e11747ced79c86dde3abbad2c181a9cbd8d5ca1e9a7154bfda48e13ad"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0060","number":33335,"title":{"zh-Hant":"第 33335 題：有限Markov密度","en":"Question 33335: 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":"c5c5867432c1e4c339f7bbc6be2382084a6bc60dd729292ed590cfc25a840e87","derivation_sha256":"e25b12c29769d92c94008b113c84fb9938d467ab05840e06b23e893d8f3cad73"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0061","number":33336,"title":{"zh-Hant":"第 33336 題：有限Markov密度","en":"Question 33336: 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":"eef8532eb84ebaf8c1068ae6ad10cf1038472bb12be33f87325e8249782fd6ec","derivation_sha256":"a1d18587a4bfb9304691d6e9656c5996d9af4d772b6a5f7f961ae69107259742"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0062","number":33337,"title":{"zh-Hant":"第 33337 題：有限Markov密度","en":"Question 33337: 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":"c2082d2f9072cfe3ed53616622ebd0ba9178f66735d6289fee4489281837bb75","derivation_sha256":"71cf340d87b35917cd57a4e0f3be353c1823eee75bd62cf6f69797ef1adc448c"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0063","number":33338,"title":{"zh-Hant":"第 33338 題：有限Markov密度","en":"Question 33338: 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":"477046baaa485347f77df97b7693e531e2856eed486e8dea5306bd0bb3bb726c","derivation_sha256":"aec2030431601240651617268c2f14f6f40767d0a77adcb4d2ec73847ac1bb97"},{"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"},{"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"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0066","number":33341,"title":{"zh-Hant":"第 33341 題：有限Markov密度","en":"Question 33341: 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":"f0afe3c49ddc94d3f509cb8beb1188c3f8789663397ede2a357285ce38088fe2","derivation_sha256":"6d32fc814fd85b015332dcb42b9d8fec3835f983b6f7432c751ac48636475f23"},{"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"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0068","number":33343,"title":{"zh-Hant":"第 33343 題：有限Markov密度","en":"Question 33343: 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":"ba995155a5fb8989696f1b414d9753cd5cedc5e121935b4e105a0f207bff6f47","derivation_sha256":"f0f2fffc6f84e0e801f6f6f623d371a0410016126405053d5215153e44baa6a1"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0069","number":33344,"title":{"zh-Hant":"第 33344 題：有限Markov密度","en":"Question 33344: 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":"0d557a94dfed30398c8fa7ebdb223e6ef73f52fd2f0c9c0948f9b5d41dd2f60d","derivation_sha256":"ba5369a81c6bb566590d952243f108ff1033521fda9e152ed051c8cf88bb84be"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0070","number":33345,"title":{"zh-Hant":"第 33345 題：有限Markov密度","en":"Question 33345: 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":"a9e554ab173e6c261019483d65f96d5ee81aae52681e46c13f17cfcfdb527e2c","derivation_sha256":"9b8db1f2d654474648e77fef6178bbe580264e6fed9b48ece4f4274f0e5ecaf6"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0071","number":33346,"title":{"zh-Hant":"第 33346 題：有限Markov密度","en":"Question 33346: 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":"beba98ae59d229923f103fe1432f308ccdeaac428e503a7b21da05180c14ff5b","derivation_sha256":"a4c50ae8b5a7e82dcd6d9c227f554850aceb47ebdea7da1496065ac0939c0862"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0072","number":33347,"title":{"zh-Hant":"第 33347 題：有限Markov密度","en":"Question 33347: 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":"e00ac0b6d7f4560f5ac6f7d3156fb2ff004190815a990dd3fdb8566af3b55b56","derivation_sha256":"cfbeef6de178daf33650460becb28ce2a9e692a08fcc314ecf8f5c88326832ec"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0073","number":33348,"title":{"zh-Hant":"第 33348 題：有限Markov密度","en":"Question 33348: 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":"573418613750d4e69d8bb6ccf78075c596059068b380a18ba786231877cfa604","derivation_sha256":"609dc1b3d0a12d75865b22acea3c3458f28cd7c6c7bf7f6e1204d4c1e5dba16b"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0074","number":33349,"title":{"zh-Hant":"第 33349 題：有限Markov密度","en":"Question 33349: 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":"4194674b3dbdb3367510bfbda706732d08dac841e3ac3b4ea71170d0731e5887","derivation_sha256":"b3b20be6b04307507e0343019b48a4100496f5df9cf402b645905c9ceb36f822"},{"question_id":"q-20261013-advance-20261025-r06-finite-markov-chain-0075","number":33350,"title":{"zh-Hant":"第 33350 題：有限Markov密度","en":"Question 33350: 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":"a9ba196a1c63c760847891f993818f97f5ce67860b66f2015c6a9d351e380b01","derivation_sha256":"08cce93a738c41554347ae903d91efe2b56de1a7964115143c402fe83c020a94"}]}