{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GSGDSIFAR2YUTYRYFFFGLNHZBK","short_pith_number":"pith:GSGDSIFA","schema_version":"1.0","canonical_sha256":"348c3920a08eb149e238294a65b4f90a90cdd851893a0f04db6a7af911e2eeff","source":{"kind":"arxiv","id":"2102.08569","version":2},"attestation_state":"computed","paper":{"title":"Constructing a Distance Sensitivity Oracle in $O(n^{2.5794}M)$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hanlin Ren, Yong Gu","submitted_at":"2021-02-17T04:28:04Z","abstract_excerpt":"We continue the study of distance sensitivity oracles (DSOs). Given a directed graph $G$ with $n$ vertices and edge weights in $\\{1, 2, \\dots, M\\}$, we want to build a data structure such that given any source vertex $u$, any target vertex $v$, and any failure $f$ (which is either a vertex or an edge), it outputs the length of the shortest path from $u$ to $v$ not going through $f$. Our main result is a DSO with preprocessing time $O(n^{2.5794}M)$ and constant query time. Previously, the best preprocessing time of DSOs for directed graphs is $O(n^{2.7233}M)$, and even in the easier case of und"},"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":"2102.08569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-02-17T04:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"a7aeed3da15044979b1878ca4d99844f69ac62e28440ce5f2875af0cccc26d80","abstract_canon_sha256":"5d1ff6c23b0ad50a4374af1481e34cc73cbb9d195e3b25b730f630777e2a83eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:46.067745Z","signature_b64":"M94YVZsR1bau++V6Ma0nXXRjBl0a04nwr0Se85ohJd7HmNJjJN6LnwFZJQDLsQtP8EO3mGRGFdKPuCdnKPi5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"348c3920a08eb149e238294a65b4f90a90cdd851893a0f04db6a7af911e2eeff","last_reissued_at":"2026-07-05T03:02:46.067295Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:46.067295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing a Distance Sensitivity Oracle in $O(n^{2.5794}M)$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hanlin Ren, Yong Gu","submitted_at":"2021-02-17T04:28:04Z","abstract_excerpt":"We continue the study of distance sensitivity oracles (DSOs). Given a directed graph $G$ with $n$ vertices and edge weights in $\\{1, 2, \\dots, M\\}$, we want to build a data structure such that given any source vertex $u$, any target vertex $v$, and any failure $f$ (which is either a vertex or an edge), it outputs the length of the shortest path from $u$ to $v$ not going through $f$. Our main result is a DSO with preprocessing time $O(n^{2.5794}M)$ and constant query time. Previously, the best preprocessing time of DSOs for directed graphs is $O(n^{2.7233}M)$, and even in the easier case of und"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.08569","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.08569/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.08569","created_at":"2026-07-05T03:02:46.067368+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.08569v2","created_at":"2026-07-05T03:02:46.067368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.08569","created_at":"2026-07-05T03:02:46.067368+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSGDSIFAR2YU","created_at":"2026-07-05T03:02:46.067368+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSGDSIFAR2YUTYRY","created_at":"2026-07-05T03:02:46.067368+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSGDSIFA","created_at":"2026-07-05T03:02:46.067368+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/GSGDSIFAR2YUTYRYFFFGLNHZBK","json":"https://pith.science/pith/GSGDSIFAR2YUTYRYFFFGLNHZBK.json","graph_json":"https://pith.science/api/pith-number/GSGDSIFAR2YUTYRYFFFGLNHZBK/graph.json","events_json":"https://pith.science/api/pith-number/GSGDSIFAR2YUTYRYFFFGLNHZBK/events.json","paper":"https://pith.science/paper/GSGDSIFA"},"agent_actions":{"view_html":"https://pith.science/pith/GSGDSIFAR2YUTYRYFFFGLNHZBK","download_json":"https://pith.science/pith/GSGDSIFAR2YUTYRYFFFGLNHZBK.json","view_paper":"https://pith.science/paper/GSGDSIFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.08569&json=true","fetch_graph":"https://pith.science/api/pith-number/GSGDSIFAR2YUTYRYFFFGLNHZBK/graph.json","fetch_events":"https://pith.science/api/pith-number/GSGDSIFAR2YUTYRYFFFGLNHZBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSGDSIFAR2YUTYRYFFFGLNHZBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSGDSIFAR2YUTYRYFFFGLNHZBK/action/storage_attestation","attest_author":"https://pith.science/pith/GSGDSIFAR2YUTYRYFFFGLNHZBK/action/author_attestation","sign_citation":"https://pith.science/pith/GSGDSIFAR2YUTYRYFFFGLNHZBK/action/citation_signature","submit_replication":"https://pith.science/pith/GSGDSIFAR2YUTYRYFFFGLNHZBK/action/replication_record"}},"created_at":"2026-07-05T03:02:46.067368+00:00","updated_at":"2026-07-05T03:02:46.067368+00:00"}