{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:L5GDHFE7G53GNKYMM2PBGHWJOR","short_pith_number":"pith:L5GDHFE7","schema_version":"1.0","canonical_sha256":"5f4c33949f377666ab0c669e131ec9746a11ae94595c1f38e157da478aa795af","source":{"kind":"arxiv","id":"1110.1964","version":1},"attestation_state":"computed","paper":{"title":"Towards optimal kernel for connected vertex cover in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Karol Suchan, Lukasz Kowalik, Marcin Pilipczuk","submitted_at":"2011-10-10T09:06:27Z","abstract_excerpt":"We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP is a subset of coNP/poly), for planar graphs Guo and Niedermeier [ICALP'08] showed a kernel with at most 14k vertices, subsequently improved by Wang et al. [MFCS'11] to 4k. The constant 4 here is so small that a natural question arises: could it be already an optimal value for this problem? In this paper we answer this quesion in negative: we show a (11/3)k-ve"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1110.1964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-10T09:06:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"df8357ca9e8fedc5db6e30a93c4f035c7be1d29ff9f9eb6bf777fd47c86d8d7f","abstract_canon_sha256":"292443902a35910ecb028f1bc496f3aff7c8651c817df70068e9eb15b746b575"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:19.227501Z","signature_b64":"HiPdPXoOqHKUpS3oNAQJQoa2ws3YPFkr9swH0FNMBghI1u3+IHNIJtwbS/u+byRXJSJxEiEHUs739GdXFe9DDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f4c33949f377666ab0c669e131ec9746a11ae94595c1f38e157da478aa795af","last_reissued_at":"2026-05-18T04:11:19.226998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:19.226998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards optimal kernel for connected vertex cover in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Karol Suchan, Lukasz Kowalik, Marcin Pilipczuk","submitted_at":"2011-10-10T09:06:27Z","abstract_excerpt":"We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP is a subset of coNP/poly), for planar graphs Guo and Niedermeier [ICALP'08] showed a kernel with at most 14k vertices, subsequently improved by Wang et al. [MFCS'11] to 4k. The constant 4 here is so small that a natural question arises: could it be already an optimal value for this problem? In this paper we answer this quesion in negative: we show a (11/3)k-ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1964","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.1964","created_at":"2026-05-18T04:11:19.227072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1964v1","created_at":"2026-05-18T04:11:19.227072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1964","created_at":"2026-05-18T04:11:19.227072+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5GDHFE7G53G","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5GDHFE7G53GNKYM","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5GDHFE7","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR","json":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR.json","graph_json":"https://pith.science/api/pith-number/L5GDHFE7G53GNKYMM2PBGHWJOR/graph.json","events_json":"https://pith.science/api/pith-number/L5GDHFE7G53GNKYMM2PBGHWJOR/events.json","paper":"https://pith.science/paper/L5GDHFE7"},"agent_actions":{"view_html":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR","download_json":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR.json","view_paper":"https://pith.science/paper/L5GDHFE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1964&json=true","fetch_graph":"https://pith.science/api/pith-number/L5GDHFE7G53GNKYMM2PBGHWJOR/graph.json","fetch_events":"https://pith.science/api/pith-number/L5GDHFE7G53GNKYMM2PBGHWJOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/action/storage_attestation","attest_author":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/action/author_attestation","sign_citation":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/action/citation_signature","submit_replication":"https://pith.science/pith/L5GDHFE7G53GNKYMM2PBGHWJOR/action/replication_record"}},"created_at":"2026-05-18T04:11:19.227072+00:00","updated_at":"2026-05-18T04:11:19.227072+00:00"}