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