{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:02Z","timestamp":1763468222371,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,11]],"date-time":"2015-01-11T00:00:00Z","timestamp":1420934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["616787"],"award-info":[{"award-number":["616787"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-083727, CCF-1218711"],"award-info":[{"award-number":["CCF-083727, CCF-1218711"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Neuron Fund for Support of Science"},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["14-10003S"],"award-info":[{"award-number":["14-10003S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,11]]},"DOI":"10.1145\/2688073.2688096","type":"proceedings-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T20:42:45Z","timestamp":1421095365000},"page":"247-254","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A New Approach to the Sensitivity Conjecture"],"prefix":"10.1145","author":[{"given":"Justin","family":"Gilmer","sequence":"first","affiliation":[{"name":"Rutgers University, Piscataway, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Kouck\u00fd","sequence":"additional","affiliation":[{"name":"Charles University, Prague, Czech Rep"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael E.","family":"Saks","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscataway, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(88)90034-9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(92)90060-8"},{"key":"e_1_3_2_1_5_1","volume-title":"Variations on the Sensitivity Conjecture. Number 4 in Graduate Surveys","author":"Hatami P.","year":"2011","unstructured":"P. Hatami , R. Kulkarni , and D. Pankratov . Variations on the Sensitivity Conjecture. Number 4 in Graduate Surveys . Theory of Computing Library , 2011 . P. Hatami, R. Kulkarni, and D. Pankratov. Variations on the Sensitivity Conjecture. Number 4 in Graduate Surveys. Theory of Computing Library, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2002.12.001"},{"key":"e_1_3_2_1_7_1","volume-title":"Lecture notes on evasiveness of graph properties. arXiv preprint cs\/0205031","author":"Lovasz L.","year":"2002","unstructured":"L. Lovasz and N. E. Young . Lecture notes on evasiveness of graph properties. arXiv preprint cs\/0205031 , 2002 . L. Lovasz and N. E. Young. Lecture notes on evasiveness of graph properties. arXiv preprint cs\/0205031, 2002."},{"key":"e_1_3_2_1_8_1","volume-title":"Exact quantum query complexity for total boolean functions. arXiv preprint quant-ph\/0403168","author":"Midrijanis G.","year":"2004","unstructured":"G. Midrijanis . Exact quantum query complexity for total boolean functions. arXiv preprint quant-ph\/0403168 , 2004 . G. Midrijanis. Exact quantum query complexity for total boolean functions. arXiv preprint quant-ph\/0403168, 2004."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263419"}],"event":{"name":"ITCS'15: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rehovot Israel","acronym":"ITCS'15"},"container-title":["Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688096","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688073.2688096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:03Z","timestamp":1750227183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,11]]},"references-count":9,"alternative-id":["10.1145\/2688073.2688096","10.1145\/2688073"],"URL":"https:\/\/doi.org\/10.1145\/2688073.2688096","relation":{},"subject":[],"published":{"date-parts":[[2015,1,11]]},"assertion":[{"value":"2015-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}