{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LFMLSWA6MVDBYO3NTQWL4GFQSR","short_pith_number":"pith:LFMLSWA6","schema_version":"1.0","canonical_sha256":"5958b9581e65461c3b6d9c2cbe18b09466568e22d53312012cc686b0173345b1","source":{"kind":"arxiv","id":"1607.05132","version":2},"attestation_state":"computed","paper":{"title":"Fully dynamic all-pairs shortest paths with worst-case update-time revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ittai Abraham, Sebastian Krinninger, Shiri Chechik","submitted_at":"2016-07-18T15:35:39Z","abstract_excerpt":"We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges. We give worst-case guarantees on the time needed to process a single update (in contrast to related results, the update time is not amortized over a sequence of updates).\n  Our main result is a simple randomized algorithm that for any parameter $c>1$ has a worst-case update time of $O(cn^{2+2/3} \\log^{4/3}{n})$ and answers distance queries correctly with probability $1-1/n^c$, agains"},"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":"1607.05132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-18T15:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"66ac3327b79b72fe994d8e0f29bc6b63fb83179dcf176d65357ac3992faa9abd","abstract_canon_sha256":"d532df4ee11cb2444e111e199c6062e75da2860c8e103ec4c598dc556b8c4c19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.434505Z","signature_b64":"7Fjctqat2oi++R5k9tTS+KBkZpsSJnmAsLSSjA5onD2X9rlRyl4lacVqmdQaF8wv/N4X7dri8cpSkcyymGtRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5958b9581e65461c3b6d9c2cbe18b09466568e22d53312012cc686b0173345b1","last_reissued_at":"2026-05-18T00:22:16.433825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.433825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully dynamic all-pairs shortest paths with worst-case update-time revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ittai Abraham, Sebastian Krinninger, Shiri Chechik","submitted_at":"2016-07-18T15:35:39Z","abstract_excerpt":"We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges. We give worst-case guarantees on the time needed to process a single update (in contrast to related results, the update time is not amortized over a sequence of updates).\n  Our main result is a simple randomized algorithm that for any parameter $c>1$ has a worst-case update time of $O(cn^{2+2/3} \\log^{4/3}{n})$ and answers distance queries correctly with probability $1-1/n^c$, agains"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05132","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":"1607.05132","created_at":"2026-05-18T00:22:16.433940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05132v2","created_at":"2026-05-18T00:22:16.433940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05132","created_at":"2026-05-18T00:22:16.433940+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFMLSWA6MVDB","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFMLSWA6MVDBYO3N","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFMLSWA6","created_at":"2026-05-18T12:30:29.479603+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/LFMLSWA6MVDBYO3NTQWL4GFQSR","json":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR.json","graph_json":"https://pith.science/api/pith-number/LFMLSWA6MVDBYO3NTQWL4GFQSR/graph.json","events_json":"https://pith.science/api/pith-number/LFMLSWA6MVDBYO3NTQWL4GFQSR/events.json","paper":"https://pith.science/paper/LFMLSWA6"},"agent_actions":{"view_html":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR","download_json":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR.json","view_paper":"https://pith.science/paper/LFMLSWA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05132&json=true","fetch_graph":"https://pith.science/api/pith-number/LFMLSWA6MVDBYO3NTQWL4GFQSR/graph.json","fetch_events":"https://pith.science/api/pith-number/LFMLSWA6MVDBYO3NTQWL4GFQSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/action/storage_attestation","attest_author":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/action/author_attestation","sign_citation":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/action/citation_signature","submit_replication":"https://pith.science/pith/LFMLSWA6MVDBYO3NTQWL4GFQSR/action/replication_record"}},"created_at":"2026-05-18T00:22:16.433940+00:00","updated_at":"2026-05-18T00:22:16.433940+00:00"}