{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WM45V3LHFNATUQADS4DNN2VQDH","short_pith_number":"pith:WM45V3LH","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"},"canonical_sha256":"b339daed672b413a40039706d6eab019dd882dd879775e2fb321257940e2d196","source":{"kind":"arxiv","id":"1812.10808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10808","created_at":"2026-05-17T23:57:17Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10808v1","created_at":"2026-05-17T23:57:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10808","created_at":"2026-05-17T23:57:17Z"},{"alias_kind":"pith_short_12","alias_value":"WM45V3LHFNAT","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WM45V3LHFNATUQAD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WM45V3LH","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WM45V3LHFNATUQADS4DNN2VQDH","target":"record","payload":{"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"},"canonical_sha256":"b339daed672b413a40039706d6eab019dd882dd879775e2fb321257940e2d196","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"},"source_kind":"arxiv","source_id":"1812.10808","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uhpaiz4eAUR9kBq8mgudUK0HDxhl8icYqignzeFGRE6I0MmEFdXYRczCP64QHzgWJVirurx+prIjl2gDP1laCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:20:59.663655Z"},"content_sha256":"d9f162b809acafd7407acbf177df4d3c680d232660564c75f0974343582b9789","schema_version":"1.0","event_id":"sha256:d9f162b809acafd7407acbf177df4d3c680d232660564c75f0974343582b9789"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WM45V3LHFNATUQADS4DNN2VQDH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Sm3kvbWdHmquGyw8y1aciYFVPVRZU+9L5rZ1MPbf9jEEm8Oo0KcICGoox+zlIRw3CYHGhVR/rgxNWNHwXN5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:20:59.664012Z"},"content_sha256":"813bddffed09500e4fee63caf9819c3ff6c3cbdce8affff66d8536d78724ce3d","schema_version":"1.0","event_id":"sha256:813bddffed09500e4fee63caf9819c3ff6c3cbdce8affff66d8536d78724ce3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH/bundle.json","state_url":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WM45V3LHFNATUQADS4DNN2VQDH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T16:20:59Z","links":{"resolver":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH","bundle":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH/bundle.json","state":"https://pith.science/pith/WM45V3LHFNATUQADS4DNN2VQDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WM45V3LHFNATUQADS4DNN2VQDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WM45V3LHFNATUQADS4DNN2VQDH","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":"0de8bfacd1cf93b423fd257a034787a097c1c1780ae5d3a24735971f30ee1805","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-27T19:45:43Z","title_canon_sha256":"5e9207bfc6977fe26404846a8f508372f802c6eb7bcfece212edc6d315f371a2"},"schema_version":"1.0","source":{"id":"1812.10808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10808","created_at":"2026-05-17T23:57:17Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10808v1","created_at":"2026-05-17T23:57:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10808","created_at":"2026-05-17T23:57:17Z"},{"alias_kind":"pith_short_12","alias_value":"WM45V3LHFNAT","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WM45V3LHFNATUQAD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WM45V3LH","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:813bddffed09500e4fee63caf9819c3ff6c3cbdce8affff66d8536d78724ce3d","target":"graph","created_at":"2026-05-17T23:57:17Z","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 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.","authors_text":"Dekel Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-27T19:45:43Z","title":"Above guarantee parameterization for vertex cover on graphs with maximum degree 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10808","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:d9f162b809acafd7407acbf177df4d3c680d232660564c75f0974343582b9789","target":"record","created_at":"2026-05-17T23:57:17Z","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":"0de8bfacd1cf93b423fd257a034787a097c1c1780ae5d3a24735971f30ee1805","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-27T19:45:43Z","title_canon_sha256":"5e9207bfc6977fe26404846a8f508372f802c6eb7bcfece212edc6d315f371a2"},"schema_version":"1.0","source":{"id":"1812.10808","kind":"arxiv","version":1}},"canonical_sha256":"b339daed672b413a40039706d6eab019dd882dd879775e2fb321257940e2d196","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b339daed672b413a40039706d6eab019dd882dd879775e2fb321257940e2d196","first_computed_at":"2026-05-17T23:57:17.015341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:17.015341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fn0m3DvVi8CJyRY5dlFRjhfMkivln8Cn2t4QLCLWOT0clDrJsZlATNIF6SzhiVXC/mw+Q1UVpMEX0XKfNj6+CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:17.015807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9f162b809acafd7407acbf177df4d3c680d232660564c75f0974343582b9789","sha256:813bddffed09500e4fee63caf9819c3ff6c3cbdce8affff66d8536d78724ce3d"],"state_sha256":"18f43596d84fdf45f98d3b5d0f2a003b11be139c4d8412edc75ef8c0cd5309f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zAGqY++JbiIpuX2V94+p/CiZYqO2uRsE61JfobRr0N/n0cYtMXEPPIxGx5UVOcc+WHKv18yBynPbykVvwtJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:20:59.666142Z","bundle_sha256":"0a1817ea3dce77145d59a314281394098c19822acde879a0763cd2e03edab387"}}