{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:07:09Z","timestamp":1787504829677,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61722207, 61672275, 61832003, 62002231"],"award-info":[{"award-number":["61722207, 61672275, 61832003, 62002231"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFB1003202"],"award-info":[{"award-number":["2018YFB1003202"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451101","type":"proceedings-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T21:26:13Z","timestamp":1623792373000},"page":"1565-1578","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Sampling constraint satisfaction solutions in the local lemma regime"],"prefix":"10.1145","author":[{"given":"Weiming","family":"Feng","sequence":"first","affiliation":[{"name":"Nanjing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun","family":"He","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology at Chinese Academy of Sciences, China \/ University of Chinese Academy of Sciences, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yitong","family":"Yin","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818352"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Dimitris Achlioptas Fotis Iliopoulos and Alistair Sinclair. 2019. Beyond the Lov\u00e1sz local lemma: Point to set correlations and their algorithmic applications. In FOCS. Pages 725\u2013744. https:\/\/doi.org\/10.1109\/FOCS.2019.00049 10.1109\/FOCS.2019.00049","DOI":"10.1109\/FOCS.2019.00049"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020403"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020402"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1083906"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/050644033"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20204"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646111"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200010"},{"key":"e_1_3_2_1_11_1","first-page":"627","volume-title":"Keszthely, 1973; dedicated to P. Erd\\H os on his 60th birthday)","author":"L\u00e1szl\u00f3 Lov\u00e1sz Paul","year":"1975","unstructured":"Paul Erd\\H os and L\u00e1szl\u00f3 Lov\u00e1sz. 1975. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\\H os on his 60th birthday), Vol. II. Pages 609\u2013627. Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10."},{"key":"e_1_3_2_1_12_1","volume-title":"Fast sampling and counting k-SAT solutions in the local lemma regime. arXiv preprint arXiv:1911.01319","author":"Feng Weiming","year":"2019","unstructured":"Weiming Feng, Heng Guo, Yitong Yin, and Chihao Zhang. 2019. Fast sampling and counting k-SAT solutions in the local lemma regime. arXiv preprint arXiv:1911.01319, 2019."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Weiming Feng Heng Guo Yitong Yin and Chihao Zhang. 2020. Fast sampling and counting k-SAT solutions in the local lemma regime. In STOC. ACM. Pages 854\u2013867. https:\/\/doi.org\/10.1145\/3357713.3384255 10.1145\/3357713.3384255","DOI":"10.1145\/3357713.3384255"},{"key":"e_1_3_2_1_14_1","volume-title":"Sampling Constraint Satisfaction Solutions in the Local Lemma Regime. arXiv preprint arXiv:2011.03915","author":"Feng Weiming","year":"2020","unstructured":"Weiming Feng, Kun He, and Yitong Yin. 2020. Sampling Constraint Satisfaction Solutions in the Local Lemma Regime. arXiv preprint arXiv:2011.03915, 2020."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.06.005"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.06.001"},{"key":"e_1_3_2_1_17_1","volume-title":"Peugniez","author":"Frisch Alan M.","year":"2001","unstructured":"Alan M. Frisch and Timothy J. Peugniez. 2001. Solving Non-Boolean Satisfiability Problems with Stochastic Local Search. In IJCAI. Pages 282\u2013290."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2020.53"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3310131"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1202955"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147211"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049702"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20914"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3392035"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3039869"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2017.v013a017"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342222"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1167176"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/14-AAP1015"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993669"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1093306"},{"key":"e_1_3_2_1_33_1","unstructured":"Vladimir Kolmogorov. 2018. A Faster Approximation Algorithm for the Gibbs Partition Function. In COLT. PMLR. Pages 228\u2013249."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","unstructured":"David A Levin and Yuval Peres. 2017. Markov chains and mixing times. American Mathematical Soc.. https:\/\/doi.org\/10.1090\/mbk\/107 10.1090\/mbk\/107","DOI":"10.1090\/mbk"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2003.1257732"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3268930"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Michael Molloy and Bruce Reed. 1998. Further algorithmic aspects of the local lemma. In STOC. Pages 524\u2013529. https:\/\/doi.org\/10.1145\/276698.276866 10.1145\/276698.276866","DOI":"10.1145\/276698.276866"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","unstructured":"Robin A. Moser. 2009. A constructive proof of the Lov\u00e1sz local lemma. In STOC. Pages 343\u2013350. https:\/\/doi.org\/10.1145\/1536414.1536462 10.1145\/1536414.1536462","DOI":"10.1145\/1536414.1536462"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579368"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516520"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvckq7xb"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451101","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:24:53Z","timestamp":1750181093000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":43,"alternative-id":["10.1145\/3406325.3451101","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451101","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}