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