{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:59:36Z","timestamp":1772521176716,"version":"3.50.1"},"reference-count":85,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"France 2030","award":["ANR-23-PEIA-0004"],"award-info":[{"award-number":["ANR-23-PEIA-0004"]}]},{"name":"SOCOT","award":["ANR-23-CE40-0017"],"award-info":[{"award-number":["ANR-23-CE40-0017"]}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["ERC-2019-COG"],"award-info":[{"award-number":["ERC-2019-COG"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1109\/tvcg.2026.3657210","type":"journal-article","created":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T20:58:28Z","timestamp":1769201908000},"page":"3016-3023","source":"Crossref","is-referenced-by-count":0,"title":["Robust Barycenters of Persistence Diagrams"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7396-5546","authenticated-orcid":false,"given":"Keanu","family":"Sisouk","sequence":"first","affiliation":[{"name":"LIP6, Sorbonne Universit&#x00E9; &#x0026; CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eloi","family":"Tanguy","sequence":"additional","affiliation":[{"name":"MAP5, Universit&#x00E9; Paris-Cit&#x00E9; &#x0026; CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7182-7537","authenticated-orcid":false,"given":"Julie","family":"Delon","sequence":"additional","affiliation":[{"name":"MAP5, Universit&#x00E9; Paris-Cit&#x00E9; &#x0026; CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0056-2831","authenticated-orcid":false,"given":"Julien","family":"Tierny","sequence":"additional","affiliation":[{"name":"LIP6, Sorbonne Universit&#x00E9; &#x0026; CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/PACIFICVIS.2015.7156387"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/100805741"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00755-3_8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2020.3022359"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584237"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.25181"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.10.018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-83500-2_16"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2743980"},{"key":"ref10","first-page":"139","article-title":"A multi-resolution data structure for 2-dimensional morse functions","volume-title":"Proc. IEEE Vis.","author":"Bremer"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.253"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2025.129952"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/23M1624786"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/s0925-7721(02)00093-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV.2016.7874312"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/VISUAL.2004.96"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.07.021"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064133"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1276-5"},{"key":"ref20","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Cuturi"},{"key":"ref21","first-page":"685","article-title":"Fast computation of wasserstein barycenters","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cuturi"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12596"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198524847.001.0001"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.115"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/069"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/777792.777846"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/378583.378626"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2864432"},{"key":"ref29","article-title":"Visualizing ensembles of viscous fingers","volume-title":"Proc. IEEE SciVis Contest","author":"Favelier"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2467204"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12898"},{"issue":"78","key":"ref32","first-page":"1","article-title":"POT: Python optimal transport","volume":"22","author":"Flamary","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","article-title":"A user\u2019s guide to discrete morse theory","volume":"48","author":"Forman","year":"2002","journal-title":"S\u00e9minaire Lotharingien de Combinatoire"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346403"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2898436"},{"key":"ref36","article-title":"Task-based augmented reeb graphs with dynamic ST-Trees","volume-title":"Proc. Eurographics Symp. Parallel Graph. Visu.","author":"Gueunet"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12361"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2864848"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70603"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2467432"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12933"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.141"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.1"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.249"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3064175"},{"key":"ref46","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma","year":"2015"},{"key":"ref47","article-title":"Visualization of uncertain contour trees","volume-title":"Proc. 23rd SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst.","author":"Kraus"},{"key":"ref48","first-page":"9792","article-title":"Large scale computation of means and clusters for persistence diagrams using optimal transport","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Lacombe"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.186"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TopoInVis60193.2023.00013"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2012.6507496"},{"key":"ref52","first-page":"64","article-title":"Topology-inspired partition-based sensitivity analysis and visualization of nuclear simulations","volume-title":"Proc. IEEE PacificViz","author":"Maljovec"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346455"},{"key":"ref54","first-page":"1781","volume-title":"M\u00e9moire Sur La Th\u00e9orie Des D\u00e9blais Et Des Remblais","author":"Monge"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1201\/9780429493911"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV57265.2022.9966403"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1002\/qua.26133"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1039\/D2CP05893F"},{"key":"ref60","volume-title":"The IEEE SciVis Contest","year":"2004"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2261250.2261289"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276449"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"ref64","article-title":"Wasserstein distances, geodesics and barycenters of merge trees\u2013ensemble benchmark","author":"Pont","year":"2021"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2021.3114839"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2022.3215001"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.55"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.95"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20828-2"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.181"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03089.x"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2452919"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2023.3330262"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV48142.2019.8944365"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-2966.2011.18394.x"},{"key":"ref76","article-title":"Computing barycentres of measures for generic transport costs","author":"Tanguy","year":"2025"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276892"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.163"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.4310\/hha.2020.v22.n1.a15"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-014-9604-7"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2934256"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.143"},{"key":"ref84","volume-title":"Sketching as a Tool for Numerical Linear Algebra","author":"Woodruff","year":"2014"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1615\/int.j.uncertaintyquantification.2012003956"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/2945\/11418562\/11363006.pdf?arnumber=11363006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:20:49Z","timestamp":1772518849000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11363006\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":85,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2026.3657210","relation":{},"ISSN":["1077-2626","1941-0506","2160-9306"],"issn-type":[{"value":"1077-2626","type":"print"},{"value":"1941-0506","type":"electronic"},{"value":"2160-9306","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]}}}