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