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