{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:11:27Z","timestamp":1763467887499,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"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":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374380","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"21-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Unique games on expanding constraint graphs are easy"],"prefix":"10.1145","author":[{"given":"Sanjeev","family":"Arora","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Subhash A.","family":"Khot","sequence":"additional","affiliation":[{"name":"Courant Institue of Mathematical Sciences, New York University, New York, NY, USA"}]},{"given":"Alexandra","family":"Kolla","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]},{"given":"David","family":"Steurer","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Madhur","family":"Tulsiani","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]},{"given":"Nisheeth K.","family":"Vishnoi","sequence":"additional","affiliation":[{"name":"IBM India Research Lab, Delhi, India"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1333875.1334206"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_1_3_1","first-page":"58","volume-title":"the 7th Annual Symposium on Theoretical Aspects of Computer Science","author":"Condon Anne","year":"1990","unstructured":"Jin-yi Cai, Anne Condon , and Richard J. Lipton . Playing games of incomplete information . In the 7th Annual Symposium on Theoretical Aspects of Computer Science , pages 58 -- 69 , 1990 . Jin-yi Cai, Anne Condon, and Richard J. Lipton. Playing games of incomplete information. In the 7th Annual Symposium on Theoretical Aspects of Computer Science, pages 58--69, 1990."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132547"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0210-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.36"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132594"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132567"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129783"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109569"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250852"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.49"},{"key":"e_1_3_2_1_14_1","first-page":"379","volume-title":"Proceedings of the Annual IEEE Conference on Computational Complexity, number 18","author":"Khot Subhash","year":"2003","unstructured":"Subhash Khot and Oded Regev . Vertex cover might be hard to approximate to within 2--eps . In Proceedings of the Annual IEEE Conference on Computational Complexity, number 18 , pages 379 -- 386 , 2003 . Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2--eps. In Proceedings of the Annual IEEE Conference on Computational Complexity, number 18, pages 379--386, 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.74"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.3.470.16391"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374378"},{"key":"e_1_3_2_1_21_1","unstructured":"Shmuel Safra and Oded Schwartz. On Parallel--Repetition Unique-Game and Max-Cut. Manuscript 2007.  Shmuel Safra and Oded Schwartz. On Parallel--Repetition Unique-Game and Max-Cut. Manuscript 2007."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.22"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Victoria British Columbia Canada","acronym":"STOC '08"},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374380","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:32Z","timestamp":1750278152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374380"}},"subtitle":["extended abstract"],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":22,"alternative-id":["10.1145\/1374376.1374380","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374380","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}