{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T07:33:34Z","timestamp":1775374414506,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"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.3188806","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"940-951","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["On non-optimally expanding sets in Grassmann graphs"],"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","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_2_1","unstructured":"Personal communication.  Personal communication."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188804"},{"key":"e_1_3_2_2_4_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_5_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC) 24","author":"Non-Optimally Expanding On","year":"2017"},{"key":"e_1_3_2_2_6_1","volume-title":"Friedgut-Kalai-Naor Theorem for Slices of the Boolean Cube. Chicago J. Theor. Comput. Sci. 2016","author":"Filmus Yuval","year":"2016"},{"key":"e_1_3_2_2_7_1","first-page":"P1","article-title":"An Orthogonal Basis for Functions over a Slice of the Boolean Hypercube","volume":"23","author":"Filmus Yuval","year":"2016","journal-title":"Electr. J. Comb."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2982445.2982460"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2982445.2982461"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90063-4"},{"key":"e_1_3_2_2_11_1","unstructured":"Subhash Khot. 2002.  Subhash Khot. 2002."},{"key":"e_1_3_2_2_12_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_13_1","unstructured":"1004334  1004334"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055432"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214005"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.37236\/2389"},{"key":"e_1_3_2_2_17_1","unstructured":"Murali K. Srinivasan. 2014.  Murali K. Srinivasan. 2014."}],"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.3188806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188806","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.3188806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":17,"alternative-id":["10.1145\/3188745.3188806","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188806","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"}}]}}