{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261015-advance-20261115-r06-minimum-vertex-cover-0069"},"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-0069","number":26069,"title":{"zh-Hant":"第 26069 題：最小頂點覆蓋","en":"Question 26069: A Cover Can Resist Every Single Deletion yet Be Larger than Another Cover"},"family_id":"qf-mod46-mincover-minimal-not-minimum","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":"3feadc1f3a8de7f74dc5405bd47f756b46ac29e699f053f727eedde6b5a66b8b","derivation_sha256":"a270b3fd2198bd834a36d629638d88f4c907d0b459351bc72d3d1c729e83ce68"}]}