{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T16:07:41Z","timestamp":1787760461516,"version":"build-2784847793"},"reference-count":72,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"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 (ERC) through the EU Horizon 2020 Research and Innovation Program","doi-asserted-by":"publisher","award":["725929"],"award-info":[{"award-number":["725929"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project DUALITY"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1109\/tit.2022.3193723","type":"journal-article","created":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T20:12:21Z","timestamp":1658779941000},"page":"1037-1056","source":"Crossref","is-referenced-by-count":47,"title":["Fundamental Limits of Combinatorial Multi-Access Caching"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6980-3827","authenticated-orcid":false,"given":"Federico","family":"Brunero","sequence":"first","affiliation":[{"name":"Communication Systems Department, EURECOM, Sophia Antipolis, Biot, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3531-120X","authenticated-orcid":false,"given":"Petros","family":"Elia","sequence":"additional","affiliation":[{"name":"Communication Systems Department, EURECOM, Sophia Antipolis, Biot, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614722"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2962686"},{"key":"ref4","article-title":"On multi-server coded caching in the low memory regime","author":"Shariatpanahi","year":"2018","journal-title":"arXiv:1803.07655"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2674668"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007072"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2751608"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149433"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844618"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2669942"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2888615"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2975160"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/WIOPT.2017.7959863"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053372"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036313"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2967753"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800059"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613527"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2847679"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844960"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095471"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3049074"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2639522"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2768517"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2695611"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946361"},{"key":"ref30","article-title":"Unselfish coded caching can yield unbounded gains over symmetrically selfish caching","author":"Brunero","year":"2021","journal-title":"arXiv:2109.04807"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3158326"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849537"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9148779"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849357"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149113"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2970950"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955384"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3015348"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278044"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3078890"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3001176"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2962495"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2969918"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3030973"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3139013"},{"key":"ref46","article-title":"Vector coded caching multiplicatively boosts the throughput of realistic downlink systems","author":"Zhao","year":"2022","journal-title":"arXiv:2202.07047"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2980817"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989128"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC51071.2022.9771663"},{"key":"ref50","article-title":"Multiaccess coded caching with private demands","author":"Liang","year":"2021","journal-title":"arXiv:2105.06282"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611506"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126663"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834838"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3116229"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517891"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3053048"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611437"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611394"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2018.8503093"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2015.7227127"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405315"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557320"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1561\/0100000094"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2662706"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2799202"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620369"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139058520"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3107432"},{"key":"ref70","first-page":"5610","article-title":"Communication-computation efficient gradient coding","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","volume":"80","author":"Ye"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2964547"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10024105\/09839411.pdf?arnumber=9839411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T03:26:47Z","timestamp":1709350007000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9839411\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":72,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3193723","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]}}}