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