{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:58:36Z","timestamp":1774990716782,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541276","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"135-139","source":"Crossref","is-referenced-by-count":69,"title":["On caching with more users than files"],"prefix":"10.1109","author":[{"given":"Kai","family":"Wan","sequence":"first","affiliation":[{"name":"CentraleSupélec-CNRS-Université Paris-Sud, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Tuninetti","sequence":"additional","affiliation":[{"name":"CentraleSupelec, Univ. Paris-Sud, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Piantanida","sequence":"additional","affiliation":[{"name":"CentraleSupelec, Univ. Paris-Sud, Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"K users caching two files: An improved achievable rate","author":"sahraei","year":"2015","journal-title":"arXiv 1512 06682"},{"key":"ref3","article-title":"Fundamental limits of caching: Improved bounds for small buffer users","author":"chen","year":"2014","journal-title":"arxiv 1407 1935"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.33232\/BIMS.0028.45.52","article-title":"Cauchy's matrix, the vandermonde matrix and polynomial interpolation","volume":"28","author":"gow","year":"1992","journal-title":"Irish Math Soc Bull"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IWCIT.2014.6842484"},{"key":"ref5","article-title":"Decentralized coded caching attains order-optimal memory-rate tradeoff","author":"maddah-ali","year":"2014","journal-title":"arXiv 1301 5848"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2015.7179393"},{"key":"ref7","article-title":"Order optimal coded delivery and caching: Multiple groupcast index coding","author":"ji","year":"2014","journal-title":"arXiv 1402 4572v2"},{"key":"ref2","article-title":"On the optimality of uncoded cache placement","author":"wan","year":"2015","journal-title":"arXiv 1511 02256"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541276"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541276.pdf?arnumber=7541276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:17Z","timestamp":1774986677000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541276","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}