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