{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:47:30Z","timestamp":1755794850682,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519966","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"195-202","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate polymorphisms"],"prefix":"10.1145","author":[{"given":"Gilad","family":"Chase","sequence":"first","affiliation":[{"name":"Technion, Israel"}]},{"given":"Yuval","family":"Filmus","sequence":"additional","affiliation":[{"name":"Technion, Israel"}]},{"given":"Dor","family":"Minzer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Elchanan","family":"Mossel","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Nitin","family":"Saurabh","sequence":"additional","affiliation":[{"name":"IIT Hyderabad, India"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1086\/256963"},{"key":"e_1_3_2_1_2_1","unstructured":"Libor Barto Andrei Krokhin and Ross Willard. 2017. Polymorphisms and how to use them. In Dagstuhl Follow-Ups. 7.  Libor Barto Andrei Krokhin and Ross Willard. 2017. Polymorphisms and how to use them. In Dagstuhl Follow-Ups. 7."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556674"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Manuel Blum Michael Luby and Ronitt Rubinfeld. 1990. Self-Testing\/Correcting with Applications to Numerical Problems. In STOC. 73\u201383.  Manuel Blum Michael Luby and Ronitt Rubinfeld. 1990. Self-Testing\/Correcting with Applications to Numerical Problems. In STOC. 73\u201383.","DOI":"10.1145\/100216.100225"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-008-0320-1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2010.02.005"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384254"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.19086\/da"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_10_1","volume-title":"A Noisy-Influence Regularity Lemma for Boolean Functions. CoRR, abs\/1610.06950","author":"Jones Chris","year":"2016","unstructured":"Chris Jones . 2016. A Noisy-Influence Regularity Lemma for Boolean Functions. CoRR, abs\/1610.06950 ( 2016 ), arxiv:1610.06950. arxiv:1610.06950 Chris Jones. 2016. A Noisy-Influence Regularity Lemma for Boolean Functions. CoRR, abs\/1610.06950 (2016), arxiv:1610.06950. arxiv:1610.06950"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-8858(02)00023-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/334"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-010-0047-x"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-011-0362-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2010.171.295"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v19-3005"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-013-9358-6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101407444"},{"key":"e_1_3_2_1_19_1","unstructured":"Mario Szegedy and Yixin Xu. 2015. Impossibility Theorems and the Universal Algebraic Toolkit. Unpublished note.  Mario Szegedy and Yixin Xu. 2015. Impossibility Theorems and the Universal Algebraic Toolkit. Unpublished note."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(72)90051-8"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"STOC '22"},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519966","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:38Z","timestamp":1750268978000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":20,"alternative-id":["10.1145\/3519935.3519966","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519966","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}