{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:32:37Z","timestamp":1776889957236,"version":"3.51.2"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195627","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Multi-Source Approximate Message Passing With Random Semi-Unitary Dictionaries"],"prefix":"10.1109","author":[{"given":"Burak","family":"\u00c7akmak","sequence":"first","affiliation":[{"name":"Technical University of Berlin,Germany"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"Technical University of Berlin,Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3541281"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619473"},{"key":"ref3","article-title":"Plugin estimation in high-dimensional linear inverse problems: A rigorous analysis","volume":"31","author":"Fletcher","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2525824"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC60668.2024.10694410"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195627"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/23-AOP1628"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3458953"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/24-AAP2056"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2013.12.026"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.062140"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2653119"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916359"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2947058"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2222382"},{"key":"ref17","author":"Pandit","year":"2020","journal-title":"Inference in multi-layer networks with matrix-valued unknowns"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3327609"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2816681"},{"key":"ref20","author":"Li","year":"2022","journal-title":"A non-asymptotic framework for approximate message passing in spiked models"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3396472"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2174612"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/abb8c9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.103.L030101"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2101"},{"key":"ref26","first-page":"10144","article-title":"Learning gaussian mixtures with generalized linear models: Precise asymptotics in high-dimensions,","volume":"34","author":"Loureiro","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3222913"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaae024"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619576"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3114351"},{"key":"ref31","author":"Mezzadri","year":"2006","journal-title":"How to generate random matrices from the classical compact groups"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619669"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.340450"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.641553"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195627.pdf?arnumber=11195627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:13Z","timestamp":1773347413000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195627\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195627","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}