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