{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261007-advance-20261009-r02-tree-0039"},"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-0039","number":35489,"title":{"zh-Hant":"第 35489 題：有限樹兩端的唯一道路","en":"Question 35489: 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":"a40ef96e9f18cfd62256a087a59f8d5af903e2cecde234fcf3bb1ee52c9c5917","derivation_sha256":"1d98fd3c8c41029953dcc5a1744abb4f75a9c20878f637cfc1ac146eebf8f7d7"}]}