{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HKS3E3SPHAQALIFRZ446IBJEE2","short_pith_number":"pith:HKS3E3SP","canonical_record":{"source":{"id":"1608.04769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-16T20:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"e143c439cd6937e6df94e5d05fa9aefae3dc130912cb892fb3eb79148e47dd86","abstract_canon_sha256":"a87b01586564bfd501e795042f591e1735404f0870cfa1b2769236897a6fdd7c"},"schema_version":"1.0"},"canonical_sha256":"3aa5b26e4f382005a0b1cf39e4052426966fc58f3799ea0cc2c2aefe0eb5d3aa","source":{"kind":"arxiv","id":"1608.04769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04769","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04769v1","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04769","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"HKS3E3SPHAQA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HKS3E3SPHAQALIFR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HKS3E3SP","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HKS3E3SPHAQALIFRZ446IBJEE2","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-16T20:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"e143c439cd6937e6df94e5d05fa9aefae3dc130912cb892fb3eb79148e47dd86","abstract_canon_sha256":"a87b01586564bfd501e795042f591e1735404f0870cfa1b2769236897a6fdd7c"},"schema_version":"1.0"},"canonical_sha256":"3aa5b26e4f382005a0b1cf39e4052426966fc58f3799ea0cc2c2aefe0eb5d3aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:33.651264Z","signature_b64":"LCVQn/XCeOYAGPgZMsXYxqAUmYC9m7ng9FJEsHNgMyK6wD3obU3N+Rh+I1eMxp03QUUHkjaqyJS0nBkL4rJGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aa5b26e4f382005a0b1cf39e4052426966fc58f3799ea0cc2c2aefe0eb5d3aa","last_reissued_at":"2026-05-18T01:08:33.650633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:33.650633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04769","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:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wiuKhWjD62Tg8ZHssV2YkEJr1TNBmHXLpaFDKb5YbEE//fBQslQcOfK7eCZMbWaw2KJ0XLmbVG6G1Oeg5zafAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:18:25.424269Z"},"content_sha256":"525c0bbe45174f20d94db2867719cd86fa58d4c04b7f8730f24511609ed656db","schema_version":"1.0","event_id":"sha256:525c0bbe45174f20d94db2867719cd86fa58d4c04b7f8730f24511609ed656db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HKS3E3SPHAQALIFRZ446IBJEE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact and Fast Sensitivity Oracles for Single-Source Distances","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":"2016-08-16T20:38:20Z","abstract_excerpt":"Let $s$ denote a distinguished source vertex of a non-negatively real weighted and undirected graph $G$ with $n$ vertices and $m$ edges. In this paper we present two efficient \\emph{single-source approximate-distance sensitivity oracles}, namely \\emph{compact} data structures which are able to \\emph{quickly} report an approximate (by a multiplicative stretch factor) distance from $s$ to any node of $G$ following the failure of any edge in $G$. More precisely, we first present a sensitivity oracle of size $O(n)$ which is able to report 2-approximate distances from the source in $O(1)$ time. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04769","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:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QpzuHlNKagkWf4X5RW0lzvNkI1M+3Lf6cdoabOGpqPQtSyMsh89m1MWQomn3RNkNj8RqweLohOwoV3mgLi44BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:18:25.424637Z"},"content_sha256":"1a161e084efa478f8f0068818368fc0ba275fa62c07b794b9776c930aef56296","schema_version":"1.0","event_id":"sha256:1a161e084efa478f8f0068818368fc0ba275fa62c07b794b9776c930aef56296"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2/bundle.json","state_url":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKS3E3SPHAQALIFRZ446IBJEE2/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-01T08:18:25Z","links":{"resolver":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2","bundle":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2/bundle.json","state":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKS3E3SPHAQALIFRZ446IBJEE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HKS3E3SPHAQALIFRZ446IBJEE2","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":"a87b01586564bfd501e795042f591e1735404f0870cfa1b2769236897a6fdd7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-16T20:38:20Z","title_canon_sha256":"e143c439cd6937e6df94e5d05fa9aefae3dc130912cb892fb3eb79148e47dd86"},"schema_version":"1.0","source":{"id":"1608.04769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04769","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04769v1","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04769","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"HKS3E3SPHAQA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HKS3E3SPHAQALIFR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HKS3E3SP","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:1a161e084efa478f8f0068818368fc0ba275fa62c07b794b9776c930aef56296","target":"graph","created_at":"2026-05-18T01:08:33Z","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 $s$ denote a distinguished source vertex of a non-negatively real weighted and undirected graph $G$ with $n$ vertices and $m$ edges. In this paper we present two efficient \\emph{single-source approximate-distance sensitivity oracles}, namely \\emph{compact} data structures which are able to \\emph{quickly} report an approximate (by a multiplicative stretch factor) distance from $s$ to any node of $G$ following the failure of any edge in $G$. More precisely, we first present a sensitivity oracle of size $O(n)$ which is able to report 2-approximate distances from the source in $O(1)$ time. The","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":"2016-08-16T20:38:20Z","title":"Compact and Fast Sensitivity Oracles for Single-Source Distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04769","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:525c0bbe45174f20d94db2867719cd86fa58d4c04b7f8730f24511609ed656db","target":"record","created_at":"2026-05-18T01:08:33Z","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":"a87b01586564bfd501e795042f591e1735404f0870cfa1b2769236897a6fdd7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-16T20:38:20Z","title_canon_sha256":"e143c439cd6937e6df94e5d05fa9aefae3dc130912cb892fb3eb79148e47dd86"},"schema_version":"1.0","source":{"id":"1608.04769","kind":"arxiv","version":1}},"canonical_sha256":"3aa5b26e4f382005a0b1cf39e4052426966fc58f3799ea0cc2c2aefe0eb5d3aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3aa5b26e4f382005a0b1cf39e4052426966fc58f3799ea0cc2c2aefe0eb5d3aa","first_computed_at":"2026-05-18T01:08:33.650633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:33.650633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LCVQn/XCeOYAGPgZMsXYxqAUmYC9m7ng9FJEsHNgMyK6wD3obU3N+Rh+I1eMxp03QUUHkjaqyJS0nBkL4rJGDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:33.651264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:525c0bbe45174f20d94db2867719cd86fa58d4c04b7f8730f24511609ed656db","sha256:1a161e084efa478f8f0068818368fc0ba275fa62c07b794b9776c930aef56296"],"state_sha256":"5beb01379ba4d94bb270ddf723ffa57ba2f914158f0df5f491930095c4655a3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6U2CdWWeniNA3B8qnIWK367Vmqu0KPVCTQBn+XZ3d45cxMfXEkr9dJq+bN6o/bQsKIES/72Qhueslv8Zk1bgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:18:25.426587Z","bundle_sha256":"4692baadfa9f20ebeaa1ed4fe7be2d215c2387c9ed6231a1ccbd69abb6073951"}}