{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:57Z","timestamp":1773377037304,"version":"3.50.1"},"reference-count":12,"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.11195434","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":3,"title":["An Achievability Bound for Type-Based Unsourced Multiple Access"],"prefix":"10.1109","author":[{"given":"Deekshith Pathayappilly","family":"Krishnan","sequence":"first","affiliation":[{"name":"Chalmers University of Technology,Department of Electrical Engineering,Gothenburg,Sweden,41296"}]},{"given":"Kaan","family":"Okumus","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology,Department of Electrical Engineering,Gothenburg,Sweden,41296"}]},{"given":"Khac-Hoang","family":"Ngo","sequence":"additional","affiliation":[{"name":"Linköping University,Department of Electrical Engineering (ISY),Linköping,58183"}]},{"given":"Giuseppe","family":"Durisi","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology,Department of Electrical Engineering,Gothenburg,Sweden,41296"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2023.3249835"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2024.3351469"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC60668.2024.10694621"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2024.3456572"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.861896"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC60668.2024.10694658"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3012948"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2945-6"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT63088.2025.11195434","volume-title":"An achievability bound for type-based unsourced multiple access","author":"Krishnan","year":"2025"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3081189"}],"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\/11195434.pdf?arnumber=11195434","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\/11195434\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195434","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}