{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YKK6A6LIRUYWIBDK5UPY2GXDDV","short_pith_number":"pith:YKK6A6LI","canonical_record":{"source":{"id":"1601.04169","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-01-16T14:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"4c784ac5e9043f22c6415e494b885cebc46a1921eff53fdabd24163d608de771","abstract_canon_sha256":"c72597fa6cdb1df0dd3609792f5ffeb81b5f5078c0ca9856231d4e3dfe3bb409"},"schema_version":"1.0"},"canonical_sha256":"c295e079688d3164046aed1f8d1ae31d5b70247c249ee448c5805b56c8c066b4","source":{"kind":"arxiv","id":"1601.04169","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04169","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04169v2","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04169","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"YKK6A6LIRUYW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YKK6A6LIRUYWIBDK","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YKK6A6LI","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YKK6A6LIRUYWIBDK5UPY2GXDDV","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04169","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-01-16T14:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"4c784ac5e9043f22c6415e494b885cebc46a1921eff53fdabd24163d608de771","abstract_canon_sha256":"c72597fa6cdb1df0dd3609792f5ffeb81b5f5078c0ca9856231d4e3dfe3bb409"},"schema_version":"1.0"},"canonical_sha256":"c295e079688d3164046aed1f8d1ae31d5b70247c249ee448c5805b56c8c066b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:13.891531Z","signature_b64":"wR2X1YOR25ue9eHc1xDkt2hRxQfhx8dEsrzjDmNuUpSvQGIirvPqOs1W/Xg9VECoEEfNNW+YovXipbjQivxwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c295e079688d3164046aed1f8d1ae31d5b70247c249ee448c5805b56c8c066b4","last_reissued_at":"2026-05-18T01:22:13.890824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:13.890824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04169","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:22:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ZjvL5y7zXhqSzte/SuOgqzoh9GiptFwOl2eileRUe/D7BM4zZYW0cm20xQhdywDVC4kI22K8LfzwfeuSRSgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:37:02.305417Z"},"content_sha256":"00b5f0c3a9cfd3d43e96dd3ef9e96e9b0b0b8930c825088f019ccb23fe4acaee","schema_version":"1.0","event_id":"sha256:00b5f0c3a9cfd3d43e96dd3ef9e96e9b0b0b8930c825088f019ccb23fe4acaee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YKK6A6LIRUYWIBDK5UPY2GXDDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2016-01-16T14:44:58Z","abstract_excerpt":"Let $G$ be an $n$-node and $m$-edge positively real-weighted undirected graph. For any given integer $f \\ge 1$, we study the problem of designing a sparse \\emph{f-edge-fault-tolerant} ($f$-EFT) $\\sigma${\\em -approximate single-source shortest-path tree} ($\\sigma$-ASPT), namely a subgraph of $G$ having as few edges as possible and which, following the failure of a set $F$ of at most $f$ edges in $G$, contains paths from a fixed source that are stretched at most by a factor of $\\sigma$. To this respect, we provide an algorithm that efficiently computes an $f$-EFT $(2|F|+1)$-ASPT of size $O(f n)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04169","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:22:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RlRAZovWFvdmbmVnt3N0+Tp8hM9uSels71OXiUj/14mOAbwQlRoBbUEA3cORSN66a/aMxrWL4Pi7So9PwbNUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:37:02.305775Z"},"content_sha256":"c6374e96eebbe9e0f6838c2f17d1e14341e9f0b60c35684ca647e3d7228f3699","schema_version":"1.0","event_id":"sha256:c6374e96eebbe9e0f6838c2f17d1e14341e9f0b60c35684ca647e3d7228f3699"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/bundle.json","state_url":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/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-01T06:37:02Z","links":{"resolver":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV","bundle":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/bundle.json","state":"https://pith.science/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKK6A6LIRUYWIBDK5UPY2GXDDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YKK6A6LIRUYWIBDK5UPY2GXDDV","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":"c72597fa6cdb1df0dd3609792f5ffeb81b5f5078c0ca9856231d4e3dfe3bb409","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-01-16T14:44:58Z","title_canon_sha256":"4c784ac5e9043f22c6415e494b885cebc46a1921eff53fdabd24163d608de771"},"schema_version":"1.0","source":{"id":"1601.04169","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04169","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04169v2","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04169","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"YKK6A6LIRUYW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YKK6A6LIRUYWIBDK","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YKK6A6LI","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:c6374e96eebbe9e0f6838c2f17d1e14341e9f0b60c35684ca647e3d7228f3699","target":"graph","created_at":"2026-05-18T01:22: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":"Let $G$ be an $n$-node and $m$-edge positively real-weighted undirected graph. For any given integer $f \\ge 1$, we study the problem of designing a sparse \\emph{f-edge-fault-tolerant} ($f$-EFT) $\\sigma${\\em -approximate single-source shortest-path tree} ($\\sigma$-ASPT), namely a subgraph of $G$ having as few edges as possible and which, following the failure of a set $F$ of at most $f$ edges in $G$, contains paths from a fixed source that are stretched at most by a factor of $\\sigma$. To this respect, we provide an algorithm that efficiently computes an $f$-EFT $(2|F|+1)$-ASPT of size $O(f n)$","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-01-16T14:44:58Z","title":"Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04169","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:00b5f0c3a9cfd3d43e96dd3ef9e96e9b0b0b8930c825088f019ccb23fe4acaee","target":"record","created_at":"2026-05-18T01:22: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":"c72597fa6cdb1df0dd3609792f5ffeb81b5f5078c0ca9856231d4e3dfe3bb409","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-01-16T14:44:58Z","title_canon_sha256":"4c784ac5e9043f22c6415e494b885cebc46a1921eff53fdabd24163d608de771"},"schema_version":"1.0","source":{"id":"1601.04169","kind":"arxiv","version":2}},"canonical_sha256":"c295e079688d3164046aed1f8d1ae31d5b70247c249ee448c5805b56c8c066b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c295e079688d3164046aed1f8d1ae31d5b70247c249ee448c5805b56c8c066b4","first_computed_at":"2026-05-18T01:22:13.890824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:13.890824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wR2X1YOR25ue9eHc1xDkt2hRxQfhx8dEsrzjDmNuUpSvQGIirvPqOs1W/Xg9VECoEEfNNW+YovXipbjQivxwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:13.891531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04169","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00b5f0c3a9cfd3d43e96dd3ef9e96e9b0b0b8930c825088f019ccb23fe4acaee","sha256:c6374e96eebbe9e0f6838c2f17d1e14341e9f0b60c35684ca647e3d7228f3699"],"state_sha256":"45ea9230fb605c3b3d6779596162d429eb7cd6e849156a758bd0309056f5f243"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5K/wQgNWtMFL6bW75TWHUp9bQdoSRnuCpLw4GjMPm9jQIwvM5lBCb8DbMDD678hnaV42HduTtz+hhULQy89Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:37:02.307896Z","bundle_sha256":"77bbc592bf32eb14f751c25fbd42016b542b8034529c70470b6adbde101d95dc"}}