{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:43W3K2FIDRKLKNGUCM5XZK5RBZ","short_pith_number":"pith:43W3K2FI","schema_version":"1.0","canonical_sha256":"e6edb568a81c54b534d4133b7cabb10e5e9bf36a1e5b099897a427257a7b7703","source":{"kind":"arxiv","id":"2005.09588","version":1},"attestation_state":"computed","paper":{"title":"Faster Deterministic All Pairs Shortest Paths in Congest Model","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":"2020-05-19T17:09:41Z","abstract_excerpt":"We present a new deterministic algorithm for distributed weighted all pairs shortest paths (APSP) in both undirected and directed graphs. Our algorithm runs in $\\tilde{O}(n^{4/3})$ rounds in the Congest models on graphs with arbitrary edge weights, and it improves on the previous $\\tilde{O}(n^{3/2})$ bound of Agarwal et al. [ARKP18]. The main components of our new algorithm are a new faster technique for constructing blocker set deterministically and a new pipelined method for deterministically propagating distance values from source nodes to the blocker set nodes in the network. Both of these"},"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":"2005.09588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-19T17:09:41Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6ef092a85de6d66ce725ff22acd3e92b1d69b81c5ad23618f16be05827a85376","abstract_canon_sha256":"9da5c44d4aad64d7fee96fd6590da5d9ce29a7b1fdfee45090e4c5bd95283a85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:51.287013Z","signature_b64":"JcTqM2nVyx0oc9KEBhePA2nvISwCnW+oN6/l0xFt1sYcvKujIUgJdEBE7npiq+LvGYRHq3SOWkixLnkOotD6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6edb568a81c54b534d4133b7cabb10e5e9bf36a1e5b099897a427257a7b7703","last_reissued_at":"2026-07-05T01:03:51.286627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:51.286627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Deterministic All Pairs Shortest Paths in Congest Model","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":"2020-05-19T17:09:41Z","abstract_excerpt":"We present a new deterministic algorithm for distributed weighted all pairs shortest paths (APSP) in both undirected and directed graphs. Our algorithm runs in $\\tilde{O}(n^{4/3})$ rounds in the Congest models on graphs with arbitrary edge weights, and it improves on the previous $\\tilde{O}(n^{3/2})$ bound of Agarwal et al. [ARKP18]. The main components of our new algorithm are a new faster technique for constructing blocker set deterministically and a new pipelined method for deterministically propagating distance values from source nodes to the blocker set nodes in the network. Both of these"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.09588","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.09588/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.09588","created_at":"2026-07-05T01:03:51.286679+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.09588v1","created_at":"2026-07-05T01:03:51.286679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.09588","created_at":"2026-07-05T01:03:51.286679+00:00"},{"alias_kind":"pith_short_12","alias_value":"43W3K2FIDRKL","created_at":"2026-07-05T01:03:51.286679+00:00"},{"alias_kind":"pith_short_16","alias_value":"43W3K2FIDRKLKNGU","created_at":"2026-07-05T01:03:51.286679+00:00"},{"alias_kind":"pith_short_8","alias_value":"43W3K2FI","created_at":"2026-07-05T01:03:51.286679+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/43W3K2FIDRKLKNGUCM5XZK5RBZ","json":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ.json","graph_json":"https://pith.science/api/pith-number/43W3K2FIDRKLKNGUCM5XZK5RBZ/graph.json","events_json":"https://pith.science/api/pith-number/43W3K2FIDRKLKNGUCM5XZK5RBZ/events.json","paper":"https://pith.science/paper/43W3K2FI"},"agent_actions":{"view_html":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ","download_json":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ.json","view_paper":"https://pith.science/paper/43W3K2FI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.09588&json=true","fetch_graph":"https://pith.science/api/pith-number/43W3K2FIDRKLKNGUCM5XZK5RBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/43W3K2FIDRKLKNGUCM5XZK5RBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/action/storage_attestation","attest_author":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/action/author_attestation","sign_citation":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/action/citation_signature","submit_replication":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/action/replication_record"}},"created_at":"2026-07-05T01:03:51.286679+00:00","updated_at":"2026-07-05T01:03:51.286679+00:00"}