{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YKK6A6LIRUYWIBDK5UPY2GXDDV","short_pith_number":"pith:YKK6A6LI","schema_version":"1.0","canonical_sha256":"c295e079688d3164046aed1f8d1ae31d5b70247c249ee448c5805b56c8c066b4","source":{"kind":"arxiv","id":"1601.04169","version":2},"attestation_state":"computed","paper":{"title":"Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2016-01-16T14:44:58Z","abstract_excerpt":"Let $G$ be an $n$-node and $m$-edge positively real-weighted undirected graph. For any given integer $f \\ge 1$, we study the problem of designing a sparse \\emph{f-edge-fault-tolerant} ($f$-EFT) $\\sigma${\\em -approximate single-source shortest-path tree} ($\\sigma$-ASPT), namely a subgraph of $G$ having as few edges as possible and which, following the failure of a set $F$ of at most $f$ edges in $G$, contains paths from a fixed source that are stretched at most by a factor of $\\sigma$. To this respect, we provide an algorithm that efficiently computes an $f$-EFT $(2|F|+1)$-ASPT of size $O(f n)$"},"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":"1601.04169","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-01-16T14:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"4c784ac5e9043f22c6415e494b885cebc46a1921eff53fdabd24163d608de771","abstract_canon_sha256":"c72597fa6cdb1df0dd3609792f5ffeb81b5f5078c0ca9856231d4e3dfe3bb409"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:13.891531Z","signature_b64":"wR2X1YOR25ue9eHc1xDkt2hRxQfhx8dEsrzjDmNuUpSvQGIirvPqOs1W/Xg9VECoEEfNNW+YovXipbjQivxwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c295e079688d3164046aed1f8d1ae31d5b70247c249ee448c5805b56c8c066b4","last_reissued_at":"2026-05-18T01:22:13.890824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:13.890824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2016-01-16T14:44:58Z","abstract_excerpt":"Let $G$ be an $n$-node and $m$-edge positively real-weighted undirected graph. For any given integer $f \\ge 1$, we study the problem of designing a sparse \\emph{f-edge-fault-tolerant} ($f$-EFT) $\\sigma${\\em -approximate single-source shortest-path tree} ($\\sigma$-ASPT), namely a subgraph of $G$ having as few edges as possible and which, following the failure of a set $F$ of at most $f$ edges in $G$, contains paths from a fixed source that are stretched at most by a factor of $\\sigma$. To this respect, we provide an algorithm that efficiently computes an $f$-EFT $(2|F|+1)$-ASPT of size $O(f n)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04169","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":"1601.04169","created_at":"2026-05-18T01:22:13.890937+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04169v2","created_at":"2026-05-18T01:22:13.890937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04169","created_at":"2026-05-18T01:22:13.890937+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKK6A6LIRUYW","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKK6A6LIRUYWIBDK","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKK6A6LI","created_at":"2026-05-18T12:30:53.716459+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/YKK6A6LIRUYWIBDK5UPY2GXDDV","json":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV.json","graph_json":"https://pith.science/api/pith-number/YKK6A6LIRUYWIBDK5UPY2GXDDV/graph.json","events_json":"https://pith.science/api/pith-number/YKK6A6LIRUYWIBDK5UPY2GXDDV/events.json","paper":"https://pith.science/paper/YKK6A6LI"},"agent_actions":{"view_html":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV","download_json":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV.json","view_paper":"https://pith.science/paper/YKK6A6LI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04169&json=true","fetch_graph":"https://pith.science/api/pith-number/YKK6A6LIRUYWIBDK5UPY2GXDDV/graph.json","fetch_events":"https://pith.science/api/pith-number/YKK6A6LIRUYWIBDK5UPY2GXDDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/action/storage_attestation","attest_author":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/action/author_attestation","sign_citation":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/action/citation_signature","submit_replication":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/action/replication_record"}},"created_at":"2026-05-18T01:22:13.890937+00:00","updated_at":"2026-05-18T01:22:13.890937+00:00"}