{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AQI7CNBUYBE2YNROLZNHGOXMSF","short_pith_number":"pith:AQI7CNBU","canonical_record":{"source":{"id":"1809.02636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-07T18:46:11Z","cross_cats_sorted":[],"title_canon_sha256":"e63c6c80f57afaf8394ec8b67fb490a637497761da3f9e15c882a1a6cb20c706","abstract_canon_sha256":"f96cd3c47528d7eb56c0ff2b9b718e9350b206cde8c9bfff0222f8432247a4be"},"schema_version":"1.0"},"canonical_sha256":"0411f13434c049ac362e5e5a733aec9177b4cd97ddf7cf6035bd49e11bd749c4","source":{"kind":"arxiv","id":"1809.02636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02636","created_at":"2026-05-18T00:06:15Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02636v1","created_at":"2026-05-18T00:06:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02636","created_at":"2026-05-18T00:06:15Z"},{"alias_kind":"pith_short_12","alias_value":"AQI7CNBUYBE2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AQI7CNBUYBE2YNRO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AQI7CNBU","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AQI7CNBUYBE2YNROLZNHGOXMSF","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-07T18:46:11Z","cross_cats_sorted":[],"title_canon_sha256":"e63c6c80f57afaf8394ec8b67fb490a637497761da3f9e15c882a1a6cb20c706","abstract_canon_sha256":"f96cd3c47528d7eb56c0ff2b9b718e9350b206cde8c9bfff0222f8432247a4be"},"schema_version":"1.0"},"canonical_sha256":"0411f13434c049ac362e5e5a733aec9177b4cd97ddf7cf6035bd49e11bd749c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:15.744726Z","signature_b64":"3/Gp0ty7e0Uvspgwzagl8kLSCmXEHRVVt7Z9XHPAjBKNTYGUtj29xRl/h71eq/XyTYQ5ubi/NatlKFoVA0dvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0411f13434c049ac362e5e5a733aec9177b4cd97ddf7cf6035bd49e11bd749c4","last_reissued_at":"2026-05-18T00:06:15.744140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:15.744140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02636","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-18T00:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1y/IERFGIGhckR4SW7/wgCm44MFs8NB1YS5uaHbQi1Pu+4a80XKYgsNr22WL0F/5ppoKUNFaGC8PHwhTH+kgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:44:01.072260Z"},"content_sha256":"0e93854a843026eae1b9f5feb56d154e4d3310f04e46c1cf947d60dd1b3e2f50","schema_version":"1.0","event_id":"sha256:0e93854a843026eae1b9f5feb56d154e4d3310f04e46c1cf947d60dd1b3e2f50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AQI7CNBUYBE2YNROLZNHGOXMSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized algorithm for 3-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-09-07T18:46:11Z","abstract_excerpt":"In the 3-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 3 vertices in $G$ contains at least one vertex of $S$. In this paper we give parameterized algorithm for 3-path cover whose time complexity is $O^*(1.713^k)$. Our algorithm is faster than previous algorithms for this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02636","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-18T00:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfaViLKD9Z3eeXxgInPySmKERjAebDbCAmi+T3PwQtu0XzbXfKzXnqIaLUpH+UFTJLYPlxNf0Cdi4UnCJ3q9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:44:01.072881Z"},"content_sha256":"462a0b8bf5906bf24b3b42e9bf8338b08eff09826f7d61a4287970ef192c414a","schema_version":"1.0","event_id":"sha256:462a0b8bf5906bf24b3b42e9bf8338b08eff09826f7d61a4287970ef192c414a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQI7CNBUYBE2YNROLZNHGOXMSF/bundle.json","state_url":"https://pith.science/pith/AQI7CNBUYBE2YNROLZNHGOXMSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQI7CNBUYBE2YNROLZNHGOXMSF/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-11T02:44:01Z","links":{"resolver":"https://pith.science/pith/AQI7CNBUYBE2YNROLZNHGOXMSF","bundle":"https://pith.science/pith/AQI7CNBUYBE2YNROLZNHGOXMSF/bundle.json","state":"https://pith.science/pith/AQI7CNBUYBE2YNROLZNHGOXMSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQI7CNBUYBE2YNROLZNHGOXMSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AQI7CNBUYBE2YNROLZNHGOXMSF","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":"f96cd3c47528d7eb56c0ff2b9b718e9350b206cde8c9bfff0222f8432247a4be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-07T18:46:11Z","title_canon_sha256":"e63c6c80f57afaf8394ec8b67fb490a637497761da3f9e15c882a1a6cb20c706"},"schema_version":"1.0","source":{"id":"1809.02636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02636","created_at":"2026-05-18T00:06:15Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02636v1","created_at":"2026-05-18T00:06:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02636","created_at":"2026-05-18T00:06:15Z"},{"alias_kind":"pith_short_12","alias_value":"AQI7CNBUYBE2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AQI7CNBUYBE2YNRO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AQI7CNBU","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:462a0b8bf5906bf24b3b42e9bf8338b08eff09826f7d61a4287970ef192c414a","target":"graph","created_at":"2026-05-18T00:06:15Z","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 3-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 3 vertices in $G$ contains at least one vertex of $S$. In this paper we give parameterized algorithm for 3-path cover whose time complexity is $O^*(1.713^k)$. Our algorithm is faster than previous algorithms for this problem.","authors_text":"Dekel Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-07T18:46:11Z","title":"Parameterized algorithm for 3-path vertex cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02636","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:0e93854a843026eae1b9f5feb56d154e4d3310f04e46c1cf947d60dd1b3e2f50","target":"record","created_at":"2026-05-18T00:06:15Z","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":"f96cd3c47528d7eb56c0ff2b9b718e9350b206cde8c9bfff0222f8432247a4be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-07T18:46:11Z","title_canon_sha256":"e63c6c80f57afaf8394ec8b67fb490a637497761da3f9e15c882a1a6cb20c706"},"schema_version":"1.0","source":{"id":"1809.02636","kind":"arxiv","version":1}},"canonical_sha256":"0411f13434c049ac362e5e5a733aec9177b4cd97ddf7cf6035bd49e11bd749c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0411f13434c049ac362e5e5a733aec9177b4cd97ddf7cf6035bd49e11bd749c4","first_computed_at":"2026-05-18T00:06:15.744140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:15.744140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3/Gp0ty7e0Uvspgwzagl8kLSCmXEHRVVt7Z9XHPAjBKNTYGUtj29xRl/h71eq/XyTYQ5ubi/NatlKFoVA0dvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:15.744726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e93854a843026eae1b9f5feb56d154e4d3310f04e46c1cf947d60dd1b3e2f50","sha256:462a0b8bf5906bf24b3b42e9bf8338b08eff09826f7d61a4287970ef192c414a"],"state_sha256":"1288aa9079ae534810238b7d3e8d33faac37380fca57967ac893b10f02a4c38e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzHTM/OQHy/xd16O9SPkmZrhEKy+a4YxGg5vMMIQBDobMdVCDzh051FR4QKFBzqGK9CiWlKc/Wtx9++tADr8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:44:01.076276Z","bundle_sha256":"5e41da39b6ddcd01b7509e1f6907e0e7ae424eb590dee7126080ccd9b800affc"}}