{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T05:47:43Z","timestamp":1764222463010,"version":"3.46.0"},"reference-count":31,"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":"am","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"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2111688"],"award-info":[{"award-number":["2111688"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/lcsys.2025.3634944","type":"journal-article","created":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T18:48:06Z","timestamp":1763578086000},"page":"2555-2560","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Multimarginal Schr\u00f6dinger Bridge: Minimum Spanning Tree Over Measure-Valued Vertices"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1369-2495","authenticated-orcid":false,"given":"Georgiy A.","family":"Bondar","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, University of California at Santa Cruz, Santa Cruz, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1509-5853","authenticated-orcid":false,"given":"Abhishek","family":"Halder","sequence":"additional","affiliation":[{"name":"Department of Aerospace Engineering, Iowa State University, Ames, IA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2020.107474"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26980-7_75"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.23919\/ACC60939.2024.10644864"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2025.3560511"},{"key":"ref5","first-page":"57058","article-title":"Deep momentum multi-marginal Schr\u00f6dinger bridge","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Chen"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/20M1320195"},{"key":"ref7","first-page":"55193","article-title":"Tree-based diffusion Schr\u00f6dinger bridge with applications to Wasserstein barycenters","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Noble"},{"key":"ref8","article-title":"Oh snapMMD! forecasting stochastic dynamics beyond the Schr\u00f6dinger bridge\u2019s end","author":"Berlinghieri","year":"2025","journal-title":"arXiv:2505.16082"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-020-01325-7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/21M1410634"},{"issue":"65","key":"ref12","first-page":"1","article-title":"On the complexity of approximating multimarginal optimal transport","volume":"23","author":"Lin","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01868-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3077465"},{"key":"ref15","first-page":"236","article-title":"Understanding belief propagation and its generalizations","volume":"8","author":"Yedidia","year":"2003","journal-title":"Explor. Artif. Intell. New Millennium"},{"key":"ref16","first-page":"9147","article-title":"On the complexity of the optimal transport problem with graph-structured cost","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"Fan"},{"key":"ref17","first-page":"503","article-title":"Optimal trees","volume-title":"Handbooks in Operations Research and Management Science","volume":"7","author":"Magnanti","year":"1995"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/505241.505243"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176991596"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/98524.98567"},{"key":"ref22","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"Cayley","year":"2011","journal-title":"Quart. J. Math."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref25","first-page":"1367","article-title":"Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn\u2019s algorithm","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dvurechensky"},{"key":"ref26","first-page":"1961","article-title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Altschuler"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"volume-title":"Introduction to Algorithms","year":"2009","author":"Cormen","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045"},{"volume-title":"Movie gen: A cast of media foundation models","year":"2025","key":"ref31"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7782633\/10939047\/11261383-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7782633\/10939047\/11261383.pdf?arnumber=11261383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T05:41:45Z","timestamp":1764222105000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11261383\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2025.3634944","relation":{},"ISSN":["2475-1456"],"issn-type":[{"type":"electronic","value":"2475-1456"}],"subject":[],"published":{"date-parts":[[2025]]}}}