{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J4EZY4VVG75NVYH7PXJJKU4AUJ","short_pith_number":"pith:J4EZY4VV","schema_version":"1.0","canonical_sha256":"4f099c72b537fadae0ff7dd2955380a271b9da43003ae7c13780e9562eb5bb80","source":{"kind":"arxiv","id":"1607.07737","version":2},"attestation_state":"computed","paper":{"title":"Finding Detours is Fixed-parameter Tractable","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Holger Dell, Ivona Bez\\'akov\\'a, Radu Curticapean","submitted_at":"2016-07-26T15:00:18Z","abstract_excerpt":"We consider the following natural \"above guarantee\" parameterization of the classical Longest Path problem: For given vertices s and t of a graph G, and an integer k, the problem Longest Detour asks for an (s,t)-path in G that is at least k longer than a shortest (s,t)-path. Using insights into structural graph theory, we prove that Longest Detour is fixed-parameter tractable (FPT) on undirected graphs and actually even admits a single-exponential algorithm, that is, one of running time exp(O(k)) poly(n). This matches (up to the base of the exponential) the best algorithms for finding a path o"},"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":"1607.07737","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T15:00:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cd825d72425f30d1fdb6f1bd2fe3ce7a6a13d9037e7fec0afdcecabba96c1a4b","abstract_canon_sha256":"8cf3d7d0985acfa0bd51cbd0d616b4d0837bb795150b5ca93dadeb6c6f7ebec4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:55.271608Z","signature_b64":"ayYd1pMY0v0+v7y08Do3mJAeCFTKKiVsn7PB5fOldYT1OATRX5sYMmS+k/yc7ZuscDJW4nlHnTSMqO8XieneCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f099c72b537fadae0ff7dd2955380a271b9da43003ae7c13780e9562eb5bb80","last_reissued_at":"2026-05-18T00:17:55.270939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:55.270939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Detours is Fixed-parameter Tractable","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Holger Dell, Ivona Bez\\'akov\\'a, Radu Curticapean","submitted_at":"2016-07-26T15:00:18Z","abstract_excerpt":"We consider the following natural \"above guarantee\" parameterization of the classical Longest Path problem: For given vertices s and t of a graph G, and an integer k, the problem Longest Detour asks for an (s,t)-path in G that is at least k longer than a shortest (s,t)-path. Using insights into structural graph theory, we prove that Longest Detour is fixed-parameter tractable (FPT) on undirected graphs and actually even admits a single-exponential algorithm, that is, one of running time exp(O(k)) poly(n). This matches (up to the base of the exponential) the best algorithms for finding a path o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07737","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":"1607.07737","created_at":"2026-05-18T00:17:55.271043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07737v2","created_at":"2026-05-18T00:17:55.271043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07737","created_at":"2026-05-18T00:17:55.271043+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4EZY4VVG75N","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4EZY4VVG75NVYH7","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4EZY4VV","created_at":"2026-05-18T12:30:22.444734+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/J4EZY4VVG75NVYH7PXJJKU4AUJ","json":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ.json","graph_json":"https://pith.science/api/pith-number/J4EZY4VVG75NVYH7PXJJKU4AUJ/graph.json","events_json":"https://pith.science/api/pith-number/J4EZY4VVG75NVYH7PXJJKU4AUJ/events.json","paper":"https://pith.science/paper/J4EZY4VV"},"agent_actions":{"view_html":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ","download_json":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ.json","view_paper":"https://pith.science/paper/J4EZY4VV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07737&json=true","fetch_graph":"https://pith.science/api/pith-number/J4EZY4VVG75NVYH7PXJJKU4AUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/J4EZY4VVG75NVYH7PXJJKU4AUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/action/storage_attestation","attest_author":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/action/author_attestation","sign_citation":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/action/citation_signature","submit_replication":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/action/replication_record"}},"created_at":"2026-05-18T00:17:55.271043+00:00","updated_at":"2026-05-18T00:17:55.271043+00:00"}