{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FP2N77UBWQFPJXTQDSQUZPSHC5","short_pith_number":"pith:FP2N77UB","schema_version":"1.0","canonical_sha256":"2bf4dffe81b40af4de701ca14cbe471750f1462ea65d3d398f67870bf7f0a331","source":{"kind":"arxiv","id":"1804.05441","version":1},"attestation_state":"computed","paper":{"title":"A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\\tilde{O}(n^{3/2})$ Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Udit Agarwal, Valerie King, Vijaya Ramachandran","submitted_at":"2018-04-15T22:17:54Z","abstract_excerpt":"We present a deterministic distributed algorithm to compute all-pairs shortest paths(APSP) in an edge-weighted directed or undirected graph. Our algorithm runs in $\\tilde{O}(n^{3/2})$ rounds in the Congest model, where $n$ is the number of nodes in the graph. This is the first $o(n^2)$ rounds deterministic distributed algorithm for the weighted APSP problem. Our algorithm is fairly simple and incorporates a deterministic distributed algorithm we develop for computing a `blocker set' \\cite{King99}, which has been used earlier in sequential dynamic computation of APSP."},"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":"1804.05441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-15T22:17:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"21361d71bf5cbfcc116f4aff6ab6f67bfc8058fa1a8e12fd725d9d5a3bf06a20","abstract_canon_sha256":"ea11f1074db374f5675adce67bdc9764a0861810433e7954f42b6835cdff125f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:28.124933Z","signature_b64":"KwxK3ERDkbCkt1tVa4cZ4A1JCfOc6btFoRIdGMGIOFE4Ws7uLRT+CE8NgehPH8y2ibe9QKAHN/49XEn5+1puCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bf4dffe81b40af4de701ca14cbe471750f1462ea65d3d398f67870bf7f0a331","last_reissued_at":"2026-05-18T00:18:28.124549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:28.124549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\\tilde{O}(n^{3/2})$ Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Udit Agarwal, Valerie King, Vijaya Ramachandran","submitted_at":"2018-04-15T22:17:54Z","abstract_excerpt":"We present a deterministic distributed algorithm to compute all-pairs shortest paths(APSP) in an edge-weighted directed or undirected graph. Our algorithm runs in $\\tilde{O}(n^{3/2})$ rounds in the Congest model, where $n$ is the number of nodes in the graph. This is the first $o(n^2)$ rounds deterministic distributed algorithm for the weighted APSP problem. Our algorithm is fairly simple and incorporates a deterministic distributed algorithm we develop for computing a `blocker set' \\cite{King99}, which has been used earlier in sequential dynamic computation of APSP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05441","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":"1804.05441","created_at":"2026-05-18T00:18:28.124600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05441v1","created_at":"2026-05-18T00:18:28.124600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05441","created_at":"2026-05-18T00:18:28.124600+00:00"},{"alias_kind":"pith_short_12","alias_value":"FP2N77UBWQFP","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FP2N77UBWQFPJXTQ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FP2N77UB","created_at":"2026-05-18T12:32:25.280505+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/FP2N77UBWQFPJXTQDSQUZPSHC5","json":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5.json","graph_json":"https://pith.science/api/pith-number/FP2N77UBWQFPJXTQDSQUZPSHC5/graph.json","events_json":"https://pith.science/api/pith-number/FP2N77UBWQFPJXTQDSQUZPSHC5/events.json","paper":"https://pith.science/paper/FP2N77UB"},"agent_actions":{"view_html":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5","download_json":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5.json","view_paper":"https://pith.science/paper/FP2N77UB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05441&json=true","fetch_graph":"https://pith.science/api/pith-number/FP2N77UBWQFPJXTQDSQUZPSHC5/graph.json","fetch_events":"https://pith.science/api/pith-number/FP2N77UBWQFPJXTQDSQUZPSHC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/action/storage_attestation","attest_author":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/action/author_attestation","sign_citation":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/action/citation_signature","submit_replication":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/action/replication_record"}},"created_at":"2026-05-18T00:18:28.124600+00:00","updated_at":"2026-05-18T00:18:28.124600+00:00"}