{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:50Z","timestamp":1740131690871,"version":"3.37.3"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council under the EU Horizon 2020 research and innovation program \/ ERC","doi-asserted-by":"publisher","award":["725929"],"award-info":[{"award-number":["725929"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DUALITY"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/tcomm.2021.3067911","type":"journal-article","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T20:13:11Z","timestamp":1616443991000},"page":"4433-4447","source":"Crossref","is-referenced-by-count":6,"title":["Fundamental Limits of Stochastic Shared-Cache Networks"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7789-9144","authenticated-orcid":false,"given":"Adeel","family":"Malik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4730-3119","authenticated-orcid":false,"given":"Berksan","family":"Serbetci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele","family":"Parrinello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petros","family":"Elia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.040413.120676"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2014.6812287"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2664815"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989173"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925857"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2909240"},{"key":"ref36","first-page":"1237","article-title":"Coded caching with linear subpacketization is possible using Ruzsa-Szeméredi graphs","author":"shanmugam","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2847679"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007038"},{"key":"ref28","article-title":"An optimal linear error correcting delivery scheme for coded caching with shared caches","author":"sageer karat","year":"2019","journal-title":"arXiv 1901 03188"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437704"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3054518"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref1","first-page":"1","article-title":"Stochastic analysis of coded multicasting for shared caches networks","author":"malik","year":"2020","journal-title":"Proc IEEE Global Commun Conf"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955384"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2705102"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735962"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2878845"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7997396"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970444435X"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/LATINCOM.2016.7811561"},{"key":"ref54","first-page":"159","article-title":"‘Balls into bins’—A simple and tight analysis","author":"martin","year":"1998","journal-title":"Proc Int Workshop Randomization Approx Techn Comput Sci"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/0167-7152(92)90071-C"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2018.2878579"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006558"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007072"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2157937"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844960"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2674668"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614722"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2962686"},{"key":"ref16","article-title":"On multi-server coded caching in the low memory regime","author":"shariatpanahi","year":"2018","journal-title":"arXiv 1803 07655"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447131"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007039"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2911083"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2768517"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2639522"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2870566"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISWCS.2014.6933485"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2967753"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/71.963420"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541613"},{"key":"ref46","article-title":"Generating permutations with a given major index","author":"vajnovszki","year":"2013","journal-title":"arXiv 1302 6558"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1080\/00207169808804755"},{"journal-title":"Generating all partitions A comparison of two encodings","year":"2009","author":"kelleher","key":"ref48"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-011-9168-y"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2017.2652464"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2012.081612.111361"},{"journal-title":"NIST digital library of mathematical functions","year":"2020","author":"olver","key":"ref44"},{"key":"ref43","article-title":"Fundamental limits of stochastic shared caches networks","author":"malik","year":"2020","journal-title":"arXiv 2005 13847"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9483878\/09382979.pdf?arnumber=9382979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:48:36Z","timestamp":1652194116000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9382979\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":54,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2021.3067911","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}