{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:25Z","timestamp":1749873985948,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2402835","CCF-2402836","CCF-2402837"],"award-info":[{"award-number":["CCF-2402835","CCF-2402836","CCF-2402837"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-231-0191"],"award-info":[{"award-number":["W911NF-231-0191"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733506","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"299-309","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Message Optimality and Message-Time Trade-offs for APSP and Beyond"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2977-4109","authenticated-orcid":false,"given":"Fabien","family":"Dufoulon","sequence":"first","affiliation":[{"name":"School of Computing and Communications, Lancaster University, Lancaster, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2409-7807","authenticated-orcid":false,"given":"Shreyas","family":"Pai","sequence":"additional","affiliation":[{"name":"IIT Madras, Chennai, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5833-6592","authenticated-orcid":false,"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Houston, Houston, Texas, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0834-3476","authenticated-orcid":false,"given":"Sriram","family":"Pemmaraju","sequence":"additional","affiliation":[{"name":"University of Iowa, Iowa City, Iowa, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7442-7002","authenticated-orcid":false,"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[{"name":"Augusta University, Augusta, Georgia, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469834"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1255378.1255381"},{"key":"e_1_3_2_1_4_1","volume-title":"Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR abs\/1607.05127","author":"Becker Ruben","year":"2016","unstructured":"Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, and Christoph Lenzen. 2016. Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR abs\/1607.05127 (2016). http:\/\/arxiv.org\/abs\/1607.05127"},{"key":"e_1_3_2_1_5_1","article-title":"Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time","volume":"52","author":"Bernstein Aaron","year":"2021","unstructured":"Aaron Bernstein and Danupon Nanongkai. 2021. Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time. SIAM J. Comput. 52, 2 (2021), STOC19\u2013112.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2017.10"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2019.11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405729"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2024.41"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087823"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387161"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.91"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767417"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662812"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538429"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2018.32"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212737"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2015.6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935812"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.24"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2017.4"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699440"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215349"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486180"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331569"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055449"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520074"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733506","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:25:42Z","timestamp":1749824742000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":30,"alternative-id":["10.1145\/3732772.3733506","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733506","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}