{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T18:10:03Z","timestamp":1756491003659,"version":"3.44.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Signal and Inf. Process. over Networks"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tsipn.2025.3587399","type":"journal-article","created":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:20:55Z","timestamp":1752103255000},"page":"1005-1014","source":"Crossref","is-referenced-by-count":0,"title":["An ADMM-Based Approach to Quadratically-Regularized Distributed Optimal Transport on Graphs"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1027-0242","authenticated-orcid":false,"given":"Yacine","family":"Mokhtari","sequence":"first","affiliation":[{"name":"LIAS (UR 20299), ISAE-ENSMA\/Universit&#x00E9; de Poitiers, Poitiers, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8687-884X","authenticated-orcid":false,"given":"Emmanuel","family":"Moulay","sequence":"additional","affiliation":[{"name":"XLIM (UMR CNRS 7252), Universit&#x00E9; de Poitiers, Poitiers, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7359-5728","authenticated-orcid":false,"given":"Patrick","family":"Coirault","sequence":"additional","affiliation":[{"name":"LIAS (UR 20299), ISAE-ENSMA\/Universit&#x00E9; de Poitiers, Poitiers, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3417-4135","authenticated-orcid":false,"given":"Jerome","family":"Le Ny","sequence":"additional","affiliation":[{"name":"Polytechnique Montr&#x00E9;al, Montr&#x00E9;al, QC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Network Optimization: Continuous and Discrete Models","volume":"8","author":"Bertsekas","year":"1998"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.21236\/ada594171"},{"key":"ref3","first-page":"666","article-title":"Mmoire sur la thorie des dblais et des remblais","author":"Monge","year":"1781","journal-title":"Mem. Math. Phys. Acad. Royale Sci."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.1"},{"key":"ref5","first-page":"2053","article-title":"Learning with a Wasserstein loss","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Frogner","year":"2015"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2766963"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1515\/9781400883592"},{"key":"ref8","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Cuturi","year":"2013"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/16M1106018"},{"key":"ref12","article-title":"Optimal transport with Laplacian regularization: Applications to domain adaptation and shape matching","volume-title":"Proc. NIPS Workshop Optimal Transport Mach. Learn.","author":"Flamary","year":"2014"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/17M1132665"},{"issue":"1","key":"ref14","first-page":"590","article-title":"Regularized optimal transport and the rot movers distance","volume":"19","author":"Dessein","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref15","first-page":"880","article-title":"Smooth and sparse optimal transport","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Blondel","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2017.2720471"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2019.05.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1272825"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2015.2406578"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2019.2910476"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CISS50987.2021.9400236"},{"article-title":"Decentralized entropic optimal transport for privacy-preserving distributed distribution comparison","year":"2023","author":"Wang","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-6670(17)55135-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022613603828"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2293221"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402990"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1791212.1791218"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2593681"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2055862"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2019.8814988"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425904"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2298\/YJOR121120001S"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2014.895828"},{"volume-title":"Introduction to Linear Optimization","year":"1997","author":"Bertsimas","key":"ref36"},{"volume-title":"Nonlinear Programming","year":"1999","author":"Bertsekas","key":"ref37"},{"volume-title":"Parallel and Distributed Computation: Numerical Methods","year":"2015","author":"Bertsekas","key":"ref38"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/110836936"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0530-2"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783400"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-021-00368-3"},{"article-title":"Distributed state estimation: A novel stopping criterion","year":"2020","author":"Asefi","key":"ref43"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16646-9"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/9780470400791"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s00245-019-09614-w"}],"container-title":["IEEE Transactions on Signal and Information Processing over Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6884276\/10789318\/11075625.pdf?arnumber=11075625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T17:43:35Z","timestamp":1756489415000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11075625\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/tsipn.2025.3587399","relation":{},"ISSN":["2373-776X","2373-7778"],"issn-type":[{"type":"electronic","value":"2373-776X"},{"type":"electronic","value":"2373-7778"}],"subject":[],"published":{"date-parts":[[2025]]}}}