{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:26:30Z","timestamp":1729671990794,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006928","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2243-2247","source":"Crossref","is-referenced-by-count":4,"title":["Making recommendations bandwidth aware"],"prefix":"10.1109","author":[{"given":"Linqi","family":"Song","sequence":"first","affiliation":[]},{"given":"Christina","family":"Fragouli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Yahoo! search marketing advertiser bidding data version 1 0","year":"2016","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023702"},{"journal-title":"The minrank of random graphs","year":"2016","author":"golovnev","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541273"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477821"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372165"},{"journal-title":"Making recommendations bandwidth aware","year":"2016","author":"song","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00205-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"journal-title":"Conviva Viewer Experience Report","year":"2013","key":"ref3"},{"journal-title":"Index Coding Via Linear Programming","year":"2010","author":"blasiak","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2414926"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"3187","DOI":"10.1109\/TIT.2010.2048502","article-title":"On the index coding problem and its relation to network coding and matroid theory","volume":"56","author":"el","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.079"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245121"},{"journal-title":"Mémoire sur les élections au Scrutin","year":"1781","author":"de borda","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\/08006928.pdf?arnumber=8006928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:20:32Z","timestamp":1570040432000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006928\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006928","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}