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