{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OFUTIOAMIQ2TR256MEVI6ZAKIP","short_pith_number":"pith:OFUTIOAM","canonical_record":{"source":{"id":"1811.03592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-08T18:26:26Z","cross_cats_sorted":[],"title_canon_sha256":"991cc411b08d51a1d0f7119ce74ceaab32ac9896316a6f71526e8bda4b7c752b","abstract_canon_sha256":"e94e96eefb4a9cef470107a8fc667250e5653500ab186d19b8c0a6f60a413b05"},"schema_version":"1.0"},"canonical_sha256":"716934380c443538ebbe612a8f640a43e4f61f5cabbdcff0b6606d57054f17c1","source":{"kind":"arxiv","id":"1811.03592","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03592","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03592v2","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03592","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"OFUTIOAMIQ2T","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OFUTIOAMIQ2TR256","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OFUTIOAM","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OFUTIOAMIQ2TR256MEVI6ZAKIP","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-08T18:26:26Z","cross_cats_sorted":[],"title_canon_sha256":"991cc411b08d51a1d0f7119ce74ceaab32ac9896316a6f71526e8bda4b7c752b","abstract_canon_sha256":"e94e96eefb4a9cef470107a8fc667250e5653500ab186d19b8c0a6f60a413b05"},"schema_version":"1.0"},"canonical_sha256":"716934380c443538ebbe612a8f640a43e4f61f5cabbdcff0b6606d57054f17c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:52.661626Z","signature_b64":"VZej0R30HPK+QylMF5WQYsvZPM9aJjPqvAHS5DC8guHLkYjp7N0dA64llqVkaaQimGWPqU0lJyb3J/XEHzUxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"716934380c443538ebbe612a8f640a43e4f61f5cabbdcff0b6606d57054f17c1","last_reissued_at":"2026-05-17T23:56:52.661121Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:52.661121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03592","source_version":2,"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:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGuL70YIcBBihlnZNEnDxjK/ihehIxU4dU92Ey0H2y17WTN7tSr6XmlfLMDebAgSmTuhinhLAOO1tiTOlIXYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:31:13.086651Z"},"content_sha256":"29c187d3e15455b53dc709aed175e000a7030218787618ce1ee6ab5437c176b6","schema_version":"1.0","event_id":"sha256:29c187d3e15455b53dc709aed175e000a7030218787618ce1ee6ab5437c176b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OFUTIOAMIQ2TR256MEVI6ZAKIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An O^*(2.619^k) algorithm for 4-path vertex cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2018-11-08T18:26:26Z","abstract_excerpt":"In the 4-path vertex cover problem, the input is an undirected graph $G$ and an integer $k$. The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that every path with 4 vertices in $G$ contains at least one vertex of $S$. In this paper we give a parameterized algorithm for 4-path vertex cover whose time complexity is $O^*(2.619^k)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03592","kind":"arxiv","version":2},"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:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBmp46gD5Vjw695rsJ+/th7p8BzeKo7KvwKYIo7Wv0HP26FUnjRbs2y0O7Ws+gzKGP3Qm+mIXQ87FoWBXKw9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:31:13.087383Z"},"content_sha256":"d3c434a3ef1a155f03bbe7b3e51745fbbfff55d62fd62ce618cac6172613f940","schema_version":"1.0","event_id":"sha256:d3c434a3ef1a155f03bbe7b3e51745fbbfff55d62fd62ce618cac6172613f940"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFUTIOAMIQ2TR256MEVI6ZAKIP/bundle.json","state_url":"https://pith.science/pith/OFUTIOAMIQ2TR256MEVI6ZAKIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFUTIOAMIQ2TR256MEVI6ZAKIP/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-09T17:31:13Z","links":{"resolver":"https://pith.science/pith/OFUTIOAMIQ2TR256MEVI6ZAKIP","bundle":"https://pith.science/pith/OFUTIOAMIQ2TR256MEVI6ZAKIP/bundle.json","state":"https://pith.science/pith/OFUTIOAMIQ2TR256MEVI6ZAKIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFUTIOAMIQ2TR256MEVI6ZAKIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OFUTIOAMIQ2TR256MEVI6ZAKIP","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":"e94e96eefb4a9cef470107a8fc667250e5653500ab186d19b8c0a6f60a413b05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-08T18:26:26Z","title_canon_sha256":"991cc411b08d51a1d0f7119ce74ceaab32ac9896316a6f71526e8bda4b7c752b"},"schema_version":"1.0","source":{"id":"1811.03592","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03592","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03592v2","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03592","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"OFUTIOAMIQ2T","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OFUTIOAMIQ2TR256","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OFUTIOAM","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:d3c434a3ef1a155f03bbe7b3e51745fbbfff55d62fd62ce618cac6172613f940","target":"graph","created_at":"2026-05-17T23:56:52Z","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 4-path vertex cover problem, the input is an undirected graph $G$ and an integer $k$. The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that every path with 4 vertices in $G$ contains at least one vertex of $S$. In this paper we give a parameterized algorithm for 4-path vertex cover whose time complexity is $O^*(2.619^k)$.","authors_text":"Dekel Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-08T18:26:26Z","title":"An O^*(2.619^k) algorithm for 4-path vertex cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03592","kind":"arxiv","version":2},"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:29c187d3e15455b53dc709aed175e000a7030218787618ce1ee6ab5437c176b6","target":"record","created_at":"2026-05-17T23:56:52Z","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":"e94e96eefb4a9cef470107a8fc667250e5653500ab186d19b8c0a6f60a413b05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-08T18:26:26Z","title_canon_sha256":"991cc411b08d51a1d0f7119ce74ceaab32ac9896316a6f71526e8bda4b7c752b"},"schema_version":"1.0","source":{"id":"1811.03592","kind":"arxiv","version":2}},"canonical_sha256":"716934380c443538ebbe612a8f640a43e4f61f5cabbdcff0b6606d57054f17c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"716934380c443538ebbe612a8f640a43e4f61f5cabbdcff0b6606d57054f17c1","first_computed_at":"2026-05-17T23:56:52.661121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:52.661121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VZej0R30HPK+QylMF5WQYsvZPM9aJjPqvAHS5DC8guHLkYjp7N0dA64llqVkaaQimGWPqU0lJyb3J/XEHzUxCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:52.661626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03592","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29c187d3e15455b53dc709aed175e000a7030218787618ce1ee6ab5437c176b6","sha256:d3c434a3ef1a155f03bbe7b3e51745fbbfff55d62fd62ce618cac6172613f940"],"state_sha256":"987a9c3ccc935e092d06c529bdb5218a0a8615e644372569b2dceddb9172317b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMhfuHaVMxkRz36aRAsVNHMpqd+O7xKUAKm99LIuCaQF4QFFRX1mr6MipikKvyzD921SCWSbnsBFNF6jz1M1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:31:13.091802Z","bundle_sha256":"a6f92b7ebf23d9f5f91c9dae2977fc4384006755ee3a9ab1e5007090eb3c18e4"}}