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