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