{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:50:20Z","timestamp":1774680620580,"version":"3.50.1"},"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.8007042","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2810-2814","source":"Crossref","is-referenced-by-count":2,"title":["Storage capacity as an information-theoretic analogue of vertex cover"],"prefix":"10.1109","author":[{"given":"Arya","family":"Mazumdar","sequence":"first","affiliation":[]},{"given":"Andrew","family":"McGregor","sequence":"additional","affiliation":[]},{"given":"Sofya","family":"Vorotnikova","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"254","article-title":"Planarity of data networks","author":"bowden","year":"2011","journal-title":"Teletraffic Congress (ITC) 2011 23rd International"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2414926"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/140988358"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref14","first-page":"109","article-title":"Zur theorie der diskreten gebilde, vii: Ein dreifarbensatz fr dreikreisfreie netze auf der kugel","volume":"8","author":"gr\u00f6tzsch","year":"1959","journal-title":"Wiss Z Martin-Luther-U Halle-Wittenberg Math -Nat Reihe"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472521"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1215\/ijm\/1256049012","article-title":"Every planar map is four colorable. part ii: Reducibility","volume":"21","author":"appel","year":"1977","journal-title":"Illinois J Math"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802205"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.39"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034247"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","article-title":"Every planar map is four colorable. part i: Discharging","volume":"21","author":"appel","year":"1977","journal-title":"Illinois J Math"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.532875"},{"key":"ref9","article-title":"Index coding via linear programming","author":"blasiak","year":"2010","journal-title":"CoRR"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","location":"Aachen, Germany","start":{"date-parts":[[2017,6,25]]},"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\/08007042.pdf?arnumber=8007042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:20:46Z","timestamp":1570040446000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8007042\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007042","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}