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