{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261015-advance-20261115-r06-minimum-vertex-cover-0100"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261015-advance-20261115-r06-minimum-vertex-cover-0100","number":26025,"title":{"zh-Hant":"第 26025 題：最小頂點覆蓋","en":"Question 26025: Edgeless Graphs Have the Unique Empty Minimum Cover; Other Graphs May Have Several"},"family_id":"qf-mod46-mincover-empty-multiple-boundary","batch_id":"batch-20261015-advance-20261115-r06-minimum-vertex-cover-foundations","mko_ids":["mko-minimum-vertex-cover"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"948d7e84e09f719320d016c6f7cd9f99cacb652a6b0dee255320f90d87eb495c","derivation_sha256":"eac58fd7ae9bf5b910599b9f0a52dda593842c7c404c60262d104f56b4a74b1f"}]}