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