{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:N4HMI36DS3M37SU2CK27Y2HASH","short_pith_number":"pith:N4HMI36D","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"},"canonical_sha256":"6f0ec46fc396d9bfca9a12b5fc68e091edb1a22f1428ae4ff4daff80dd30d7ed","source":{"kind":"arxiv","id":"1101.5753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5753","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5753v1","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5753","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"N4HMI36DS3M3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N4HMI36DS3M37SU2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N4HMI36D","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:N4HMI36DS3M37SU2CK27Y2HASH","target":"record","payload":{"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"},"canonical_sha256":"6f0ec46fc396d9bfca9a12b5fc68e091edb1a22f1428ae4ff4daff80dd30d7ed","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"},"source_kind":"arxiv","source_id":"1101.5753","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLTmFz9vT5vRsmmRfjsmLFr/63fofJjixoMFREDbKMqrzImqOmtqpq+hUCrExExgrM1YeW9W2NaUi72Al0QeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:27:42.598237Z"},"content_sha256":"7180bedb944f86def87fa8f0403c1f31845632ae0116e1595e35ecbaf17f0bd9","schema_version":"1.0","event_id":"sha256:7180bedb944f86def87fa8f0403c1f31845632ae0116e1595e35ecbaf17f0bd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:N4HMI36DS3M37SU2CK27Y2HASH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpE5lLZ6nk30Q1JdRbF85exw9BPmMSm8dRmWkHUglPWUzcakVD/b86ZbrsmWBwPuv1ZEJ1PEZfR+BSEl4gqBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:27:42.598904Z"},"content_sha256":"db92e4acfdca699820f8c9d275836e83b031c1561631b6c784b7add5ad5cc656","schema_version":"1.0","event_id":"sha256:db92e4acfdca699820f8c9d275836e83b031c1561631b6c784b7add5ad5cc656"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH/bundle.json","state_url":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4HMI36DS3M37SU2CK27Y2HASH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T19:27:42Z","links":{"resolver":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH","bundle":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH/bundle.json","state":"https://pith.science/pith/N4HMI36DS3M37SU2CK27Y2HASH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4HMI36DS3M37SU2CK27Y2HASH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:N4HMI36DS3M37SU2CK27Y2HASH","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":"2a795bbc771c5c5726899e21411f2482d766ba73444f97812fe3557dc0f69e30","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-30T09:35:13Z","title_canon_sha256":"e13c81a243566937f8d1ec5967f88b3f4fd92f8e051d053733f230d5397b4010"},"schema_version":"1.0","source":{"id":"1101.5753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5753","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5753v1","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5753","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"N4HMI36DS3M3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N4HMI36DS3M37SU2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N4HMI36D","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:db92e4acfdca699820f8c9d275836e83b031c1561631b6c784b7add5ad5cc656","target":"graph","created_at":"2026-05-18T04:30:24Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Michael Dinitz, Robert Krauthgamer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-30T09:35:13Z","title":"Fault-Tolerant Spanners: Better and Simpler"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5753","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7180bedb944f86def87fa8f0403c1f31845632ae0116e1595e35ecbaf17f0bd9","target":"record","created_at":"2026-05-18T04:30:24Z","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":"2a795bbc771c5c5726899e21411f2482d766ba73444f97812fe3557dc0f69e30","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-30T09:35:13Z","title_canon_sha256":"e13c81a243566937f8d1ec5967f88b3f4fd92f8e051d053733f230d5397b4010"},"schema_version":"1.0","source":{"id":"1101.5753","kind":"arxiv","version":1}},"canonical_sha256":"6f0ec46fc396d9bfca9a12b5fc68e091edb1a22f1428ae4ff4daff80dd30d7ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f0ec46fc396d9bfca9a12b5fc68e091edb1a22f1428ae4ff4daff80dd30d7ed","first_computed_at":"2026-05-18T04:30:24.890814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:24.890814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ckOZNvVIT5aJmRWgE0Gse4/uxy5e2M0pKART6JFgiodGPjh1qSp6OlJGx3E49OVU6WYwbGgw1AJkyWoF30ICDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:24.891276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.5753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7180bedb944f86def87fa8f0403c1f31845632ae0116e1595e35ecbaf17f0bd9","sha256:db92e4acfdca699820f8c9d275836e83b031c1561631b6c784b7add5ad5cc656"],"state_sha256":"e93a255fd78401dcb67929ca8f7b8fa03be89c771ae1122eda2aade15effdcb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOtZp3bYTR6/krQiukHagj/Qq2+oUm497YBMIYXvceEVp2jJqWk7la50D7vShNTSErFTIMkmpb0t9Il2HAJsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:27:42.602942Z","bundle_sha256":"27b7f0c6fb48702af3c72f3bb596eaf5a9759adef541f10b3b5c0b0fb31a8c95"}}