{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T05:03:00Z","timestamp":1787893380839,"version":"build-2784847793"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Foundation, United States","award":["1954042"],"award-info":[{"award-number":["1954042"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11222-025-10708-5","type":"journal-article","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T05:45:29Z","timestamp":1756532729000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Random sampling of contingency tables and partitions: Two practical examples of the Burnside process"],"prefix":"10.1007","volume":"35","author":[{"given":"Persi","family":"Diaconis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Howes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,30]]},"reference":[{"issue":"4","key":"10708_CR1","first-page":"5","volume":"148","author":"HC Andersen","year":"2007","unstructured":"Andersen, H.C., Diaconis, P.: Hit and run as a unifying device. Journal de la societe francaise de statistique & revue de statistique appliquee 148(4), 5\u201328 (2007)","journal-title":"Journal de la societe francaise de statistique & revue de statistique appliquee"},{"issue":"3","key":"10708_CR2","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1017\/S0963548315000358","volume":"25","author":"R Arratia","year":"2016","unstructured":"Arratia, R., DeSalvo, S.: Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example. Comb. Probab. Comput. 25(3), 324\u2013351 (2016)","journal-title":"Comb. Probab. Comput."},{"key":"10708_CR3","unstructured":"Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs. Unfinished monograph, recompiled 2014, available at http:\/\/www.stat.berkeley.edu\/~aldous\/RWG\/book.html (2002)"},{"issue":"1","key":"10708_CR4","first-page":"131","volume":"7","author":"A Agresti","year":"1992","unstructured":"Agresti, A.: A survey of exact inference for contingency tables. Stat. Sci. 7(1), 131\u2013153 (1992)","journal-title":"Stat. Sci."},{"issue":"546","key":"10708_CR5","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1080\/01621459.2024.2310181","volume":"119","author":"F Almendra-Hern\u00e1ndez","year":"2024","unstructured":"Almendra-Hern\u00e1ndez, F., De Loera, J.A., Petrovi\u0107, S.: Markov bases: a 25 year update. J. Am. Stat. Assoc. 119(546), 1671\u20131686 (2024). (1\u201316)","journal-title":"J. Am. Stat. Assoc."},{"key":"10708_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0099420","volume-title":"\u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XIII \u2013 1983","author":"DJ Aldous","year":"1985","unstructured":"Aldous, D.J.: Exchangeability and related topics. In: Hennequin, P.L. (ed.) \u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XIII \u2013 1983, pp. 1\u2013198. Springer, Berlin, Heidelberg (1985)"},{"key":"10708_CR7","doi-asserted-by":"publisher","unstructured":"Anders, M., Schweitzer, P.: Parallel computation of combinatorial symmetries. In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference). LIPIcs, vol. 204, pp. 6\u20131618. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.6","DOI":"10.4230\/LIPIcs.ESA.2021.6"},{"key":"10708_CR8","unstructured":"Anders, M., Schweitzer, P., Stie\u00df, J.: Engineering a preprocessor for symmetry detection. CoRR arXiv: 2302.06351 (2023)"},{"issue":"4","key":"10708_CR9","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1093\/biomet\/76.4.633","volume":"76","author":"J Besag","year":"1989","unstructured":"Besag, J., Clifford, P.: Generalized monte carlo significance tests. Biometrika 76(4), 633\u2013642 (1989). https:\/\/doi.org\/10.1093\/biomet\/76.4.633","journal-title":"Biometrika"},{"key":"10708_CR10","unstructured":"Bartholdi, L., Diaconis, P.: An algorithm for uniform generation of unlabeled trees (p\u00f3lya trees), with an extension of cayley\u2019s formula. arXiv:2411.17613 (2024)"},{"issue":"1","key":"10708_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: A fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017)","journal-title":"SIAM Rev."},{"key":"10708_CR12","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1214\/22-AIHP1248","volume":"59","author":"A Ben-Hamou","year":"2023","unstructured":"Ben-Hamou, A., Peres, Y.: Cutoff for permuted markov chains. In: Annales de l\u2019Institut Henri Poincare (B) Probabilites et Statistiques 59, 230\u2013243 (2023). https:\/\/doi.org\/10.1214\/22-AIHP1248. (Institut Henri Poincar\u00e9)","journal-title":"In: Annales de l\u2019Institut Henri Poincare (B) Probabilites et Statistiques"},{"key":"10708_CR13","doi-asserted-by":"publisher","unstructured":"Broder, A.Z.: How hard is it to marry at random?(on the approximation of the permanent). In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 50\u201358 (1986). https:\/\/doi.org\/10.1145\/12130.12136","DOI":"10.1145\/12130.12136"},{"key":"10708_CR14","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s00440-020-01006-4","volume":"178","author":"S Chatterjee","year":"2020","unstructured":"Chatterjee, S., Diaconis, P.: Speeding up markov chains with deterministic jumps. Probab. Theory Relat. Fields 178, 1193\u20131214 (2020)","journal-title":"Probab. Theory Relat. Fields"},{"issue":"3","key":"10708_CR15","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1214\/aop\/1176992088","volume":"15","author":"FR Chung","year":"1987","unstructured":"Chung, F.R., Diaconis, P., Graham, R.L.: Random walks arising in random number generation. Ann. Probab. 15(3), 1148\u20131165 (1987). https:\/\/doi.org\/10.1214\/aop\/1176992088","journal-title":"Ann. Probab."},{"issue":"469","key":"10708_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1198\/016214504000001303","volume":"100","author":"Y Chen","year":"2005","unstructured":"Chen, Y., Diaconis, P., Holmes, S.P., Liu, J.S.: Sequential monte carlo methods for statistical analysis of tables. J. Am. Stat. Assoc. 100(469), 109\u2013120 (2005). https:\/\/doi.org\/10.1198\/016214504000001303. (Accessed 2023-04-17)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"10708_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/2330443X.2020.1806763","volume":"7","author":"M Chikina","year":"2020","unstructured":"Chikina, M., Frieze, A., Mattingly, J.C., Pegden, W.: Separating effect from significance in markov chain tests. Statistics and Public Policy 7(1), 101\u2013114 (2020). https:\/\/doi.org\/10.1080\/2330443X.2020.1806763","journal-title":"Statistics and Public Policy"},{"issue":"11","key":"10708_CR18","doi-asserted-by":"publisher","first-page":"2860","DOI":"10.1073\/pnas.1617540114","volume":"114","author":"M Chikina","year":"2017","unstructured":"Chikina, M., Frieze, A., Pegden, W.: Assessing significance in a markov chain without mixing. Proc. Natl. Acad. Sci. 114(11), 2860\u20132864 (2017). https:\/\/doi.org\/10.1073\/pnas.1617540114","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"10708_CR19","first-page":"1","volume":"31","author":"H Crane","year":"2016","unstructured":"Crane, H.: The ubiquitous ewens sampling formula. Stat. Sci. 31(1), 1\u201319 (2016)","journal-title":"Stat. Sci."},{"issue":"3","key":"10708_CR20","first-page":"845","volume":"13","author":"P Diaconis","year":"1985","unstructured":"Diaconis, P., Efron, B.: Testing for independence in a two-way table: new interpretations of the chi-square statistic. Ann. Stat. 13(3), 845\u2013874 (1985)","journal-title":"Ann. Stat."},{"key":"10708_CR21","first-page":"24","volume":"40","author":"P Donovan","year":"1972","unstructured":"Donovan, P., Freislich, M.: Some evidence for an extension of the brauer-thrall conjecture. Sonderforschungsbereich Theor. Math 40, 24\u201326 (1972)","journal-title":"Sonderforschungsbereich Theor. Math"},{"issue":"4\u20135","key":"10708_CR22","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1017\/S0963548304006315","volume":"13","author":"P Duchon","year":"2004","unstructured":"Duchon, P., Flajolet, P., Louchard, G., Schaeffer, G.: Boltzmann samplers for the random generation of combinatorial structures. Comb. Probab. Comput. 13(4\u20135), 577\u2013625 (2004). https:\/\/doi.org\/10.1017\/S0963548304006315","journal-title":"Comb. Probab. Comput."},{"key":"10708_CR23","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-1-4612-0801-3_3","volume-title":"Discrete Probability and Algorithms","author":"P Diaconis","year":"1995","unstructured":"Diaconis, P., Gangolli, A.: Rectangular arrays with fixed margins. In: Aldous, D., Diaconis, P., Spencer, J., Steele, J.M. (eds.) Discrete Probability and Algorithms, pp. 15\u201341. Springer, New York, NY (1995)"},{"key":"10708_CR24","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.anihpb.2004.09.007","volume":"41","author":"P Diaconis","year":"2005","unstructured":"Diaconis, P.: Analysis of a bose\u2013einstein markov chain. In: Annales de l\u2019Institut Henri Poincare (B) Probability and Statistics 41, 409\u2013418 (2005). https:\/\/doi.org\/10.1016\/j.anihpb.2004.09.007. (Elsevier)","journal-title":"In: Annales de l\u2019Institut Henri Poincare (B) Probability and Statistics"},{"key":"10708_CR25","unstructured":"Dittmer, S.J.: Counting Linear Extensions and Contingency Tables. University of California, Los Angeles, Los Angeles, CA (2019). https:\/\/escholarship.org\/uc\/item\/80k2b78q"},{"issue":"4","key":"10708_CR26","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/(SICI)1098-2418(199707)10:4<487::AID-RSA4>3.0.CO;2-Q","volume":"10","author":"M Dyer","year":"1997","unstructured":"Dyer, M., Kannan, R., Mount, J.: Sampling contingency tables. Random Structures & Algorithms 10(4), 487\u2013506 (1997)","journal-title":"Random Structures & Algorithms"},{"key":"10708_CR27","doi-asserted-by":"publisher","first-page":"403","DOI":"10.53733\/134","volume":"52","author":"P Diaconis","year":"2021","unstructured":"Diaconis, P., Malliaris, M.: Complexity and randomness in the heisenberg groups (and beyond). New Zealand Journal of Mathematics 52, 403\u2013426 (2021)","journal-title":"New Zealand Journal of Mathematics"},{"key":"10708_CR28","doi-asserted-by":"publisher","unstructured":"Drmota, M.: Random Trees: an Interplay Between Combinatorics and Probability. Springer, Vienna (2009). https:\/\/doi.org\/10.1007\/978-3-211-75357-6","DOI":"10.1007\/978-3-211-75357-6"},{"key":"10708_CR29","doi-asserted-by":"publisher","unstructured":"Drozd, J.A.: Tame and wild matrix problems. In: Dlab, V., Gabriel, P. (eds.) Representation Theory II, pp. 242\u2013258. Springer, Berlin, Heidelberg (1980). https:\/\/doi.org\/10.1007\/BFb0088467","DOI":"10.1007\/BFb0088467"},{"key":"10708_CR30","doi-asserted-by":"publisher","unstructured":"Diaconis, P., Sturmfels, B.: Algebraic algorithms for sampling from conditional distributions. Ann. Stat. 26(1), 363\u2013397 (1998). https:\/\/doi.org\/10.1214\/aos\/1030563990","DOI":"10.1214\/aos\/1030563990"},{"key":"10708_CR31","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.jalgebra.2021.05.010","volume":"607","author":"P Diaconis","year":"2022","unstructured":"Diaconis, P., Simper, M.: Statistical enumeration of groups by double cosets. J. Algebra 607, 214\u2013246 (2022)","journal-title":"J. Algebra"},{"key":"10708_CR32","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Tung, N.: Poisson approximation for large permutation groups (2024) arXiv: 2408.06611 math.PR]","DOI":"10.1016\/j.aam.2025.102883"},{"issue":"2","key":"10708_CR33","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s11139-021-00482-z","volume":"61","author":"P Diaconis","year":"2020","unstructured":"Diaconis, P., Zhong, C.: Hahn polynomials and the burnside process. The Ramanujan Journal 61(2), 567\u2013595 (2020). (1\u201329)","journal-title":"The Ramanujan Journal"},{"key":"10708_CR34","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Zhong, C.: Counting the number of group orbits by marrying the Burnside process with importance sampling (2025). arXiv: 2501.11731","DOI":"10.1016\/j.aam.2025.102955"},{"key":"10708_CR35","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 1, 3rd edn. Wiley, New York, NY (1968)"},{"key":"10708_CR36","doi-asserted-by":"publisher","unstructured":"Flajolet, P., Fusy, E., Pivoteau, C.: Boltzmann Sampling of Unlabelled Structures, pp. 201\u2013211 (2007). https:\/\/doi.org\/10.1137\/1.9781611972979.5","DOI":"10.1137\/1.9781611972979.5"},{"key":"10708_CR37","unstructured":"Fisher, R.A.: Statistical Methods for Research Workers. Springer, Edinburgh (1970)"},{"issue":"2","key":"10708_CR38","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1090\/S0002-9947-1993-1094553-1","volume":"337","author":"B Fristedt","year":"1993","unstructured":"Fristedt, B.: The structure of random partitions of large integers. Trans. Am. Math. Soc. 337(2), 703\u2013735 (1993)","journal-title":"Trans. Am. Math. Soc."},{"key":"10708_CR39","doi-asserted-by":"crossref","unstructured":"Goldberg, L.A., Jerrum, M.: The \u2018burnside process\u2019 converges slowly. Comb. Probab. Comput. 11(1), 21\u201334 (2002)","DOI":"10.1017\/S096354830100493X"},{"issue":"1","key":"10708_CR40","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01068228","volume":"26","author":"P Gudivok","year":"1990","unstructured":"Gudivok, P., Kapitonova, Y.V., Polyak, S., Rud\u2019ko, V., Tsitkin, A.: Classes of conjugate elements of the unitriangular group. Cybernetics 26(1), 47\u201357 (1990)","journal-title":"Cybernetics"},{"issue":"2","key":"10708_CR41","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1006\/inco.1993.1045","volume":"105","author":"LA Goldberg","year":"1993","unstructured":"Goldberg, L.A.: Automating p\u00f3lya theory: The computational complexity of the cycle index polynomial. Inf. Comput. 105(2), 268\u2013288 (1993)","journal-title":"Inf. Comput."},{"key":"10708_CR42","unstructured":"Holtzen, S., Millstein, T., Van den Broeck, G.: Generating and sampling orbits for lifted probabilistic inference. In: Adams, R.P., Gogate, V. (eds.) Proceedings of The 35th Uncertainty in Artificial Intelligence Conference. Proceedings of Machine Learning Research, vol. 115, pp. 985\u2013994. PMLR, (2020). https:\/\/proceedings.mlr.press\/v115\/holtzen20a.html Tel Aviv, Israel"},{"key":"10708_CR43","unstructured":"Howes, M.: Markov chain monte carlo significance tests. arXiv preprint arXiv:2310.04924 (2023)"},{"issue":"1","key":"10708_CR44","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1214\/21-AOP1532","volume":"50","author":"J Hermon","year":"2022","unstructured":"Hermon, J., Sly, A., Sousi, P.: Universality of cutoff for graphs with an added random matching. Ann. Probab. 50(1), 203\u2013240 (2022). https:\/\/doi.org\/10.1214\/21-AOP1532","journal-title":"Ann. Probab."},{"key":"10708_CR45","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Uniform sampling modulo a group of symmetries using markov chain simulation. In: Friedman, J. (ed.) Expanding Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 10, pp. 37\u201347. American Mathematical Society, Princeton, NJ (1993). https:\/\/www.lfcs.inf.ed.ac.uk\/reports\/93\/ECS-LFCS-93-272\/ECS-LFCS-93-272.ps","DOI":"10.1090\/dimacs\/010\/04"},{"key":"10708_CR46","unstructured":"James, G.D., Kerber, A.: The Representation Theory of the Symmetric Groups. Encyclopedia of Mathematics and its Applications, vol. 16. Cambridge University Press, Cambridge (1981)"},{"key":"10708_CR47","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"MR Jerrum","year":"1986","unstructured":"Jerrum, M.R., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 169\u2013188 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"10708_CR48","doi-asserted-by":"publisher","unstructured":"Keller, T.M.: In: Campbell, C.M., Robertson, E.F., Smith, G.C.E. (eds.) Orbits in finite group actions. London Mathematical Society Lecture Note Series, pp. 306\u2013331. Cambridge University Press, Cambridge (2003). https:\/\/doi.org\/10.1017\/CBO9780511542787.003","DOI":"10.1017\/CBO9780511542787.003"},{"key":"10708_CR49","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Undergraduate Texts in Mathematics, vol. 26. Springer, New York, NY (1976)"},{"key":"10708_CR50","volume-title":"Theory of Point Estimation","author":"EL Lehmann","year":"1998","unstructured":"Lehmann, E.L., Casella, G.: Theory of Point Estimation. Springer, New York, NY (1998)"},{"key":"10708_CR51","doi-asserted-by":"publisher","unstructured":"Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms: for Computers and Calculators, 2nd edn. Academic Press, New York, NY (1978). https:\/\/doi.org\/10.1016\/C2013-0-11243-3","DOI":"10.1016\/C2013-0-11243-3"},{"key":"10708_CR52","unstructured":"Paguyo, J.: Mixing times of a burnside process markov chain on set partitions. arXiv preprint arXiv:2207.14269 (2022)"},{"issue":"1","key":"10708_CR53","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10959-020-01049-2","volume":"35","author":"J Rahmani","year":"2022","unstructured":"Rahmani, J.: Mixing times for the commuting chain on ca groups. J. Theor. Probab. 35(1), 457\u2013483 (2022)","journal-title":"J. Theor. Probab."},{"key":"10708_CR54","doi-asserted-by":"crossref","unstructured":"Suzuki, M.: Group Theory I vol. 247. Springer, New York, NY (1982)","DOI":"10.1007\/978-3-642-61804-8"},{"key":"10708_CR55","unstructured":"Tung, N.: Cutting a unit square and permuting blocks. arXiv preprint arXiv:2501.13844 (2025)"},{"key":"10708_CR56","unstructured":"Zhong, C.: An Ewens deformation of a Bose-Einstein Markov chain. In preperation (2025)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-025-10708-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-025-10708-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-025-10708-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T07:17:20Z","timestamp":1762327040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-025-10708-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"references-count":56,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["10708"],"URL":"https:\/\/doi.org\/10.1007\/s11222-025-10708-5","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,30]]},"assertion":[{"value":"13 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"181"}}