{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261003-advance-20261004-r04-graph-0045"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261003-advance-20261004-r04-graph-0045","number":35295,"title":{"zh-Hant":"第 35295 題：簡單無向圖的鄰居集合","en":"Question 35295: Neighbors in a Simple Undirected Graph"},"family_id":"qf-simple-graph-neighbors","batch_id":"batch-20261003-advance-20261004-r04-graph-foundations","mko_ids":["mko-graph"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"10236415910342c9460cbf3656a0837d2090bf11da6cb803c5a978d216f1dcb7","derivation_sha256":"154258c20e9b1e877f4c4680766ba0d04d268b3fd8884d21f1a3442ab9f49310"}]}