{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FTV537635QXEXUFDZTDZTT4Y6X","short_pith_number":"pith:FTV53763","schema_version":"1.0","canonical_sha256":"2cebddffdbec2e4bd0a3ccc799cf98f5ce000bc02e0a61ff246b5b11ae541c21","source":{"kind":"arxiv","id":"1406.6169","version":1},"attestation_state":"computed","paper":{"title":"Fault Tolerant Approximate BFS Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Peleg, Merav Parter","submitted_at":"2014-06-24T08:46:12Z","abstract_excerpt":"This paper addresses the problem of designing a {\\em fault-tolerant} $(\\alpha, \\beta)$ approximate BFS structure (or {\\em FT-ABFS structure} for short), namely, a subgraph $H$ of the network $G$ such that subsequent to the failure of some subset $F$ of edges or vertices, the surviving part of $H$ still contains an \\emph{approximate} BFS spanning tree for (the surviving part of) $G$, satisfying $dist(s,v,H\\setminus F) \\leq \\alpha \\cdot dist(s,v,G\\setminus F)+\\beta$ for every $v \\in V$. We first consider {\\em multiplicative} $(\\alpha,0)$ FT-ABFS structures resilient to a failure of a single edge"},"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":"1406.6169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-24T08:46:12Z","cross_cats_sorted":[],"title_canon_sha256":"70767467d1778668b872dce26c2b87b917e0e51cc2ed50a42974612039a82dda","abstract_canon_sha256":"26c5c5757242fb5e31d9189f20e57c2fa6ddb22fd73797d0a38fe51b43273d80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:03.938930Z","signature_b64":"ZIr4xS3N21OFyBwo9u62Y6wQN9PlL039fRgSH6XAsOJimIKsnEB5cOqD4mzqhP6UxPbK2OcFWicjET+Fcw7gCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cebddffdbec2e4bd0a3ccc799cf98f5ce000bc02e0a61ff246b5b11ae541c21","last_reissued_at":"2026-05-18T02:49:03.938462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:03.938462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault Tolerant Approximate BFS Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Peleg, Merav Parter","submitted_at":"2014-06-24T08:46:12Z","abstract_excerpt":"This paper addresses the problem of designing a {\\em fault-tolerant} $(\\alpha, \\beta)$ approximate BFS structure (or {\\em FT-ABFS structure} for short), namely, a subgraph $H$ of the network $G$ such that subsequent to the failure of some subset $F$ of edges or vertices, the surviving part of $H$ still contains an \\emph{approximate} BFS spanning tree for (the surviving part of) $G$, satisfying $dist(s,v,H\\setminus F) \\leq \\alpha \\cdot dist(s,v,G\\setminus F)+\\beta$ for every $v \\in V$. We first consider {\\em multiplicative} $(\\alpha,0)$ FT-ABFS structures resilient to a failure of a single edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6169","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":"1406.6169","created_at":"2026-05-18T02:49:03.938533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6169v1","created_at":"2026-05-18T02:49:03.938533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6169","created_at":"2026-05-18T02:49:03.938533+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTV537635QXE","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTV537635QXEXUFD","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTV53763","created_at":"2026-05-18T12:28:28.263976+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/FTV537635QXEXUFDZTDZTT4Y6X","json":"https://pith.science/pith/FTV537635QXEXUFDZTDZTT4Y6X.json","graph_json":"https://pith.science/api/pith-number/FTV537635QXEXUFDZTDZTT4Y6X/graph.json","events_json":"https://pith.science/api/pith-number/FTV537635QXEXUFDZTDZTT4Y6X/events.json","paper":"https://pith.science/paper/FTV53763"},"agent_actions":{"view_html":"https://pith.science/pith/FTV537635QXEXUFDZTDZTT4Y6X","download_json":"https://pith.science/pith/FTV537635QXEXUFDZTDZTT4Y6X.json","view_paper":"https://pith.science/paper/FTV53763","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6169&json=true","fetch_graph":"https://pith.science/api/pith-number/FTV537635QXEXUFDZTDZTT4Y6X/graph.json","fetch_events":"https://pith.science/api/pith-number/FTV537635QXEXUFDZTDZTT4Y6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTV537635QXEXUFDZTDZTT4Y6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTV537635QXEXUFDZTDZTT4Y6X/action/storage_attestation","attest_author":"https://pith.science/pith/FTV537635QXEXUFDZTDZTT4Y6X/action/author_attestation","sign_citation":"https://pith.science/pith/FTV537635QXEXUFDZTDZTT4Y6X/action/citation_signature","submit_replication":"https://pith.science/pith/FTV537635QXEXUFDZTDZTT4Y6X/action/replication_record"}},"created_at":"2026-05-18T02:49:03.938533+00:00","updated_at":"2026-05-18T02:49:03.938533+00:00"}