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