{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T07:10:22Z","timestamp":1725433822207},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006556","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"391-395","source":"Crossref","is-referenced-by-count":1,"title":["A computer-aided investigation on the fundamental limits of caching"],"prefix":"10.1109","author":[{"given":"Chao","family":"Tian","sequence":"first","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ITW.2016.7606818"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ISIT.2016.7541276"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ISIT.2016.7541415"},{"year":"2016","author":"yu","journal-title":"The exact rate-memory tradeoff for caching with uncoded prefetching","key":"ref13"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/JSAC.2014.140516"},{"key":"ref16","article-title":"Symmetry, outer bounds, and code constructions: A computer-aided investigation on the fundamental limits of caching","author":"tian","year":"0","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/ISIT.2016.7541415"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/ISIT.2016.7541414"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/ISIT.2015.7282744"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ISIT.2015.7282745"},{"year":"2014","author":"chen","journal-title":"Fundamental limits of caching Improved bounds for small buffer users","key":"ref8"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/NCC.2015.7084871"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/18.641556"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TIT.2014.2306938"},{"year":"2015","author":"sahraei","journal-title":"k users caching two files An improved achievable rate","key":"ref9"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006556.pdf?arnumber=8006556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:20:04Z","timestamp":1570040404000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006556\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006556","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}