{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LCTJB7NRHW7IVYQMAEOV35A6UR","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":"eb7afa1a96f45136216a0b0706eb8702f8567c1e97d179959ad61b019740321e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-04T04:11:38Z","title_canon_sha256":"2b724abbe7ce6ab1d3a3be4b1a6969df889041a15e354a2879229f1c225ea32c"},"schema_version":"1.0","source":{"id":"1308.0776","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0776","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0776v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0776","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"LCTJB7NRHW7I","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LCTJB7NRHW7IVYQM","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LCTJB7NR","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:f3d28b01cacc8486f925604873db008d1e42fec3efac81322af620d11f378208","target":"graph","created_at":"2026-05-18T00:22:16Z","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":"We study dynamic $(1+\\epsilon)$-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected $n$-node $m$-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of $\\tilde O(mn/\\epsilon)$ and constant query time by Roditty and Zwick [FOCS 2004]. The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach [JACM 1981]; it has a total update time of $O(mn^2)$ and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of $\\tild","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-04T04:11:38Z","title":"Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0776","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:5ba4ce1cd4b45db49171f905d6fcef28a0a5c6a3c46db9c0e3ebb84e5da3ccbc","target":"record","created_at":"2026-05-18T00:22:16Z","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":"eb7afa1a96f45136216a0b0706eb8702f8567c1e97d179959ad61b019740321e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-04T04:11:38Z","title_canon_sha256":"2b724abbe7ce6ab1d3a3be4b1a6969df889041a15e354a2879229f1c225ea32c"},"schema_version":"1.0","source":{"id":"1308.0776","kind":"arxiv","version":2}},"canonical_sha256":"58a690fdb13dbe8ae20c011d5df41ea4764df61f1335120415f5090d12861f24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58a690fdb13dbe8ae20c011d5df41ea4764df61f1335120415f5090d12861f24","first_computed_at":"2026-05-18T00:22:16.668261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.668261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cylEmzij9v2wKuLjbg6FUeCFT/v2/7ctYTVk9LKXGnEAymhu3+t2aI6jyHP6LcXD4PDbBPhEe7q6Qa4D9gtNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.668917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0776","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ba4ce1cd4b45db49171f905d6fcef28a0a5c6a3c46db9c0e3ebb84e5da3ccbc","sha256:f3d28b01cacc8486f925604873db008d1e42fec3efac81322af620d11f378208"],"state_sha256":"e873042e4ad1548790a25bbedc5d04197f63ebbd156b9aa7ab948c27442a72f4"}