{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:07Z","timestamp":1750220767976,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["No"],"award-info":[{"award-number":["No"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1412958"],"award-info":[{"award-number":["CCF-1412958"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014155","name":"Simons Foundation","doi-asserted-by":"publisher","award":["622132"],"award-info":[{"award-number":["622132"]}],"id":[{"id":"10.13039\/100014155","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384254","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"222-233","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["AND testing and robust judgement aggregation"],"prefix":"10.1145","author":[{"given":"Yuval","family":"Filmus","sequence":"first","affiliation":[{"name":"Technion, Israel"}]},{"given":"Noam","family":"Lifshitz","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Israel"}]},{"given":"Dor","family":"Minzer","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study at Princeton, USA"}]},{"given":"Elchanan","family":"Mossel","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"K. Arrow. 1950. A dificulty in the theory of social welfare. J. of Political Economy 58 ( 1950 ) 328-346.  K. Arrow. 1950. A dificulty in the theory of social welfare. J. of Political Economy 58 ( 1950 ) 328-346.","DOI":"10.1086\/256963"},{"volume-title":"Social choice and individual values","author":"Arrow K.","key":"e_1_3_2_1_4_1","unstructured":"K. Arrow . 1963. Social choice and individual values . John Wiley and Sons . K. Arrow. 1963. Social choice and individual values. John Wiley and Sons."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"John J Bartholdi Craig A Tovey and Michael A Trick. 1989. The computational dificulty of manipulating an election. Social Choice and Welfare 6 3 ( 1989 ) 227-241.  John J Bartholdi Craig A Tovey and Michael A Trick. 1989. The computational dificulty of manipulating an election. Social Choice and Welfare 6 3 ( 1989 ) 227-241.","DOI":"10.1007\/BF00295861"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556674"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02785861"},{"key":"e_1_3_2_1_9_1","volume-title":"Symmetric Polymorphisms and Eficient Decidability of Promise CSPs. In SODA","author":"Brakensiek Joshua","year":"2020","unstructured":"Joshua Brakensiek and Venkatesan Guruswami . 2020 . Symmetric Polymorphisms and Eficient Decidability of Promise CSPs. In SODA 2020. Joshua Brakensiek and Venkatesan Guruswami. 2020. Symmetric Polymorphisms and Eficient Decidability of Promise CSPs. In SODA 2020."},{"key":"e_1_3_2_1_10_1","unstructured":"Jonah Brown-Cohen and Prasad Raghavendra. 2015. Combinatorial Optimization Algorithms via Polymorphisms. arXiv: 1501.01598 [cs.CC]  Jonah Brown-Cohen and Prasad Raghavendra. 2015. Combinatorial Optimization Algorithms via Polymorphisms. arXiv: 1501.01598 [cs.CC]"},{"key":"e_1_3_2_1_11_1","unstructured":"Jean-Antoine-Nicolas Condorcet. 1785. Essai sur l'application de l'analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. De l'Imprimerie Royale.  Jean-Antoine-Nicolas Condorcet. 1785. Essai sur l'application de l'analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. De l'Imprimerie Royale."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1061655"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Elad Dokow and Ron Holzman. 2009. Aggregation of binary evaluations for truth-functional agendas. Soc. Choice Welf. 32 ( 2009 ) 221-241.  Elad Dokow and Ron Holzman. 2009. Aggregation of binary evaluations for truth-functional agendas. Soc. Choice Welf. 32 ( 2009 ) 221-241.","DOI":"10.1007\/s00355-008-0320-1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Elad Dokow and Ron Holzman. 2010. Aggregation of binary evaluations. J. Econ. Theory 145 ( 2010 ) 495-511.  Elad Dokow and Ron Holzman. 2010. Aggregation of binary evaluations. J. Econ. Theory 145 ( 2010 ) 495-511.","DOI":"10.1016\/j.jet.2007.10.004"},{"key":"e_1_3_2_1_15_1","article-title":"Aggregation of binary evaluations with abstentions","volume":"145","author":"Dokow Elad","year":"2010","unstructured":"Elad Dokow and Ron Holzman . 2010 . Aggregation of binary evaluations with abstentions . J. Econ. Theory 145 , 2 ( 2010 ), 544-561. Elad Dokow and Ron Holzman. 2010. Aggregation of binary evaluations with abstentions. J. Econ. Theory 145, 2 ( 2010 ), 544-561.","journal-title":"J. Econ. Theory"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Elad Dokow and Ron Holzman. 2010. Aggregation of non-binary evaluations. Adv. Appl. Math. 45 ( 2010 ) 487-504.  Elad Dokow and Ron Holzman. 2010. Aggregation of non-binary evaluations. Adv. Appl. Math. 45 ( 2010 ) 487-504.","DOI":"10.1016\/j.aam.2010.02.005"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-014-1064-5"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v31i4.2314"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/090756740"},{"volume-title":"Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 243-249","author":"Friedgut E.","key":"e_1_3_2_1_20_1","unstructured":"E. Friedgut , G. Kalai , and N. Nisan . 2009. Elections Can be Manipulated Often . In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 243-249 . E. Friedgut, G. Kalai, and N. Nisan. 2009. Elections Can be Manipulated Often. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 243-249."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"A. Gibbard. 1973. Manipulation of voting schemes: a general result. Econometrica 41 4 ( 1973 ) 587-601.  A. Gibbard. 1973. Manipulation of voting schemes: a general result. Econometrica 41 4 ( 1973 ) 587-601.","DOI":"10.2307\/1914083"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743493"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1070\/sm8872"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_25_1","volume-title":"Article arXiv","author":"Huang Hao","year":"1907","unstructured":"Hao Huang . 2019. Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture. arXiv e-prints , Article arXiv : 1907 . 00847 ( Jul 2019 ), arXiv: 1907.00847 pages. arXiv: 1907.00847 [math.CO] Hao Huang. 2019. Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture. arXiv e-prints, Article arXiv: 1907. 00847 ( Jul 2019 ), arXiv: 1907.00847 pages. arXiv: 1907.00847 [math.CO]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01830975"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"M. Isaksson G. Kindler and E. Mossel. 2012. The Geometry of Manipulation-a Quantitative Proof of the Gibbard Satterthwaite Theorem. Combinatorica 32 2 ( 2012 ) 221-250.  M. Isaksson G. Kindler and E. Mossel. 2012. The Geometry of Manipulation-a Quantitative Proof of the Gibbard Satterthwaite Theorem. Combinatorica 32 2 ( 2012 ) 221-250.","DOI":"10.1007\/s00493-012-2704-1"},{"key":"e_1_3_2_1_28_1","first-page":"412","volume-title":"Appl. Math. 29, 3 ( 2002 )","author":"Kalai G.","unstructured":"G. Kalai . 2002. A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem. Adv . in Appl. Math. 29, 3 ( 2002 ) , 412 - 426 . G. Kalai. 2002. A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem. Adv. in Appl. Math. 29, 3 ( 2002 ), 412-426."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Nathan Keller. 2012. A tight quantitative version of Arrow's impossibility theorem. ( 2012 ) 1331-1355 pages.  Nathan Keller. 2012. A tight quantitative version of Arrow's impossibility theorem. ( 2012 ) 1331-1355 pages.","DOI":"10.4171\/JEMS\/334"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-018-1646-8"},{"key":"e_1_3_2_1_31_1","unstructured":"Guy Kindler and Shmuel Safra. [n.d.]. Noise-resistant boolean functions are juntas. ([n. d.]).  Guy Kindler and Shmuel Safra. [n.d.]. Noise-resistant boolean functions are juntas. ([n. d.])."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Lewis A Kornhauser and Lawrence G Sager. 1986. Unpacking the court. Yale LJ 96 ( 1986 ) 82.  Lewis A Kornhauser and Lawrence G Sager. 1986. Unpacking the court. Yale LJ 96 ( 1986 ) 82.","DOI":"10.2307\/796436"},{"key":"e_1_3_2_1_33_1","volume-title":"Hypergraph removal lemmas via robust sharp threshold theorems. arXiv preprint arXiv","author":"Lifshitz Noam","year":"1804","unstructured":"Noam Lifshitz . 2018. Hypergraph removal lemmas via robust sharp threshold theorems. arXiv preprint arXiv : 1804 . 00328 ( 2018 ). Noam Lifshitz. 2018. Hypergraph removal lemmas via robust sharp threshold theorems. arXiv preprint arXiv: 1804. 00328 ( 2018 )."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Christian List and Philip Pettit. 2002. Aggregating sets of judgments: An impossibility result. Economics and Philosophy 18 1 ( 2002 ) 89-110.  Christian List and Philip Pettit. 2002. Aggregating sets of judgments: An impossibility result. Economics and Philosophy 18 1 ( 2002 ) 89-110.","DOI":"10.1017\/S0266267102001098"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:SYNT.0000029950.50517.59"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/140958578"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"E. Mossel. 2012. A Quantitative Arrow Theorem. Probability Theory and Related Fields 154 1 ( 2012 ) 49-88.  E. Mossel. 2012. A Quantitative Arrow Theorem. Probability Theory and Related Fields 154 1 ( 2012 ) 49-88.","DOI":"10.1007\/s00440-011-0362-7"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"E. Mossel K. Oleszkiewicz and A. Sen. 2013. On reverse hypercontractivity. Geometric and Functional Analysis 23 3 ( 2013 ) 1062-1097.  E. Mossel K. Oleszkiewicz and A. Sen. 2013. On reverse hypercontractivity. Geometric and Functional Analysis 23 3 ( 2013 ) 1062-1097.","DOI":"10.1007\/s00039-013-0229-4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"E. Mossel and M. Z. Racz. 2015. A quantitative Gibbard-Satterthwaite theorem without neutrality. Combinatorica 35 3 ( 2015 ) 317-387.  E. Mossel and M. Z. Racz. 2015. A quantitative Gibbard-Satterthwaite theorem without neutrality. Combinatorica 35 3 ( 2015 ) 317-387.","DOI":"10.1007\/s00493-014-2979-5"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Ilan Nehama. 2013. Approximately classic judgement aggregation. Ann. Math. Artif. Intell. 68 ( 2013 ) 91-134.  Ilan Nehama. 2013. Approximately classic judgement aggregation. Ann. Math. Artif. Intell. 68 ( 2013 ) 91-134.","DOI":"10.1007\/s10472-013-9358-6"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Klaus Nehring and Clemens Puppe. 2008. Consistent judgement aggregation: the truth-functional case. Soc. Choice Welf. 31 ( 2008 ) 41-57.  Klaus Nehring and Clemens Puppe. 2008. Consistent judgement aggregation: the truth-functional case. Soc. Choice Welf. 31 ( 2008 ) 41-57.","DOI":"10.1007\/s00355-007-0261-0"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129757"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101407444"},{"volume-title":"The Stanford Encyclopedia of Philosophy (winter 2016 ed.), Edward N","author":"Pigozzi Gabriella","key":"e_1_3_2_1_44_1","unstructured":"Gabriella Pigozzi . 2016. Belief Merging and Judgment Aggregation . In The Stanford Encyclopedia of Philosophy (winter 2016 ed.), Edward N . Zalta (Ed.). Metaphysics Research Lab, Stanford University . Gabriella Pigozzi. 2016. Belief Merging and Judgment Aggregation. In The Stanford Encyclopedia of Philosophy (winter 2016 ed.), Edward N. Zalta (Ed.). Metaphysics Research Lab, Stanford University."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"M. A. Satterthwaite. 1975. Strategy-proofness and Arrow's Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions. J. of Economic Theory 10 ( 1975 ) 187-217.  M. A. Satterthwaite. 1975. Strategy-proofness and Arrow's Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions. J. of Economic Theory 10 ( 1975 ) 187-217.","DOI":"10.1016\/0022-0531(75)90050-2"},{"key":"e_1_3_2_1_46_1","unstructured":"Mario Szegedy and Yixin Xu. 2018. Impossibility theorems and the universal algebraic toolkit. ( 2018 ).  Mario Szegedy and Yixin Xu. 2018. Impossibility theorems and the universal algebraic toolkit. ( 2018 )."}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC '20"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384254","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":46,"alternative-id":["10.1145\/3357713.3384254","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384254","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}