{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LPEZP5YM5D24ZZDUO4GZDWLKDO","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":"00a3fbea430ba31a5dac1c73f8752c6afb7964c6a38e3e55f9eb087b5927a22b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-13T13:27:47Z","title_canon_sha256":"655c045a866298a34a4d684a96fca83e61b4f6930cd7d054019eea6eda7d6cb3"},"schema_version":"1.0","source":{"id":"1708.03903","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03903","created_at":"2026-05-18T00:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03903v2","created_at":"2026-05-18T00:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03903","created_at":"2026-05-18T00:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"LPEZP5YM5D24","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LPEZP5YM5D24ZZDU","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LPEZP5YM","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:b8fd783e6002b2781f541931d8ea9397f1ef92a58ea1d2bfd06f1f7528fefe23","target":"graph","created_at":"2026-05-18T00:31:18Z","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 study computing {\\em all-pairs shortest paths} (APSP) on distributed networks (the CONGEST model). The goal is for every node in the (weighted) network to know the distance from every other node using communication. The problem admits $(1+o(1))$-approximation $\\tilde O(n)$-time algorithms ~\\cite{LenzenP-podc15,Nanongkai-STOC14}, which are matched with $\\tilde \\Omega(n)$-time lower bounds~\\cite{Nanongkai-STOC14,LenzenP_stoc13,FrischknechtHW12}\\footnote{$\\tilde \\Theta$, $\\tilde O$ and $\\tilde \\Omega$ hide polylogarithmic factors. Note that the lower bounds also hold even in the unweighted cas","authors_text":"Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-13T13:27:47Z","title":"Distributed Exact Weighted All-Pairs Shortest Paths in $\\tilde O(n^{5/4})$ Rounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03903","kind":"arxiv","version":2},"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:3d82a8bf82ce235e9ba8cad62fe3a145483d5954902900b320361354412f02bc","target":"record","created_at":"2026-05-18T00:31:18Z","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":"00a3fbea430ba31a5dac1c73f8752c6afb7964c6a38e3e55f9eb087b5927a22b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-13T13:27:47Z","title_canon_sha256":"655c045a866298a34a4d684a96fca83e61b4f6930cd7d054019eea6eda7d6cb3"},"schema_version":"1.0","source":{"id":"1708.03903","kind":"arxiv","version":2}},"canonical_sha256":"5bc997f70ce8f5cce474770d91d96a1b8b96e48a427444da12a626f268334380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bc997f70ce8f5cce474770d91d96a1b8b96e48a427444da12a626f268334380","first_computed_at":"2026-05-18T00:31:18.919416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:18.919416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VH39VmiUjfOJglXg9gqX69UbaRUp02x1qoxTUN79OIGUKrAldGvQzcJ7LSVV0Cyf4cWswb5zHNkWMKDykRsrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:18.920094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03903","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d82a8bf82ce235e9ba8cad62fe3a145483d5954902900b320361354412f02bc","sha256:b8fd783e6002b2781f541931d8ea9397f1ef92a58ea1d2bfd06f1f7528fefe23"],"state_sha256":"c5aa528692d7e907e1aaae67d538b8d9631d56851e7758afe69382314982d84b"}