{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W75YYP3D5WEIXFINR4PE7KQ4A3","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":"7dcf2122a77c137a3fc50a4afa07023e50ca64e77f3af95462baf4fa7227f0f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T17:21:08Z","title_canon_sha256":"f9143c328e381ae7c2a43530277598f9e84cfe255c167b3b2d159f86e5e44537"},"schema_version":"1.0","source":{"id":"2605.13800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13800","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13800v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13800","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"W75YYP3D5WEI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"W75YYP3D5WEIXFIN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"W75YYP3D","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:8d5ff6d7a8c522ae67d10f95138a8beaf32b36e62f4379ce80ac5b38f050a6b4","target":"graph","created_at":"2026-05-18T02:44:15Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A subgraph of size O(n^{3/2}) lets you recover a 2-approximate min-cost arborescence after any single edge fault."}],"snapshot_sha256":"ecfcd56a319dd5a59dac7b199a7bee27d28a5fdc3d9a4646b7f57dc750ba8bb5"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c16b9043e654a6dd8b49b3c98970f36ea03394b081703eca699be4b7052c8501"},"paper":{"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 ","authors_text":"Dipan Dey, Telikepalli Kavitha","cross_cats":[],"headline":"A subgraph of size O(n^{3/2}) lets you recover a 2-approximate min-cost arborescence after any single edge fault.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T17:21:08Z","title":"Low-Cost Arborescence Under Edge Faults"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"10.1007/978-3-662-48653-5_35","is_internal_anchor":false,"ref_index":1,"title":"Fault tolerant reachability for directed graphs","work_id":"75868f8a-1b4f-44eb-a6f4-04a5f24396c9","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"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","year":2018},{"cited_arxiv_id":"","doi":"10.1007/s00453-012-9621-y","is_internal_anchor":false,"ref_index":3,"title":"2 BLM12 Surender Baswana, Utkarsh Lath, and Anuradha S","work_id":"f39237b1-bf57-4d15-9cd1-f73bf0a99787","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"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","year":2025},{"cited_arxiv_id":"","doi":"10.4230/lipics.esa.2025.83","is_internal_anchor":false,"ref_index":5,"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","year":2025}],"snapshot_sha256":"04ff9ce52820990adb13723a00bea9e6ea79c4c156498dba588b79415f27a099"},"source":{"id":"2605.13800","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:31:49.790446Z","id":"c855fa24-c0bc-43a2-b19a-383a5c7a3f0a","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"c855fa24-c0bc-43a2-b19a-383a5c7a3f0a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bb159be73f72e4d55c096dbcc69f230ba3952c9dee3ba0cf28d42bac61872d80","target":"record","created_at":"2026-05-18T02:44:15Z","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":"7dcf2122a77c137a3fc50a4afa07023e50ca64e77f3af95462baf4fa7227f0f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T17:21:08Z","title_canon_sha256":"f9143c328e381ae7c2a43530277598f9e84cfe255c167b3b2d159f86e5e44537"},"schema_version":"1.0","source":{"id":"2605.13800","kind":"arxiv","version":1}},"canonical_sha256":"b7fb8c3f63ed888b950d8f1e4faa1c06e8d888ac1853ff90491090853ec6c4fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7fb8c3f63ed888b950d8f1e4faa1c06e8d888ac1853ff90491090853ec6c4fc","first_computed_at":"2026-05-18T02:44:15.520131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:15.520131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v5RwkeA9YeqmThfZMOKH9JLs52o7BiVGuioQ519n8+k/xLHf2uK+hvTI0FROC2qvcD+TB5cLeduEriVkhGUnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:15.520691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb159be73f72e4d55c096dbcc69f230ba3952c9dee3ba0cf28d42bac61872d80","sha256:8d5ff6d7a8c522ae67d10f95138a8beaf32b36e62f4379ce80ac5b38f050a6b4"],"state_sha256":"181053ca2c463e0c0f4614c683e3d456e6159021914be0a6b41d3d8ba7f38f3f"}