{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:53:32Z","timestamp":1781078012662,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"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":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585210","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"463-471","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications"],"prefix":"10.1145","author":[{"given":"Hamed","family":"Hatami","sequence":"first","affiliation":[{"name":"McGill University, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaave","family":"Hosseini","sequence":"additional","affiliation":[{"name":"University of Rochester, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang","family":"Meng","sequence":"additional","affiliation":[{"name":"McGill University, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.30"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00070"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6265-7"},{"key":"e_1_3_2_1_4_1","volume-title":"Spec. Issue Comput. Learn. Theory","author":"Ben-David Shai","year":"2002","unstructured":"Shai Ben-David , Nadav Eiron , and Hans Ulrich Simon . 2002. Limitations of learning via embeddings in Euclidean half spaces. J. Mach. Learn. Res., 3 , Spec. Issue Comput. Learn. Theory ( 2002 ), 441\u2013461. Shai Ben-David, Nadav Eiron, and Hans Ulrich Simon. 2002. Limitations of learning via embeddings in Euclidean half spaces. J. Mach. Learn. Res., 3, Spec. Issue Comput. Learn. Theory (2002), 441\u2013461."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2016.37"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993644"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2019.14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2018.v014a021"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2582112.2582146"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 30th Conference on Learning Theory, COLT 2017 (Proceedings of Machine Learning Research","volume":"830","author":"Feldman Vitaly","year":"2017","unstructured":"Vitaly Feldman . 2017 . A General Characterization of the Statistical Query Complexity . In Proceedings of the 30th Conference on Learning Theory, COLT 2017 (Proceedings of Machine Learning Research , Vol. 65). 785\u2013 830 . Vitaly Feldman. 2017. A General Characterization of the Statistical Query Complexity. In Proceedings of the 30th Conference on Learning Theory, COLT 2017 (Proceedings of Machine Learning Research, Vol. 65). 785\u2013830."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.82"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00019-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.90"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/705"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-018-0175-5"},{"key":"e_1_3_2_1_16_1","unstructured":"Hamed Hatami Pooya Hatami William Pires Ran Tao and Rosie Zhao. [n. d.]. Lower Bound Methods for Sign-rank and their Limitations. \t\t\t\t  Hamed Hatami Pooya Hatami William Pires Ran Tao and Rosie Zhao. [n. d.]. Lower Bound Methods for Sign-rank and their Limitations."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2022.v018a019"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5010-1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574948"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-2160-5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548308009656"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76649-0"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761110"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789813272880_0029"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90157-D"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715908"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/080744037"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9000-7"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0042519"},{"key":"e_1_3_2_1_30_1","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"Shalev-Shwartz Shai","unstructured":"Shai Shalev-Shwartz and Shai Ben-David . 2014. Understanding Machine Learning: From Theory to Algorithms . Cambridge University Press , USA. isbn:1107057132 Shai Shalev-Shwartz and Shai Ben-David. 2014. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, USA. isbn:1107057132"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.11"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-2580-0"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a008"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316408"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_37"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2015.10.001"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585210","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:01Z","timestamp":1750178821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":36,"alternative-id":["10.1145\/3564246.3585210","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585210","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}