{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261014-advance-20261108-r07-finite-directed-graph-0053"},"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-0053","number":20803,"title":{"zh-Hant":"第 20803 題：有限有向圖","en":"Question 20803: 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":"54287f0169eb75b0b4ae76c59d9a1a558bdd05967313a2c6471444f81d1dcdd6","derivation_sha256":"968d199c2430d0e4066cd2f62b6322ba4442254340c5e754e2ab1e58cd8b2f56"}]}