{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WXBXZZVI46CLPZFXRIYWAIAM4K","short_pith_number":"pith:WXBXZZVI","canonical_record":{"source":{"id":"1808.04185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-13T12:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"10e1fcfe472abb17fb1b1a252a2a714c1897a6bc307dc94a4cd0d7de21be4805","abstract_canon_sha256":"ab2fb4a927aaca49c8115689703f71cd0f1a8ede76f46a7c37c24ed12f469bc0"},"schema_version":"1.0"},"canonical_sha256":"b5c37ce6a8e784b7e4b78a3160200ce2b1df33040db193343c7b1c3e31008f07","source":{"kind":"arxiv","id":"1808.04185","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04185","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04185v2","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04185","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"WXBXZZVI46CL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WXBXZZVI46CLPZFX","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WXBXZZVI","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WXBXZZVI46CLPZFXRIYWAIAM4K","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-13T12:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"10e1fcfe472abb17fb1b1a252a2a714c1897a6bc307dc94a4cd0d7de21be4805","abstract_canon_sha256":"ab2fb4a927aaca49c8115689703f71cd0f1a8ede76f46a7c37c24ed12f469bc0"},"schema_version":"1.0"},"canonical_sha256":"b5c37ce6a8e784b7e4b78a3160200ce2b1df33040db193343c7b1c3e31008f07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:38.443857Z","signature_b64":"y1CNJb6Hd+yTe5qSlzgKU5+ps/5ysR4KX12iSEJaQrRn06G7+sJa+3nF09zuPkADzGesU36KOoval9i8BJbkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5c37ce6a8e784b7e4b78a3160200ce2b1df33040db193343c7b1c3e31008f07","last_reissued_at":"2026-05-17T23:55:38.443433Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:38.443433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04185","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:55:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUqFeSSBJWk2MpvHG6meJcwUSNiTapTamCiBpn1XfU+V4k8pmiTVpuc76OXspKAERZaIruWmdNfTQZMr5zrGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:08:21.523242Z"},"content_sha256":"87162d0ba126d42303c546af8bf8f4abf94839bda5fa01a08963debaa58f8498","schema_version":"1.0","event_id":"sha256:87162d0ba126d42303c546af8bf8f4abf94839bda5fa01a08963debaa58f8498"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WXBXZZVI46CLPZFXRIYWAIAM4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster deterministic parameterized algorithm for k-Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2018-08-13T12:58:08Z","abstract_excerpt":"In the k-Path problem, the input is a directed graph $G$ and an integer $k\\geq 1$, and the goal is to decide whether there is a simple directed path in $G$ with exactly $k$ vertices. We give a deterministic algorithm for k-Path with time complexity $O^*(2.554^k)$. This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is $O^*(2.597^k)$. The technique used by our algorithm can also be used to obtain faster deterministic algorithms for k-Tree, r-Dimensional k-Matching, Graph Motif, and Partial Cover."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04185","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:55:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"um9mvTB7b1t+4JGvGMrR/qiGc61oEKCSJxquFLr1/soO/JT+Qt3INIHqJ8cqiMq8ZrRJtnoP20w1+tXauEbVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:08:21.523923Z"},"content_sha256":"935ca4002e39f7a2709e5cc7a2d58b1e6da142f396208ea5c1a3a6b76a12cbb2","schema_version":"1.0","event_id":"sha256:935ca4002e39f7a2709e5cc7a2d58b1e6da142f396208ea5c1a3a6b76a12cbb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/bundle.json","state_url":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/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-09T19:08:21Z","links":{"resolver":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K","bundle":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/bundle.json","state":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WXBXZZVI46CLPZFXRIYWAIAM4K","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":"ab2fb4a927aaca49c8115689703f71cd0f1a8ede76f46a7c37c24ed12f469bc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-13T12:58:08Z","title_canon_sha256":"10e1fcfe472abb17fb1b1a252a2a714c1897a6bc307dc94a4cd0d7de21be4805"},"schema_version":"1.0","source":{"id":"1808.04185","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04185","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04185v2","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04185","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"WXBXZZVI46CL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WXBXZZVI46CLPZFX","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WXBXZZVI","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:935ca4002e39f7a2709e5cc7a2d58b1e6da142f396208ea5c1a3a6b76a12cbb2","target":"graph","created_at":"2026-05-17T23:55:38Z","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 k-Path problem, the input is a directed graph $G$ and an integer $k\\geq 1$, and the goal is to decide whether there is a simple directed path in $G$ with exactly $k$ vertices. We give a deterministic algorithm for k-Path with time complexity $O^*(2.554^k)$. This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is $O^*(2.597^k)$. The technique used by our algorithm can also be used to obtain faster deterministic algorithms for k-Tree, r-Dimensional k-Matching, Graph Motif, and Partial Cover.","authors_text":"Dekel Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-13T12:58:08Z","title":"Faster deterministic parameterized algorithm for k-Path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04185","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:87162d0ba126d42303c546af8bf8f4abf94839bda5fa01a08963debaa58f8498","target":"record","created_at":"2026-05-17T23:55:38Z","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":"ab2fb4a927aaca49c8115689703f71cd0f1a8ede76f46a7c37c24ed12f469bc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-13T12:58:08Z","title_canon_sha256":"10e1fcfe472abb17fb1b1a252a2a714c1897a6bc307dc94a4cd0d7de21be4805"},"schema_version":"1.0","source":{"id":"1808.04185","kind":"arxiv","version":2}},"canonical_sha256":"b5c37ce6a8e784b7e4b78a3160200ce2b1df33040db193343c7b1c3e31008f07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5c37ce6a8e784b7e4b78a3160200ce2b1df33040db193343c7b1c3e31008f07","first_computed_at":"2026-05-17T23:55:38.443433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:38.443433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y1CNJb6Hd+yTe5qSlzgKU5+ps/5ysR4KX12iSEJaQrRn06G7+sJa+3nF09zuPkADzGesU36KOoval9i8BJbkCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:38.443857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04185","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87162d0ba126d42303c546af8bf8f4abf94839bda5fa01a08963debaa58f8498","sha256:935ca4002e39f7a2709e5cc7a2d58b1e6da142f396208ea5c1a3a6b76a12cbb2"],"state_sha256":"81ba3c2f4d52a1e351aa24caa14a21d76c127f871c4f3ee3a2d337c21fc23e7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuMww22CW1OePrTOdqP2KxBZQRljY9HgZ/he6ysf8Y4aEVu6XKehY4LGIdsvvIjC5mHlzBa6wsNL5w8e/lBaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:08:21.528171Z","bundle_sha256":"65a5509270bf653630f31856e2d979dbc98a381e86dcea669ed161b9ecaf9abb"}}