{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T18:10:20Z","timestamp":1774635020613,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The amendment procedure and the successive procedure have been widely employed in parliamentary and legislative decision making and have undergone extensive study in the literature from various perspectives. However, investigating them through the lens of computational complexity theory has not been as thoroughly conducted as for many other prevalent voting procedures heretofore. To the best of our knowledge, there is only one paper which explores the complexity of several strategic voting problems under these two procedures, prior to our current work. To provide a better understanding of to what extent the two procedures resist strategic behavior, we study the parameterized complexity of constructive\/destructive control by adding\/deleting voters\/candidates for both procedures. To enhance the generalizability of our results, we also examine a more generalized form of the amendment procedure. Our exploration yields a comprehensive (parameterized) complexity landscape of these problems with respect to numerous parameters.<\/jats:p>","DOI":"10.1007\/s00453-025-01304-0","type":"journal-article","created":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T20:18:41Z","timestamp":1741897121000},"page":"842-907","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Parameterized Complexity of Controlling Amendment and Successive Winners"],"prefix":"10.1007","volume":"87","author":[{"given":"Yongjie","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"1304_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.geb.2014.05.006","volume":"87","author":"J Apesteguia","year":"2014","unstructured":"Apesteguia, J., Ballester, M.A., Masatlioglu, Y.: A foundation for strategic agenda voting. Games Econ. Behav. 87, 91\u201399 (2014)","journal-title":"Games Econ. Behav."},{"key":"1304_CR2","doi-asserted-by":"crossref","unstructured":"Bang-Jensen J., Gutin, G.Z. (Eds.) Classes of Directed Graphs. Springer Monographs in Mathematics. Springer (2018)","DOI":"10.1007\/978-3-319-71840-8"},{"key":"1304_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.3982\/TE2118","volume":"12","author":"S Barber\u00e1","year":"2017","unstructured":"Barber\u00e1, S., Gerber, A.: Sequential voting and agenda manipulation. Theor. Econ. 12, 211\u2013247 (2017)","journal-title":"Theor. Econ."},{"issue":"8\u20139","key":"1304_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"JJ Bartholdi III","year":"1992","unstructured":"Bartholdi, J.J., III., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16(8\u20139), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"1304_CR5","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Erd\u00e9lyi, O.J., Rothe, J.: Control in judgment aggregation. In: STAIRS, pp. 23\u201334 (2012)"},{"key":"1304_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.jcss.2020.03.001","volume":"112","author":"D Baumeister","year":"2020","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Erd\u00e9lyi, O.J., Rothe, J., Selker, A.-K.: Complexity of control in judgment aggregation for uniform premise-based quota rules. J. Comput. Syst. Sci. 112, 13\u201333 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"1304_CR7","doi-asserted-by":"crossref","unstructured":"Baumeister, D. Rothe, J.: Preference aggregation by voting. In:\u00a0Rothe, J. (Ed.) Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, chapter\u00a04, pp. 197\u2013325. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-662-47904-9_4"},{"key":"1304_CR8","volume-title":"The Theory of Committees and Elections","author":"D Black","year":"1958","unstructured":"Black, D.: The Theory of Committees and Elections. Cambridge University Press, Cambridge (1958)"},{"key":"1304_CR9","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.\u00a0L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. In: ESA, pp. 635\u2013646 (2009)","DOI":"10.1007\/978-3-642-04128-0_57"},{"key":"1304_CR10","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1613\/jair.4647","volume":"53","author":"F Brandt","year":"2015","unstructured":"Brandt, F., Brill, M., Hemaspaandra, E., Hemaspaandra, L.A.: Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates. J. Artif. Intell. Res. 53, 439\u2013496 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"1304_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1613\/jair.5407","volume":"59","author":"R Bredereck","year":"2017","unstructured":"Bredereck, R., Chen, J., Niedermeier, R., Walsh, T.: Parliamentary voting procedures: agenda control, manipulation, and uncertainty. J. Artif. Intell. Res. 59, 133\u2013173 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"1304_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103600","volume":"302","author":"M Brill","year":"2022","unstructured":"Brill, M., Schmidt-Kraepelin, U., Suksompong, W.: Margin of victory for tournament solutions. Artif. Intell. 302, Nr.\u00a0103600 (2022)","journal-title":"Artif. Intell."},{"issue":"3","key":"1304_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(01)00207-1","volume":"81","author":"M Cesati","year":"2002","unstructured":"Cesati, M.: Perfect Code is W[1]-complete. Inf. Process. Lett. 81(3), 163\u2013168 (2002)","journal-title":"Inf. Process. Lett."},{"key":"1304_CR14","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1613\/jair.5515","volume":"60","author":"J Chen","year":"2017","unstructured":"Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Elections with few voters: candidate control can be easy. J. Artif. Intell. Res. 60, 937\u20131002 (2017)","journal-title":"J. Artif. Intell. Res."},{"issue":"8","key":"1304_CR15","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","volume":"72","author":"J Chen","year":"2006","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8), 1346\u20131367 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"1304_CR16","unstructured":"Cornaz, D., Galand, L., Spanjaard, O.: Bounded single-peaked width and proportional representation. In: ECAI, pp. 270\u2013275 (2012)"},{"key":"1304_CR17","unstructured":"Cornaz, D., Galand, L., Spanjaard, O.: Kemeny elections with bounded single-peaked or single-crossing width. In: IJCAI, pp. 76\u201382 (2013)"},{"key":"1304_CR18","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.\u00a0V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Lower bounds based on the exponential-time hypothesis. In: Parameterized Algorithms, Chapter\u00a014, pp. 467\u2013521. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3_14"},{"key":"1304_CR19","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: STOC, pp. 624\u2013633 (2014)","DOI":"10.1145\/2591796.2591884"},{"issue":"2","key":"1304_CR20","first-page":"Nr. 13","volume":"11","author":"M Dom","year":"2014","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and IDs. ACM Trans. Algor. 11(2), Nr. 13 (2014)","journal-title":"ACM Trans. Algor."},{"issue":"1\u20132","key":"1304_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: on completeness for W[1]. Theor. Comput. Sci. 141(1\u20132), 109\u2013131 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"1304_CR22","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer, New York (2013)"},{"key":"1304_CR23","doi-asserted-by":"crossref","unstructured":"Downey, R.\u00a0G., Fellows, M.\u00a0R., Stege, U.: Parameterized complexity: a framework for systematically confronting computational intractability. In: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, pp. 49\u201399 (1999)","DOI":"10.1090\/dimacs\/049\/04"},{"key":"1304_CR24","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Hemaspaandra, E., Hemaspaandra, L.A.: More natural models of electoral control by partition. In: ADT, pp. 396\u2013413 (2015)","DOI":"10.1007\/978-3-319-23114-3_24"},{"issue":"2","key":"1304_CR25","doi-asserted-by":"publisher","first-page":"Nr.\u00a041","DOI":"10.1007\/s10458-021-09523-9","volume":"35","author":"G Erd\u00e9lyi","year":"2021","unstructured":"Erd\u00e9lyi, G., Neveling, M., Reger, C., Rothe, J., Yang, Y., Zorn, R.: Towards completing the puzzle: Complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agent Multi-Ag. 35(2), Nr.\u00a041 (2021)","journal-title":"Auton. Agent Multi-Ag."},{"issue":"1","key":"1304_CR26","doi-asserted-by":"publisher","first-page":"Nr.\u00a08","DOI":"10.1007\/s10458-019-09427-9","volume":"34","author":"G Erd\u00e9lyi","year":"2020","unstructured":"Erd\u00e9lyi, G., Reger, C., Yang, Y.: The complexity of bribery and control in group identification. Auton. Agent Multi-Ag. 34(1), Nr.\u00a08 (2020)","journal-title":"Auton. Agent Multi-Ag."},{"key":"1304_CR27","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In:\u00a0Brandt, F., Conitzer, V.,\u00a0Endriss, U.,\u00a0Lang, J., Procaccia, A. (Eds.) Handbook of Computational Social Choice, Chapter\u00a07, pp. 146\u2013168. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.008"},{"key":"1304_CR28","volume-title":"Theory of Voting","author":"R Farquharson","year":"1969","unstructured":"Farquharson, R.: Theory of Voting. Yale University Press, New Haven (1969)"},{"key":"1304_CR29","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","DOI":"10.1145\/285055.285059"},{"key":"1304_CR30","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: WG, pp. 245\u2013256 (2004)","DOI":"10.1007\/978-3-540-30559-0_21"},{"issue":"1","key":"1304_CR31","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous Diophantine approximaiton in combinatorial optimazation. Combinatorica 7(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"1304_CR32","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"5\u20136","key":"1304_CR33","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Anyone but him: the complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"issue":"1","key":"1304_CR34","doi-asserted-by":"publisher","first-page":"235","DOI":"10.3982\/TE2618","volume":"16","author":"S Horan","year":"2021","unstructured":"Horan, S.: Agendas in legislative decision-making. Theor. Econ. 16(1), 235\u2013274 (2021)","journal-title":"Theor. Econ."},{"issue":"3","key":"1304_CR35","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1304_CR36","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"1304_CR37","doi-asserted-by":"crossref","unstructured":"Lin, B.: The parameterized complexity of k-biclique. In: SODA, pp. 605\u2013615 (2015)","DOI":"10.1137\/1.9781611973730.41"},{"issue":"27\u201329","key":"1304_CR38","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1016\/j.tcs.2009.04.004","volume":"410","author":"H Liu","year":"2009","unstructured":"Liu, H., Feng, H., Zhu, D., Luan, J.: Parameterized computational complexity of control problems in voting systems. Theor. Comput. Sci. 410(27\u201329), 2746\u20132753 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1304_CR39","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2013.05.019","volume":"498","author":"H Liu","year":"2013","unstructured":"Liu, H., Zhu, D.: Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems. Theor. Comput. Sci. 498, 115\u2013123 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"1304_CR40","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s10458-016-9339-3","volume":"31","author":"K Magiera","year":"2017","unstructured":"Magiera, K., Faliszewski, P.: How hard is control in single-crossing elections? Auton. Agent Multi-Ag. 31(3), 606\u2013627 (2017)","journal-title":"Auton. Agent Multi-Ag."},{"issue":"4","key":"1304_CR41","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"DC McGarvey","year":"1953","unstructured":"McGarvey, D.C.: A theorem on the construction of voting paradoxes. Econometrica 21(4), 608\u2013610 (1953)","journal-title":"Econometrica"},{"key":"1304_CR42","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R Meir","year":"2008","unstructured":"Meir, R., Procaccia, A.D., Rosenschein, J.S., Zohar, A.: Complexity of strategic behavior in multi-winner elections. J. Artif. Intell. Res. 33, 149\u2013178 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"1304_CR43","doi-asserted-by":"publisher","first-page":"769","DOI":"10.2307\/2110736","volume":"21","author":"NR Miller","year":"1977","unstructured":"Miller, N.R.: Graph-theoretical approaches to the theory of voting. AM. J. Polit. Sci. 21, 769\u2013803 (1977)","journal-title":"AM. J. Polit. Sci."},{"key":"1304_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103508","volume":"298","author":"M Neveling","year":"2021","unstructured":"Neveling, M., Rothe, J.: Control complexity in Borda elections: solving all open cases of offline control and some cases of online control. Artif. Intell. 298, Nr. 103508 (2021)","journal-title":"Artif. Intell."},{"key":"1304_CR45","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"1","key":"1304_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/440391","volume":"25","author":"BE Rasch","year":"2000","unstructured":"Rasch, B.E.: Parliamentary floor voting procedures and agenda setting in Europe. Legis. Stud. Q. 25(1), 3\u201323 (2000)","journal-title":"Legis. Stud. Q."},{"issue":"3\u20134","key":"1304_CR47","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s11127-012-0054-6","volume":"158","author":"BE Rasch","year":"2014","unstructured":"Rasch, B.E.: Insincere voting under the successive procedure. Public Choice 158(3\u20134), 499\u2013511 (2014)","journal-title":"Public Choice"},{"issue":"3","key":"1304_CR48","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/inte.32.3.30.39","volume":"32","author":"CA Tovey","year":"2002","unstructured":"Tovey, C.A.: Tutorial on computational complexity. Interfaces 32(3), 30\u201361 (2002)","journal-title":"Interfaces"},{"key":"1304_CR49","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice-Hall, London (2000)"},{"key":"1304_CR50","unstructured":"Yang, Y.: The complexity of control and bribery in majority judgment. In: AAMAS, pp. 1169\u20131177 (2017)"},{"key":"1304_CR51","unstructured":"Yang, Y.: On the complexity of Borda control in single-peaked elections. In: AAMAS, pp. 1178\u20131186 (2017)"},{"key":"1304_CR52","doi-asserted-by":"crossref","unstructured":"Yang, Y.: Complexity of manipulating and controlling approval-based multiwinner voting. In: IJCAI, pp. 637\u2013643 (2019)","DOI":"10.24963\/ijcai.2019\/90"},{"key":"1304_CR53","unstructured":"Yang, Y.: On the complexity of constructive control under nearly single-peaked preferences. In: ECAI, pp. 243\u2013250 (2020)"},{"key":"1304_CR54","unstructured":"Yang, Y.: On the complexity of controlling amendment and successive winners. In: AAMAS, pp. 1768\u20131770 (2022)"},{"issue":"5","key":"1304_CR55","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s10458-018-9392-1","volume":"32","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Dimitrov, D.: How hard is it to control a group? Auton. Agent Multi-Ag. 32(5), 672\u2013692 (2018)","journal-title":"Auton. Agent Multi-Ag."},{"key":"1304_CR56","unstructured":"Yang, Y., Guo, J.: Controlling elections with bounded single-peaked width. In: AAMAS, pp. 629\u2013636 (2014)"},{"key":"1304_CR57","unstructured":"Yang, Y., Wang, J.: Anyone but them: the complexity challenge for a resolute election controller. In: AAMAS, pp. 1133\u20131141 (2017)"}],"updated-by":[{"DOI":"10.1007\/s00453-025-01328-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T00:00:00Z","timestamp":1748476800000}}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-025-01304-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-025-01304-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-025-01304-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T12:20:36Z","timestamp":1748521236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-025-01304-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,13]]},"references-count":57,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1304"],"URL":"https:\/\/doi.org\/10.1007\/s00453-025-01304-0","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s00453-025-01328-6","asserted-by":"object"}]},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,13]]},"assertion":[{"value":"5 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2025","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00453-025-01328-6","URL":"https:\/\/doi.org\/10.1007\/s00453-025-01328-6","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}