{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3UTMTMJL26PEOOHJQDGACUL7W3","short_pith_number":"pith:3UTMTMJL","schema_version":"1.0","canonical_sha256":"dd26c9b12bd79e4738e980cc01517fb6eb4846cf375df2cdbd23fc9369675eae","source":{"kind":"arxiv","id":"1105.3770","version":1},"attestation_state":"computed","paper":{"title":"All-Pairs Shortest Paths in $O(n^2)$ time with high probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Dimitry Sotnikov, Uri Zwick, Yuval Peres","submitted_at":"2011-05-19T00:42:48Z","abstract_excerpt":"We present an all-pairs shortest path algorithm whose running time on a complete directed graph on $n$ vertices whose edge weights are chosen independently and uniformly at random from $[0,1]$ is $O(n^2)$, in expectation and with high probability. This resolves a long standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano. The analysis relies on a proof that the number of \\emph{locally shortest paths} in such randomly weighted graphs is $O(n^2)$, in expectation and with high probability. We also present a dynamic version o"},"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":"1105.3770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-19T00:42:48Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"46b3893bfc640f7d5a28a2dc822a434746f72ac024df10c180f118d162e4e587","abstract_canon_sha256":"2a5afb401be1c0fb819b7b6c6834c1db753668dd0d9edbab87959f52b3df448e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:51.354644Z","signature_b64":"P7hrmc+KzfHgU3cx4fmKlHH2D3hCLVXnVnk1mr+9s/+xFUqo9rflHhF2QCdrcI0GJzPXm5Taik7Qpj3BQ+6RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd26c9b12bd79e4738e980cc01517fb6eb4846cf375df2cdbd23fc9369675eae","last_reissued_at":"2026-05-18T04:21:51.354034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:51.354034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All-Pairs Shortest Paths in $O(n^2)$ time with high probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Dimitry Sotnikov, Uri Zwick, Yuval Peres","submitted_at":"2011-05-19T00:42:48Z","abstract_excerpt":"We present an all-pairs shortest path algorithm whose running time on a complete directed graph on $n$ vertices whose edge weights are chosen independently and uniformly at random from $[0,1]$ is $O(n^2)$, in expectation and with high probability. This resolves a long standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano. The analysis relies on a proof that the number of \\emph{locally shortest paths} in such randomly weighted graphs is $O(n^2)$, in expectation and with high probability. We also present a dynamic version o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3770","kind":"arxiv","version":1},"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":"1105.3770","created_at":"2026-05-18T04:21:51.354132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3770v1","created_at":"2026-05-18T04:21:51.354132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3770","created_at":"2026-05-18T04:21:51.354132+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UTMTMJL26PE","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UTMTMJL26PEOOHJ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UTMTMJL","created_at":"2026-05-18T12:26:20.644004+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/3UTMTMJL26PEOOHJQDGACUL7W3","json":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3.json","graph_json":"https://pith.science/api/pith-number/3UTMTMJL26PEOOHJQDGACUL7W3/graph.json","events_json":"https://pith.science/api/pith-number/3UTMTMJL26PEOOHJQDGACUL7W3/events.json","paper":"https://pith.science/paper/3UTMTMJL"},"agent_actions":{"view_html":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3","download_json":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3.json","view_paper":"https://pith.science/paper/3UTMTMJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3770&json=true","fetch_graph":"https://pith.science/api/pith-number/3UTMTMJL26PEOOHJQDGACUL7W3/graph.json","fetch_events":"https://pith.science/api/pith-number/3UTMTMJL26PEOOHJQDGACUL7W3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3/action/storage_attestation","attest_author":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3/action/author_attestation","sign_citation":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3/action/citation_signature","submit_replication":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3/action/replication_record"}},"created_at":"2026-05-18T04:21:51.354132+00:00","updated_at":"2026-05-18T04:21:51.354132+00:00"}