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