{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:67XFZJVYGILSF4MVCFM6YOWXFK","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":"c954be83a52ce60a24cbcaabeb7eeded5127777818165a283e518dd38ac15f6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-09T03:16:12Z","title_canon_sha256":"d3d1470bd9c272dd51c0644df9a0a0df944fa59b9f55210c3909837bd513affc"},"schema_version":"1.0","source":{"id":"1810.03792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03792","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03792v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03792","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"67XFZJVYGILS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"67XFZJVYGILSF4MV","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"67XFZJVY","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:13100588ac3c84f155902eec9f0018a464a40b40f9579a6b0457d67f1543abdf","target":"graph","created_at":"2026-05-18T00:03:44Z","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":"In Maximum $k$-Vertex Cover (Max $k$-VC), the input is an edge-weighted graph $G$ and an integer $k$, and the goal is to find a subset $S$ of $k$ vertices that maximizes the total weight of edges covered by $S$. Here we say that an edge is covered by $S$ iff at least one of its endpoints lies in $S$.\n  We present an FPT approximation scheme (FPT-AS) that runs in $(1/\\epsilon)^{O(k)} poly(n)$ time for the problem, which improves upon Gupta et al.'s $(k/\\epsilon)^{O(k)} poly(n)$-time FPT-AS [SODA'18, FOCS'18]. Our algorithm is simple: just use brute force to find the best $k$-vertex subset among","authors_text":"Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-09T03:16:12Z","title":"A Note on Max $k$-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03792","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:13c6edb9fa4fac0aa25b9ddb3b7096e3585b3556248264ffe48ded2570660b7a","target":"record","created_at":"2026-05-18T00:03:44Z","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":"c954be83a52ce60a24cbcaabeb7eeded5127777818165a283e518dd38ac15f6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-09T03:16:12Z","title_canon_sha256":"d3d1470bd9c272dd51c0644df9a0a0df944fa59b9f55210c3909837bd513affc"},"schema_version":"1.0","source":{"id":"1810.03792","kind":"arxiv","version":1}},"canonical_sha256":"f7ee5ca6b8321722f1951159ec3ad72a9a7238cc3fa98a10d201c53f440710e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7ee5ca6b8321722f1951159ec3ad72a9a7238cc3fa98a10d201c53f440710e2","first_computed_at":"2026-05-18T00:03:44.508940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:44.508940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3WdfjNmkaEwqv/7EPO/9vZ1kzTMMZQl8nvYT/XmlBBcXo1mnzIqIupaKh/W26iDSHWqUPrMhDWgbCiypqeWGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:44.509424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13c6edb9fa4fac0aa25b9ddb3b7096e3585b3556248264ffe48ded2570660b7a","sha256:13100588ac3c84f155902eec9f0018a464a40b40f9579a6b0457d67f1543abdf"],"state_sha256":"ef9c17c91c68b700156ef0e776ddd242ee21d04af34f06d96c001f3a451a4d8f"}