{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NA6QC7GRUGWOTKAYVWLRE32ZUL","short_pith_number":"pith:NA6QC7GR","schema_version":"1.0","canonical_sha256":"683d017cd1a1ace9a818ad97126f59a2e286652704b83524d17354460b440afe","source":{"kind":"arxiv","id":"1302.5401","version":1},"attestation_state":"computed","paper":{"title":"Sparse Fault-Tolerant BFS Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Peleg, Merav Parter","submitted_at":"2013-02-21T20:19:31Z","abstract_excerpt":"This paper addresses the problem of designing a sparse {\\em fault-tolerant} BFS tree, or {\\em FT-BFS tree} for short, namely, a sparse subgraph $T$ of the given network $G$ such that subsequent to the failure of a single edge or vertex, the surviving part $T'$ of $T$ still contains a BFS spanning tree for (the surviving part of) $G$. Our main results are as follows. We present an algorithm that for every $n$-vertex graph $G$ and source node $s$ constructs a (single edge failure) FT-BFS tree rooted at $s$ with $O(n \\cdot \\min\\{\\Depth(s), \\sqrt{n}\\})$ edges, where $\\Depth(s)$ is the depth of the"},"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":"1302.5401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-21T20:19:31Z","cross_cats_sorted":[],"title_canon_sha256":"086a8173984eee1b21fde957d9a6148fdfbf185ed59b8b17203870252cc16230","abstract_canon_sha256":"e8dac3eaf5e16a10b8bd87fbca502a744247a71468949e59d2aa194fa91eb548"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:57.759827Z","signature_b64":"JbsDiWYqyPiQm6Up4mlbL0o0Rwx9mEXFbfw5wWURIXVB+wTwK879oyvh3MfsACutoj6LFkigSBvVAa7RSe+QCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"683d017cd1a1ace9a818ad97126f59a2e286652704b83524d17354460b440afe","last_reissued_at":"2026-05-18T03:32:57.759173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:57.759173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Fault-Tolerant BFS Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Peleg, Merav Parter","submitted_at":"2013-02-21T20:19:31Z","abstract_excerpt":"This paper addresses the problem of designing a sparse {\\em fault-tolerant} BFS tree, or {\\em FT-BFS tree} for short, namely, a sparse subgraph $T$ of the given network $G$ such that subsequent to the failure of a single edge or vertex, the surviving part $T'$ of $T$ still contains a BFS spanning tree for (the surviving part of) $G$. Our main results are as follows. We present an algorithm that for every $n$-vertex graph $G$ and source node $s$ constructs a (single edge failure) FT-BFS tree rooted at $s$ with $O(n \\cdot \\min\\{\\Depth(s), \\sqrt{n}\\})$ edges, where $\\Depth(s)$ is the depth of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5401","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":"1302.5401","created_at":"2026-05-18T03:32:57.759279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5401v1","created_at":"2026-05-18T03:32:57.759279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5401","created_at":"2026-05-18T03:32:57.759279+00:00"},{"alias_kind":"pith_short_12","alias_value":"NA6QC7GRUGWO","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NA6QC7GRUGWOTKAY","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NA6QC7GR","created_at":"2026-05-18T12:27:52.871228+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/NA6QC7GRUGWOTKAYVWLRE32ZUL","json":"https://pith.science/pith/NA6QC7GRUGWOTKAYVWLRE32ZUL.json","graph_json":"https://pith.science/api/pith-number/NA6QC7GRUGWOTKAYVWLRE32ZUL/graph.json","events_json":"https://pith.science/api/pith-number/NA6QC7GRUGWOTKAYVWLRE32ZUL/events.json","paper":"https://pith.science/paper/NA6QC7GR"},"agent_actions":{"view_html":"https://pith.science/pith/NA6QC7GRUGWOTKAYVWLRE32ZUL","download_json":"https://pith.science/pith/NA6QC7GRUGWOTKAYVWLRE32ZUL.json","view_paper":"https://pith.science/paper/NA6QC7GR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5401&json=true","fetch_graph":"https://pith.science/api/pith-number/NA6QC7GRUGWOTKAYVWLRE32ZUL/graph.json","fetch_events":"https://pith.science/api/pith-number/NA6QC7GRUGWOTKAYVWLRE32ZUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NA6QC7GRUGWOTKAYVWLRE32ZUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NA6QC7GRUGWOTKAYVWLRE32ZUL/action/storage_attestation","attest_author":"https://pith.science/pith/NA6QC7GRUGWOTKAYVWLRE32ZUL/action/author_attestation","sign_citation":"https://pith.science/pith/NA6QC7GRUGWOTKAYVWLRE32ZUL/action/citation_signature","submit_replication":"https://pith.science/pith/NA6QC7GRUGWOTKAYVWLRE32ZUL/action/replication_record"}},"created_at":"2026-05-18T03:32:57.759279+00:00","updated_at":"2026-05-18T03:32:57.759279+00:00"}