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