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