{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AVAVT3SUNSVJAE33E7VKYT2XE4","short_pith_number":"pith:AVAVT3SU","schema_version":"1.0","canonical_sha256":"054159ee546caa90137b27eaac4f57271c2a9ebd96c344e021fb38a842d94580","source":{"kind":"arxiv","id":"1507.01695","version":1},"attestation_state":"computed","paper":{"title":"Path-Fault-Tolerant Approximate Shortest-Path Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Annalisa D'Andrea, Daniele Frigioni, Guido Proietti, Mattia D'Emidio, Stefano Leucci","submitted_at":"2015-07-07T07:59:40Z","abstract_excerpt":"Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\\em single-source shortest-path tree} (SPT) of $G$ with a \\emph{sparse} set of \\emph{auxiliary} edges selected from $E$, in order to create a structure which tolerates effectively a \\emph{path failure} in the SPT. This consists of a simultaneous fault of a set $F$ of at most $f$ adjacent edges along a shortest path emanating from the source, and it is recognized as one of the most frequent disruption in an SPT. We show that, for any integer parameter $k \\geq 1$, it is possible to"},"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":"1507.01695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"904a2d171e50447db66f9cd03565b8bfaece1bdafa08ca1fe1a4f9dd3a42c1b4","abstract_canon_sha256":"b772d182eca436c5f13596e01bf738206ca163d45d236b30977636f9affa8e23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:12.642201Z","signature_b64":"VZScHlXooz6c1S+g8cqCten2YV/BijdyyNUC1/M+QKIw9wAxH0r+Ie5RrFL7ZGHMFIi/QK03EimA3L//BCzbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"054159ee546caa90137b27eaac4f57271c2a9ebd96c344e021fb38a842d94580","last_reissued_at":"2026-05-18T01:37:12.641591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:12.641591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path-Fault-Tolerant Approximate Shortest-Path Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Annalisa D'Andrea, Daniele Frigioni, Guido Proietti, Mattia D'Emidio, Stefano Leucci","submitted_at":"2015-07-07T07:59:40Z","abstract_excerpt":"Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\\em single-source shortest-path tree} (SPT) of $G$ with a \\emph{sparse} set of \\emph{auxiliary} edges selected from $E$, in order to create a structure which tolerates effectively a \\emph{path failure} in the SPT. This consists of a simultaneous fault of a set $F$ of at most $f$ adjacent edges along a shortest path emanating from the source, and it is recognized as one of the most frequent disruption in an SPT. We show that, for any integer parameter $k \\geq 1$, it is possible to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01695","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":""},"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":"1507.01695","created_at":"2026-05-18T01:37:12.641684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01695v1","created_at":"2026-05-18T01:37:12.641684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01695","created_at":"2026-05-18T01:37:12.641684+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVAVT3SUNSVJ","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVAVT3SUNSVJAE33","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVAVT3SU","created_at":"2026-05-18T12:29:10.953037+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/AVAVT3SUNSVJAE33E7VKYT2XE4","json":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4.json","graph_json":"https://pith.science/api/pith-number/AVAVT3SUNSVJAE33E7VKYT2XE4/graph.json","events_json":"https://pith.science/api/pith-number/AVAVT3SUNSVJAE33E7VKYT2XE4/events.json","paper":"https://pith.science/paper/AVAVT3SU"},"agent_actions":{"view_html":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4","download_json":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4.json","view_paper":"https://pith.science/paper/AVAVT3SU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01695&json=true","fetch_graph":"https://pith.science/api/pith-number/AVAVT3SUNSVJAE33E7VKYT2XE4/graph.json","fetch_events":"https://pith.science/api/pith-number/AVAVT3SUNSVJAE33E7VKYT2XE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/action/storage_attestation","attest_author":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/action/author_attestation","sign_citation":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/action/citation_signature","submit_replication":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/action/replication_record"}},"created_at":"2026-05-18T01:37:12.641684+00:00","updated_at":"2026-05-18T01:37:12.641684+00:00"}