{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T03:23:34Z","timestamp":1768706614678,"version":"3.49.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100004381","name":"Intel, Cisco, and Verizon through the VAWN Project","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF 1161801"],"award-info":[{"award-number":["CCF 1161801"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/tit.2017.2695611","type":"journal-article","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T18:23:18Z","timestamp":1492626198000},"page":"3923-3949","source":"Crossref","is-referenced-by-count":147,"title":["Order-Optimal Rate of Caching and Coded Multicasting With Random Demands"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7970-2245","authenticated-orcid":false,"given":"Mingyue","family":"Ji","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6050-4150","authenticated-orcid":false,"given":"Antonia M.","family":"Tulino","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6713-5861","authenticated-orcid":false,"given":"Jaime","family":"Llorca","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7749-1333","authenticated-orcid":false,"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"ref38","author":"ji","year":"2015","journal-title":"Order-optimal rate of caching and coded multicasting with random demands"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2014.6883600"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISWCS.2014.6933489"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6871674"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.918081"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132612"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285151"},{"key":"ref34","author":"blasiak","year":"2010","journal-title":"Index Coding Via Linear Programming"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248916"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6655103"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2639522"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490226"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2452672"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/261390"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/080715421"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref3","first-page":"661","article-title":"Approximation algorithms for data placement in arbitrary networks","author":"baev","year":"2001","journal-title":"Proc 12th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/90.879344"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298309"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461964"},{"key":"ref8","first-page":"193","article-title":"Cost-aware www proxy caching algorithms","volume":"12","author":"cao","year":"1997","journal-title":"Proc USENIX Symp Internet Technol Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1047770"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2151677.2151686"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/505696.505701"},{"key":"ref1","year":"2013","journal-title":"The Zettabyte Era-Trends and Analysis"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISWCS.2014.6933485"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133172"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2014.7032246"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421346"},{"key":"ref41","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198572237.001.0001","volume":"80","author":"grimmett","year":"2001","journal-title":"Probability and Random Processes"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2557804"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2375553"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7308972"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7931776\/7904696-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7931776\/07904696.pdf?arnumber=7904696","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T17:28:12Z","timestamp":1719163692000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7904696\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":42,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2695611","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}