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