{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:22Z","timestamp":1781031442446,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2147094"],"award-info":[{"award-number":["2147094"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2440509"],"award-info":[{"award-number":["2440509"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2246780"],"award-info":[{"award-number":["2246780"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800834","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1236-1241","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Mixing of General Biased Adjacent Transposition Chains"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4236-9407","authenticated-orcid":false,"given":"Reza","family":"Gheissari","sequence":"first","affiliation":[{"name":"Northwestern University, Chicago, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3534-8739","authenticated-orcid":false,"given":"Holden","family":"Lee","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4741-8303","authenticated-orcid":false,"given":"Eric","family":"Vigoda","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0068322"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-05-03610-X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Prateek Bhakta Sarah Miracle Dana Randall and Amanda Pascoe Streib. 2012. Mixing times of Markov chains for self-organizing lists and biased permutations. arXiv:1204.3239.","DOI":"10.1137\/1.9781611973105.1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21082"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00333-1"},{"key":"e_1_3_2_1_6_1","first-page":"230","article-title":"Kardar-Parisi-Zhang universality","volume":"63","author":"Corwin Ivan","year":"2016","unstructured":"Ivan Corwin. 2016. Kardar-Parisi-Zhang universality. Notices of the AMS, 63, 3 (2016), 230\u2013239.","journal-title":"Notices of the AMS"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176989013"},{"key":"e_1_3_2_1_8_1","volume-title":"An interesting spectral gap problem, from Jim Fill. arxiv:2508.12557 Notes from","author":"Fill James Allen","year":"2003","unstructured":"James Allen Fill. 2003. An interesting spectral gap problem, from Jim Fill. arxiv:2508.12557 Notes from 2003, posted to arXiv in 2025"},{"key":"e_1_3_2_1_9_1","unstructured":"Reza Gheissari Holden Lee and Eric Vigoda. 2025. Mixing of general biased adjacent transposition chains. arXiv preprint arXiv:2511.02725."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS).","author":"Haddadan Shahrzad","year":"2017","unstructured":"Shahrzad Haddadan and Peter Winkler. 2017. Mixing Time for Some Adjacent Transposition Markov Chains. In Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205050"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/5505.5507"},{"key":"e_1_3_2_1_13_1","series-title":"SIAM journal on computing, 18, 6","volume-title":"Approximating the permanent","author":"Jerrum Mark","year":"1989","unstructured":"Mark Jerrum and Alistair Sinclair. 1989. Approximating the permanent. SIAM journal on computing, 18, 6 (1989), 1149\u20131178."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511780516"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOP1290"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOP1004"},{"key":"e_1_3_2_1_18_1","volume-title":"Levin and Yuval Peres","author":"David","year":"2017","unstructured":"David A. Levin and Yuval Peres. 2017. Markov chains and mixing times. American Mathematical Society."},{"key":"e_1_3_2_1_19_1","volume-title":"Interacting particle systems. 2","author":"Liggett Thomas M","unstructured":"Thomas M Liggett. 1985. Interacting particle systems. 2, Springer."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48115-7_2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77404-6_59"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2025.v021a003"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(70)90034-4"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v8-1071"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800834","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:02:58Z","timestamp":1781028178000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":24,"alternative-id":["10.1145\/3798129.3800834","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800834","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}