{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:12Z","timestamp":1773378012096,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849823","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"96-100","source":"Crossref","is-referenced-by-count":14,"title":["A Group Testing Approach to Random Access for Short-Packet Communication"],"prefix":"10.1109","author":[{"given":"Huseyin A.","family":"Inan","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Stanford University"}]},{"given":"Surin","family":"Ahn","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University"}]},{"given":"Peter","family":"Kairouz","sequence":"additional","affiliation":[{"name":"Google AI, Mountain View, CA, 94043"}]},{"given":"Ayfer","family":"Ozgur","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2007.348337"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057010"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120391"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2314472"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10095"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3150\/14-BEJ605"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492579"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.120710.100054"},{"key":"ref6","article-title":"CHIRRUP: a practical algorithm for unsourced multiple access","author":"calderbank","year":"2018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278023"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2902397"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.135636"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1024916.1024920"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1478462.1478502"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996746"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849823.pdf?arnumber=8849823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:54Z","timestamp":1773347754000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849823\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849823","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}