{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:32:36Z","timestamp":1730280756841,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"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":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470706","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["Inapproximability of Unique Games in Fixed-Point Logic with Counting"],"prefix":"10.1109","author":[{"given":"Jamie","family":"Tucker-Foltz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214005"},{"key":"ref11","article-title":"Approximating np-hard problems efficient algorithms and their limits","author":"raghavendra","year":"2009","journal-title":"Ph D Dissertation"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005108"},{"key":"ref13","article-title":"Approximating Constraint Satisfaction Problems Symmetrically","author":"tucker-foltz","year":"2020","journal-title":"Master’s thesis"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15369-3_23"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21676-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0070"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0011-7"},{"article-title":"Computational topology and the unique games conjecture","year":"0","author":"grochow","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.049"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2728816.2728820"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9692-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exz022"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63543"},{"key":"ref8","first-page":"592","article-title":"Pseudorandom sets in grassmann graph have near-perfect expansion","author":"khot","year":"2018","journal-title":"59th IEEE Annual Symposium on Foundations of Computer Science FOCS 2018 Paris France October 7-9 2018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2010.19"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80029-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188806"},{"key":"ref20","article-title":"A new series of dense graphs of high girth","volume":"32","author":"lazebnik","year":"1994","journal-title":"Bulletin of the American Mathematical Society"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1"},{"journal-title":"Rudiments of ?-calculus","year":"2001","author":"arnold","key":"ref21"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2021,6,29]]},"location":"Rome, Italy","end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470706.pdf?arnumber=9470706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:21Z","timestamp":1652197581000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470706","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}