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