{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LPEZP5YM5D24ZZDUO4GZDWLKDO","short_pith_number":"pith:LPEZP5YM","schema_version":"1.0","canonical_sha256":"5bc997f70ce8f5cce474770d91d96a1b8b96e48a427444da12a626f268334380","source":{"kind":"arxiv","id":"1708.03903","version":2},"attestation_state":"computed","paper":{"title":"Distributed Exact Weighted All-Pairs Shortest Paths in $\\tilde O(n^{5/4})$ Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak","submitted_at":"2017-08-13T13:27:47Z","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"},"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":"1708.03903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-13T13:27:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"655c045a866298a34a4d684a96fca83e61b4f6930cd7d054019eea6eda7d6cb3","abstract_canon_sha256":"00a3fbea430ba31a5dac1c73f8752c6afb7964c6a38e3e55f9eb087b5927a22b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:18.920094Z","signature_b64":"VH39VmiUjfOJglXg9gqX69UbaRUp02x1qoxTUN79OIGUKrAldGvQzcJ7LSVV0Cyf4cWswb5zHNkWMKDykRsrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bc997f70ce8f5cce474770d91d96a1b8b96e48a427444da12a626f268334380","last_reissued_at":"2026-05-18T00:31:18.919416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:18.919416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Exact Weighted All-Pairs Shortest Paths in $\\tilde O(n^{5/4})$ Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak","submitted_at":"2017-08-13T13:27:47Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03903","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":"1708.03903","created_at":"2026-05-18T00:31:18.919525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03903v2","created_at":"2026-05-18T00:31:18.919525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03903","created_at":"2026-05-18T00:31:18.919525+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPEZP5YM5D24","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPEZP5YM5D24ZZDU","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPEZP5YM","created_at":"2026-05-18T12:31:28.150371+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/LPEZP5YM5D24ZZDUO4GZDWLKDO","json":"https://pith.science/pith/LPEZP5YM5D24ZZDUO4GZDWLKDO.json","graph_json":"https://pith.science/api/pith-number/LPEZP5YM5D24ZZDUO4GZDWLKDO/graph.json","events_json":"https://pith.science/api/pith-number/LPEZP5YM5D24ZZDUO4GZDWLKDO/events.json","paper":"https://pith.science/paper/LPEZP5YM"},"agent_actions":{"view_html":"https://pith.science/pith/LPEZP5YM5D24ZZDUO4GZDWLKDO","download_json":"https://pith.science/pith/LPEZP5YM5D24ZZDUO4GZDWLKDO.json","view_paper":"https://pith.science/paper/LPEZP5YM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03903&json=true","fetch_graph":"https://pith.science/api/pith-number/LPEZP5YM5D24ZZDUO4GZDWLKDO/graph.json","fetch_events":"https://pith.science/api/pith-number/LPEZP5YM5D24ZZDUO4GZDWLKDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPEZP5YM5D24ZZDUO4GZDWLKDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPEZP5YM5D24ZZDUO4GZDWLKDO/action/storage_attestation","attest_author":"https://pith.science/pith/LPEZP5YM5D24ZZDUO4GZDWLKDO/action/author_attestation","sign_citation":"https://pith.science/pith/LPEZP5YM5D24ZZDUO4GZDWLKDO/action/citation_signature","submit_replication":"https://pith.science/pith/LPEZP5YM5D24ZZDUO4GZDWLKDO/action/replication_record"}},"created_at":"2026-05-18T00:31:18.919525+00:00","updated_at":"2026-05-18T00:31:18.919525+00:00"}