{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NEXRHCOTQFREGYF2H5MI7IEY3C","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":"9a392bacee8bd71b5f8aa35b7ae29b4cb2c5222ea3803034cfa95d2f89c00fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-29T03:34:38Z","title_canon_sha256":"13cab8ad2b850d273f2e73884e6fdfb367f0fb920bb4d9103fd7005613e00df2"},"schema_version":"1.0","source":{"id":"1603.08627","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08627","created_at":"2026-05-18T01:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08627v1","created_at":"2026-05-18T01:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08627","created_at":"2026-05-18T01:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"NEXRHCOTQFRE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEXRHCOTQFREGYF2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEXRHCOT","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:3ddb1045d6097e1c0e64c3684760c8169fd2b33a592b0c217e3195032aef46e7","target":"graph","created_at":"2026-05-18T01:18:05Z","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":"The Shoshan-Zwick algorithm solves the all pairs shortest paths problem in undirected graphs with integer edge costs in the range $\\{1, 2, \\dots, M\\}$. It runs in $\\tilde{O}(M\\cdot n^{\\omega})$ time, where $n$ is the number of vertices, $M$ is the largest integer edge cost, and $\\omega < 2.3727$ is the exponent of matrix multiplication. It is the fastest known algorithm for this problem. This paper points out the erroneous behavior of the Shoshan-Zwick algorithm and revises the algorithm to resolve the issues that cause this behavior. Moreover, it discusses implementation aspects of the Shosha","authors_text":"K. Subramani, Matthew Williamson, Pavlos Eirinakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-29T03:34:38Z","title":"On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08627","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:e2b7083a2bd74e18a126345af13b89fe16811bf8a198ab61d7a546a0d9511008","target":"record","created_at":"2026-05-18T01:18:05Z","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":"9a392bacee8bd71b5f8aa35b7ae29b4cb2c5222ea3803034cfa95d2f89c00fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-29T03:34:38Z","title_canon_sha256":"13cab8ad2b850d273f2e73884e6fdfb367f0fb920bb4d9103fd7005613e00df2"},"schema_version":"1.0","source":{"id":"1603.08627","kind":"arxiv","version":1}},"canonical_sha256":"692f1389d381624360ba3f588fa098d8a06617ba40e258ec7b72af209e599d03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"692f1389d381624360ba3f588fa098d8a06617ba40e258ec7b72af209e599d03","first_computed_at":"2026-05-18T01:18:05.815911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:05.815911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ORdsgCN21SYDpkrXGtDBfGcFSl6ozwXcf6o8pGX2LZKcNl5rmSKM32QC09eiXIF8mEyH0B1VEmv4iQ2bHQLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:05.816609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08627","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2b7083a2bd74e18a126345af13b89fe16811bf8a198ab61d7a546a0d9511008","sha256:3ddb1045d6097e1c0e64c3684760c8169fd2b33a592b0c217e3195032aef46e7"],"state_sha256":"46bde7ee9856d75a8beaf95e628d98cf478a6a2d847eb4517499b841bbf2ded1"}