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