{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZXYWNFXBXTTEZT4JTRLGVPCLBF","short_pith_number":"pith:ZXYWNFXB","schema_version":"1.0","canonical_sha256":"cdf16696e1bce64ccf899c566abc4b095c8dcd76f60390ef29fb8fca33a3cc02","source":{"kind":"arxiv","id":"1807.08824","version":3},"attestation_state":"computed","paper":{"title":"A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining","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-07-23T20:51:42Z","abstract_excerpt":"We present a new pipelined approach to compute all pairs shortest paths (APSP) in a directed graph with nonnegative integer edge weights (including zero weights) in the CONGEST model in the distributed setting. Our deterministic distributed algorithm computes shortest paths of distance at most $\\Delta$ for all pairs of vertices in at most $2 n \\sqrt{\\Delta} + 2n$ rounds, and more generally, it computes h-hop shortest paths for k sources in $2\\sqrt{nkh} + n + k$ rounds. The algorithm is simple, and it has some novel features and a nontrivial analysis.It uses only the directed edges in the graph"},"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":"1807.08824","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T20:51:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"4605631ed7173bc5fa3ef7f60782a4484f860d3737ba2857939c7150ff9d61a6","abstract_canon_sha256":"7fe8e1a7ae6621d869c11dbcad3b018b6d4d2adc61843d6ea07d98b19a060a83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:39.625202Z","signature_b64":"GzzeLdgQrH5hWKWxWxDBOE5cuUvuqoKawY4Bpp22mqlRGFLYIMpy5YyBNkzRbDODWhOg1yO/7/43jJnFpxi3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdf16696e1bce64ccf899c566abc4b095c8dcd76f60390ef29fb8fca33a3cc02","last_reissued_at":"2026-05-18T00:02:39.624635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:39.624635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining","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-07-23T20:51:42Z","abstract_excerpt":"We present a new pipelined approach to compute all pairs shortest paths (APSP) in a directed graph with nonnegative integer edge weights (including zero weights) in the CONGEST model in the distributed setting. Our deterministic distributed algorithm computes shortest paths of distance at most $\\Delta$ for all pairs of vertices in at most $2 n \\sqrt{\\Delta} + 2n$ rounds, and more generally, it computes h-hop shortest paths for k sources in $2\\sqrt{nkh} + n + k$ rounds. The algorithm is simple, and it has some novel features and a nontrivial analysis.It uses only the directed edges in the graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08824","kind":"arxiv","version":3},"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":"1807.08824","created_at":"2026-05-18T00:02:39.624736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08824v3","created_at":"2026-05-18T00:02:39.624736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08824","created_at":"2026-05-18T00:02:39.624736+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXYWNFXBXTTE","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXYWNFXBXTTEZT4J","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXYWNFXB","created_at":"2026-05-18T12:33:07.085635+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/ZXYWNFXBXTTEZT4JTRLGVPCLBF","json":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF.json","graph_json":"https://pith.science/api/pith-number/ZXYWNFXBXTTEZT4JTRLGVPCLBF/graph.json","events_json":"https://pith.science/api/pith-number/ZXYWNFXBXTTEZT4JTRLGVPCLBF/events.json","paper":"https://pith.science/paper/ZXYWNFXB"},"agent_actions":{"view_html":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF","download_json":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF.json","view_paper":"https://pith.science/paper/ZXYWNFXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08824&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXYWNFXBXTTEZT4JTRLGVPCLBF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXYWNFXBXTTEZT4JTRLGVPCLBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/action/storage_attestation","attest_author":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/action/author_attestation","sign_citation":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/action/citation_signature","submit_replication":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/action/replication_record"}},"created_at":"2026-05-18T00:02:39.624736+00:00","updated_at":"2026-05-18T00:02:39.624736+00:00"}