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