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