{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LCTJB7NRHW7IVYQMAEOV35A6UR","short_pith_number":"pith:LCTJB7NR","schema_version":"1.0","canonical_sha256":"58a690fdb13dbe8ae20c011d5df41ea4764df61f1335120415f5090d12861f24","source":{"kind":"arxiv","id":"1308.0776","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","submitted_at":"2013-08-04T04:11:38Z","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"},"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":"1308.0776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-04T04:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"2b724abbe7ce6ab1d3a3be4b1a6969df889041a15e354a2879229f1c225ea32c","abstract_canon_sha256":"eb7afa1a96f45136216a0b0706eb8702f8567c1e97d179959ad61b019740321e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.668917Z","signature_b64":"cylEmzij9v2wKuLjbg6FUeCFT/v2/7ctYTVk9LKXGnEAymhu3+t2aI6jyHP6LcXD4PDbBPhEe7q6Qa4D9gtNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58a690fdb13dbe8ae20c011d5df41ea4764df61f1335120415f5090d12861f24","last_reissued_at":"2026-05-18T00:22:16.668261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.668261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","submitted_at":"2013-08-04T04:11:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0776","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":""},"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":"1308.0776","created_at":"2026-05-18T00:22:16.668366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0776v2","created_at":"2026-05-18T00:22:16.668366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0776","created_at":"2026-05-18T00:22:16.668366+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCTJB7NRHW7I","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCTJB7NRHW7IVYQM","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCTJB7NR","created_at":"2026-05-18T12:27:51.066281+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/LCTJB7NRHW7IVYQMAEOV35A6UR","json":"https://pith.science/pith/LCTJB7NRHW7IVYQMAEOV35A6UR.json","graph_json":"https://pith.science/api/pith-number/LCTJB7NRHW7IVYQMAEOV35A6UR/graph.json","events_json":"https://pith.science/api/pith-number/LCTJB7NRHW7IVYQMAEOV35A6UR/events.json","paper":"https://pith.science/paper/LCTJB7NR"},"agent_actions":{"view_html":"https://pith.science/pith/LCTJB7NRHW7IVYQMAEOV35A6UR","download_json":"https://pith.science/pith/LCTJB7NRHW7IVYQMAEOV35A6UR.json","view_paper":"https://pith.science/paper/LCTJB7NR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0776&json=true","fetch_graph":"https://pith.science/api/pith-number/LCTJB7NRHW7IVYQMAEOV35A6UR/graph.json","fetch_events":"https://pith.science/api/pith-number/LCTJB7NRHW7IVYQMAEOV35A6UR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCTJB7NRHW7IVYQMAEOV35A6UR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCTJB7NRHW7IVYQMAEOV35A6UR/action/storage_attestation","attest_author":"https://pith.science/pith/LCTJB7NRHW7IVYQMAEOV35A6UR/action/author_attestation","sign_citation":"https://pith.science/pith/LCTJB7NRHW7IVYQMAEOV35A6UR/action/citation_signature","submit_replication":"https://pith.science/pith/LCTJB7NRHW7IVYQMAEOV35A6UR/action/replication_record"}},"created_at":"2026-05-18T00:22:16.668366+00:00","updated_at":"2026-05-18T00:22:16.668366+00:00"}