{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W75YYP3D5WEIXFINR4PE7KQ4A3","short_pith_number":"pith:W75YYP3D","schema_version":"1.0","canonical_sha256":"b7fb8c3f63ed888b950d8f1e4faa1c06e8d888ac1853ff90491090853ec6c4fc","source":{"kind":"arxiv","id":"2605.13800","version":1},"attestation_state":"computed","paper":{"title":"Low-Cost Arborescence Under Edge Faults","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A subgraph of size O(n^{3/2}) lets you recover a 2-approximate min-cost arborescence after any single edge fault.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dipan Dey, Telikepalli Kavitha","submitted_at":"2026-05-13T17:21:08Z","abstract_excerpt":"Our input is a directed graph $G = (V,E)$ on $n$ vertices and $m$ edges with a designated root vertex $r$ and a function $cost: E \\rightarrow \\mathbb{R}_{\\geq 0}$. The problem is to maintain a min-cost arborescence in $G$ in the presence of edge faults (a single fault at a time). Edge faults are transient and once the faulty edge is repaired, the original min-cost arborescence $\\mathcal{T}$ is restored. Whenever an edge fault happens, we need to update $\\mathcal{T}$ to a min-cost arborescence in $G-f$, where $f$ is the faulty edge. Since computing a min-cost arborescence in $G - f$ takes $O(m "},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.13800","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T17:21:08Z","cross_cats_sorted":[],"title_canon_sha256":"f9143c328e381ae7c2a43530277598f9e84cfe255c167b3b2d159f86e5e44537","abstract_canon_sha256":"7dcf2122a77c137a3fc50a4afa07023e50ca64e77f3af95462baf4fa7227f0f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:15.520691Z","signature_b64":"v5RwkeA9YeqmThfZMOKH9JLs52o7BiVGuioQ519n8+k/xLHf2uK+hvTI0FROC2qvcD+TB5cLeduEriVkhGUnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7fb8c3f63ed888b950d8f1e4faa1c06e8d888ac1853ff90491090853ec6c4fc","last_reissued_at":"2026-05-18T02:44:15.520131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:15.520131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Cost Arborescence Under Edge Faults","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A subgraph of size O(n^{3/2}) lets you recover a 2-approximate min-cost arborescence after any single edge fault.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dipan Dey, Telikepalli Kavitha","submitted_at":"2026-05-13T17:21:08Z","abstract_excerpt":"Our input is a directed graph $G = (V,E)$ on $n$ vertices and $m$ edges with a designated root vertex $r$ and a function $cost: E \\rightarrow \\mathbb{R}_{\\geq 0}$. The problem is to maintain a min-cost arborescence in $G$ in the presence of edge faults (a single fault at a time). Edge faults are transient and once the faulty edge is repaired, the original min-cost arborescence $\\mathcal{T}$ is restored. Whenever an edge fault happens, we need to update $\\mathcal{T}$ to a min-cost arborescence in $G-f$, where $f$ is the faulty edge. Since computing a min-cost arborescence in $G - f$ takes $O(m "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show a simple polynomial-time algorithm to construct a subgraph H of size O(n^{3/2}) such that, for any f in E, a min-cost arborescence in H-f is a 2-approximation of a min-cost arborescence in G-f.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That a min-cost arborescence can be computed efficiently inside the constructed subgraph H-f and that the 2-approximation guarantee holds for the specific construction given in the full paper.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An O(n^{3/2})-size subgraph preserves 2-approximate min-cost arborescences under single edge faults with fast updates, plus a tight k times rank bound for k-fault-tolerant matroid preservers.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A subgraph of size O(n^{3/2}) lets you recover a 2-approximate min-cost arborescence after any single edge fault.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ecfcd56a319dd5a59dac7b199a7bee27d28a5fdc3d9a4646b7f57dc750ba8bb5"},"source":{"id":"2605.13800","kind":"arxiv","version":1},"verdict":{"id":"c855fa24-c0bc-43a2-b19a-383a5c7a3f0a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:31:49.790446Z","strongest_claim":"We show a simple polynomial-time algorithm to construct a subgraph H of size O(n^{3/2}) such that, for any f in E, a min-cost arborescence in H-f is a 2-approximation of a min-cost arborescence in G-f.","one_line_summary":"An O(n^{3/2})-size subgraph preserves 2-approximate min-cost arborescences under single edge faults with fast updates, plus a tight k times rank bound for k-fault-tolerant matroid preservers.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That a min-cost arborescence can be computed efficiently inside the constructed subgraph H-f and that the 2-approximation guarantee holds for the specific construction given in the full paper.","pith_extraction_headline":"A subgraph of size O(n^{3/2}) lets you recover a 2-approximate min-cost arborescence after any single edge fault."},"references":{"count":25,"sample":[{"doi":"10.1007/978-3-662-48653-5_35","year":2015,"title":"Fault tolerant reachability for directed graphs","work_id":"75868f8a-1b4f-44eb-a6f4-04a5f24396c9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Fault-tolerant subgraph for single-source reachability: General and optimal.SIAM Journal on Computing, 47(1):80–95, 2018","work_id":"8117ad94-0743-47f1-87fc-ff7d4e7c5d90","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s00453-012-9621-y","year":2013,"title":"2 BLM12 Surender Baswana, Utkarsh Lath, and Anuradha S","work_id":"f39237b1-bf57-4d15-9cd1-f73bf0a99787","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Matthias Bentert, Fedor V . Fomin, Petr A. Golovach, and Laure Morelle. Fault-tolerant matroid bases. InProceedings of the 33rd Annual European Symposium on Algorithms, (ESA 2025), pages 83:1–83:14,","work_id":"22b00ba5-a162-449f-98af-4259ab32a73c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.4230/lipics.esa.2025.83","year":2025,"title":"URL: https://doi.org/10.4230/LIPIcs.ESA.2025.83, doi:10.4230/LIPICS. ESA.2025.83","work_id":"fcbb6e3c-bc47-4e86-955c-2179f0dbc1c9","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"04ff9ce52820990adb13723a00bea9e6ea79c4c156498dba588b79415f27a099","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c16b9043e654a6dd8b49b3c98970f36ea03394b081703eca699be4b7052c8501"},"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":"2605.13800","created_at":"2026-05-18T02:44:15.520211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13800v1","created_at":"2026-05-18T02:44:15.520211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13800","created_at":"2026-05-18T02:44:15.520211+00:00"},{"alias_kind":"pith_short_12","alias_value":"W75YYP3D5WEI","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"W75YYP3D5WEIXFIN","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"W75YYP3D","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W75YYP3D5WEIXFINR4PE7KQ4A3","json":"https://pith.science/pith/W75YYP3D5WEIXFINR4PE7KQ4A3.json","graph_json":"https://pith.science/api/pith-number/W75YYP3D5WEIXFINR4PE7KQ4A3/graph.json","events_json":"https://pith.science/api/pith-number/W75YYP3D5WEIXFINR4PE7KQ4A3/events.json","paper":"https://pith.science/paper/W75YYP3D"},"agent_actions":{"view_html":"https://pith.science/pith/W75YYP3D5WEIXFINR4PE7KQ4A3","download_json":"https://pith.science/pith/W75YYP3D5WEIXFINR4PE7KQ4A3.json","view_paper":"https://pith.science/paper/W75YYP3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13800&json=true","fetch_graph":"https://pith.science/api/pith-number/W75YYP3D5WEIXFINR4PE7KQ4A3/graph.json","fetch_events":"https://pith.science/api/pith-number/W75YYP3D5WEIXFINR4PE7KQ4A3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W75YYP3D5WEIXFINR4PE7KQ4A3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W75YYP3D5WEIXFINR4PE7KQ4A3/action/storage_attestation","attest_author":"https://pith.science/pith/W75YYP3D5WEIXFINR4PE7KQ4A3/action/author_attestation","sign_citation":"https://pith.science/pith/W75YYP3D5WEIXFINR4PE7KQ4A3/action/citation_signature","submit_replication":"https://pith.science/pith/W75YYP3D5WEIXFINR4PE7KQ4A3/action/replication_record"}},"created_at":"2026-05-18T02:44:15.520211+00:00","updated_at":"2026-05-18T02:44:15.520211+00:00"}