{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261007-advance-20261009-r02-tree-0043"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261007-advance-20261009-r02-tree-0043","number":35493,"title":{"zh-Hant":"第 35493 題：有限樹兩端的唯一道路","en":"Question 35493: Unique Ordered Path in a Finite Tree"},"family_id":"qf-tree-unique-path","batch_id":"batch-20261007-advance-20261009-r02-tree-foundations","mko_ids":["mko-tree"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"dea68a0a2fb89a0b2482086eeb352cff251452f8436ec57c7267dad8c60acc31","derivation_sha256":"4c2762b9474dc083859fa2639652fc0a989c2ec58b37869b1bbb72f4fd6586fc"}]}