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