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