{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PDB3V2QRGVRQXUQ3M6B3FSTEWO","short_pith_number":"pith:PDB3V2QR","schema_version":"1.0","canonical_sha256":"78c3baea1135630bd21b6783b2ca64b38b61b691974e086ea6f5f1e03dda3982","source":{"kind":"arxiv","id":"1810.08544","version":1},"attestation_state":"computed","paper":{"title":"New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Udit Agarwal, Vijaya Ramachandran","submitted_at":"2018-10-18T15:53:23Z","abstract_excerpt":"We consider the problem of computing all pairs shortest paths (APSP) and shortest paths for k sources in a weighted graph in the distributed CONGEST model. For graphs with non-negative integer edge weights (including zero weights) we build on a recent pipelined algorithm to obtain $\\tilde{O}(\\lambda^{1/4}\\cdot n^{5/4})$ in graphs with non-negative integer edge-weight at most $\\lambda$, and $\\tilde{O}(n \\cdot \\bigtriangleup^{1/3})$ rounds for shortest path distances at most $\\bigtriangleup$. Additionally, we simplify some of the procedures in the earlier APSP algorithms for non-negative edge we"},"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":"1810.08544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T15:53:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"37f7825fc808b8c74fded88ed560602d20d6a5b9345219360c29b58a876d37ad","abstract_canon_sha256":"7f12b9ddc109fe5606d1ddaea403a0f20fdef0a453cce737c04a24ed2fbf3be2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:47.826973Z","signature_b64":"NPmHrQXJhPGjS4NlpcE19gjKrllc0ZAf2MLXno3IQtet8ygbIm4jSPSnKkoMY44Z2k2v63sgf/Hc1epN4IMkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c3baea1135630bd21b6783b2ca64b38b61b691974e086ea6f5f1e03dda3982","last_reissued_at":"2026-05-18T00:02:47.826596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:47.826596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Udit Agarwal, Vijaya Ramachandran","submitted_at":"2018-10-18T15:53:23Z","abstract_excerpt":"We consider the problem of computing all pairs shortest paths (APSP) and shortest paths for k sources in a weighted graph in the distributed CONGEST model. For graphs with non-negative integer edge weights (including zero weights) we build on a recent pipelined algorithm to obtain $\\tilde{O}(\\lambda^{1/4}\\cdot n^{5/4})$ in graphs with non-negative integer edge-weight at most $\\lambda$, and $\\tilde{O}(n \\cdot \\bigtriangleup^{1/3})$ rounds for shortest path distances at most $\\bigtriangleup$. Additionally, we simplify some of the procedures in the earlier APSP algorithms for non-negative edge we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08544","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":"1810.08544","created_at":"2026-05-18T00:02:47.826655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08544v1","created_at":"2026-05-18T00:02:47.826655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08544","created_at":"2026-05-18T00:02:47.826655+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDB3V2QRGVRQ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDB3V2QRGVRQXUQ3","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDB3V2QR","created_at":"2026-05-18T12:32:43.782077+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/PDB3V2QRGVRQXUQ3M6B3FSTEWO","json":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO.json","graph_json":"https://pith.science/api/pith-number/PDB3V2QRGVRQXUQ3M6B3FSTEWO/graph.json","events_json":"https://pith.science/api/pith-number/PDB3V2QRGVRQXUQ3M6B3FSTEWO/events.json","paper":"https://pith.science/paper/PDB3V2QR"},"agent_actions":{"view_html":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO","download_json":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO.json","view_paper":"https://pith.science/paper/PDB3V2QR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08544&json=true","fetch_graph":"https://pith.science/api/pith-number/PDB3V2QRGVRQXUQ3M6B3FSTEWO/graph.json","fetch_events":"https://pith.science/api/pith-number/PDB3V2QRGVRQXUQ3M6B3FSTEWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/action/storage_attestation","attest_author":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/action/author_attestation","sign_citation":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/action/citation_signature","submit_replication":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/action/replication_record"}},"created_at":"2026-05-18T00:02:47.826655+00:00","updated_at":"2026-05-18T00:02:47.826655+00:00"}