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