{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J4EZY4VVG75NVYH7PXJJKU4AUJ","short_pith_number":"pith:J4EZY4VV","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"},"canonical_sha256":"4f099c72b537fadae0ff7dd2955380a271b9da43003ae7c13780e9562eb5bb80","source":{"kind":"arxiv","id":"1607.07737","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07737","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07737v2","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07737","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"J4EZY4VVG75N","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J4EZY4VVG75NVYH7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J4EZY4VV","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J4EZY4VVG75NVYH7PXJJKU4AUJ","target":"record","payload":{"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"},"canonical_sha256":"4f099c72b537fadae0ff7dd2955380a271b9da43003ae7c13780e9562eb5bb80","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"},"source_kind":"arxiv","source_id":"1607.07737","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-18T00:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Qw7pHCIENkn6FI7Cd+8gr/n8f/3NZAfNSiosjlqL5YrYtOvhx9BGOCOGT6QKEA4wtqLeTzBvtjlbiYeH6cODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:21:57.032899Z"},"content_sha256":"ff8e82da4a602591ce4f6b6a81741e8277f43e7f0bb7c6333569c447e83ac638","schema_version":"1.0","event_id":"sha256:ff8e82da4a602591ce4f6b6a81741e8277f43e7f0bb7c6333569c447e83ac638"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J4EZY4VVG75NVYH7PXJJKU4AUJ","target":"graph","payload":{"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"},"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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ViXFPROEYLQgrfrAwVK/ZnX7buyliumOMhAnhrtV9cTE4TTn4JvxyidoinV6hnfNXqnRLemr/qsaU5W1U3C0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:21:57.033276Z"},"content_sha256":"0c875cf7bae40f49264d78d3346018ded0bd6e0d00efe07d63fdf5a56ce17460","schema_version":"1.0","event_id":"sha256:0c875cf7bae40f49264d78d3346018ded0bd6e0d00efe07d63fdf5a56ce17460"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/bundle.json","state_url":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/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-26T14:21:57Z","links":{"resolver":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ","bundle":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/bundle.json","state":"https://pith.science/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4EZY4VVG75NVYH7PXJJKU4AUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J4EZY4VVG75NVYH7PXJJKU4AUJ","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":"8cf3d7d0985acfa0bd51cbd0d616b4d0837bb795150b5ca93dadeb6c6f7ebec4","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T15:00:18Z","title_canon_sha256":"cd825d72425f30d1fdb6f1bd2fe3ce7a6a13d9037e7fec0afdcecabba96c1a4b"},"schema_version":"1.0","source":{"id":"1607.07737","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07737","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07737v2","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07737","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"J4EZY4VVG75N","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J4EZY4VVG75NVYH7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J4EZY4VV","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:0c875cf7bae40f49264d78d3346018ded0bd6e0d00efe07d63fdf5a56ce17460","target":"graph","created_at":"2026-05-18T00:17:55Z","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":"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","authors_text":"Fedor V. Fomin, Holger Dell, Ivona Bez\\'akov\\'a, Radu Curticapean","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T15:00:18Z","title":"Finding Detours is Fixed-parameter Tractable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07737","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:ff8e82da4a602591ce4f6b6a81741e8277f43e7f0bb7c6333569c447e83ac638","target":"record","created_at":"2026-05-18T00:17:55Z","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":"8cf3d7d0985acfa0bd51cbd0d616b4d0837bb795150b5ca93dadeb6c6f7ebec4","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T15:00:18Z","title_canon_sha256":"cd825d72425f30d1fdb6f1bd2fe3ce7a6a13d9037e7fec0afdcecabba96c1a4b"},"schema_version":"1.0","source":{"id":"1607.07737","kind":"arxiv","version":2}},"canonical_sha256":"4f099c72b537fadae0ff7dd2955380a271b9da43003ae7c13780e9562eb5bb80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f099c72b537fadae0ff7dd2955380a271b9da43003ae7c13780e9562eb5bb80","first_computed_at":"2026-05-18T00:17:55.270939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:55.270939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ayYd1pMY0v0+v7y08Do3mJAeCFTKKiVsn7PB5fOldYT1OATRX5sYMmS+k/yc7ZuscDJW4nlHnTSMqO8XieneCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:55.271608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07737","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff8e82da4a602591ce4f6b6a81741e8277f43e7f0bb7c6333569c447e83ac638","sha256:0c875cf7bae40f49264d78d3346018ded0bd6e0d00efe07d63fdf5a56ce17460"],"state_sha256":"4206b7b1a2eee4f8c73c9ad16abd4b4acf87324ea5351abd94913f17b4eac264"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kga41QG/O7cBGR6lldPkIZ0ple4qOzCxI8TmsdSejK/7UxM7CV/H7+cqjqRikTiNqBHktHfs5ipbTtje3RqjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:21:57.035354Z","bundle_sha256":"f2d7e7833ec828018a0cc65fd5fb92e743ce92bc8c9a287ee68e54295472b361"}}