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