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