{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N4HMI36DS3M37SU2CK27Y2HASH","short_pith_number":"pith:N4HMI36D","schema_version":"1.0","canonical_sha256":"6f0ec46fc396d9bfca9a12b5fc68e091edb1a22f1428ae4ff4daff80dd30d7ed","source":{"kind":"arxiv","id":"1101.5753","version":1},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Spanners: Better and Simpler","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Michael Dinitz, Robert Krauthgamer","submitted_at":"2011-01-30T09:35:13Z","abstract_excerpt":"A natural requirement of many distributed structures is fault-tolerance: after some failures, whatever remains from the structure should still be effective for whatever remains from the network. In this paper we examine spanners of general graphs that are tolerant to vertex failures, and significantly improve their dependence on the number of faults $r$, for all stretch bounds.\n  For stretch $k \\geq 3$ we design a simple transformation that converts every $k$-spanner construction with at most $f(n)$ edges into an $r$-fault-tolerant $k$-spanner construction with at most $O(r^3 \\log n) \\cdot f(2"},"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":"1101.5753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-30T09:35:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e13c81a243566937f8d1ec5967f88b3f4fd92f8e051d053733f230d5397b4010","abstract_canon_sha256":"2a795bbc771c5c5726899e21411f2482d766ba73444f97812fe3557dc0f69e30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:24.891276Z","signature_b64":"ckOZNvVIT5aJmRWgE0Gse4/uxy5e2M0pKART6JFgiodGPjh1qSp6OlJGx3E49OVU6WYwbGgw1AJkyWoF30ICDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f0ec46fc396d9bfca9a12b5fc68e091edb1a22f1428ae4ff4daff80dd30d7ed","last_reissued_at":"2026-05-18T04:30:24.890814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:24.890814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Spanners: Better and Simpler","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Michael Dinitz, Robert Krauthgamer","submitted_at":"2011-01-30T09:35:13Z","abstract_excerpt":"A natural requirement of many distributed structures is fault-tolerance: after some failures, whatever remains from the structure should still be effective for whatever remains from the network. In this paper we examine spanners of general graphs that are tolerant to vertex failures, and significantly improve their dependence on the number of faults $r$, for all stretch bounds.\n  For stretch $k \\geq 3$ we design a simple transformation that converts every $k$-spanner construction with at most $f(n)$ edges into an $r$-fault-tolerant $k$-spanner construction with at most $O(r^3 \\log n) \\cdot f(2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5753","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":"1101.5753","created_at":"2026-05-18T04:30:24.890890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5753v1","created_at":"2026-05-18T04:30:24.890890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5753","created_at":"2026-05-18T04:30:24.890890+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4HMI36DS3M3","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4HMI36DS3M37SU2","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4HMI36D","created_at":"2026-05-18T12:26:37.096874+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/N4HMI36DS3M37SU2CK27Y2HASH","json":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH.json","graph_json":"https://pith.science/api/pith-number/N4HMI36DS3M37SU2CK27Y2HASH/graph.json","events_json":"https://pith.science/api/pith-number/N4HMI36DS3M37SU2CK27Y2HASH/events.json","paper":"https://pith.science/paper/N4HMI36D"},"agent_actions":{"view_html":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH","download_json":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH.json","view_paper":"https://pith.science/paper/N4HMI36D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5753&json=true","fetch_graph":"https://pith.science/api/pith-number/N4HMI36DS3M37SU2CK27Y2HASH/graph.json","fetch_events":"https://pith.science/api/pith-number/N4HMI36DS3M37SU2CK27Y2HASH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH/action/storage_attestation","attest_author":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH/action/author_attestation","sign_citation":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH/action/citation_signature","submit_replication":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH/action/replication_record"}},"created_at":"2026-05-18T04:30:24.890890+00:00","updated_at":"2026-05-18T04:30:24.890890+00:00"}