{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261015-advance-20261115-r06-minimum-vertex-cover-0086"},"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-0086","number":26011,"title":{"zh-Hant":"第 26011 題：最小頂點覆蓋","en":"Question 26011: 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":"b858f90515f9d5c13bb5e5b833631dbaabfcd842e506ba7e097f9d3a241d3a6d","derivation_sha256":"1a714002e1235497601ad2c349e6564b4e8e07aca300edadf2fabbda23eba813"}]}