{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:42Z","timestamp":1773377922671,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517965","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2477-2482","source":"Crossref","is-referenced-by-count":9,"title":["Capacity Bounds and User Identification Costs in Rayleigh-Fading Many-Access Channel"],"prefix":"10.1109","author":[{"given":"Jyotish","family":"Robin","sequence":"first","affiliation":[{"name":"New York University,Tandon School of Engineering,Dept. of Electrical and Computer Engineering,Brooklyn,NY,USA"}]},{"given":"Elza","family":"Erkip","sequence":"additional","affiliation":[{"name":"New York University,Tandon School of Engineering,Dept. of Electrical and Computer Engineering,Brooklyn,NY,USA"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262800"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2668391"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120391"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref11","author":"zhang","year":"0","journal-title":"On the non-asymptotic and sharp lower tail bounds of random variables"},{"key":"ref5","author":"robin","year":"0","journal-title":"Sparse activity discovery in energy constrained multi-cluster IoT networks using group testing"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/9781680835977"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394812"},{"key":"ref2","author":"cover","year":"2006","journal-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)"},{"key":"ref9","first-page":"121","article-title":"Capacity of the discrete-time noncoherent memoryless Gaussian channels at low SNR","author":"rezki","year":"0","journal-title":"2008 IEEE International Symposium on Information Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849781"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517965.pdf?arnumber=9517965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:34Z","timestamp":1773347734000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517965\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517965","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}