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