{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:67XFZJVYGILSF4MVCFM6YOWXFK","short_pith_number":"pith:67XFZJVY","schema_version":"1.0","canonical_sha256":"f7ee5ca6b8321722f1951159ec3ad72a9a7238cc3fa98a10d201c53f440710e2","source":{"kind":"arxiv","id":"1810.03792","version":1},"attestation_state":"computed","paper":{"title":"A Note on Max $k$-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pasin Manurangsi","submitted_at":"2018-10-09T03:16:12Z","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"},"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":"1810.03792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-09T03:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"d3d1470bd9c272dd51c0644df9a0a0df944fa59b9f55210c3909837bd513affc","abstract_canon_sha256":"c954be83a52ce60a24cbcaabeb7eeded5127777818165a283e518dd38ac15f6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:44.509424Z","signature_b64":"3WdfjNmkaEwqv/7EPO/9vZ1kzTMMZQl8nvYT/XmlBBcXo1mnzIqIupaKh/W26iDSHWqUPrMhDWgbCiypqeWGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7ee5ca6b8321722f1951159ec3ad72a9a7238cc3fa98a10d201c53f440710e2","last_reissued_at":"2026-05-18T00:03:44.508940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:44.508940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Max $k$-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pasin Manurangsi","submitted_at":"2018-10-09T03:16:12Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03792","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":"1810.03792","created_at":"2026-05-18T00:03:44.509006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03792v1","created_at":"2026-05-18T00:03:44.509006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03792","created_at":"2026-05-18T00:03:44.509006+00:00"},{"alias_kind":"pith_short_12","alias_value":"67XFZJVYGILS","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"67XFZJVYGILSF4MV","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"67XFZJVY","created_at":"2026-05-18T12:32:08.215937+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/67XFZJVYGILSF4MVCFM6YOWXFK","json":"https://pith.science/pith/67XFZJVYGILSF4MVCFM6YOWXFK.json","graph_json":"https://pith.science/api/pith-number/67XFZJVYGILSF4MVCFM6YOWXFK/graph.json","events_json":"https://pith.science/api/pith-number/67XFZJVYGILSF4MVCFM6YOWXFK/events.json","paper":"https://pith.science/paper/67XFZJVY"},"agent_actions":{"view_html":"https://pith.science/pith/67XFZJVYGILSF4MVCFM6YOWXFK","download_json":"https://pith.science/pith/67XFZJVYGILSF4MVCFM6YOWXFK.json","view_paper":"https://pith.science/paper/67XFZJVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03792&json=true","fetch_graph":"https://pith.science/api/pith-number/67XFZJVYGILSF4MVCFM6YOWXFK/graph.json","fetch_events":"https://pith.science/api/pith-number/67XFZJVYGILSF4MVCFM6YOWXFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67XFZJVYGILSF4MVCFM6YOWXFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67XFZJVYGILSF4MVCFM6YOWXFK/action/storage_attestation","attest_author":"https://pith.science/pith/67XFZJVYGILSF4MVCFM6YOWXFK/action/author_attestation","sign_citation":"https://pith.science/pith/67XFZJVYGILSF4MVCFM6YOWXFK/action/citation_signature","submit_replication":"https://pith.science/pith/67XFZJVYGILSF4MVCFM6YOWXFK/action/replication_record"}},"created_at":"2026-05-18T00:03:44.509006+00:00","updated_at":"2026-05-18T00:03:44.509006+00:00"}