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