{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T22:28:16Z","timestamp":1768688896492,"version":"3.49.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (NSERC) under the Discovery Grant","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tit.2022.3193316","type":"journal-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T19:35:37Z","timestamp":1658432137000},"page":"7850-7870","source":"Crossref","is-referenced-by-count":7,"title":["Memory-Rate Tradeoff for Caching With Uncoded Placement Under Nonuniform Random Demands"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0120-5767","authenticated-orcid":false,"given":"Yong","family":"Deng","sequence":"first","affiliation":[{"name":"Department of Electrical, Computer and Software Engineering, Ontario Tech University, Oshawa, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7223-8865","authenticated-orcid":false,"given":"Min","family":"Dong","sequence":"additional","affiliation":[{"name":"Department of Electrical, Computer and Software Engineering, Ontario Tech University, Oshawa, Canada"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2921711"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9148779"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2870566"},{"key":"ref32","article-title":"Uncoded placement optimization for coded delivery","author":"jin","year":"2017","journal-title":"arXiv 1709 06462"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2930692"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2962495"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149113"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849537"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849357"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849597"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282743"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2017.8081667"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849540"},{"key":"ref2","first-page":"1","article-title":"Optimal uncoded placement and file grouping structure for improved coded caching under nonuniform popularity","author":"deng","year":"2020","journal-title":"Proc Int Symp Model Optim Mobile Ad-Hoc Wireless Netw (WiOpt)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF51394.2020.9443377"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2639522"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2695611"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"ref24","article-title":"Structural properties of uncoded placement optimization for coded delivery","author":"jin","year":"2017","journal-title":"arXiv 1707 07146"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2768517"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3179266"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2946361"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.09.022"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282567"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2914393"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2669942"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2717912"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2557804"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394482"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2940671"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541276"},{"key":"ref19","first-page":"161","article-title":"On the optimality of uncoded cache placement","author":"wan","year":"2016","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6736753"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6871674"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844939"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614722"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735962"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2019.8815475"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955384"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2605104"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7249208"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2963031"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2969918"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.2969896"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2805331"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9961124\/09837078.pdf?arnumber=9837078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T19:12:17Z","timestamp":1670872337000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9837078\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":50,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3193316","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}