{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:01:26Z","timestamp":1774990886521,"version":"3.50.1"},"reference-count":14,"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.7541414","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"825-829","source":"Crossref","is-referenced-by-count":27,"title":["Symmetry, demand types and outer bounds in caching systems"],"prefix":"10.1109","author":[{"given":"Chao","family":"Tian","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, The University of Tennessee Knoxville, United States"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8608-5"},{"key":"ref11","author":"andrews","year":"1976","journal-title":"The Theory of Partitions"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2015.1205"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176789"},{"key":"ref14","article-title":"A note on the fundamental limits of coded caching","author":"tian","year":"0","journal-title":"arXiv 1503 00010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2014.6883597"},{"key":"ref3","article-title":"Coded caching with nonuniform demands","author":"maddah-ali","year":"0","journal-title":"Proc of INFO-COM Workshops 2014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282745"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282744"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140516"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2015.7084871"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref9","article-title":"Solutions of Computed Information Theoretic Limits (SCITL)","author":"tian","year":"0"}],"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\/07541414.pdf?arnumber=7541414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:12Z","timestamp":1774986732000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541414\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541414","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}