{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AVAVT3SUNSVJAE33E7VKYT2XE4","short_pith_number":"pith:AVAVT3SU","canonical_record":{"source":{"id":"1507.01695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"904a2d171e50447db66f9cd03565b8bfaece1bdafa08ca1fe1a4f9dd3a42c1b4","abstract_canon_sha256":"b772d182eca436c5f13596e01bf738206ca163d45d236b30977636f9affa8e23"},"schema_version":"1.0"},"canonical_sha256":"054159ee546caa90137b27eaac4f57271c2a9ebd96c344e021fb38a842d94580","source":{"kind":"arxiv","id":"1507.01695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01695","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01695v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01695","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"AVAVT3SUNSVJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AVAVT3SUNSVJAE33","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AVAVT3SU","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AVAVT3SUNSVJAE33E7VKYT2XE4","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"904a2d171e50447db66f9cd03565b8bfaece1bdafa08ca1fe1a4f9dd3a42c1b4","abstract_canon_sha256":"b772d182eca436c5f13596e01bf738206ca163d45d236b30977636f9affa8e23"},"schema_version":"1.0"},"canonical_sha256":"054159ee546caa90137b27eaac4f57271c2a9ebd96c344e021fb38a842d94580","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:12.642201Z","signature_b64":"VZScHlXooz6c1S+g8cqCten2YV/BijdyyNUC1/M+QKIw9wAxH0r+Ie5RrFL7ZGHMFIi/QK03EimA3L//BCzbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"054159ee546caa90137b27eaac4f57271c2a9ebd96c344e021fb38a842d94580","last_reissued_at":"2026-05-18T01:37:12.641591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:12.641591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01695","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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjrLxKpYU8GFOflhcixYj6AepHBvod7lhS1BMa5fLEi6kzszI6ieCji2T/+F6Pdru+ds4v40nVVWzeCfkZMABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:06.591641Z"},"content_sha256":"a9606540c5eeeffb0780be8498bb7fb2610789bfe5936138d3379d44b4294a33","schema_version":"1.0","event_id":"sha256:a9606540c5eeeffb0780be8498bb7fb2610789bfe5936138d3379d44b4294a33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AVAVT3SUNSVJAE33E7VKYT2XE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path-Fault-Tolerant Approximate Shortest-Path Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Annalisa D'Andrea, Daniele Frigioni, Guido Proietti, Mattia D'Emidio, Stefano Leucci","submitted_at":"2015-07-07T07:59:40Z","abstract_excerpt":"Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\\em single-source shortest-path tree} (SPT) of $G$ with a \\emph{sparse} set of \\emph{auxiliary} edges selected from $E$, in order to create a structure which tolerates effectively a \\emph{path failure} in the SPT. This consists of a simultaneous fault of a set $F$ of at most $f$ adjacent edges along a shortest path emanating from the source, and it is recognized as one of the most frequent disruption in an SPT. We show that, for any integer parameter $k \\geq 1$, it is possible to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01695","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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZOB/q9U9/mKp87XpDFmBdKwZD4+1isOvg+Eby5pecvc5wFETSyUvzBjzXYBNhgXaJPqeo2irGEkvotjRe1uAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:06.592003Z"},"content_sha256":"2c6087d76acb1bc45b3f8466dc49970a1d8f9e0df1a5cabe4173d48ad80164ca","schema_version":"1.0","event_id":"sha256:2c6087d76acb1bc45b3f8466dc49970a1d8f9e0df1a5cabe4173d48ad80164ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/bundle.json","state_url":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/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-02T18:38:06Z","links":{"resolver":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4","bundle":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/bundle.json","state":"https://pith.science/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVAVT3SUNSVJAE33E7VKYT2XE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AVAVT3SUNSVJAE33E7VKYT2XE4","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":"b772d182eca436c5f13596e01bf738206ca163d45d236b30977636f9affa8e23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:59:40Z","title_canon_sha256":"904a2d171e50447db66f9cd03565b8bfaece1bdafa08ca1fe1a4f9dd3a42c1b4"},"schema_version":"1.0","source":{"id":"1507.01695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01695","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01695v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01695","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"AVAVT3SUNSVJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AVAVT3SUNSVJAE33","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AVAVT3SU","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:2c6087d76acb1bc45b3f8466dc49970a1d8f9e0df1a5cabe4173d48ad80164ca","target":"graph","created_at":"2026-05-18T01:37:12Z","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":"Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\\em single-source shortest-path tree} (SPT) of $G$ with a \\emph{sparse} set of \\emph{auxiliary} edges selected from $E$, in order to create a structure which tolerates effectively a \\emph{path failure} in the SPT. This consists of a simultaneous fault of a set $F$ of at most $f$ adjacent edges along a shortest path emanating from the source, and it is recognized as one of the most frequent disruption in an SPT. We show that, for any integer parameter $k \\geq 1$, it is possible to","authors_text":"Annalisa D'Andrea, Daniele Frigioni, Guido Proietti, Mattia D'Emidio, Stefano Leucci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:59:40Z","title":"Path-Fault-Tolerant Approximate Shortest-Path Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01695","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:a9606540c5eeeffb0780be8498bb7fb2610789bfe5936138d3379d44b4294a33","target":"record","created_at":"2026-05-18T01:37:12Z","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":"b772d182eca436c5f13596e01bf738206ca163d45d236b30977636f9affa8e23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T07:59:40Z","title_canon_sha256":"904a2d171e50447db66f9cd03565b8bfaece1bdafa08ca1fe1a4f9dd3a42c1b4"},"schema_version":"1.0","source":{"id":"1507.01695","kind":"arxiv","version":1}},"canonical_sha256":"054159ee546caa90137b27eaac4f57271c2a9ebd96c344e021fb38a842d94580","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"054159ee546caa90137b27eaac4f57271c2a9ebd96c344e021fb38a842d94580","first_computed_at":"2026-05-18T01:37:12.641591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:12.641591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VZScHlXooz6c1S+g8cqCten2YV/BijdyyNUC1/M+QKIw9wAxH0r+Ie5RrFL7ZGHMFIi/QK03EimA3L//BCzbAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:12.642201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9606540c5eeeffb0780be8498bb7fb2610789bfe5936138d3379d44b4294a33","sha256:2c6087d76acb1bc45b3f8466dc49970a1d8f9e0df1a5cabe4173d48ad80164ca"],"state_sha256":"774f8c833085f68a96d1078bd46db3d136bbde541bc10aaa764eda86fa14263d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gRFUOVlOMWdkcnwDN1qwAFzqelfzsA1fqyQEAkaX4FIxYlRw25cKw0Z+8uqClEz8wMGDamNsKXuzC2iL78L2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:38:06.594013Z","bundle_sha256":"65341149cbba65598f9c2e1bd70ce2ecb4f3740501a2b3cc3bb68afe02b66790"}}