{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WXBXZZVI46CLPZFXRIYWAIAM4K","short_pith_number":"pith:WXBXZZVI","schema_version":"1.0","canonical_sha256":"b5c37ce6a8e784b7e4b78a3160200ce2b1df33040db193343c7b1c3e31008f07","source":{"kind":"arxiv","id":"1808.04185","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.04185","created_at":"2026-05-17T23:55:38.443509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04185v2","created_at":"2026-05-17T23:55:38.443509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04185","created_at":"2026-05-17T23:55:38.443509+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXBXZZVI46CL","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXBXZZVI46CLPZFX","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXBXZZVI","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/WXBXZZVI46CLPZFXRIYWAIAM4K","json":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K.json","graph_json":"https://pith.science/api/pith-number/WXBXZZVI46CLPZFXRIYWAIAM4K/graph.json","events_json":"https://pith.science/api/pith-number/WXBXZZVI46CLPZFXRIYWAIAM4K/events.json","paper":"https://pith.science/paper/WXBXZZVI"},"agent_actions":{"view_html":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K","download_json":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K.json","view_paper":"https://pith.science/paper/WXBXZZVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04185&json=true","fetch_graph":"https://pith.science/api/pith-number/WXBXZZVI46CLPZFXRIYWAIAM4K/graph.json","fetch_events":"https://pith.science/api/pith-number/WXBXZZVI46CLPZFXRIYWAIAM4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/action/storage_attestation","attest_author":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/action/author_attestation","sign_citation":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/action/citation_signature","submit_replication":"https://pith.science/pith/WXBXZZVI46CLPZFXRIYWAIAM4K/action/replication_record"}},"created_at":"2026-05-17T23:55:38.443509+00:00","updated_at":"2026-05-17T23:55:38.443509+00:00"}