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