{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T11:48:24Z","timestamp":1787312904432,"version":"build-2736575974"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T00:00:00Z","timestamp":1782086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T00:00:00Z","timestamp":1782086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Research Foundation Flanders","doi-asserted-by":"crossref","award":["G081222N"],"award-info":[{"award-number":["G081222N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"crossref"}]},{"name":"DocPRO4 BOF","award":["48996"],"award-info":[{"award-number":["48996"]}]},{"name":"DocPRO BOF","award":["46929"],"award-info":[{"award-number":["46929"]}]},{"DOI":"10.13039\/501100003130","name":"Research Foundation Flanders","doi-asserted-by":"crossref","award":["12AK924N"],"award-info":[{"award-number":["12AK924N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10957-026-03034-x","type":"journal-article","created":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T11:26:42Z","timestamp":1782127602000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Minimizing Smooth Kurdyka-\u0141ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity"],"prefix":"10.1007","volume":"210","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4206-9789","authenticated-orcid":false,"given":"Masoud","family":"Ahookhosh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9062-8800","authenticated-orcid":false,"given":"Susan","family":"Ghaderi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6554-6969","authenticated-orcid":false,"given":"Alireza","family":"Kabgani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7372-251X","authenticated-orcid":false,"given":"Morteza","family":"Rahimi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,22]]},"reference":[{"issue":"2","key":"3034_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/040605266","volume":"16","author":"PA Absil","year":"2005","unstructured":"Absil, P.A., Mahony, R., Andrews, B.: Convergence of the iterates of descent methods for analytic cost functions. SIAM J. Optim. 16(2), 531\u2013547 (2005). https:\/\/doi.org\/10.1137\/040605266","journal-title":"SIAM J. Optim."},{"issue":"98","key":"3034_CR2","first-page":"1","volume":"22","author":"A Agarwal","year":"2021","unstructured":"Agarwal, A., Kakade, S.M., Lee, J.D., Mahajan, G.: On the theory of policy gradient methods: Optimality, approximation, and distribution shift. J. Mach. Learn. Res. 22(98), 1\u201376 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"3034_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00186-019-00674-w","volume":"89","author":"M Ahookhosh","year":"2019","unstructured":"Ahookhosh, M.: Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity. Math. Methods Oper. Res. 89(3), 319\u2013353 (2019)","journal-title":"Math. Methods Oper. Res."},{"key":"3034_CR4","unstructured":"Ahookhosh, M., Iusem, A., Kabgani, A., Lara, F.: Asymptotic convergence analysis of highorder proximal-point methods beyond sublinear rates. arXiv:2505.20484 (2025)"},{"issue":"1","key":"3034_CR5","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/19M1264783","volume":"31","author":"M Ahookhosh","year":"2021","unstructured":"Ahookhosh, M., Themelis, A., Patrinos, P.: A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima. SIAM J. Optim. 31(1), 653\u2013685 (2021)","journal-title":"SIAM J. Optim."},{"key":"3034_CR6","unstructured":"Allen-Zhu, Z., Li, Y., Song, Z.: A convergence theory for deep learning via over-parameterization. In: International conference on machine learning, pp. 242\u2013252. (2019) . (PMLR)"},{"issue":"3","key":"3034_CR7","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10898-022-01164-w","volume":"84","author":"V Apidopoulos","year":"2022","unstructured":"Apidopoulos, V., Ginatta, N., Villa, S.: Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under polyak-\u0142ojasiewicz condition. J. Global Optim. 84(3), 563\u2013589 (2022)","journal-title":"J. Global Optim."},{"key":"3034_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho, F.J., Fleming, R.M., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. 169, 95\u2013118 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"3034_CR9","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"3034_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"3034_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. CMS Books in Mathematics, Springer (2017)"},{"issue":"3","key":"3034_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10957-025-02816-z","volume":"207","author":"G Bento","year":"2025","unstructured":"Bento, G., Mordukhovich, B., Mota, T., Nesterov, Y.: Convergence of descent optimization algorithms under Polyak-\u0141ojasiewicz-Kurdyka conditions. J. Optim. Theory Appl. 207(3), 41 (2025)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"3034_CR13","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.jmaa.2005.07.068","volume":"321","author":"J Bolte","year":"2006","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: A nonsmooth morse-sard theorem for subanalytic functions. J. Math. Anal. Appl. 321(2), 729\u2013740 (2006)","journal-title":"J. Math. Anal. Appl."},{"issue":"4","key":"3034_CR14","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"3034_CR15","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"3034_CR16","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"3034_CR17","unstructured":"Bu, J., Mesbahi, A., Fazel, M., Mesbahi, M.: Lqr through the lens of first order methods: Discrete-time case. arXiv preprint arXiv:1907.08921 (2019)"},{"issue":"15","key":"3034_CR18","doi-asserted-by":"publisher","first-page":"3754","DOI":"10.1109\/TSP.2014.2330349","volume":"62","author":"L Chen","year":"2014","unstructured":"Chen, L., Gu, Y.: The convergence guarantees of a non-convex approach for sparse recovery. IEEE Trans. Signal Process. 62(15), 3754\u20133767 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"3034_CR19","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1007\/s10957-018-1372-8","volume":"179","author":"D Davis","year":"2018","unstructured":"Davis, D., Drusvyatskiy, D., MacPhee, K.J., Paquette, C.: Subgradient methods for sharp weakly convex functions. J. Optim. Theory Appl. 179, 962\u2013982 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"3034_CR20","doi-asserted-by":"publisher","first-page":"15836","DOI":"10.52202\/068431-1152","volume":"35","author":"I Fatkhullin","year":"2022","unstructured":"Fatkhullin, I., Etesami, J., He, N., Kiyavash, N.: Sharp analysis of stochastic optimization under global Kurdyka-\u0141ojasiewicz inequality. Adv. Neural. Inf. Process. Syst. 35, 15836\u201315848 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"5","key":"3034_CR21","doi-asserted-by":"publisher","first-page":"3887","DOI":"10.1137\/20M1329858","volume":"59","author":"I Fatkhullin","year":"2021","unstructured":"Fatkhullin, I., Polyak, B.: Optimizing static linear feedback: Gradient method. SIAM J. Control. Optim. 59(5), 3887\u20133911 (2021)","journal-title":"SIAM J. Control. Optim."},{"key":"3034_CR22","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka-\u0141ojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165, 874\u2013900 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"3034_CR23","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s10107-022-01809-4","volume":"198","author":"G Garrigos","year":"2023","unstructured":"Garrigos, G., Rosasco, L., Villa, S.: Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry. Math. Program. 198(1), 937\u2013996 (2023)","journal-title":"Math. Program."},{"key":"3034_CR24","unstructured":"Kabgani, A., Ahookhosh, M.: ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order moreau envelope. arXiv (2024). arXiv:2410.19928"},{"key":"3034_CR25","unstructured":"Kabgani, A., Ahookhosh, M.: ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization. arXiv (2025). arXiv:2501.02155"},{"key":"3034_CR26","doi-asserted-by":"crossref","unstructured":"Kabgani, A., Ahookhosh, M.: Moreau envelope and proximal-point methods under the lens of high-order regularization. Set-Valued and Variational. Analysis 33(47), (2025)","DOI":"10.1007\/s11228-025-00785-z"},{"key":"3034_CR27","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition. In: Joint European conference on machine learning and knowledge discovery in databases, pp. 795\u2013811. Springer (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"3034_CR28","unstructured":"Kingma, D.P.: Adam: A method for stochastic optimization, (2014). arXiv:1412.6980 arXiv preprint"},{"issue":"3","key":"3034_CR29","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Annales de l\u2019institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Annales de l\u2019institut Fourier"},{"issue":"5","key":"3034_CR30","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka-\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18(5), 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"key":"3034_CR31","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.sigpro.2018.05.020","volume":"152","author":"Q Liu","year":"2018","unstructured":"Liu, Q., Yang, C., Gu, Y., So, H.C.: Robust sparse recovery via weakly convex optimization in impulsive noise. Signal Process. 152, 84\u201389 (2018)","journal-title":"Signal Process."},{"key":"3034_CR32","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Les \u00e9quations aux d\u00e9riv\u00e9es partielles pp, pp. 87\u201389. (1963)"},{"issue":"5","key":"3034_CR33","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.5802\/aif.1384","volume":"43","author":"S \u0141ojasiewicz","year":"1993","unstructured":"\u0141ojasiewicz, S.: Sur la g\u00e9om\u00e9trie semi- et sous- analytique. Annales de l\u2019institut Fourier 43(5), 1575\u20131595 (1993)","journal-title":"Annales de l\u2019institut Fourier"},{"key":"3034_CR34","unstructured":"Mei, J., Xiao, C., Szepesvari, C., Schuurmans, D.: On the global convergence rates of softmax policy gradient methods. In: International conference on machine learning, pp. 6820\u20136829. (2020) . (PMLR)"},{"key":"3034_CR35","doi-asserted-by":"crossref","unstructured":"Mordukhovich, B.S.: Variational Analysis and Applications, Springer (2018)","DOI":"10.1007\/978-3-319-92775-6"},{"key":"3034_CR36","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull. Soc. Math. France 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. France"},{"issue":"1\u20132","key":"3034_CR37","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152(1\u20132), 381\u2013404 (2015)","journal-title":"Math. Program."},{"key":"3034_CR38","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, vol. 137, Springer (2018)","DOI":"10.1007\/978-3-319-91578-4_2"},{"key":"3034_CR39","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Science & Business Media (2006)"},{"key":"3034_CR40","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01068677","volume":"9","author":"EA Nurminskii","year":"1973","unstructured":"Nurminskii, E.A.: The quasigradient method for the solving of the nonlinear programming problems. Cybernetics 9, 145\u2013150 (1973)","journal-title":"Cybernetics"},{"issue":"5","key":"3034_CR41","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1090\/S0002-9947-96-01544-9","volume":"348","author":"RA Poliquin","year":"1996","unstructured":"Poliquin, R.A., Rockafellar, R.T.: Prox-regular functions in variational analysis. Trans. Am. Math. Soc. 348(5), 1805\u20131838 (1996)","journal-title":"Trans. Am. Math. Soc."},{"key":"3034_CR42","unstructured":"Rahimi, M., Ghaderi, S., Moreau, Y., Ahookhosh, M.: Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery, (2024). arXiv:2501.00427 arXiv preprint"},{"key":"3034_CR43","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer Science & Business Media (2011)"},{"key":"3034_CR44","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10957-020-01653-6","volume":"185","author":"A Rodomanov","year":"2020","unstructured":"Rodomanov, A., Nesterov, Y.: Smoothness parameter of power of euclidean norm. J. Optim. Theory Appl. 185, 303\u2013326 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"3034_CR45","doi-asserted-by":"crossref","unstructured":"Shen, J.J.: Deblurring images: Matrices, spectra, and filtering, (2007)","DOI":"10.1090\/S0025-5718-07-02043-1"},{"issue":"3","key":"3034_CR46","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Forward-backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67(3), 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"3034_CR47","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: Further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018)","journal-title":"SIAM J. Optim."},{"issue":"19","key":"3034_CR48","doi-asserted-by":"publisher","first-page":"5046","DOI":"10.1109\/TSP.2019.2935906","volume":"67","author":"C Yang","year":"2019","unstructured":"Yang, C., Shen, X., Ma, H., Chen, B., Gu, Y., So, H.C.: Weakly convex regularized robust sparse recovery methods with theoretical guarantees. IEEE Trans. Signal Process. 67(19), 5046\u20135061 (2019)","journal-title":"IEEE Trans. Signal Process."},{"key":"3034_CR49","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1007\/s11590-015-0936-x","volume":"10","author":"M Yashtini","year":"2016","unstructured":"Yashtini, M.: On the global convergence rate of the gradient descent method for functions with H\u00f6der continuous gradients. Optimization Letters 10, 1361\u20131370 (2016)","journal-title":"Optimization Letters"},{"issue":"4","key":"3034_CR50","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1007\/s10208-021-09528-6","volume":"22","author":"P Yu","year":"2022","unstructured":"Yu, P., Li, G., Pong, T.K.: Kurdyka-\u0141ojasiewicz exponent via inf-projection. Found. Comput. Math. 22(4), 1171\u20131217 (2022)","journal-title":"Found. Comput. Math."},{"key":"3034_CR51","unstructured":"Yuan, R., Gower, R.M., Lazaric, A.: A general sample complexity analysis of vanilla policy gradient. In: International Conference on Artificial Intelligence and Statistics, pp. 3332\u20133380. (2022) . (PMLR)"},{"key":"3034_CR52","unstructured":"Zeng, J., Ouyang, S., Lau, T.T.K., Lin, S., Yao, Y.: Global convergence in deep learning with variable splitting via the Kurdyka-\u0141ojasiewicz property, vol. 9, (2018). arXiv:1803.00225 arXiv preprint"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03034-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-03034-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03034-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T04:51:06Z","timestamp":1784868666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-03034-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,22]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["3034"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-03034-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,22]]},"assertion":[{"value":"31 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}