{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T20:45:57Z","timestamp":1768682757588,"version":"3.49.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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","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":[[2020,1]]},"DOI":"10.1109\/tit.2019.2946361","type":"journal-article","created":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T19:59:08Z","timestamp":1570651148000},"page":"633-648","source":"Crossref","is-referenced-by-count":13,"title":["Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9185-7779","authenticated-orcid":false,"given":"Seyed Ali","family":"Saberali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6583-1978","authenticated-orcid":false,"given":"Lutz","family":"Lampe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9660-1449","authenticated-orcid":false,"given":"Ian F.","family":"Blake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2639522"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218445"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISWCS.2014.6933485"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2768517"},{"key":"ref15","article-title":"Structural properties of uncoded placement optimization for coded delivery","author":"jin","year":"2017","journal-title":"arXiv 1707 07146"},{"key":"ref16","article-title":"Optimization of heterogeneous coded caching","author":"daniel","year":"2017","journal-title":"arXiv 1708 04322"},{"key":"ref17","article-title":"Adaptive delivery in caching networks","author":"saberali","year":"2017","journal-title":"arXiv 1707 09662"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2930692"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7565184"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2801246"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2574919"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7537173"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2698447"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7565185"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7565183"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282746"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2558144"},{"key":"ref23","author":"luenberger","year":"2015","journal-title":"Linear and Nonlinear Programming"},{"key":"ref26","first-page":"118","article-title":"Structured sparsity-inducing norms through submodular functions","author":"bach","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8939138\/08863425.pdf?arnumber=8863425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:20:09Z","timestamp":1651080009000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8863425\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":26,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2946361","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}