{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261108-r07-finite-directed-graph-0051"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261014-advance-20261108-r07-finite-directed-graph-0051","number":20801,"title":{"zh-Hant":"第 20801 題：有限有向圖","en":"Question 20801: Every Successive Step Must Follow Its Own Directed Edge"},"family_id":"qf-mod39-digraph-directed-walk-audit","batch_id":"batch-20261014-advance-20261108-r07-finite-directed-graph-foundations","mko_ids":["mko-finite-directed-graph"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"4a8f81d3d77b4bdf78338cab454f691da757a2f7dff8e78bb71746878c67b1b6","derivation_sha256":"47cd4c16eea10bdec85208ad8825c3bde26359ff2e539a92888d3639bf43fc83"}]}