{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:37Z","timestamp":1773377617098,"version":"3.50.1"},"reference-count":27,"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.8849463","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2349-2353","source":"Crossref","is-referenced-by-count":2,"title":["Universally Sparse Hypergraphs with Applications to Coding Theory"],"prefix":"10.1109","author":[{"given":"Chong","family":"Shangguan","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv, 6997801, Israel"}]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv, 6997801, Israel"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2766659"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.841169"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196304246"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9253-z"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref16","article-title":"Private Communication","author":"gu","year":"2018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.915661"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2009.3.13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2013.03.009"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060208"},{"key":"ref3","first-page":"53","article-title":"Some extremal problems on r-graphs","author":"brown","year":"1973","journal-title":"New Directions in the Theory of Graphs"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24298-9_4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00222-010-0247-x"},{"key":"ref7","article-title":"Construction of optimal locally recoverable codes and connection with hypergraph","author":"xing","year":"2018"},{"key":"ref2","first-page":"436","article-title":"Eine Extremalaufgabe aus der Graphentheorie","volume":"48","author":"tur\u00e1n","year":"1941","journal-title":"Mat Fiz Lapok"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20667"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849463"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.08.046"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17364-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref25","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Presented as part of the 2012 USENIX Annual Technical Conference (USENIX ATC 12)"}],"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\/08849463.pdf?arnumber=8849463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:36Z","timestamp":1773347676000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849463\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849463","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}