{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WM45V3LHFNATUQADS4DNN2VQDH","short_pith_number":"pith:WM45V3LH","schema_version":"1.0","canonical_sha256":"b339daed672b413a40039706d6eab019dd882dd879775e2fb321257940e2d196","source":{"kind":"arxiv","id":"1812.10808","version":1},"attestation_state":"computed","paper":{"title":"Above guarantee parameterization for vertex cover on graphs with maximum degree 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2018-12-27T19:45:43Z","abstract_excerpt":"In the vertex cover problem, the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that every edge of $G$ is incident on at least one vertex in $S$. We study the vertex cover problem on graphs with maximum degree 4 and minimum degree at least 2, parameterized by $r = k-n/3$. We give an algorithm for this problem whose running time is $O^*(1.6253^r)$. As a corollary, we obtain an $O^*(1.2403^k)$-time algorithm for vertex cover on graphs with maximum degree 4."},"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":"1812.10808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-27T19:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"5e9207bfc6977fe26404846a8f508372f802c6eb7bcfece212edc6d315f371a2","abstract_canon_sha256":"0de8bfacd1cf93b423fd257a034787a097c1c1780ae5d3a24735971f30ee1805"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:17.015807Z","signature_b64":"fn0m3DvVi8CJyRY5dlFRjhfMkivln8Cn2t4QLCLWOT0clDrJsZlATNIF6SzhiVXC/mw+Q1UVpMEX0XKfNj6+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b339daed672b413a40039706d6eab019dd882dd879775e2fb321257940e2d196","last_reissued_at":"2026-05-17T23:57:17.015341Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:17.015341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Above guarantee parameterization for vertex cover on graphs with maximum degree 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2018-12-27T19:45:43Z","abstract_excerpt":"In the vertex cover problem, the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that every edge of $G$ is incident on at least one vertex in $S$. We study the vertex cover problem on graphs with maximum degree 4 and minimum degree at least 2, parameterized by $r = k-n/3$. We give an algorithm for this problem whose running time is $O^*(1.6253^r)$. As a corollary, we obtain an $O^*(1.2403^k)$-time algorithm for vertex cover on graphs with maximum degree 4."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10808","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":"1812.10808","created_at":"2026-05-17T23:57:17.015436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10808v1","created_at":"2026-05-17T23:57:17.015436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10808","created_at":"2026-05-17T23:57:17.015436+00:00"},{"alias_kind":"pith_short_12","alias_value":"WM45V3LHFNAT","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WM45V3LHFNATUQAD","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WM45V3LH","created_at":"2026-05-18T12:33:01.666342+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/WM45V3LHFNATUQADS4DNN2VQDH","json":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH.json","graph_json":"https://pith.science/api/pith-number/WM45V3LHFNATUQADS4DNN2VQDH/graph.json","events_json":"https://pith.science/api/pith-number/WM45V3LHFNATUQADS4DNN2VQDH/events.json","paper":"https://pith.science/paper/WM45V3LH"},"agent_actions":{"view_html":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH","download_json":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH.json","view_paper":"https://pith.science/paper/WM45V3LH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10808&json=true","fetch_graph":"https://pith.science/api/pith-number/WM45V3LHFNATUQADS4DNN2VQDH/graph.json","fetch_events":"https://pith.science/api/pith-number/WM45V3LHFNATUQADS4DNN2VQDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH/action/storage_attestation","attest_author":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH/action/author_attestation","sign_citation":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH/action/citation_signature","submit_replication":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH/action/replication_record"}},"created_at":"2026-05-17T23:57:17.015436+00:00","updated_at":"2026-05-17T23:57:17.015436+00:00"}