{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T19:06:40Z","timestamp":1777576000086,"version":"3.51.4"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T00:00:00Z","timestamp":1724284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T00:00:00Z","timestamp":1724284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-22-1-0356"],"award-info":[{"award-number":["FA9550-22-1-0356"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-P3IA-0001"],"award-info":[{"award-number":["ANR-19-P3IA-0001"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10107-024-02127-7","type":"journal-article","created":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T10:17:50Z","timestamp":1724408270000},"page":"1-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses"],"prefix":"10.1007","volume":"213","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9650-8746","authenticated-orcid":false,"given":"Shuvomoy","family":"Das Gupta","sequence":"first","affiliation":[]},{"given":"Robert M.","family":"Freund","sequence":"additional","affiliation":[]},{"given":"Xu Andy","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Adrien","family":"Taylor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,22]]},"reference":[{"issue":"4","key":"2127_CR1","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extremal problems. USSR Comput. Math. Math. Phys. 9(4), 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"16","key":"2127_CR2","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e8re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle. S\u00e9rie rouge 3(16), 35\u201343 (1969)","journal-title":"Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle. S\u00e9rie rouge"},{"issue":"2","key":"2127_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149\u2013154 (1964)","journal-title":"Comput. J."},{"issue":"6","key":"2127_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"2127_CR5","volume-title":"Practical Methods of Optimization, Volume 1: Unconstrained Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, Volume 1: Unconstrained Optimization. Wiley, New Jersey (1987)"},{"issue":"1","key":"2127_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y-H Dai","year":"1999","unstructured":"Dai, Y.-H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2127_CR7","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2(1), 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"key":"2127_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-42950-8","volume-title":"Nonlinear Conjugate Gradient Methods for Unconstrained Optimization","author":"N Andrei","year":"2020","unstructured":"Andrei, N.: Nonlinear Conjugate Gradient Methods for Unconstrained Optimization. Springer, New York (2020)"},{"issue":"1","key":"2127_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-013-0653-0","volume":"145","author":"Y Drori","year":"2014","unstructured":"Drori, Y., Teboulle, M.: Performance of first-order methods for smooth convex minimization: a novel approach. Math. Program. 145(1), 451\u2013482 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"2127_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-016-1009-3","volume":"161","author":"AB Taylor","year":"2017","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Math. Program. 161(1), 307\u2013345 (2017)","journal-title":"Math. Program."},{"key":"2127_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"2127_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having lipschitz continuous first partial derivatives. Pac. J. Math. 16(1), 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"issue":"1","key":"2127_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1137\/0303013","volume":"3","author":"AA Goldstein","year":"1965","unstructured":"Goldstein, A.A.: On steepest descent. J. Soc. Ind. Appl. Math. Ser. A Control 3(1), 147\u2013151 (1965)","journal-title":"J. Soc. Ind. Appl. Math. Ser. A Control"},{"issue":"2","key":"2127_CR14","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11(2), 226\u2013235 (1969)","journal-title":"SIAM Rev."},{"issue":"2","key":"2127_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P Wolfe","year":"1971","unstructured":"Wolfe, P.: Convergence conditions for ascent methods II: some corrections. SIAM Rev. 13(2), 185\u2013188 (1971)","journal-title":"SIAM Rev."},{"issue":"1","key":"2127_CR16","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16(1), 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2127_CR17","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for newton\u2019s method. SIAM J. Numer. Anal. 23(4), 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"2127_CR18","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2127_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s11075-014-9866-4","volume":"68","author":"S Huang","year":"2015","unstructured":"Huang, S., Wan, Z., Chen, X.: A new nonmonotone line search technique for unconstrained optimization. Numer. Algorithms 68(4), 671\u2013689 (2015)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"2127_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0893-6080(88)90023-8","volume":"1","author":"R Paul Gorman","year":"1988","unstructured":"Paul Gorman, R., Sejnowski, T.J.: Analysis of hidden units in a layered network trained to classify sonar targets. Neural Netw. 1(1), 75\u201389 (1988)","journal-title":"Neural Netw."},{"key":"2127_CR21","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $${O}(1\/k^2)$$. In: Doklady Akademii Nauk (1983)"},{"issue":"1\u20132","key":"2127_CR22","first-page":"1","volume":"5","author":"A d\u2019Aspremont","year":"2021","unstructured":"d\u2019Aspremont, A., Scieur, D., Taylor, A.B.: Acceleration methods. Found. Trends\u00ae Optim. 5(1\u20132), 1\u2013245 (2021)","journal-title":"Found. Trends\u00ae Optim."},{"issue":"1","key":"2127_CR23","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-019-01410-2","volume":"184","author":"Y Drori","year":"2020","unstructured":"Drori, Y., Taylor, A.B.: Efficient first-order methods for convex minimization: a constructive approach. Math. Program. 184(1), 183\u2013220 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"2127_CR24","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1137\/16M108104X","volume":"27","author":"AB Taylor","year":"2017","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case performance of first-order methods for composite convex optimization. SIAM J. Optim. 27(3), 1283\u20131313 (2017)","journal-title":"SIAM J. Optim."},{"key":"2127_CR25","unstructured":"Barr\u00e9, M., Taylor, A.B., d\u2019Aspremont, A.: Complexity guarantees for Polyak steps with momentum. In: Conference on Learning Theory (2020)"},{"key":"2127_CR26","unstructured":"Barr\u00e9, M.: Worst-Case Analysis of Efficient First-Order Methods. PhD Thesis, Universit\u00e9 Paris Sciences & Lettres (2021)"},{"key":"2127_CR27","first-page":"1","volume":"204","author":"G Das","year":"2023","unstructured":"Das, G., Shuvomoy, V.P., Bart, P.G., Ryu, E.K.: Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods. Math. Program. 204, 1\u201373 (2023)","journal-title":"Math. Program."},{"key":"2127_CR28","doi-asserted-by":"crossref","unstructured":"Reuther, A., Kepner, J., Byun, C., Samsi, S., Arcand, W., Bestor, D., Bergeron, B., Gadepally, V., Houle, M., Hubbell, M., Jones, M.: Interactive supercomputing on 40,000 cores for machine learning and data analysis. In: 2018 IEEE High Performance extreme Computing Conference (HPEC), pp. 1\u20136. IEEE (2018)","DOI":"10.1109\/HPEC.2018.8547629"},{"issue":"2","key":"2127_CR29","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"key":"2127_CR30","unstructured":"MOSEK ApS. MOSEK Optimizer API for C 9.3.6 (2019)"},{"key":"2127_CR31","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-Scale Nonlinear Optimization","author":"RH Byrd","year":"2006","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: KNITRO: an integrated package for nonlinear optimization. In: Di Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization, pp. 35\u201359. Springer, New York (2006)"},{"key":"2127_CR32","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual (2023)"},{"key":"2127_CR33","unstructured":"Goujaud, B., Moucer, C., Glineur, Fr., Hendrickx, J.M., Taylor, A.B., Dieuleveut, A.: Pepit: Computer-Assisted Worst-Case Analyses of First-Order Optimization Methods in Python. arXiv:2201.04040 (2022)"},{"key":"2127_CR34","unstructured":"Nemirovski, A.: Information-Based Complexity of Convex Programming. Lecture Notes. http:\/\/www2.isye.gatech.edu\/~nemirovs\/Lec_EMCO.pdf (1994)"},{"key":"2127_CR35","unstructured":"Nemirovski, A.: Optimization II: Numerical Methods for Nonlinear Continuous Optimization. Lecture Notes. http:\/\/www2.isye.gatech.edu\/~nemirovs\/Lect_OptII.pdf (1999)"},{"key":"2127_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"2127_CR37","volume-title":"Numerical Optimization: Theoretical and Practical Aspects","author":"J-F Bonnans","year":"2006","unstructured":"Bonnans, J.-F., Gilbert, J.-C., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.A.: Numerical Optimization: Theoretical and Practical Aspects. Springer, New York (2006)"},{"issue":"1","key":"2127_CR38","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1093\/imanum\/5.1.121","volume":"5","author":"M Al-Baali","year":"1985","unstructured":"Al-Baali, M.: Descent property and global convergence of the fletcher-reeves method with inexact line search. IMA J. Numer. Anal. 5(1), 121\u2013124 (1985)","journal-title":"IMA J. Numer. Anal."},{"key":"2127_CR39","unstructured":"Dai, Y.-H.: Analysis of conjugate gradient methods. Inst. Comput. Math. Sci. Eng. Comput. Chin. Acad. Sci. (1997). (in Chinese)"},{"key":"2127_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2022.100044","volume":"10","author":"R Chan-Renous-Legoubin","year":"2022","unstructured":"Chan-Renous-Legoubin, R., Royer, C.W.: A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression. EURO J. Comput. Optim. 10, 100044 (2022)","journal-title":"EURO J. Comput. Optim."},{"key":"2127_CR41","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: \u201cConvex until proven guilty\u201d: dimension-free acceleration of gradient descent on non-convex functions. In: International Conference on Machine Learning, pp. 654\u2013663. PMLR (2017)"},{"key":"2127_CR42","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, Inc., New York (1987)"},{"issue":"1","key":"2127_CR43","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"issue":"7","key":"2127_CR44","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s11590-016-1087-4","volume":"11","author":"E de Klerk","year":"2017","unstructured":"de Klerk, E., Glineur, F., Taylor, A.B.: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optim. Lett. 11(7), 1185\u20131199 (2017)","journal-title":"Optim. Lett."},{"key":"2127_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course. Applied Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Applied Optimization. Springer, New York (2004)"},{"key":"2127_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2021.101590","volume":"68","author":"Y Drori","year":"2022","unstructured":"Drori, Y., Taylor, A.B.: On the oracle complexity of smooth strongly convex minimization. J. Complex. 68, 101590 (2022)","journal-title":"J. Complex."},{"issue":"3","key":"2127_CR47","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1137\/19M1281368","volume":"30","author":"E de Klerk","year":"2020","unstructured":"de Klerk, E., Glineur, F., Taylor, A.B.: Worst-case convergence analysis of inexact gradient and newton methods through semidefinite programming performance estimation. SIAM J. Optim. 30(3), 2053\u20132082 (2020)","journal-title":"SIAM J. Optim."},{"key":"2127_CR48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)"},{"key":"2127_CR49","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.103","volume":"3","author":"A Meurer","year":"2017","unstructured":"Meurer, A., et al.: Sympy: symbolic computing in python. PeerJ Comput. Sci. 3, e103 (2017)","journal-title":"PeerJ Comput. Sci."},{"key":"2127_CR50","unstructured":"Wolfram\u00a0Research, Inc.: Wolfram Language, Version 14.0. Champaign, IL (2024)"},{"key":"2127_CR51","doi-asserted-by":"crossref","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Performance estimation toolbox (PESTO): automated worst-case analysis of first-order optimization methods. In: Conference on Decision and Control, pp. 1278\u20131283. IEEE (2017)","DOI":"10.1109\/CDC.2017.8263832"},{"key":"2127_CR52","first-page":"1997","volume":"37\u201356","author":"RH Byrd","year":"1997","unstructured":"Byrd, R.H., Liu, G., Nocedal, J.: On the local behavior of an interior point method for nonlinear programming. Numer. Anal. 37\u201356, 1997 (1997)","journal-title":"Numer. Anal."},{"issue":"1","key":"2127_CR53","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"2127_CR54","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"AV Fiacco","year":"1990","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. SIAM, Philadelphia (1990)"},{"key":"2127_CR55","unstructured":"Achterberg, T., Towle, E.: Non-Convex Quadratic Optimization: Gurobi 9.0. (2020). https:\/\/www.gurobi.com\/resource\/non-convex-quadratic-optimization\/"},{"key":"2127_CR56","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972672","volume-title":"Global Optimization: Theory, Algorithms, and Applications","author":"M Locatelli","year":"2013","unstructured":"Locatelli, M., Schoen, F.: Global Optimization: Theory, Algorithms, and Applications. SIAM, Philadelphia (2013)"},{"issue":"2","key":"2127_CR57","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-002-0350-x","volume":"95","author":"HY Benson","year":"2003","unstructured":"Benson, H.Y., Vanderbei, R.J.: Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming. Math. Program. 95(2), 279\u2013302 (2003)","journal-title":"Math. Program."},{"key":"2127_CR58","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization, vol. 6. Athena Scientific, Nashua (1997)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02127-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02127-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02127-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T12:03:57Z","timestamp":1756901037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02127-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,22]]},"references-count":58,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2127"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02127-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,22]]},"assertion":[{"value":"4 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}