{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261108-r07-finite-directed-graph-0030"},"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-0030","number":20830,"title":{"zh-Hant":"第 20830 題：有限有向圖","en":"Question 20830: In-Degrees and Out-Degrees Each Sum to the Edge Count"},"family_id":"qf-mod39-digraph-in-out-degree","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":"63b8093f89f73f82da13da20b350896d687502f1bdfb5cb12ee9947465898a14","derivation_sha256":"0757ea2a78fa4ade6481f3ffa392d8a7e564b39c018322738329fc133af15686"}]}