{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CWBXHGSLRH3TMUPH2T4V46FMC3","short_pith_number":"pith:CWBXHGSL","schema_version":"1.0","canonical_sha256":"1583739a4b89f73651e7d4f95e78ac16cb94701bad5a7162a099faa5a6e67797","source":{"kind":"arxiv","id":"2001.10801","version":2},"attestation_state":"computed","paper":{"title":"Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, Maximilian Probst Gutenberg","submitted_at":"2020-01-29T13:16:15Z","abstract_excerpt":"Given a directed weighted graph $G=(V,E)$ undergoing vertex insertions \\emph{and} deletions, the All-Pairs Shortest Paths (APSP) problem asks to maintain a data structure that processes updates efficiently and returns after each update the distance matrix to the current version of $G$. In two breakthrough results, Italiano and Demetrescu [STOC '03] presented an algorithm that requires $\\tilde{O}(n^2)$ \\emph{amortized} update time, and Thorup showed in [STOC '05] that \\emph{worst-case} update time $\\tilde{O}(n^{2+3/4})$ can be achieved. In this article, we make substantial progress on the probl"},"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":"2001.10801","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T13:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"10ca57d3e93d93008454db7e429313c8d94233e9a840a984cd2260a372cd7807","abstract_canon_sha256":"63b5e6d495b396202f94af883db7866a46e2724d4170af56b8a74c4e49893532"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:42:22.886650Z","signature_b64":"km94N/j4Ia25XVnJnUUx1QxdiJ63iPTiXm5kBYsFlIENflEGePoInWMYBy4Y22Tgqw3nqg2iwxTGyyrnjTomBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1583739a4b89f73651e7d4f95e78ac16cb94701bad5a7162a099faa5a6e67797","last_reissued_at":"2026-07-05T00:42:22.886203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:42:22.886203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, Maximilian Probst Gutenberg","submitted_at":"2020-01-29T13:16:15Z","abstract_excerpt":"Given a directed weighted graph $G=(V,E)$ undergoing vertex insertions \\emph{and} deletions, the All-Pairs Shortest Paths (APSP) problem asks to maintain a data structure that processes updates efficiently and returns after each update the distance matrix to the current version of $G$. In two breakthrough results, Italiano and Demetrescu [STOC '03] presented an algorithm that requires $\\tilde{O}(n^2)$ \\emph{amortized} update time, and Thorup showed in [STOC '05] that \\emph{worst-case} update time $\\tilde{O}(n^{2+3/4})$ can be achieved. In this article, we make substantial progress on the probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10801","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/2001.10801/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":"2001.10801","created_at":"2026-07-05T00:42:22.886259+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.10801v2","created_at":"2026-07-05T00:42:22.886259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10801","created_at":"2026-07-05T00:42:22.886259+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWBXHGSLRH3T","created_at":"2026-07-05T00:42:22.886259+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWBXHGSLRH3TMUPH","created_at":"2026-07-05T00:42:22.886259+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWBXHGSL","created_at":"2026-07-05T00:42:22.886259+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/CWBXHGSLRH3TMUPH2T4V46FMC3","json":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3.json","graph_json":"https://pith.science/api/pith-number/CWBXHGSLRH3TMUPH2T4V46FMC3/graph.json","events_json":"https://pith.science/api/pith-number/CWBXHGSLRH3TMUPH2T4V46FMC3/events.json","paper":"https://pith.science/paper/CWBXHGSL"},"agent_actions":{"view_html":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3","download_json":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3.json","view_paper":"https://pith.science/paper/CWBXHGSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.10801&json=true","fetch_graph":"https://pith.science/api/pith-number/CWBXHGSLRH3TMUPH2T4V46FMC3/graph.json","fetch_events":"https://pith.science/api/pith-number/CWBXHGSLRH3TMUPH2T4V46FMC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/action/storage_attestation","attest_author":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/action/author_attestation","sign_citation":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/action/citation_signature","submit_replication":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/action/replication_record"}},"created_at":"2026-07-05T00:42:22.886259+00:00","updated_at":"2026-07-05T00:42:22.886259+00:00"}