{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:42:56Z","timestamp":1778647376924,"version":"3.51.4"},"reference-count":68,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003343","name":"Cambridge Trust Scholarship","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003343","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Harding Distinguished Postgraduate Scholars Program Leverage Scheme"},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council Doctoral Training Award","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tit.2025.3611276","type":"journal-article","created":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T17:30:30Z","timestamp":1758130230000},"page":"9074-9099","source":"Crossref","is-referenced-by-count":1,"title":["Quantitative Group Testing and Pooled Data in the Linear Regime With Sublinear Tests"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1529-4115","authenticated-orcid":false,"given":"Nelvin","family":"Tan","sequence":"first","affiliation":[{"name":"Department of Engineering, University of Cambridge, Cambridge, U.K"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6791-8877","authenticated-orcid":false,"given":"Pablo","family":"Pascual Cobo","sequence":"additional","affiliation":[{"name":"Department of Engineering, University of Cambridge, Cambridge, U.K"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7915-5432","authenticated-orcid":false,"given":"Ramji","family":"Venkataramanan","sequence":"additional","affiliation":[{"name":"Department of Engineering, University of Cambridge, Cambridge, U.K"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/0100000099"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310477"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3138489"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3141244"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3210593"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437774"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-195"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2021.01.004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7308980"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541526"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006977"},{"key":"ref12","first-page":"377","article-title":"Phase transitions in the pooled data problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Scarlett"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2855698"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/18M1183339"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988195"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63397-9_19"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/23M1604928"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/36\/43\/030"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/08\/P08009"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033942"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2893254"},{"key":"ref24","first-page":"11071","article-title":"Phase retrieval in high dimensions: Statistical and computational phase transitions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Maillard"},{"key":"ref25","first-page":"397","article-title":"Approximate message passing with spectral initialization for generalized linear models","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Mondelli"},{"issue":"317","key":"ref26","first-page":"1","article-title":"Mixed regression via approximate message passing","volume":"24","author":"Tan","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875223"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iax014"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2556702"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/aa7284"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1958"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2302930120"},{"key":"ref33","article-title":"Approximate message passing for the matrix tensor product model","author":"Rossetti","year":"2023","journal-title":"arXiv:2306.15580"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1561\/2200000092"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706927"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2400445"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274513"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3455228"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1214\/24-AAP2056"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352296"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.782171"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref43","first-page":"1374","article-title":"Optimal group testing","volume-title":"Proc. Conf. Learn. Theory","author":"Coja-Oghlan"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548324000336"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206963"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619188"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989403"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919896"},{"key":"ref49","first-page":"3395","article-title":"Near optimal efficient decoding from pooled data","volume-title":"Proc. Conf. Learn. Theory","author":"Hahn-Klimroth"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2023.104718"},{"key":"ref51","first-page":"4574","article-title":"A non-adaptive algorithm for the quantitative group testing problem","volume-title":"Proc. Conf. Learn. Theory","author":"Soleymani"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00018"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457606"},{"key":"ref54","article-title":"Efficient approximate recovery from pooled data using doubly regular pooling schemes","author":"Hahn-Klimroth","year":"2023","journal-title":"arXiv:2303.00043"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619221"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3083733"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891664"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990880"},{"key":"ref59","volume-title":"Code for Spatially Coupled AMP for Pooled Data and Quantitative Group Testing","author":"Pascual Cobo","year":"2024"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7_1"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619669"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref63","article-title":"A leave-one-out approach to approximate message passing","author":"Bao","year":"2023","journal-title":"arXiv:2312.05911"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay021"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2169535"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3250119"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3247520"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619156"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11220181\/11168964.pdf?arnumber=11168964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T17:33:19Z","timestamp":1761759199000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11168964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":68,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3611276","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}