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