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