{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KVGQ7C5WXO3KF7B3VOVUU2UWNK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d0c20660ae91781015068ce0e0935897eacc403d2bd7c8f5ffb913e4b5294724","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T16:17:26Z","title_canon_sha256":"bb58effe6348651bb369671409b329d6881c9ccf545b6e4118042db929e274cd"},"schema_version":"1.0","source":{"id":"1711.07872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07872","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07872v1","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07872","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"KVGQ7C5WXO3K","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KVGQ7C5WXO3KF7B3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KVGQ7C5W","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:039e38edd688340de1db655f3a4c31ce28e4222fd65c3f0cc05b447a0d877cb2","target":"graph","created_at":"2026-05-18T00:04:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Diptapriyo Majumdar, R. Krithika, Venkatesh Raman","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T16:17:26Z","title":"Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07872","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ad06e6ce2455b23704e2a4e0eabc129ec18958638b970473b180d8c9206cf90c","target":"record","created_at":"2026-05-18T00:04:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d0c20660ae91781015068ce0e0935897eacc403d2bd7c8f5ffb913e4b5294724","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T16:17:26Z","title_canon_sha256":"bb58effe6348651bb369671409b329d6881c9ccf545b6e4118042db929e274cd"},"schema_version":"1.0","source":{"id":"1711.07872","kind":"arxiv","version":1}},"canonical_sha256":"554d0f8bb6bbb6a2fc3babab4a6a966a8b7c24e819dbc93e42346b0790f8eb86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"554d0f8bb6bbb6a2fc3babab4a6a966a8b7c24e819dbc93e42346b0790f8eb86","first_computed_at":"2026-05-18T00:04:05.026814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:05.026814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mJbJuXsGEvKTvJrmsbPbmEUdRB1cTir4Y03zjT7xOeBjuurKzGdSkDPc2cN7f/JsQfmEz3ZJQeEBfUlo0itwAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:05.027497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad06e6ce2455b23704e2a4e0eabc129ec18958638b970473b180d8c9206cf90c","sha256:039e38edd688340de1db655f3a4c31ce28e4222fd65c3f0cc05b447a0d877cb2"],"state_sha256":"045ce686fb6d119de3d9995430cb0d507389709ee3245c1976bea393e5479f98"}