{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:45:46Z","timestamp":1775472346930,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T00:00:00Z","timestamp":1727308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T00:00:00Z","timestamp":1727308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["URA-HPC PTDC\/08838\/2022"],"award-info":[{"award-number":["URA-HPC PTDC\/08838\/2022"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The Kaczmarz algorithm is an iterative method that solves linear systems of equations. It stands out among iterative algorithms when dealing with large systems for two reasons. First, at each iteration, the Kaczmarz algorithm uses a single equation, resulting in minimal computational work per iteration. Second, solving the entire system may only require the use of a small subset of the equations. These characteristics have attracted significant attention to the Kaczmarz algorithm. Researchers have observed that randomly choosing equations can improve the convergence rate of the algorithm. This insight led to the development of the Randomized Kaczmarz algorithm and, subsequently, several other variations emerged. In this paper, we extensively analyze the native Kaczmarz algorithm and many of its variations using large-scale systems as benchmarks. Through our investigation, we have verified that, for consistent systems, various row sampling schemes can outperform both the original and Randomized Kaczmarz method. Specifically, sampling without replacement and using quasirandom numbers are the fastest techniques. However, for inconsistent systems, the Conjugate Gradient method for Least-Squares problems overcomes all variations of the Kaczmarz method for these types of systems.<\/jats:p>","DOI":"10.1007\/s11075-024-01945-2","type":"journal-article","created":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T02:02:38Z","timestamp":1727316158000},"page":"2097-2135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Survey of a class of iterative row-action methods: The Kaczmarz method"],"prefix":"10.1007","volume":"99","author":[{"given":"In\u00eas","family":"A. Ferreira","sequence":"first","affiliation":[]},{"given":"Juan","family":"A. Acebr\u00f3n","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Monteiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,26]]},"reference":[{"key":"1945_CR1","doi-asserted-by":"crossref","unstructured":"Kaczmarz, S.: Angen\u00e4herte Aufl\u00f6sung von systemen linearer Gleichungen. Bull. Intern. Acad. Polonaise Sci. Lett., Cl. Sci. Math. Nat. A 35, 355\u2013357 (1937). English translation: Approximate Solution of Systems of Linear Equations. International Journal of Control 57, 1269-1271 (1993)","DOI":"10.1080\/00207179308934446"},{"key":"1945_CR2","doi-asserted-by":"publisher","first-page":"108719","DOI":"10.1016\/j.cpc.2023.108719","volume":"287","author":"D Windisch","year":"2023","unstructured":"Windisch, D., Kelling, J., Juckeland, G., Bieberle, A.: Real-time data processing for ultrafast x-ray computed tomography using modular cuda based pipelines. Comput. Phys. Commun. 287, 108719 (2023)","journal-title":"Comput. Phys. Commun."},{"key":"1945_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40679-017-0040-7","volume":"3","author":"T Bicer","year":"2017","unstructured":"Bicer, T., G\u00fcrsoy, D., Andrade, V.D., Kettimuthu, R., Scullin, W., Carlo, F.D., Foster, I.T.: Trace: a high-throughput tomographic reconstruction engine for large-scale datasets. Adv. Struct. Chem. Imaging 3, 1\u201310 (2017)","journal-title":"Adv. Struct. Chem. Imaging"},{"key":"1945_CR4","volume-title":"Computing and Estimating the Rate of Convergence","author":"JR Senning","year":"2007","unstructured":"Senning, J.R.: Computing and Estimating the Rate of Convergence. Gordon College, Wenham (2007)"},{"issue":"4","key":"1945_CR5","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1137\/15M1014425","volume":"36","author":"A Ma","year":"2015","unstructured":"Ma, A., Needell, D., Ramdas, A.: Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods. SIAM J. Matrix Anal. Appl. 36(4), 1590\u20131604 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1945_CR6","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"T Strohmer","year":"2007","unstructured":"Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15, 262\u2013278 (2007)","journal-title":"J. Fourier Anal. Appl."},{"issue":"2","key":"1945_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10543-010-0265-5","volume":"50","author":"D Needell","year":"2010","unstructured":"Needell, D.: Randomized Kaczmarz solver for noisy linear systems. BIT Numer. Math. 50(2), 395\u2013403 (2010)","journal-title":"BIT Numer. Math."},{"key":"1945_CR8","unstructured":"Schmidt, M.: Notes on Randomized Kaczmarz. Lecture Notes on Randomized Algorithms - The University of British Columbia (2015)"},{"issue":"2","key":"1945_CR9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"J Nutini","year":"2009","unstructured":"Nutini, J., Schmidt, M., Sepehry, B., Koepke, H., Laradji, I., Virani, A.: Convergence rates for greedy Kaczmarz algorithms, and faster randomized Kaczmarz rules using the orthogonality graph. J. Fourier Anal. Appl. 15(2), 262\u2013278 (2009)","journal-title":"J. Fourier Anal. Appl."},{"key":"1945_CR10","doi-asserted-by":"crossref","unstructured":"Sloan, I.H., Joe, S.: Lattice Methods for Multiple Integration. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198534723.001.0001"},{"key":"1945_CR11","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/BF01386213","volume":"2","author":"JH Halton","year":"1960","unstructured":"Halton, J.H.: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. Math. 2, 84\u201390 (1960)","journal-title":"Numer. Math."},{"issue":"5","key":"1945_CR12","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0041-5553(76)90154-3","volume":"16","author":"IM Sobol","year":"1976","unstructured":"Sobol, I.M.: Uniformly distributed sequences with an additional uniform property. USSR Comput. Math. Math. Phys. 16(5), 236\u2013242 (1976)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1945_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01396365","volume":"35","author":"T Elfving","year":"1980","unstructured":"Elfving, T.: Block-iterative methods for consistent and inconsistent linear equations. Numer. Math. 35, 1\u201312 (1980)","journal-title":"Numer. Math."},{"key":"1945_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.laa.2012.12.022","volume":"441","author":"D Needell","year":"2014","unstructured":"Needell, D., Tropp, J.A.: Paved with good intentions: analysis of a randomized block Kaczmarz method. Linear Algebra Appl. 441, 199\u2013221 (2014)","journal-title":"Linear Algebra Appl."},{"key":"1945_CR15","doi-asserted-by":"crossref","unstructured":"Wang, L., Wu, W., Xu, Z., Xiao, J., Yang, Y.: Blasx: a high performance level-3 BLAS library for heterogeneous multi-GPU computing. In: Proceedings of the 2016 International Conference on Supercomputing, pp. 1\u201311 (2016)","DOI":"10.1145\/2925426.2926256"},{"issue":"3","key":"1945_CR16","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.S.: Randomized methods for linear constraints: convergence rates and conditioning. Math. Oper. Res. 35(3), 641\u2013654 (2010)","journal-title":"Math. Oper. Res."},{"key":"1945_CR17","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.laa.2015.06.027","volume":"484","author":"D Needell","year":"2015","unstructured":"Needell, D., Zhao, R., Zouzias, A.: Randomized block Kaczmarz method with projection for solving least squares. Linear Algebra Appl. 484, 322\u2013343 (2015)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1945_CR18","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1137\/120889897","volume":"34","author":"A Zouzias","year":"2013","unstructured":"Zouzias, A., Freris, N.M.: Randomized extended Kaczmarz for solving least squares. SIAM J. Matrix Anal. Appl. 34(2), 773\u2013793 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"1945_CR19","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/090779656","volume":"33","author":"E Coakley","year":"2011","unstructured":"Coakley, E., Rokhlin, V., Tygert, M.: A fast randomized algorithm for orthogonal projection. SIAM J. Sci. Comput. 33(2), 849\u2013868 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1945_CR20","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1137\/17M1137747","volume":"40","author":"Z-Z Bai","year":"2018","unstructured":"Bai, Z.-Z., Wu, W.-T.: On greedy randomized Kaczmarz method for solving large sparse linear systems. SIAM J. Sci. Comput. 40(1), 592\u2013606 (2018)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1945_CR21","doi-asserted-by":"publisher","first-page":"2458","DOI":"10.1002\/nla.2458","volume":"30","author":"Y Yaniv","year":"2023","unstructured":"Yaniv, Y., Moorman, J.D., Swartworth, W., Tu, T., Landis, D., Needell, D.: Selectable set randomized Kaczmarz. Numer. Linear Algebra Appl. 30(1), 2458 (2023)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"1","key":"1945_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10543-020-00824-1","volume":"61","author":"JD Moorman","year":"2021","unstructured":"Moorman, J.D., Tu, T.K., Molitor, D., Needell, D.: Randomized Kaczmarz with averaging. BIT Numer. Math. 61(1), 337\u2013359 (2021)","journal-title":"BIT Numer. Math."},{"issue":"3","key":"1945_CR23","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1137\/040609458","volume":"27","author":"D Gordon","year":"2005","unstructured":"Gordon, D., Gordon, R.: Component-averaged row projections: a robust, block-parallel scheme for sparse linear systems. SIAM J. Sci. Comput. 27(3), 1092\u20131117 (2005)","journal-title":"SIAM J. Sci. Comput."},{"key":"1945_CR24","unstructured":"Liu, J., Wright, S.J., Sridhar, S.: An asynchronous parallel randomized Kaczmarz algorithm. arXiv:1401.4780 (2014)"},{"key":"1945_CR25","unstructured":"Recht, B., Re, C., Wright, S., Niu, F.: Hogwild!: a lock-free approach to parallelizing stochastic gradient descent. Adv. Neural Inf. Process. Syst. 24 (2011)"},{"key":"1945_CR26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1090\/conm\/706\/14216","volume":"706","author":"X Chen","year":"2018","unstructured":"Chen, X.: The Kaczmarz algorithm, row action methods, and statistical learning algorithms. Frames Harmon. Anal. 706, 115\u2013127 (2018)","journal-title":"Frames Harmon. Anal."},{"key":"1945_CR27","unstructured":"Needell, D., Ward, R., Srebro, N.: Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"key":"1945_CR28","first-page":"326","volume":"1","author":"G Cimmino","year":"1938","unstructured":"Cimmino, G.: Cacolo approssimato per le soluzioni dei systemi di equazioni lineari. Ricerca Sci. (Roma) 1, 326\u2013333 (1938)","journal-title":"Ricerca Sci. (Roma)"},{"issue":"4","key":"1945_CR29","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1137\/22M1470463","volume":"65","author":"M Guida","year":"2023","unstructured":"Guida, M., Sbordone, C.: The reflection method for the numerical solution of linear systems. SIAM Rev. 65(4), 1137\u20131151 (2023)","journal-title":"SIAM Rev."},{"key":"1945_CR30","first-page":"253","volume":"2","author":"D Gordon","year":"2018","unstructured":"Gordon, D.: The Cimmino-Kaczmarz equivalence and related results. Appl. Anal. Optim. 2, 253\u2013270 (2018)","journal-title":"Appl. Anal. Optim."},{"key":"1945_CR31","doi-asserted-by":"publisher","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S Agmon","year":"1954","unstructured":"Agmon, S.: The relaxation method for linear inequalities. Can. J. Math. 6, 382\u2013392 (1954)","journal-title":"Can. J. Math."},{"key":"1945_CR32","doi-asserted-by":"publisher","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"TS Motzkin","year":"1954","unstructured":"Motzkin, T.S., Schoenberg, I.J.: The relaxation method for linear inequalities. Can. J. Math. 6, 393\u2013404 (1954)","journal-title":"Can. J. Math."},{"issue":"1","key":"1945_CR33","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C Hildreth","year":"1957","unstructured":"Hildreth, C.: A quadratic programming procedure. Nav. Res. Logist. Q. 4(1), 79\u201385 (1957)","journal-title":"Nav. Res. Logist. Q."},{"key":"1945_CR34","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.cam.2015.04.014","volume":"288","author":"N Jamil","year":"2015","unstructured":"Jamil, N., Chen, X., Cloninger, A.: Hildreth\u2019s algorithm with applications to soft constraints for user interface layout. J. Comput. Appl. Math. 288, 193\u2013202 (2015)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1945_CR35","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1118\/1.595715","volume":"12","author":"RL Siddon","year":"1985","unstructured":"Siddon, R.L.: Fast calculation of the exact radiological path for a three-dimensional CT array. Med. Phys. 12(2), 252\u2013255 (1985)","journal-title":"Med. Phys."},{"issue":"3","key":"1945_CR36","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/0022-5193(70)90109-8","volume":"29","author":"R Gordon","year":"1970","unstructured":"Gordon, R., Bender, R., Herman, G.T.: Algebraic Reconstruction Techniques (ART) for three-dimensional electron microscopy and X-ray photography. J. Theor. Biol. 29(3), 471\u2013481 (1970)","journal-title":"J. Theor. Biol."},{"issue":"4","key":"1945_CR37","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0010-4825(76)90066-4","volume":"6","author":"GT Herman","year":"1976","unstructured":"Herman, G.T., Lent, A.: Iterative reconstruction algorithms. Comput. Biol. Med. 6(4), 273\u2013294 (1976)","journal-title":"Comput. Biol. Med."},{"issue":"1","key":"1945_CR38","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s11075-013-9778-8","volume":"67","author":"MS Andersen","year":"2014","unstructured":"Andersen, M.S., Hansen, P.C.: Generalized row-action methods for tomographic imaging. Numer. Algorithms 67(1), 121\u2013144 (2014)","journal-title":"Numer. Algorithms"},{"key":"1945_CR39","doi-asserted-by":"publisher","first-page":"112672","DOI":"10.1016\/j.cam.2019.112672","volume":"372","author":"N Wu","year":"2020","unstructured":"Wu, N., Xiang, H.: Projected randomized Kaczmarz methods. J. Comput. Appl. Math. 372, 112672 (2020)","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"1945_CR40","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1080\/17445760600604157","volume":"21","author":"D Gordon","year":"2006","unstructured":"Gordon, D.: Parallel ART for image reconstruction in CT using processor arrays. Int. J. Parallel Emergent Distrib. Syst. 21(5), 365\u2013380 (2006)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"1","key":"1945_CR41","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0022-5193(72)90180-4","volume":"36","author":"P Gilbert","year":"1972","unstructured":"Gilbert, P.: Iterative methods for the three-dimensional reconstruction of an object from projections. J. Theor. Biol. 36(1), 105\u2013117 (1972)","journal-title":"J. Theor. Biol."},{"issue":"4","key":"1945_CR42","doi-asserted-by":"publisher","first-page":"2000","DOI":"10.1137\/110834640","volume":"34","author":"T Elfving","year":"2012","unstructured":"Elfving, T., Hansen, P.C., Nikazad, T.: Semiconvergence and relaxation parameters for projected SIRT algorithms. SIAM J. Sci. Comput. 34(4), 2000\u20132017 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1945_CR43","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1177\/016173468400600107","volume":"6","author":"AH Andersen","year":"1984","unstructured":"Andersen, A.H., Kak, A.C.: Simultaneous Algebraic Reconstruction Technique (SART): a superior implementation of the ART algorithm. Ultrason. Imaging 6(1), 81\u201394 (1984)","journal-title":"Ultrason. Imaging"},{"issue":"1","key":"1945_CR44","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11075-017-0430-x","volume":"79","author":"PC Hansen","year":"2018","unstructured":"Hansen, P.C., J\u00f8rgensen, J.S.: AIR Tools II: algebraic iterative reconstruction methods, improved implementation. Numer. Algorithms 79(1), 107\u2013137 (2018)","journal-title":"Numer. Algorithms"},{"key":"1945_CR45","doi-asserted-by":"crossref","unstructured":"Hansen, P.C., J\u00f8rgensen, J., Lionheart, W.R.: Computed tomography: algorithms, insight, and just enough theory. SIAM (2021)","DOI":"10.1137\/1.9781611976670"},{"key":"1945_CR46","doi-asserted-by":"crossref","unstructured":"Hansen, P.C., J\u00f8rgensen, J.S., Rasmussen, P.W.: Stopping rules for algebraic iterative reconstruction methods in computed tomography. In: 2021 21st International Conference on Computational Science and its Applications (ICCSA), pp. 60\u201370 (2021). IEEE","DOI":"10.1109\/ICCSA54496.2021.00019"},{"issue":"5","key":"1945_CR47","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1137\/20M1349011","volume":"43","author":"BS Lith","year":"2021","unstructured":"Lith, B.S., Hansen, P.C., Hochstenbach, M.E.: A twin error Gauge for Kaczmarz\u2019s iterations. SIAM J. Sci. Comput. 43(5), 173\u2013199 (2021)","journal-title":"SIAM J. Sci. Comput."},{"key":"1945_CR48","doi-asserted-by":"crossref","unstructured":"Wallace, T., Sekmen, A.: Deterministic versus randomized Kaczmarz iterative projection. arXiv:1407.5593 (2014)","DOI":"10.1155\/2014\/908984"}],"updated-by":[{"DOI":"10.1007\/s11075-024-01954-1","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T00:00:00Z","timestamp":1728604800000}}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01945-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01945-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01945-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T22:50:04Z","timestamp":1757112604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01945-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,26]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1945"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01945-2","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s11075-024-01954-1","asserted-by":"object"}]},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,26]]},"assertion":[{"value":"30 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2024","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\/s11075-024-01954-1","URL":"https:\/\/doi.org\/10.1007\/s11075-024-01954-1","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 that there are no relevant ethical issues with respect to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"The authors declare that all consent required for the publication of this paper has been granted.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}