{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:40:03Z","timestamp":1740148803234,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T00:00:00Z","timestamp":1712016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T00:00:00Z","timestamp":1712016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071196"],"award-info":[{"award-number":["12071196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s12190-024-02060-0","type":"journal-article","created":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T11:02:17Z","timestamp":1712055737000},"page":"2361-2386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Average block column action methods for solving least squares problems"],"prefix":"10.1007","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3708-4944","authenticated-orcid":false,"given":"Yu-Qi","family":"Niu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,2]]},"reference":[{"issue":"2","key":"2060_CR1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/TSP.2002.807005","volume":"51","author":"JA Fessler","year":"2003","unstructured":"Fessler, J.A., Sutton, B.P.: Nonuniform fast Fourier transforms using min-max interpolation. IEEE Trans. Signal Process. 51(2), 560\u2013574 (2003)","journal-title":"IEEE Trans. Signal Process."},{"key":"2060_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719277","volume-title":"Principles of Computerized Tomographic Imaging","author":"AC Kak","year":"2001","unstructured":"Kak, A.C., Slaney, M.: Principles of Computerized Tomographic Imaging. SIAM, Philadelphia (2001)"},{"key":"2060_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"\u00c5 Bj\u00f6rck","year":"1996","unstructured":"Bj\u00f6rck, \u00c5.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)"},{"key":"2060_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719284","volume-title":"The Mathematics of Computerized Tomography","author":"F Natterer","year":"2001","unstructured":"Natterer, F.: The Mathematics of Computerized Tomography. SIAM, Philadelphia (2001)"},{"issue":"1","key":"2060_CR5","doi-asserted-by":"crossref","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":"10","key":"2060_CR6","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1109\/42.959302","volume":"20","author":"Y Censor","year":"2001","unstructured":"Censor, Y., Gordon, D., Gordon, R.: BICAV: a block-iterative parallel algorithm for sparse systems with pixel-related weighting. IEEE Trans. Med. Imaging 20(10), 1050\u20131060 (2001)","journal-title":"IEEE Trans. Med. Imaging"},{"doi-asserted-by":"crossref","unstructured":"Censor, Y.: Block-iterative algorithms with diagonally scaled oblique projections for the linear feasibility problem. SIAM J. Matrix Anal. Appl. 24(1) (2002)","key":"2060_CR7","DOI":"10.1137\/S089547980138705X"},{"issue":"8","key":"2060_CR8","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1109\/TIP.2003.815295","volume":"12","author":"M Jiang","year":"2003","unstructured":"Jiang, M., Wang, G.: Convergence of the simultaneous algebraic reconstruction technique (SART). IEEE Trans. Image Process. 12(8), 957\u201361 (2003)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"2060_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIP.2006.887725","volume":"16","author":"J Wang","year":"2007","unstructured":"Wang, J., Zheng, Y.: On the convergence of generalized simultaneous iterative reconstruction algorithms. IEEE Trans. Image Process. 16(1), 1\u20136 (2007)","journal-title":"IEEE Trans. Image Process."},{"issue":"7","key":"2060_CR10","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/TMI.2008.923696","volume":"27","author":"J Gregor","year":"2008","unstructured":"Gregor, J., Benson, T.: Computational analysis and improvement of SIRT. IEEE Trans. Med. Imaging 27(7), 918\u2013924 (2008)","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"11","key":"2060_CR11","doi-asserted-by":"crossref","DOI":"10.1088\/0266-5611\/25\/11\/115011","volume":"25","author":"T Elfving","year":"2009","unstructured":"Elfving, T., Nikazad, T.: Properties of a class of block-iterative methods. Inverse Probl. 25(11), 115011 (2009)","journal-title":"Inverse Probl."},{"issue":"2","key":"2060_CR12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/TIP.2008.2008076","volume":"18","author":"G Qu","year":"2009","unstructured":"Qu, G., Wang, C., Jiang, M.: Necessary and sufficient convergence conditions for algebraic image reconstruction algorithms. IEEE Trans. Image Process. 18(2), 435\u2013440 (2009)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"2060_CR13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.3934\/ipi.2013.7.199","volume":"7","author":"L Grecu","year":"2013","unstructured":"Grecu, L., Popa, C.: Constrained SART algorithm for inverse problems in image reconstruction. Inverse Probl. Imag. 7(1), 199\u2013216 (2013)","journal-title":"Inverse Probl. Imag."},{"key":"2060_CR14","first-page":"525","volume":"273","author":"X-P Guo","year":"2016","unstructured":"Guo, X.-P.: Convergence studies on block iterative algorithms for image reconstruction. Appl. Math. Comput. 273, 525\u2013534 (2016)","journal-title":"Appl. Math. Comput."},{"key":"2060_CR15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0010-4825(76)90066-4","volume":"64","author":"GT Herman","year":"1976","unstructured":"Herman, G.T., Lent, A.: Iterative reconstruction algorithms. Comput. Biol. Med. 64, 273\u2013294 (1976)","journal-title":"Comput. Biol. Med."},{"issue":"4","key":"2060_CR16","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1137\/1023097","volume":"23","author":"Y Censor","year":"1981","unstructured":"Censor, Y.: Row-action methods for huge and sparse systems and their applications. SIAM Rev. 23(4), 444\u2013466 (1981)","journal-title":"SIAM Rev."},{"unstructured":"Kaczmarz, S.: Angen\u00e4herte aufl\u00f6sung von systemen linearer gleichungen. Bull. Int. Acad. Polon. Sci. Lett. A 35, 355\u2013357 (1937)","key":"2060_CR17"},{"issue":"2","key":"2060_CR18","doi-asserted-by":"crossref","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 50(2), 395\u2013403 (2010)","journal-title":"BIT"},{"key":"2060_CR19","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1137\/120889897","volume":"34","author":"A Zouzias","year":"2013","unstructured":"Zouzias, A., Freris, N.: Randomized extended Kaczmarz for solving least squares. SIAM J. Matrix Anal. Appl. 34, 773\u2013793 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2060_CR20","doi-asserted-by":"crossref","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":"3","key":"2060_CR21","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s11075-016-0118-7","volume":"73","author":"S Petra","year":"2016","unstructured":"Petra, S., Popa, C.: Single projection Kaczmarz extended algorithms. Numer. Algorithms 73(3), 791\u2013806 (2016)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"2060_CR22","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1007\/s10543-018-0717-x","volume":"58","author":"DA Lorenz","year":"2018","unstructured":"Lorenz, D.A., Rose, S., Schopfer, F.: The randomized Kaczmarz method with mismatched adjoint. BIT 58(4), 1079\u20131098 (2018)","journal-title":"BIT"},{"issue":"6","key":"2060_CR23","doi-asserted-by":"crossref","first-page":"3541","DOI":"10.1137\/20M1312629","volume":"42","author":"K Du","year":"2020","unstructured":"Du, K., Si, W.-T., Sun, X.-H.: Randomized extended average block Kaczmarz for solving least squares. SIAM J. Sci. Comput. 42(6), 3541\u20133559 (2020)","journal-title":"SIAM J. Sci. Comput."},{"key":"2060_CR24","volume":"370","author":"J-Q Chen","year":"2020","unstructured":"Chen, J.-Q., Huang, Z.-D.: On the error estimate of the randomized double block Kaczmarz method. Appl. Math. Comput. 370, 124907 (2020)","journal-title":"Appl. Math. Comput."},{"key":"2060_CR25","volume":"446","author":"Y Zhang","year":"2023","unstructured":"Zhang, Y., Li, H.: Splitting-based randomized iterative methods for solving indefinite least squares problem. Appl. Math. Comput. 446, 127892 (2023)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2060_CR26","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01930845","volume":"19","author":"\u00c5 Bj\u00f6rck","year":"1979","unstructured":"Bj\u00f6rck, \u00c5., Elfving, T.: Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations. BIT 19(2), 145\u2013163 (1979)","journal-title":"BIT"},{"issue":"20","key":"2060_CR27","doi-asserted-by":"crossref","first-page":"4420","DOI":"10.1364\/AO.33.004420","volume":"33","author":"DW Watt","year":"1994","unstructured":"Watt, D.W.: Column-relaxed algebraic reconstruction algorithm for tomography with noisy data. Appl. Opt. 33(20), 4420\u20137 (1994)","journal-title":"Appl. Opt."},{"issue":"3","key":"2060_CR28","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1007\/s11075-016-0176-x","volume":"74","author":"T Elfving","year":"2017","unstructured":"Elfving, T., Hansen, P.C., Nikazad, T.: Convergence analysis for column-action methods in image reconstruction. Numer. Algor. 74(3), 905\u2013924 (2017)","journal-title":"Numer. Algor."},{"issue":"10","key":"2060_CR29","doi-asserted-by":"crossref","first-page":"6131","DOI":"10.1002\/mma.6358","volume":"43","author":"M Karimpour","year":"2020","unstructured":"Karimpour, M., Nikazad, T.: On the convergence of nonstationary column-oriented version of algebraic iterative methods. Math. Meth. Appl. Sci. 43(10), 6131\u20136139 (2020)","journal-title":"Math. Meth. Appl. Sci."},{"key":"2060_CR30","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1007\/s11075-020-00932-7","volume":"86","author":"T Nikazad","year":"2021","unstructured":"Nikazad, T., Karimpour, M.: Column-oriented algebraic iterative methods for nonnegative constrained least squares problems. Numer. Algor. 86, 1265\u20131284 (2021)","journal-title":"Numer. Algor."},{"issue":"1","key":"2060_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."},{"key":"2060_CR32","doi-asserted-by":"crossref","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."},{"unstructured":"Altman, M.: On the approximate solution of linear algebraic equations. Bulletin de l\u2019Academie Polonaise des Sciences Cl. III 35(4), 365\u2013370 (1957)","key":"2060_CR33"},{"key":"2060_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9180-5","volume-title":"Projectors and Projection Methods","author":"A Gal\u00e1ntai","year":"2004","unstructured":"Gal\u00e1ntai, A.: Projectors and Projection Methods. Springer, New York (2004)"},{"issue":"3","key":"2060_CR35","doi-asserted-by":"crossref","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."},{"issue":"4","key":"2060_CR36","doi-asserted-by":"crossref","first-page":"1660","DOI":"10.1137\/15M1025487","volume":"36","author":"RM Gower","year":"2015","unstructured":"Gower, R.M., Richt\u00e1rik, P.: Randomized iterative methods for linear systems. SIAM J. Matrix Anal. Appl. 36(4), 1660\u20131690 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"2060_CR37","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1137\/16M1077891","volume":"39","author":"A Hefny","year":"2017","unstructured":"Hefny, A., Needell, D., Ramdas, A.: Rows versus columns: randomized Kaczmarz or Gauss-Seidel for ridge regression. SIAM J. Sci. Comput. 39(5), 528\u2013542 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"2060_CR38","first-page":"156","volume":"293","author":"V Edalatpour","year":"2017","unstructured":"Edalatpour, V., Hezari, D., Salkuyeh, D.K.: A generalization of the Gauss-Seidel iteration method for solving absolute value equations. Appl. Math. Comput. 293, 156\u2013167 (2017)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"2060_CR39","doi-asserted-by":"crossref","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":"2060_CR40","volume":"408","author":"K Du","year":"2021","unstructured":"Du, K., Sun, X.-H.: A doubly stochastic block Gauss-Seidel algorithm for solving linear equations. Appl. Math. Comput. 408, 126373 (2021)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"2060_CR41","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11075-005-9010-6","volume":"41","author":"HH Bauschke","year":"2006","unstructured":"Bauschke, H.H., Combettes, P.L., Kruk, S.G.: Extrapolation algorithm for affine-convex feasibility problems. Numer. Algorithms 41(3), 239\u2013274 (2006)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"2060_CR42","doi-asserted-by":"crossref","first-page":"2814","DOI":"10.1137\/18M1167061","volume":"29","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Richt\u00e1rik, P., Patrascu, A.: Randomized projection methods for convex feasibility: conditioning and convergence rates. SIAM J. Optim. 29(4), 2814\u20132852 (2019)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2060_CR43","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1137\/19M1251643","volume":"40","author":"I Necoara","year":"2019","unstructured":"Necoara, I.: Faster randomized block Kaczmarz algorithms. SIAM J. Matrix Anal. Appl. 40(4), 1425\u20131452 (2019)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2060_CR44","doi-asserted-by":"crossref","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 61(1), 337\u2013359 (2021)","journal-title":"BIT"},{"doi-asserted-by":"crossref","unstructured":"Tropp, J.A.: Column subset selection, matrix factorization, and eigenvalue optimization. In: Proceedings of the 2009 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 978\u2013986. SIAM (2009)","key":"2060_CR45","DOI":"10.1137\/1.9781611973068.106"},{"issue":"1\u20132","key":"2060_CR46","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1142\/S1793536911000787","volume":"3","author":"JA Tropp","year":"2011","unstructured":"Tropp, J.A.: Improved analysis of the subsampled randomized hadamard transform. Adv. Adapt. Data Anal. 3(1\u20132), 115\u2013126 (2011)","journal-title":"Adv. Adapt. Data Anal."},{"key":"2060_CR47","doi-asserted-by":"crossref","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: analysisof a randomized block Kaczmarz method. Linear Algebra Appl. 441, 199\u2013221 (2014)","journal-title":"Linear Algebra Appl."},{"issue":"182","key":"2060_CR48","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1090\/S0025-5718-1988-0929546-7","volume":"50","author":"JW Demmel","year":"1988","unstructured":"Demmel, J.W.: The probability that a numerical analysis problem is difficult. Math. Comput. 50(182), 449\u2013480 (1988)","journal-title":"Math. Comput."},{"key":"2060_CR49","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1093\/imanum\/10.4.555","volume":"10","author":"I Koltracht","year":"1990","unstructured":"Koltracht, I., Lancaster, P.: Contraining strategies for linear iterative processes. IMA J. Numer. Anal. 10, 555\u2013567 (1990)","journal-title":"IMA J. Numer. Anal."},{"issue":"8\u20139","key":"2060_CR50","doi-asserted-by":"crossref","first-page":"2247","DOI":"10.1016\/j.laa.2008.06.024","volume":"429","author":"C Popa","year":"2008","unstructured":"Popa, C.: Constrained Kaczmarz extended algorithm for image reconstruction. Linear Algebra Appl. 429(8\u20139), 2247\u20132267 (2008)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2060_CR51","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"2060_CR52","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718836","volume-title":"Discrete Inverse Problems: Insight and Algorithms","author":"PC Hansen","year":"2010","unstructured":"Hansen, P.C.: Discrete Inverse Problems: Insight and Algorithms. SIAM, Philadelphia (2010)"},{"issue":"1","key":"2060_CR53","doi-asserted-by":"crossref","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. Algor. 79(1), 107\u2013137 (2018)","journal-title":"Numer. Algor."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02060-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02060-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02060-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T13:39:31Z","timestamp":1717162771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02060-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,2]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2060"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02060-0","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2024,4,2]]},"assertion":[{"value":"8 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2024","order":4,"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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}