{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T01:53:29Z","timestamp":1768787609214,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591882","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"614-623","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Super-polylogarithmic hypergraph coloring hardness via low-degree long codes"],"prefix":"10.1145","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prahladh","family":"Harsha","sequence":"additional","affiliation":[{"name":"Tata Institute of Fundamental Research, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"H\u00e5stad","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srikanth","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Bombay, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Girish","family":"Varma","sequence":"additional","affiliation":[{"name":"Tata Institute of Fundamental Research, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.83"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.54"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.44"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704443057"},{"key":"e_1_3_2_2_6_1","first-page":"207","volume-title":"Covering CSPs. In Proc. 28th IEEE Conference on Computational Complexity","author":"Dinur I.","year":"2013","unstructured":"I. Dinur and G. Kol . Covering CSPs. In Proc. 28th IEEE Conference on Computational Complexity , pages 207 -- 218 , 2013 . doi:10.1109\/CCC.2013.29. 10.1109\/CCC.2013.29 I. Dinur and G. Kol. Covering CSPs. In Proc. 28th IEEE Conference on Computational Complexity, pages 207--218, 2013. doi:10.1109\/CCC.2013.29."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0032-4"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_2_9_1","volume-title":"Super-polylogarithmic hypergraph coloring hardness via low-degree long codes","author":"Guruswami V.","year":"2013","unstructured":"V. Guruswami , J. H\u00e5stad , P. Harsha , S. Srinivasan , and G. Varma . Super-polylogarithmic hypergraph coloring hardness via low-degree long codes , 2013 .. arXiv:1311.7407. V. Guruswami, J. H\u00e5stad, P. Harsha, S. Srinivasan, and G. Varma. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes, 2013.. arXiv:1311.7407."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.61"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509962"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652134"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447372"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634191"},{"key":"e_1_3_2_2_15_1","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Finite Fields","author":"Lidl R.","year":"1997","unstructured":"R. Lidl and H. Niederreiter . Finite Fields , volume 2 of Encyclopedia of Mathematics and its Applications . Cambridge University Press , 1997 . doi:10.1017\/CBO9780511525926. 10.1017\/CBO9780511525926 R. Lidl and H. Niederreiter. Finite Fields, volume 2 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1997. doi:10.1017\/CBO9780511525926."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","location":"New York New York","acronym":"STOC '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591882","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":16,"alternative-id":["10.1145\/2591796.2591882","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591882","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}