{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T07:33:33Z","timestamp":1775374413951,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"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":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188804","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"376-389","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Towards a proof of the 2-to-1 games conjecture?"],"prefix":"10.1145","author":[{"given":"Irit","family":"Dinur","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Israel"}]},{"given":"Subhash","family":"Khot","sequence":"additional","affiliation":[{"name":"New York University, USA"}]},{"given":"Guy","family":"Kindler","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Israel"}]},{"given":"Dor","family":"Minzer","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Muli","family":"Safra","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1472"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775105"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-003-0025-0"},{"key":"e_1_3_2_2_6_1","unstructured":"Boaz Barak Pravesh Kothari and David Steurer. 2018. Small-Set Expansion in Shortcode Graph and the 2-to-1 Conjecture. (2018).  Boaz Barak Pravesh Kothari and David Steurer. 2018. Small-Set Expansion in Shortcode Graph and the 2-to-1 Conjecture. (2018)."},{"key":"e_1_3_2_2_7_1","unstructured":"Personal communication.  Personal communication."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.95"},{"key":"e_1_3_2_2_9_1","unstructured":"Mihir Bellare Oded Goldreich and Madhu Sudan. 1998.  Mihir Bellare Oded Goldreich and Madhu Sudan. 1998."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.26"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188804"},{"key":"e_1_3_2_2_13_1","unstructured":"Irit Dinur Subhash Khot Guy Kindler Dor Minzer and Muli Safra. 2017.  Irit Dinur Subhash Khot Guy Kindler Dor Minzer and Muli Safra. 2017."},{"key":"e_1_3_2_2_14_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC) 24","author":"Non-Optimally Expanding On","year":"2017"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.84"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446962"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.439"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591884"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"e_1_3_2_2_20_1","unstructured":"Venkatesan Guruswami Johan H\u00e5stad and Madhu Sudan. 2002.  Venkatesan Guruswami Johan H\u00e5stad and Madhu Sudan. 2002."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700377165"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.36"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875499"},{"key":"e_1_3_2_2_24_1","unstructured":"Johan H\u00e5stad. 2001.  Johan H\u00e5stad. 2001."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/09077299X"},{"key":"e_1_3_2_2_27_1","unstructured":"Subhash Khot. 2002.  Subhash Khot. 2002."},{"key":"e_1_3_2_2_28_1","volume-title":"Games. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montr\u00e9al","author":"Round On","year":"2002"},{"key":"e_1_3_2_2_29_1","unstructured":"1004334  1004334"},{"key":"e_1_3_2_2_30_1","volume-title":"Proceedings of the International Congress of Mathematicians","author":"Khot Subhash","year":"2010"},{"key":"e_1_3_2_2_31_1","unstructured":"Subhash Khot. 2010.  Subhash Khot. 2010."},{"key":"e_1_3_2_2_32_1","volume-title":"Unique Games Conjecture. In Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010","author":"On","year":"2010"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055432"},{"key":"e_1_3_2_2_34_1","first-page":"6","article-title":"Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion","volume":"25","author":"Khot Subhash","year":"2018","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897531"},{"key":"e_1_3_2_2_36_1","unstructured":"Subhash Khot and Ryan O\u2019Donnell. 2009.  Subhash Khot and Ryan O\u2019Donnell. 2009."},{"key":"e_1_3_2_2_37_1","volume-title":"Theory of Computing 5, 1","author":"Gaps SDP","year":"2009"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"},{"key":"e_1_3_2_2_42_1","unstructured":"D. Steurer. 2011. Subexponential algorithms for d-to-1 two-prover games and for certifying almost perfect expansion. (2011).  D. Steurer. 2011. Subexponential algorithms for d-to-1 two-prover games and for certifying almost perfect expansion. (2011)."}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:09Z","timestamp":1750212429000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":42,"alternative-id":["10.1145\/3188745.3188804","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188804","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}