{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:45Z","timestamp":1773378105721,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834536","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1701-1706","source":"Crossref","is-referenced-by-count":7,"title":["The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology"],"prefix":"10.1109","author":[{"given":"Federico","family":"Brunero","sequence":"first","affiliation":[{"name":"EURECOM,Communication Systems Department,Sophia Antipolis,France"}]},{"given":"Petros","family":"Elia","sequence":"additional","affiliation":[{"name":"EURECOM,Communication Systems Department,Sophia Antipolis,France"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Vector coded caching multiplicatively boosts the throughput of realistic downlink systems","author":"zhao","year":"2022"},{"key":"ref11","article-title":"Fundamental limits of combinatorial multi-access caching","author":"brunero","year":"2021"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989128"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2980817"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611506"},{"key":"ref15","article-title":"Multi-access coded caching with demand privacy","author":"namboodiri","year":"2021"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126663"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517891"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3053048"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611394"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2962686"},{"key":"ref3","article-title":"Resolving the feedback bottleneck of multi-antenna coded caching","author":"lampiris","year":"2021","journal-title":"IEEE Trans Inf Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3030973"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2768517"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3078890"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955384"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3015348"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2015.7227127"},{"key":"ref22","article-title":"Unselfish coded caching can yield unbounded gains over symmetrically selfish caching","author":"brunero","year":"2021"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2967753"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620369"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834536.pdf?arnumber=9834536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:19Z","timestamp":1773347779000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834536\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834536","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}