{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:10:04Z","timestamp":1750695004794,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","funder":[{"name":"New Cornerstone Science Foundation","award":[""],"award-info":[{"award-number":[""]}]},{"name":"NSFC Young Student Basic Research Program (PhD candidate)","award":[""],"award-info":[{"award-number":[""]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718260","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T23:34:42Z","timestamp":1750030482000},"page":"879-890","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Rapid Mixing at the Uniqueness Threshold"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5844-8662","authenticated-orcid":false,"given":"Xiaoyu","family":"Chen","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6112-2888","authenticated-orcid":false,"given":"Zongchen","family":"Chen","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9204-7794","authenticated-orcid":false,"given":"Yitong","family":"Yin","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7324-2875","authenticated-orcid":false,"given":"Xinyuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3180298"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384317"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520048"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.181"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1367696"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2024.199.1.4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Alexander Barvinok. 2016. Combinatorics and complexity of partition functions (Algorithms and Combinatorics Vol. 30). Springer Cham.","DOI":"10.1007\/978-3-319-51829-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.22172"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.145"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548318000238"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10959-006-0016-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5802\/afst.1460"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2224-8_7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00022"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00062"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.CH170"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00018"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.178"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00053"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451035"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M136685X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.46298\/theoretics.24.16"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOP1453"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-009-0781-9"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701383844"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-021-01085-x"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","unstructured":"Andreas Galanis Alkis Kalavasis and Anthimos Vardis Kandiros. 2024. On sampling from Ising models with spectral constraints. arXiv preprint arXiv:2407.07645 https:\/\/doi.org\/10.48550\/arXiv.2407.07645 10.48550\/arXiv.2407.07645","DOI":"10.48550\/arXiv.2407.07645"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785964"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000401"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222066"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-019-3847-0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.180"},{"key":"e_1_3_2_1_33_1","volume-title":"Conference on Learning Theory, COLT","author":"Lee Yin Tat","year":"2021","unstructured":"Yin Tat Lee, Ruoqi Shen, and Kevin Tian. 2021. Structured Logconcave Sampling with a Restricted Gaussian Oracle. In Conference on Learning Theory, COLT 2021, Boulder, Colorado, USA. PMLR, 2993\u20133050."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-008-0189-z"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"David A Levin and Yuval Peres. 2017. Markov chains and mixing times. 107 American Mathematical Soc..","DOI":"10.1090\/mbk\/107"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.APPROX"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-012-1460-9"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Andrea Montanari. 2023. Sampling diffusions and stochastic localization. arXiv preprint arXiv:2305.10690 https:\/\/doi.org\/10.48550\/ARXIV.2305.10690 10.48550\/ARXIV.2305.10690","DOI":"10.48550\/ARXIV.2305.10690"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-007-0131-9"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1307\/mmj"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/314500.314945"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.34"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.56"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2019.02.001"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.37236\/1552"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Prague Czechia","acronym":"STOC '25"},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:46:54Z","timestamp":1750693614000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":46,"alternative-id":["10.1145\/3717823.3718260","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718260","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}