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