{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:53:13Z","timestamp":1773798793184,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T00:00:00Z","timestamp":1738281600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T00:00:00Z","timestamp":1738281600000},"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":["12471298"],"award-info":[{"award-number":["12471298"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171479"],"award-info":[{"award-number":["12171479"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shaanxi Fundamental Science Research Project for Mathematics and Physics","award":["23JSQ031"],"award-info":[{"award-number":["23JSQ031"]}]},{"name":"MOE Project of Key Research Institute of Humanities and Social Sciences","award":["22JJD110001"],"award-info":[{"award-number":["22JJD110001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10915-025-02802-7","type":"journal-article","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T11:17:21Z","timestamp":1738322241000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Generalized Asymmetric Forward\u2013Backward\u2013Adjoint Algorithms for Convex\u2013Concave Saddle-Point Problem"],"prefix":"10.1007","volume":"102","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2394-8852","authenticated-orcid":false,"given":"Jianchao","family":"Bai","sequence":"first","affiliation":[]},{"given":"Yang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xue","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Hongchao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,31]]},"reference":[{"key":"2802_CR1","volume-title":"Studies in Linear and Non-linear Programming, Stanford Mathematical Studies in the Social Sciences","author":"K Arrow","year":"1958","unstructured":"Arrow, K., Hurwicz, L., Uzawa, H.: Studies in Linear and Non-linear Programming, Stanford Mathematical Studies in the Social Sciences, vol. II. Stanford University Press, Stanford (1958)"},{"key":"2802_CR2","unstructured":"Banert, S., Upadhyaya,M., Giselsson, P.: The Chambolle\u2013Pock method converges weakly with $$\\theta >1\/2$$ and $$\\tau \\sigma \\Vert L\\Vert ^2<4\/(1+2\\theta )$$ (2023). arXiv:2309.03998v1"},{"key":"2802_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1080\/02331934.2019.1704754","volume":"70","author":"J Bai","year":"2021","unstructured":"Bai, J., Chang, X., Li, J., Xu, F.: Convergence revisit on generalized symmetric ADMM. Optimization 70, 149\u2013168 (2021)","journal-title":"Optimization"},{"key":"2802_CR4","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10589-021-00338-8","volume":"81","author":"J Bai","year":"2022","unstructured":"Bai, J., Hager, W., Zhang, H.: An inexact accelerated stochastic ADMM for separable convex optimization. Comput. Optim. Appl. 81, 479\u2013518 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"2802_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10915-024-02518-0","volume":"99","author":"J Bai","year":"2024","unstructured":"Bai, J., Jia, L., Peng, Z.: A new insight on augmented Lagrangian method with applications in machine learning. J. Sci. Comput. 99, 53 (2024)","journal-title":"J. Sci. Comput."},{"key":"2802_CR6","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s40305-023-00470-8","volume":"11","author":"J Bai","year":"2023","unstructured":"Bai, J., Bian, F., Chang, X., Du, L.: Accelerated stochastic Peaceman\u2013Rachford method for empirical risk minimization. J. Oper. Res. Soc. China 11, 783\u2013807 (2023)","journal-title":"J. Oper. Res. Soc. China"},{"key":"2802_CR7","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6420\/ac0966","volume":"37","author":"F Bian","year":"2021","unstructured":"Bian, F., Liang, J., Zhang, X.: A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization. Inverse Prob. 37, 075009 (2021)","journal-title":"Inverse Prob."},{"key":"2802_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"E Candes","year":"2011","unstructured":"Candes, E., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58, 1\u201337 (2011)","journal-title":"J. ACM"},{"key":"2802_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vision 40, 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vision"},{"key":"2802_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159, 253\u2013287 (2016)","journal-title":"Math. Program."},{"key":"2802_CR11","doi-asserted-by":"crossref","first-page":"2783","DOI":"10.1137\/17M1134834","volume":"28","author":"A Chambolle","year":"2018","unstructured":"Chambolle, A., Ehrhardt, M., Richtarik, P., Schonlieb, C.: Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications. SIAM J. Optim. 28, 2783\u20132808 (2018)","journal-title":"SIAM J. Optim."},{"key":"2802_CR12","doi-asserted-by":"crossref","first-page":"1584","DOI":"10.1137\/21M1420319","volume":"32","author":"X Chang","year":"2022","unstructured":"Chang, X., Yang, J., Zhang, H.: Golden ratio primal-dual algorithm with line search. SIAM J. Optim. 32, 1584\u20131613 (2022)","journal-title":"SIAM J. Optim."},{"key":"2802_CR13","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P., Willsky, A.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim. 21, 572\u2013596 (2011)","journal-title":"SIAM J. Optim."},{"key":"2802_CR14","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158, 460\u2013479 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"2802_CR15","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/20M1379344","volume":"65","author":"L Condat","year":"2023","unstructured":"Condat, L., Kitahara, D., Contreras, A., Hirabayashi, A.: Proximal splitting algorithms for convex optimization: a tour of recent advances, with new twists. SIAM Rev. 65, 375\u2013435 (2023)","journal-title":"SIAM Rev."},{"key":"2802_CR16","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1007\/s10915-015-0048-x","volume":"66","author":"W Deng","year":"2016","unstructured":"Deng, W., Yin, W.: On the global and linear convergence of the generalized alternating direction method of multipliers. J. Sci. Comput. 66, 889\u2013916 (2016)","journal-title":"J. Sci. Comput."},{"key":"2802_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"2802_CR18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite-element approximations. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"2802_CR19","doi-asserted-by":"crossref","first-page":"7110","DOI":"10.1118\/1.4761867","volume":"39","author":"H Gao","year":"2012","unstructured":"Gao, H.: Fast parallel algorithms for the X-ray transform and its adjoint. Med. Phys. 39, 7110\u20137120 (2012)","journal-title":"Med. Phys."},{"key":"2802_CR20","unstructured":"Goldstein, T., Li, M., Yuan, X.: Adaptive primal-dual splitting methods for statistical learning and image processing. NeurIPS, pp.\u00a02089\u20132097 (2015)"},{"key":"2802_CR21","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/110854989","volume":"6","author":"S Hayden","year":"2013","unstructured":"Hayden, S., Stanley, O.: A low patch-rank interpretation of texture. SIAM J. Imaging Sci. 6, 226\u2013262 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"2802_CR22","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $$o(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50, 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"2802_CR23","doi-asserted-by":"crossref","first-page":"2526","DOI":"10.1137\/140963467","volume":"7","author":"B He","year":"2014","unstructured":"He, B., You, Y., Yuan, X.: On the convergence of primal-dual hybrid gradient algorithm. SIAM J. Imaging Sci. 7, 2526\u20132537 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"2802_CR24","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1137\/21M1453463","volume":"15","author":"B He","year":"2022","unstructured":"He, B., Ma, F., Xu, S., Yuan, X.: A generalized primal-dual algorithm with improved convergence condition for saddle point problems. SIAM J. Imaging Sci. 15, 1157\u20131183 (2022)","journal-title":"SIAM J. Imaging Sci."},{"key":"2802_CR25","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1007\/s10851-022-01089-9","volume":"64","author":"B He","year":"2022","unstructured":"He, B., Xu, S., Yuan, X.: On convergence of the Arrow\u2013Hurwicz method for saddle point problems. J. Math. Imaging Vision 64, 662\u2013671 (2022)","journal-title":"J. Math. Imaging Vision"},{"key":"2802_CR26","volume":"140","author":"X He","year":"2024","unstructured":"He, X., Huang, N., Fang, Y.: Non-ergodic convergence rate of an inertial accelerated primal-dual algorithm for saddle point problems. Commun. Nonlinear Sci. Numer. Simulat. 140, 108289 (2024)","journal-title":"Commun. Nonlinear Sci. Numer. Simulat."},{"key":"2802_CR27","unstructured":"Huang, F., Chen, S.: Mini-batch stochastic ADMMs for nonconvex nonsmooth optimization (2019). arXiv: 1802.03284"},{"key":"2802_CR28","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1090\/mcom\/3610","volume":"90","author":"F Jiang","year":"2021","unstructured":"Jiang, F., Cai, X., Wu, Z., Han, D.: Approximate first-order primal-dual algorithms for saddle point problems. Math. Comput. 90, 1227\u20131262 (2021)","journal-title":"Math. Comput."},{"key":"2802_CR29","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1007\/s11075-021-01069-x","volume":"88","author":"F Jiang","year":"2021","unstructured":"Jiang, F., Wu, Z., Cai, X., Zhang, H.: A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems. Numer. Algor. 88, 1109\u20131136 (2021)","journal-title":"Numer. Algor."},{"key":"2802_CR30","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s11075-023-01509-w","volume":"94","author":"F Jiang","year":"2023","unstructured":"Jiang, F., Cai, X., Han, D.: Inexact asymmetric forward\u2013backward\u2013adjoint splitting algorithms for saddle point problems. Numer. Algor. 94, 479\u2013509 (2023)","journal-title":"Numer. Algor."},{"key":"2802_CR31","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1007\/s10898-022-01233-0","volume":"85","author":"F Jiang","year":"2023","unstructured":"Jiang, F., Zhang, Z., He, H.: Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes. J. Glob. Optim. 85, 821\u2013846 (2023)","journal-title":"J. Glob. Optim."},{"key":"2802_CR32","first-page":"747","volume":"12","author":"G Korpelevi\u010d","year":"1976","unstructured":"Korpelevi\u010d, G.: An extragradient method for finding saddle points and for other problems. \u00c8kon. Mat. Metody 12, 747\u2013756 (1976)","journal-title":"\u00c8kon. Mat. Metody"},{"key":"2802_CR33","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10589-017-9909-6","volume":"68","author":"P Latafat","year":"2017","unstructured":"Latafat, P., Patrinos, P.: Asymmetric forward\u2013backward\u2013adjoint splitting for solving monotone inclusions involving three operators. Comput. Optim. Appl. 68, 57\u201393 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"2802_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10444-020-09827-6","volume":"47","author":"Z Li","year":"2021","unstructured":"Li, Z., Yan, M.: New convergence analysis of a primal-dual algorithm with large stepsizes. Adv. Comput. Math. 47, 1\u201320 (2021)","journal-title":"Adv. Comput. Math."},{"key":"2802_CR35","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P Lions","year":"1979","unstructured":"Lions, P., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"2802_CR36","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10107-018-1321-1","volume":"179","author":"D O\u2019Connor","year":"2020","unstructured":"O\u2019Connor, D., Vandenberghe, L.: On the equivalence of the primal-dual hybrid gradient method and Douglas\u2013Rachford splitting. Math. Program. 179, 85\u2013108 (2020)","journal-title":"Math. Program."},{"key":"2802_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"B Polyak","year":"1964","unstructured":"Polyak, B.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phy. 4, 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phy."},{"key":"2802_CR38","volume-title":"Convex Analysis","author":"R Rockafellar","year":"2015","unstructured":"Rockafellar, R.: Convex Analysis. Princeton University Press, Princeton (2015)"},{"key":"2802_CR39","series-title":"Mathematical Programming at Oberwolfach","first-page":"206","volume-title":"Some Continuity Properties of Polyhedral Multifunctions","author":"S Robinson","year":"1981","unstructured":"Robinson, S.: Some Continuity Properties of Polyhedral Multifunctions. Mathematical Programming at Oberwolfach, pp. 206\u2013214. Springer, Berlin (1981)"},{"key":"2802_CR40","doi-asserted-by":"crossref","first-page":"B455","DOI":"10.1137\/20M1343956","volume":"43","author":"H Sun","year":"2021","unstructured":"Sun, H., Tai, X., Yuan, J.: Efficient and convergent preconditioned ADMM for the Potts models. SIAM J. Sci. Comput. 43, B455\u2013B478 (2021)","journal-title":"SIAM J. Sci. Comput."},{"key":"2802_CR41","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao, M., Yuan, X.: Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim. 21, 57\u201381 (2011)","journal-title":"SIAM J. Optim."},{"key":"2802_CR42","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","volume":"38","author":"B V\u0169","year":"2013","unstructured":"V\u0169, B.: A splitting algorithm for dual monotone inclusions involving cocoercive operators. Adv. Comput. Math. 38, 667\u2013681 (2013)","journal-title":"Adv. Comput. Math."},{"key":"2802_CR43","doi-asserted-by":"crossref","first-page":"2998","DOI":"10.1093\/imanum\/drac061","volume":"43","author":"N Wang","year":"2023","unstructured":"Wang, N., Li, J.: A class of preconditioners based on symmetric-triangular decomposition and matrix splitting for generalized saddle point problems. IMA J. Numer. Anal. 43, 2998\u20133025 (2023)","journal-title":"IMA J. Numer. Anal."},{"key":"2802_CR44","unstructured":"Xian, W., Huang, F., Zhang, Y., Huang, H.: A faster decentralized algorithm for nonconvex minimax problems. NeurIPS (2021). https:\/\/openreview.net\/forum?id=rjIjkiyAJao"},{"key":"2802_CR45","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1007\/s12190-022-01779-y","volume":"69","author":"S Xu","year":"2023","unstructured":"Xu, S.: A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming. J. Appl. Math. Comput. 69, 1015\u20131035 (2023)","journal-title":"J. Appl. Math. Comput."},{"key":"2802_CR46","unstructured":"Xu, S.: A search direction inspired primal-dual method for saddle point problems. Optimization Online (2020). https:\/\/optimization-online.org\/2019\/11\/7491\/"},{"key":"2802_CR47","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s10107-022-01919-z","volume":"201","author":"Z Xu","year":"2023","unstructured":"Xu, Z., Zhang, H., Xu, Y., Lan, G.: A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems. Math. Program. 201, 635\u2013706 (2023)","journal-title":"Math. Program."},{"key":"2802_CR48","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$\\ell _1$$-problems in compressive sensing. SIAM J. Sci. Comput. 33, 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"2802_CR49","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1137\/15M1027528","volume":"10","author":"L Yang","year":"2017","unstructured":"Yang, L., Pong, T., Chen, X.: Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background\/foreground extraction. SIAM J. Imaging Sci. 10, 74\u2013110 (2017)","journal-title":"SIAM J. Imaging Sci."},{"key":"2802_CR50","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s10915-010-9408-8","volume":"46","author":"X Zhang","year":"2011","unstructured":"Zhang, X., Burger, M., Osher, S.: A unified primal-dual algorithm framework based on Bregman iteration. J. Sci. Comput. 46, 20\u201346 (2011)","journal-title":"J. Sci. Comput."},{"key":"2802_CR51","volume-title":"An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, CAM Report 08-34","author":"M Zhu","year":"2008","unstructured":"Zhu, M., Chan, T.: An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, CAM Report 08-34. UCLA, Los Angeles, CA (2008)"},{"key":"2802_CR52","doi-asserted-by":"crossref","first-page":"2580","DOI":"10.1137\/21M1408683","volume":"32","author":"Y Zhu","year":"2022","unstructured":"Zhu, Y., Liu, D., Dinh, Q.: New primal-dual algorithms for a class of nonsmooth and nonlinear convex\u2013concave minimax problems. SIAM J. Optim. 32, 2580\u20132611 (2022)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02802-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02802-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02802-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T17:41:51Z","timestamp":1739900511000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02802-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,31]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2802"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02802-7","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,31]]},"assertion":[{"value":"1 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2025","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 have not disclosed any Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"80"}}