{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:CWBXHGSLRH3TMUPH2T4V46FMC3","short_pith_number":"pith:CWBXHGSL","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"},"canonical_sha256":"1583739a4b89f73651e7d4f95e78ac16cb94701bad5a7162a099faa5a6e67797","source":{"kind":"arxiv","id":"2001.10801","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.10801","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"2001.10801v2","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10801","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"CWBXHGSLRH3T","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"pith_short_16","alias_value":"CWBXHGSLRH3TMUPH","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"pith_short_8","alias_value":"CWBXHGSL","created_at":"2026-07-05T00:42:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:CWBXHGSLRH3TMUPH2T4V46FMC3","target":"record","payload":{"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"},"canonical_sha256":"1583739a4b89f73651e7d4f95e78ac16cb94701bad5a7162a099faa5a6e67797","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"},"source_kind":"arxiv","source_id":"2001.10801","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-07-05T00:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6648U5pH+BRsjX6NzcigXkWQvgeTvjQ4XTuw6nGCIk3JxHYIT63WSoG4jXKCLWpgr7udQHT6vhhA+iy1MsCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T07:09:27.751932Z"},"content_sha256":"82d46cf62de9724db1c04ce5094bcda594ca97c438f96ae73e843ee4e7c1bc4e","schema_version":"1.0","event_id":"sha256:82d46cf62de9724db1c04ce5094bcda594ca97c438f96ae73e843ee4e7c1bc4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:CWBXHGSLRH3TMUPH2T4V46FMC3","target":"graph","payload":{"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"},"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-07-05T00:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsJWQusysrz4/fCn4T9PSsX8mDeFeblcgCebhgYAbVFFRRjGrvfHzfz04V/i+20pOuqJmxxaN2JYddk3ALOIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T07:09:27.752298Z"},"content_sha256":"9c3e2495a2e2c041e772c6807c15bff338d74e9db9d41b01a8194209b6790ace","schema_version":"1.0","event_id":"sha256:9c3e2495a2e2c041e772c6807c15bff338d74e9db9d41b01a8194209b6790ace"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/bundle.json","state_url":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/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-07-16T07:09:27Z","links":{"resolver":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3","bundle":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/bundle.json","state":"https://pith.science/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:CWBXHGSLRH3TMUPH2T4V46FMC3","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":"63b5e6d495b396202f94af883db7866a46e2724d4170af56b8a74c4e49893532","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T13:16:15Z","title_canon_sha256":"10ca57d3e93d93008454db7e429313c8d94233e9a840a984cd2260a372cd7807"},"schema_version":"1.0","source":{"id":"2001.10801","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.10801","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"2001.10801v2","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10801","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"CWBXHGSLRH3T","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"pith_short_16","alias_value":"CWBXHGSLRH3TMUPH","created_at":"2026-07-05T00:42:22Z"},{"alias_kind":"pith_short_8","alias_value":"CWBXHGSL","created_at":"2026-07-05T00:42:22Z"}],"graph_snapshots":[{"event_id":"sha256:9c3e2495a2e2c041e772c6807c15bff338d74e9db9d41b01a8194209b6790ace","target":"graph","created_at":"2026-07-05T00:42:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.10801/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christian Wulff-Nilsen, Maximilian Probst Gutenberg","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T13:16:15Z","title":"Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10801","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:82d46cf62de9724db1c04ce5094bcda594ca97c438f96ae73e843ee4e7c1bc4e","target":"record","created_at":"2026-07-05T00:42:22Z","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":"63b5e6d495b396202f94af883db7866a46e2724d4170af56b8a74c4e49893532","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T13:16:15Z","title_canon_sha256":"10ca57d3e93d93008454db7e429313c8d94233e9a840a984cd2260a372cd7807"},"schema_version":"1.0","source":{"id":"2001.10801","kind":"arxiv","version":2}},"canonical_sha256":"1583739a4b89f73651e7d4f95e78ac16cb94701bad5a7162a099faa5a6e67797","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1583739a4b89f73651e7d4f95e78ac16cb94701bad5a7162a099faa5a6e67797","first_computed_at":"2026-07-05T00:42:22.886203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:42:22.886203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"km94N/j4Ia25XVnJnUUx1QxdiJ63iPTiXm5kBYsFlIENflEGePoInWMYBy4Y22Tgqw3nqg2iwxTGyyrnjTomBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:42:22.886650Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.10801","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82d46cf62de9724db1c04ce5094bcda594ca97c438f96ae73e843ee4e7c1bc4e","sha256:9c3e2495a2e2c041e772c6807c15bff338d74e9db9d41b01a8194209b6790ace"],"state_sha256":"ae988c8a11c0997b2fcf8a87658680ffacda47118cbb9cb0bfb7c76990927e31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0qznfLN9Va1R9LGpzc6zfxooDDO8uo5xvhTEj+ufckpXIkXuy2Og3fSbdKIHF2aCrwzI4d9autxVBTrAx3pBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T07:09:27.754538Z","bundle_sha256":"c3504c7e156122d3c1c7a8b81a95afd2ba532f0f87514221db8ed212386d5c0b"}}