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