{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261003-advance-20261004-r04-graph-0031"},"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-0031","number":35281,"title":{"zh-Hant":"第 35281 題：簡單無向圖的鄰居集合","en":"Question 35281: 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":"0748c7dca41b518d1a71cc035dbc69f93915db1712920cf522a85c12f5216e20","derivation_sha256":"cf36c68d32c646894e58a0ff9b22842657901993619cc9e7e759165bc81780c3"}]}