{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KVGQ7C5WXO3KF7B3VOVUU2UWNK","short_pith_number":"pith:KVGQ7C5W","schema_version":"1.0","canonical_sha256":"554d0f8bb6bbb6a2fc3babab4a6a966a8b7c24e819dbc93e42346b0790f8eb86","source":{"kind":"arxiv","id":"1711.07872","version":1},"attestation_state":"computed","paper":{"title":"Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Diptapriyo Majumdar, R. Krithika, Venkatesh Raman","submitted_at":"2017-11-21T16:17:26Z","abstract_excerpt":"The CONNECTED VERTEX COVER problem asks for a vertex cover in a graph that induces a connected subgraph. The problem is known to be fixed-parameter tractable (FPT), and is unlikely to have a polynomial sized kernel (under complexity theoretic assumptions) when parameterized by the solution size. In a recent paper, Lokshtanov et al.[STOC 2017], have shown an $\\alpha$-approximate kernel for the problem for every $\\alpha > 1$, in the framework of approximate or lossy kernelization. In this work, we exhibit lossy kernels and FPT algorithms for CONNECTED VERTEX COVER for parameters that are more na"},"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":"1711.07872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T16:17:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bb58effe6348651bb369671409b329d6881c9ccf545b6e4118042db929e274cd","abstract_canon_sha256":"d0c20660ae91781015068ce0e0935897eacc403d2bd7c8f5ffb913e4b5294724"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:05.027497Z","signature_b64":"mJbJuXsGEvKTvJrmsbPbmEUdRB1cTir4Y03zjT7xOeBjuurKzGdSkDPc2cN7f/JsQfmEz3ZJQeEBfUlo0itwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"554d0f8bb6bbb6a2fc3babab4a6a966a8b7c24e819dbc93e42346b0790f8eb86","last_reissued_at":"2026-05-18T00:04:05.026814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:05.026814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Diptapriyo Majumdar, R. Krithika, Venkatesh Raman","submitted_at":"2017-11-21T16:17:26Z","abstract_excerpt":"The CONNECTED VERTEX COVER problem asks for a vertex cover in a graph that induces a connected subgraph. The problem is known to be fixed-parameter tractable (FPT), and is unlikely to have a polynomial sized kernel (under complexity theoretic assumptions) when parameterized by the solution size. In a recent paper, Lokshtanov et al.[STOC 2017], have shown an $\\alpha$-approximate kernel for the problem for every $\\alpha > 1$, in the framework of approximate or lossy kernelization. In this work, we exhibit lossy kernels and FPT algorithms for CONNECTED VERTEX COVER for parameters that are more na"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07872","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":"1711.07872","created_at":"2026-05-18T00:04:05.026922+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07872v1","created_at":"2026-05-18T00:04:05.026922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07872","created_at":"2026-05-18T00:04:05.026922+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVGQ7C5WXO3K","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVGQ7C5WXO3KF7B3","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVGQ7C5W","created_at":"2026-05-18T12:31:28.150371+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/KVGQ7C5WXO3KF7B3VOVUU2UWNK","json":"https://pith.science/pith/KVGQ7C5WXO3KF7B3VOVUU2UWNK.json","graph_json":"https://pith.science/api/pith-number/KVGQ7C5WXO3KF7B3VOVUU2UWNK/graph.json","events_json":"https://pith.science/api/pith-number/KVGQ7C5WXO3KF7B3VOVUU2UWNK/events.json","paper":"https://pith.science/paper/KVGQ7C5W"},"agent_actions":{"view_html":"https://pith.science/pith/KVGQ7C5WXO3KF7B3VOVUU2UWNK","download_json":"https://pith.science/pith/KVGQ7C5WXO3KF7B3VOVUU2UWNK.json","view_paper":"https://pith.science/paper/KVGQ7C5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07872&json=true","fetch_graph":"https://pith.science/api/pith-number/KVGQ7C5WXO3KF7B3VOVUU2UWNK/graph.json","fetch_events":"https://pith.science/api/pith-number/KVGQ7C5WXO3KF7B3VOVUU2UWNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVGQ7C5WXO3KF7B3VOVUU2UWNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVGQ7C5WXO3KF7B3VOVUU2UWNK/action/storage_attestation","attest_author":"https://pith.science/pith/KVGQ7C5WXO3KF7B3VOVUU2UWNK/action/author_attestation","sign_citation":"https://pith.science/pith/KVGQ7C5WXO3KF7B3VOVUU2UWNK/action/citation_signature","submit_replication":"https://pith.science/pith/KVGQ7C5WXO3KF7B3VOVUU2UWNK/action/replication_record"}},"created_at":"2026-05-18T00:04:05.026922+00:00","updated_at":"2026-05-18T00:04:05.026922+00:00"}