{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ONY3O4WPCAJJI7MGIA2A74X7W6","short_pith_number":"pith:ONY3O4WP","schema_version":"1.0","canonical_sha256":"7371b772cf1012947d8640340ff2ffb79fb50b140dcc00ad2c69fcc04f99dd1d","source":{"kind":"arxiv","id":"2506.17008","version":1},"attestation_state":"computed","paper":{"title":"When does FTP become FPT?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Laure Morelle, Matthias Bentert, Petr A. Golovach","submitted_at":"2025-06-20T14:05:08Z","abstract_excerpt":"In the problem Fault-Tolerant Path (FTP), we are given an edge-weighted directed graph G = (V, E), a subset U \\subseteq E of vulnerable edges, two vertices s, t \\in V, and integers k and \\ell. The task is to decide whether there exists a subgraph H of G with total cost at most \\ell such that, after the removal of any k vulnerable edges, H still contains an s-t-path. We study whether Fault-Tolerant Path is fixed-parameter tractable (FPT) and whether it admits a polynomial kernel under various parameterizations. Our choices of parameters include: the number of vulnerable edges in the input graph"},"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":"2506.17008","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-20T14:05:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1b16eebb2bcda422652b2e22dfcf8ef179542382be95fc03b18c26097407e7f1","abstract_canon_sha256":"86fc3fc422a40ed57ea712322515ff6268bc7572d0596e83a40990eed4f2715e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:54.687702Z","signature_b64":"71vkgvgCURuLN2+Z3/oBEWJW1+Z2nYCVyh9Odpez/T8oxAwTX24aM+8ZZyugrfuQ4kLr8eJVQGHYG76H+MAgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7371b772cf1012947d8640340ff2ffb79fb50b140dcc00ad2c69fcc04f99dd1d","last_reissued_at":"2026-07-05T11:24:54.687361Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:54.687361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When does FTP become FPT?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Laure Morelle, Matthias Bentert, Petr A. Golovach","submitted_at":"2025-06-20T14:05:08Z","abstract_excerpt":"In the problem Fault-Tolerant Path (FTP), we are given an edge-weighted directed graph G = (V, E), a subset U \\subseteq E of vulnerable edges, two vertices s, t \\in V, and integers k and \\ell. The task is to decide whether there exists a subgraph H of G with total cost at most \\ell such that, after the removal of any k vulnerable edges, H still contains an s-t-path. We study whether Fault-Tolerant Path is fixed-parameter tractable (FPT) and whether it admits a polynomial kernel under various parameterizations. Our choices of parameters include: the number of vulnerable edges in the input graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.17008","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.17008/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.17008","created_at":"2026-07-05T11:24:54.687416+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.17008v1","created_at":"2026-07-05T11:24:54.687416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17008","created_at":"2026-07-05T11:24:54.687416+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONY3O4WPCAJJ","created_at":"2026-07-05T11:24:54.687416+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONY3O4WPCAJJI7MG","created_at":"2026-07-05T11:24:54.687416+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONY3O4WP","created_at":"2026-07-05T11:24:54.687416+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/ONY3O4WPCAJJI7MGIA2A74X7W6","json":"https://pith.science/pith/ONY3O4WPCAJJI7MGIA2A74X7W6.json","graph_json":"https://pith.science/api/pith-number/ONY3O4WPCAJJI7MGIA2A74X7W6/graph.json","events_json":"https://pith.science/api/pith-number/ONY3O4WPCAJJI7MGIA2A74X7W6/events.json","paper":"https://pith.science/paper/ONY3O4WP"},"agent_actions":{"view_html":"https://pith.science/pith/ONY3O4WPCAJJI7MGIA2A74X7W6","download_json":"https://pith.science/pith/ONY3O4WPCAJJI7MGIA2A74X7W6.json","view_paper":"https://pith.science/paper/ONY3O4WP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.17008&json=true","fetch_graph":"https://pith.science/api/pith-number/ONY3O4WPCAJJI7MGIA2A74X7W6/graph.json","fetch_events":"https://pith.science/api/pith-number/ONY3O4WPCAJJI7MGIA2A74X7W6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONY3O4WPCAJJI7MGIA2A74X7W6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONY3O4WPCAJJI7MGIA2A74X7W6/action/storage_attestation","attest_author":"https://pith.science/pith/ONY3O4WPCAJJI7MGIA2A74X7W6/action/author_attestation","sign_citation":"https://pith.science/pith/ONY3O4WPCAJJI7MGIA2A74X7W6/action/citation_signature","submit_replication":"https://pith.science/pith/ONY3O4WPCAJJI7MGIA2A74X7W6/action/replication_record"}},"created_at":"2026-07-05T11:24:54.687416+00:00","updated_at":"2026-07-05T11:24:54.687416+00:00"}