{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:39Z","timestamp":1773377859170,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849253","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1477-1481","source":"Crossref","is-referenced-by-count":2,"title":["Directed Intersection Representations and the Information Content of Digraphs"],"prefix":"10.1109","author":[{"given":"Alexandr V.","family":"Kostochka","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Illinois, Urbana-Champaign Urbana, Illinois, 61801"}]},{"given":"Xujun","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Illinois, Urbana-Champaign Urbana, Illinois, 61801"}]},{"given":"Roberto","family":"Machado","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign Urbana, Illinois, 61808"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign Urbana, Illinois, 61808"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90061-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0071509"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.4064\/cm-3-1-19-30"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-014-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0069178"},{"key":"ref5","article-title":"On the triangle clique cover and k_t clique cover problems","author":"dau","year":"2017","journal-title":"arXiv preprint arXiv 1709 01922"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90123-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(77)90055-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2728638"},{"key":"ref9","first-page":"320","article-title":"Problem 28","volume":"10","author":"mantel","year":"1907","journal-title":"Wiskundige Opgaven"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741128"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849253.pdf?arnumber=8849253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:23Z","timestamp":1773347723000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849253\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849253","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}