{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3UTMTMJL26PEOOHJQDGACUL7W3","short_pith_number":"pith:3UTMTMJL","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"},"canonical_sha256":"dd26c9b12bd79e4738e980cc01517fb6eb4846cf375df2cdbd23fc9369675eae","source":{"kind":"arxiv","id":"1105.3770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3770","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3770v1","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3770","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"3UTMTMJL26PE","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3UTMTMJL26PEOOHJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3UTMTMJL","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3UTMTMJL26PEOOHJQDGACUL7W3","target":"record","payload":{"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"},"canonical_sha256":"dd26c9b12bd79e4738e980cc01517fb6eb4846cf375df2cdbd23fc9369675eae","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"},"source_kind":"arxiv","source_id":"1105.3770","source_version":1,"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-05-18T04:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYrPISBTN80FzeBwq3wsE9XtMczF8Xr2rjW1x4l6RFMpbru6AQP+mzu5UN6lwdhwouy49df5q8DeV04EjsDVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:59:45.746044Z"},"content_sha256":"b2260c04007136ff39873300736fb6a7e9b91dd966989b234148f402e53fc461","schema_version":"1.0","event_id":"sha256:b2260c04007136ff39873300736fb6a7e9b91dd966989b234148f402e53fc461"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3UTMTMJL26PEOOHJQDGACUL7W3","target":"graph","payload":{"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"},"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-05-18T04:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJwXWDQqwJCPnBQ+25B5hUqiOumbouWsDraM02Ch5N4LSkQoKivHlHCKI7thh4U3j5ZEEta+ygc/tvKDJq7lAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:59:45.746460Z"},"content_sha256":"7488d0df08358a7c802ca55f735fdc3fca2e5399d8ffba770c8e63d9d09ca8f3","schema_version":"1.0","event_id":"sha256:7488d0df08358a7c802ca55f735fdc3fca2e5399d8ffba770c8e63d9d09ca8f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3/bundle.json","state_url":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UTMTMJL26PEOOHJQDGACUL7W3/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-05-30T10:59:45Z","links":{"resolver":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3","bundle":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3/bundle.json","state":"https://pith.science/pith/3UTMTMJL26PEOOHJQDGACUL7W3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UTMTMJL26PEOOHJQDGACUL7W3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3UTMTMJL26PEOOHJQDGACUL7W3","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":"2a5afb401be1c0fb819b7b6c6834c1db753668dd0d9edbab87959f52b3df448e","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-19T00:42:48Z","title_canon_sha256":"46b3893bfc640f7d5a28a2dc822a434746f72ac024df10c180f118d162e4e587"},"schema_version":"1.0","source":{"id":"1105.3770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3770","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3770v1","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3770","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"3UTMTMJL26PE","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3UTMTMJL26PEOOHJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3UTMTMJL","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:7488d0df08358a7c802ca55f735fdc3fca2e5399d8ffba770c8e63d9d09ca8f3","target":"graph","created_at":"2026-05-18T04:21:51Z","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 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","authors_text":"Benny Sudakov, Dimitry Sotnikov, Uri Zwick, Yuval Peres","cross_cats":["cs.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-19T00:42:48Z","title":"All-Pairs Shortest Paths in $O(n^2)$ time with high probability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3770","kind":"arxiv","version":1},"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:b2260c04007136ff39873300736fb6a7e9b91dd966989b234148f402e53fc461","target":"record","created_at":"2026-05-18T04:21:51Z","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":"2a5afb401be1c0fb819b7b6c6834c1db753668dd0d9edbab87959f52b3df448e","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-19T00:42:48Z","title_canon_sha256":"46b3893bfc640f7d5a28a2dc822a434746f72ac024df10c180f118d162e4e587"},"schema_version":"1.0","source":{"id":"1105.3770","kind":"arxiv","version":1}},"canonical_sha256":"dd26c9b12bd79e4738e980cc01517fb6eb4846cf375df2cdbd23fc9369675eae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd26c9b12bd79e4738e980cc01517fb6eb4846cf375df2cdbd23fc9369675eae","first_computed_at":"2026-05-18T04:21:51.354034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:51.354034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P7hrmc+KzfHgU3cx4fmKlHH2D3hCLVXnVnk1mr+9s/+xFUqo9rflHhF2QCdrcI0GJzPXm5Taik7Qpj3BQ+6RDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:51.354644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.3770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2260c04007136ff39873300736fb6a7e9b91dd966989b234148f402e53fc461","sha256:7488d0df08358a7c802ca55f735fdc3fca2e5399d8ffba770c8e63d9d09ca8f3"],"state_sha256":"a594494dcb620d5d0bad69dd44c4717bbeb28699907fea3d83f0d9d06b5f5697"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5kVzdqOPHJ4oOJEK06Zyx98L+8YcBZX1BZod98mt0TiSgzQUVh8VNVjXtgPBSE5fjKn7CIWR7ODTYS807DfLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:59:45.748615Z","bundle_sha256":"33dd07826765a83a0a8cc954c9a19e06fc3e23b74765f8412e251fa53f011c52"}}