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