{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T14:19:05Z","timestamp":1765808345447,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"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":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649708","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1793-1804","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["New Graph and Hypergraph Container Lemmas with Applications in Property Testing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5824-9034","authenticated-orcid":false,"given":"Eric","family":"Blais","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7008-5441","authenticated-orcid":false,"given":"Cameron","family":"Seth","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00019-1"},{"key":"e_1_3_2_1_2_1","volume-title":"International Workshop on Approximation Algorithms for Combinatorial Optimization. 389\u2013399","author":"Avigad Lidor","year":"2011","unstructured":"Lidor Avigad and Oded Goldreich. 2011. Testing graph blow-up. In International Workshop on Approximation Algorithms for Combinatorial Optimization. 389\u2013399."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2014-00816-X"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the International Congress of Mathematicians: Rio de Janeiro","author":"Balogh J\u00f3zsef","year":"2018","unstructured":"J\u00f3zsef Balogh, Robert Morris, and Wojciech Samotij. 2018. The method of hypergraph containers. In Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018. 3059\u20133092."},{"volume-title":"Testing Graph Properties with the Container Method. In to appear in 2023 IEEE 64rd Annual Symposium on Foundations of Computer Science (FOCS)","author":"Blais Eric","key":"e_1_3_2_1_5_1","unstructured":"Eric Blais and Cameron Seth. 2023. Testing Graph Properties with the Container Method. In to appear in 2023 IEEE 64rd Annual Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_6_1","volume-title":"28th International Colloquium, ICALP 2001 Crete, Greece, July 8\u201312, 2001 Proceedings 28","author":"Czumaj Artur","year":"2001","unstructured":"Artur Czumaj and Christian Sohler. 2001. Testing hypergraph coloring. In Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8\u201312, 2001 Proceedings 28. 493\u2013505."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703431391"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.98"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/090749621"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10078"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Matthew Jenssen Will Perkins and Aditya Potukuchi. 2023. Approximately counting independent sets in bipartite graphs via graph containers. Random Structures & Algorithms.","DOI":"10.1002\/rsa.21145"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9574.1980.tb00681.x"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90204-7"},{"key":"e_1_3_2_1_15_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM","author":"Nakar Yonatan","year":"2018","unstructured":"Yonatan Nakar and Dana Ron. 2018. On the testability of graph partition properties. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2018). 13."},{"key":"e_1_3_2_1_16_1","first-page":"29","article-title":"\u00dcber den Median einiger dikreter Verteilungen und eine damit zusammenh\u00e4ngende monotone Konvergenz","volume":"19","author":"Neumann Peter","year":"1970","unstructured":"Peter Neumann. 1970. \u00dcber den Median einiger dikreter Verteilungen und eine damit zusammenh\u00e4ngende monotone Konvergenz. Wissenschaftliche Zeitschrift der Technischen Universit\u00e4t Dresden, 19 (1970), 29\u201333.","journal-title":"Wissenschaftliche Zeitschrift der Technischen Universit\u00e4t Dresden"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11571155_1"},{"key":"e_1_3_2_1_18_1","volume-title":"Hypergraph containers. Inventiones mathematicae, 201, 3","author":"Saxton David","year":"2015","unstructured":"David Saxton and Andrew Thomason. 2015. Hypergraph containers. Inventiones mathematicae, 201, 3 (2015), 925\u2013992."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.59"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585163"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vancouver BC Canada","acronym":"STOC '24"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649708","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":20,"alternative-id":["10.1145\/3618260.3649708","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649708","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}