{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HKS3E3SPHAQALIFRZ446IBJEE2","short_pith_number":"pith:HKS3E3SP","schema_version":"1.0","canonical_sha256":"3aa5b26e4f382005a0b1cf39e4052426966fc58f3799ea0cc2c2aefe0eb5d3aa","source":{"kind":"arxiv","id":"1608.04769","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.04769","created_at":"2026-05-18T01:08:33.650729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04769v1","created_at":"2026-05-18T01:08:33.650729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04769","created_at":"2026-05-18T01:08:33.650729+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKS3E3SPHAQA","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKS3E3SPHAQALIFR","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKS3E3SP","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2","json":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2.json","graph_json":"https://pith.science/api/pith-number/HKS3E3SPHAQALIFRZ446IBJEE2/graph.json","events_json":"https://pith.science/api/pith-number/HKS3E3SPHAQALIFRZ446IBJEE2/events.json","paper":"https://pith.science/paper/HKS3E3SP"},"agent_actions":{"view_html":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2","download_json":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2.json","view_paper":"https://pith.science/paper/HKS3E3SP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04769&json=true","fetch_graph":"https://pith.science/api/pith-number/HKS3E3SPHAQALIFRZ446IBJEE2/graph.json","fetch_events":"https://pith.science/api/pith-number/HKS3E3SPHAQALIFRZ446IBJEE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2/action/storage_attestation","attest_author":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2/action/author_attestation","sign_citation":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2/action/citation_signature","submit_replication":"https://pith.science/pith/HKS3E3SPHAQALIFRZ446IBJEE2/action/replication_record"}},"created_at":"2026-05-18T01:08:33.650729+00:00","updated_at":"2026-05-18T01:08:33.650729+00:00"}