{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AXJA7NRBT6F32WFVORAK4HRW3W","short_pith_number":"pith:AXJA7NRB","canonical_record":{"source":{"id":"1407.0637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-02T16:30:58Z","cross_cats_sorted":[],"title_canon_sha256":"3d6cf7c62726f190828ff531c865a9f56f132be7563625173379191844a25c37","abstract_canon_sha256":"10a29bc2cef0709b5d9735c0fd357e96ed2ef5fafcae9046261d3395e3ce32ba"},"schema_version":"1.0"},"canonical_sha256":"05d20fb6219f8bbd58b57440ae1e36dda18c1f9615ca0ba3f197d10eb4ff8138","source":{"kind":"arxiv","id":"1407.0637","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0637","created_at":"2026-05-18T01:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0637v2","created_at":"2026-05-18T01:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0637","created_at":"2026-05-18T01:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"AXJA7NRBT6F3","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AXJA7NRBT6F32WFV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AXJA7NRB","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AXJA7NRBT6F32WFVORAK4HRW3W","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-02T16:30:58Z","cross_cats_sorted":[],"title_canon_sha256":"3d6cf7c62726f190828ff531c865a9f56f132be7563625173379191844a25c37","abstract_canon_sha256":"10a29bc2cef0709b5d9735c0fd357e96ed2ef5fafcae9046261d3395e3ce32ba"},"schema_version":"1.0"},"canonical_sha256":"05d20fb6219f8bbd58b57440ae1e36dda18c1f9615ca0ba3f197d10eb4ff8138","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:13.018206Z","signature_b64":"a0eZWSh1aqKWUXyyQHexv+/oe8FXG30iIb4Mfm/RDM0iaswHcXB0r/KSl5DFJEnubnpVI+UT/HiNgWLo4z1nBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05d20fb6219f8bbd58b57440ae1e36dda18c1f9615ca0ba3f197d10eb4ff8138","last_reissued_at":"2026-05-18T01:00:13.017511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:13.017511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0637","source_version":2,"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-18T01:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhf6fF1b2O9WVoZ9i1TZ/ct9C7a0vNxcjqOoGYADxhlHr3+/+N9JPLyaWxaJagfOvfEdPwceLpONg7KSdOfTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:52:01.344706Z"},"content_sha256":"f05c948182b530628609aef0879a7951a867b46654a3c67c0704a235ffb6e3ee","schema_version":"1.0","event_id":"sha256:f05c948182b530628609aef0879a7951a867b46654a3c67c0704a235ffb6e3ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AXJA7NRBT6F32WFVORAK4HRW3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault-Tolerant Approximate Shortest-Path Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2014-07-02T16:30:58Z","abstract_excerpt":"The resiliency of a network is its ability to remain \\emph{effectively} functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the requirement of being resilient. In this paper we address this trade-off for the prominent case of the {\\em broadcasting} routing scheme, and we build efficient (i.e., sparse and fast) \\emph{fault-tolerant approximate shortest-path trees}, for both the edge and vertex \\emph{single-failure} case. In particular, for an $n$-vertex non-negatively weighted graph, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0637","kind":"arxiv","version":2},"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-18T01:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iMMXEGKlMMwAS7dltygHbYaq6+kxNcbUMRBqm1jV1SGRo/NLcsSXd6ErAc4Z3k1aDrA8suXSJY0vQT5fw+rzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:52:01.345061Z"},"content_sha256":"034a3b35d2891333accb64be7a00e249119b9472eac56d06b12a034961a7ebb2","schema_version":"1.0","event_id":"sha256:034a3b35d2891333accb64be7a00e249119b9472eac56d06b12a034961a7ebb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXJA7NRBT6F32WFVORAK4HRW3W/bundle.json","state_url":"https://pith.science/pith/AXJA7NRBT6F32WFVORAK4HRW3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXJA7NRBT6F32WFVORAK4HRW3W/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-01T13:52:01Z","links":{"resolver":"https://pith.science/pith/AXJA7NRBT6F32WFVORAK4HRW3W","bundle":"https://pith.science/pith/AXJA7NRBT6F32WFVORAK4HRW3W/bundle.json","state":"https://pith.science/pith/AXJA7NRBT6F32WFVORAK4HRW3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXJA7NRBT6F32WFVORAK4HRW3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AXJA7NRBT6F32WFVORAK4HRW3W","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":"10a29bc2cef0709b5d9735c0fd357e96ed2ef5fafcae9046261d3395e3ce32ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-02T16:30:58Z","title_canon_sha256":"3d6cf7c62726f190828ff531c865a9f56f132be7563625173379191844a25c37"},"schema_version":"1.0","source":{"id":"1407.0637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0637","created_at":"2026-05-18T01:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0637v2","created_at":"2026-05-18T01:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0637","created_at":"2026-05-18T01:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"AXJA7NRBT6F3","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AXJA7NRBT6F32WFV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AXJA7NRB","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:034a3b35d2891333accb64be7a00e249119b9472eac56d06b12a034961a7ebb2","target":"graph","created_at":"2026-05-18T01:00:13Z","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":"The resiliency of a network is its ability to remain \\emph{effectively} functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the requirement of being resilient. In this paper we address this trade-off for the prominent case of the {\\em broadcasting} routing scheme, and we build efficient (i.e., sparse and fast) \\emph{fault-tolerant approximate shortest-path trees}, for both the edge and vertex \\emph{single-failure} case. In particular, for an $n$-vertex non-negatively weighted graph, a","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-02T16:30:58Z","title":"Fault-Tolerant Approximate Shortest-Path Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0637","kind":"arxiv","version":2},"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:f05c948182b530628609aef0879a7951a867b46654a3c67c0704a235ffb6e3ee","target":"record","created_at":"2026-05-18T01:00:13Z","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":"10a29bc2cef0709b5d9735c0fd357e96ed2ef5fafcae9046261d3395e3ce32ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-02T16:30:58Z","title_canon_sha256":"3d6cf7c62726f190828ff531c865a9f56f132be7563625173379191844a25c37"},"schema_version":"1.0","source":{"id":"1407.0637","kind":"arxiv","version":2}},"canonical_sha256":"05d20fb6219f8bbd58b57440ae1e36dda18c1f9615ca0ba3f197d10eb4ff8138","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05d20fb6219f8bbd58b57440ae1e36dda18c1f9615ca0ba3f197d10eb4ff8138","first_computed_at":"2026-05-18T01:00:13.017511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:13.017511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a0eZWSh1aqKWUXyyQHexv+/oe8FXG30iIb4Mfm/RDM0iaswHcXB0r/KSl5DFJEnubnpVI+UT/HiNgWLo4z1nBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:13.018206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f05c948182b530628609aef0879a7951a867b46654a3c67c0704a235ffb6e3ee","sha256:034a3b35d2891333accb64be7a00e249119b9472eac56d06b12a034961a7ebb2"],"state_sha256":"02f692178cc330b45a4b2b5d6f6957475a7ea61921e87ade418ba38c320741d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRAk/Lc6Wdyh7M1qSlCHjT8nhfhFYfnFs8fD/EC2Eh2O7nQF0oU29v62TZsS1Lmxsc19kjsqE4XyGW1ao5IrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:52:01.347025Z","bundle_sha256":"65a3435fc888df8e9674f6762f0ad2a72dd8b8fd40c4e79885b272f0a609646b"}}