{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:37:04Z","timestamp":1778859424312,"version":"3.51.4"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T00:00:00Z","timestamp":1758758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T00:00:00Z","timestamp":1758758400000},"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":["12471294"],"award-info":[{"award-number":["12471294"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10915-025-03069-8","type":"journal-article","created":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T09:38:57Z","timestamp":1758793137000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems"],"prefix":"10.1007","volume":"105","author":[{"given":"Junlin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3037-5367","authenticated-orcid":false,"given":"Zi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,25]]},"reference":[{"key":"3069_CR1","unstructured":"Adil, D., Bullins, B., Jambulapati, A., Sachdeva, S.: Line search-free methods for higher-order smooth monotone variational inequalities (2022). arXiv preprint arXiv:2205.06167"},{"key":"3069_CR2","unstructured":"Arjovsky, M., Chintala, S., Bottou, L.: Wasserstein generative adversarial networks. International Conference on Machine Learning, PMLR, pages 214\u2013223 (2017)"},{"key":"3069_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L., Nemirovski, A.: Robust Optimization, vol. 28. Princeton University Press, Princeton (2009)"},{"key":"3069_CR4","doi-asserted-by":"crossref","unstructured":"Beznosikov, A., Sadiev, A., Gasnikov, A.: Gradient-free methods with inexact oracle for convex-concave stochastic saddle-point problem. International Conference on Mathematical Optimization Theory and Operations Research. Springer, Cham, 105\u2013119 (2020)","DOI":"10.1007\/978-3-030-58657-7_11"},{"issue":"3","key":"3069_CR5","doi-asserted-by":"publisher","first-page":"1884","DOI":"10.1137\/21M1465470","volume":"33","author":"RI Bot\u0328","year":"2023","unstructured":"Bot\u0328, R.I., B\u00f6hm, A.: Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems. SIAM J. Optim. 33(3), 1884\u20131913 (2023)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"3069_CR6","doi-asserted-by":"publisher","first-page":"2208","DOI":"10.1137\/21M1395764","volume":"32","author":"B Bullins","year":"2022","unstructured":"Bullins, B., Lai, K.A.: Higher-order methods for convex-concave min-max optimization and monotone variational inequalities. SIAM J. Optim. 32(3), 2208\u20132229 (2022)","journal-title":"SIAM J. Optim."},{"key":"3069_CR7","unstructured":"Chen, Z., Hu, Z., Li, Q., Wang, Z., Zhou, Y.: A cubic regularization approach for finding local minimax points in nonconvex minimax optimization. Transactions on Machine Learning Research, pages 2835\u20138856 (2023)"},{"issue":"1","key":"3069_CR8","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1137\/19M130563X","volume":"31","author":"FE Curtis","year":"2021","unstructured":"Curtis, F.E., Robinson, D.P., Royer, C.W., Wright, S.J.: Trust-region newton-cg with strong second-order complexity guarantees for nonconvex optimization. SIAM J. Optim. 31(1), 518\u2013544 (2021)","journal-title":"SIAM J. Optim."},{"key":"3069_CR9","unstructured":"Du, S.S., Jin, C., Lee, J.D., Jordan, M.I., Singh, A., Poczos, B.: Gradient descent can take exponential time to escape saddle points. Advances in Neural Information Processing Systems, pages 1068\u20131078 (2017)"},{"key":"3069_CR10","volume-title":"and C","author":"GH Golub","year":"2013","unstructured":"Golub, G.H.: and C. Johns Hopkins University Press, F. Van Loan. Matrix Computations (2013)"},{"issue":"2","key":"3069_CR11","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1287\/moor.2022.1275","volume":"48","author":"R Gao","year":"2023","unstructured":"Gao, R., Kleywegt, A.J.: Distributionally robust stochastic optimization with wasserstein distance. Math. Oper. Res. 48(2), 603\u2013655 (2023)","journal-title":"Math. Oper. Res."},{"key":"3069_CR12","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. Advances in Neural Information Processing Systems, pages 2672\u20132680 (2014)"},{"key":"3069_CR13","doi-asserted-by":"crossref","unstructured":"Gratton, S., Jerad, S., Toint, P.L: Yet another fast variant of Newton\u2019s method for nonconvex optimization. IMA Journal of Numerical Analysis, drae021 (2024)","DOI":"10.1093\/imanum\/drae021"},{"issue":"1","key":"3069_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"JA Hanley","year":"1982","unstructured":"Hanley, J.A., McNeil, B.J.: The meaning and use of the area under a receiver operating characteristic (roc) curve. Radiology 143(1), 29\u201336 (1982)","journal-title":"Radiology"},{"key":"3069_CR15","doi-asserted-by":"crossref","unstructured":"He, C., Jiang, Y., Zhang, C., Ge, D., Jiang, B., Ye, Y.: Homogeneous second-order descent framework: a fast alternative to Newton-type methods (2024). arXiv preprint arXiv:2306.17516","DOI":"10.1007\/s10107-025-02230-3"},{"issue":"2","key":"3069_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-022-01962-0","volume":"91","author":"K Huang","year":"2022","unstructured":"Huang, K., Zhang, J., Zhang, S.: Cubic regularized newton method for the saddle point models: a global and local convergence analysis. J. Sci. Comput. 91(2), 1\u201331 (2022)","journal-title":"J. Sci. Comput."},{"key":"3069_CR17","unstructured":"Huang, K., Zhang, S.: An approximation-based regularized extra-gradient method for monotone variational inequalities (2022). arXiv preprint arXiv: 2210.04440"},{"key":"3069_CR18","doi-asserted-by":"crossref","unstructured":"Jiang, R., Kavis, A., Jin, Q., Sanghavi, S., Mokhtari, A.: Adaptive and optimal second-order optimistic methods for minimax optimization (2024). arXiv preprint arXiv:2406.02016","DOI":"10.52202\/079017-2986"},{"key":"3069_CR19","unstructured":"Jiang, R., Mokhtari, A.: Generalized optimistic methods for convex-concave saddle point problems. arXiv preprint arXiv: 2202.09674 (2022)"},{"key":"3069_CR20","unstructured":"Jiang, Y., He, C., Zhang, C., Ge, D., Jiang, B., Ye, Y.: A universal trust-region method for convex and nonconvex optimization (2023). arXiv preprint arXiv:2311.11489"},{"key":"3069_CR21","first-page":"4880","volume-title":"Minmax optimization: stable limit points of gradient descent ascent are locally optimal","author":"C Jin","year":"2020","unstructured":"Jin, C., Netrapalli, P., Jordan, M.I.: Minmax optimization: stable limit points of gradient descent ascent are locally optimal, pp. 4880\u20134889. International conference on machine learning, PMLR (2020)"},{"issue":"4","key":"3069_CR22","doi-asserted-by":"publisher","first-page":"2558","DOI":"10.1137\/20M1313222","volume":"31","author":"W Kong","year":"2021","unstructured":"Kong, W., Monteiro, R.D.C.: An accelerated inexact proximal point method for solving nonconvex concave min-max problems. SIAM J. Optim. 31(4), 2558\u20132585 (2021)","journal-title":"SIAM J. Optim."},{"key":"3069_CR23","first-page":"747","volume":"12","author":"GM Korpelevich","year":"1976","unstructured":"Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Matecon 12, 747\u2013756 (1976)","journal-title":"Matecon"},{"issue":"4","key":"3069_CR24","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1137\/0613066","volume":"13","author":"J Kuczy\u0144ski","year":"1992","unstructured":"Kuczy\u0144ski, J., Wo\u017aniakowski, H.: Estimating the largest eigenvalue by the power and lanczos algorithms with a random start. SIAM J. Matrix Anal. Appl. 13(4), 1094\u20131122 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3069_CR25","unstructured":"Liu, C., Luo, L.: Regularized Newton methods for monotone variational inequalities with H$$\\ddot{o}$$lder continuous Jacobians (2022). arXiv preprint arXiv:2212.07824"},{"key":"3069_CR26","unstructured":"Lin, T., Jin, C., Jordan, M.I.: On gradient descent ascent for nonconvex-concave minimax problems. International Conference on Machine Learning, PMLR, pages 6083\u20136093 (2020)"},{"key":"3069_CR27","unstructured":"Lin, T., Jin, C., Jordan, M.I.: Near-optimal algorithms for minimax optimization. Conference on Learning Theory, PMLR, pages 2738\u20132779 (2020)"},{"key":"3069_CR28","doi-asserted-by":"crossref","unstructured":"Lin, T., Jordan, M.I.: Perseus: a simple high-order regularization method for variational inequalities. Mathematical Programming, 1\u201342 (2024)","DOI":"10.1007\/s10107-024-02075-2"},{"key":"3069_CR29","unstructured":"Lin, T., Mertikopoulos, P., Jordan, M.I.: Explicit second-order min-max optimization methods with optimal convergence guarantee (2022). arXiv preprint arXiv:2210.12860"},{"key":"3069_CR30","unstructured":"Liu, S., Lu, S., Chen, X., Feng, Y., Xu, K., Al-Dujaili, A., O\u2019Reilly, U.M.: Min-max optimization without gradients: convergence and applications to black-box evasion and poisoning attacks. International conference on machine learning. PMLR, pages 6282\u20136293 (2020)"},{"key":"3069_CR31","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1109\/TSP.2020.2986363","volume":"68","author":"S Lu","year":"2020","unstructured":"Lu, S., Tsaknakis, I., Hong, M., Chen, Y.: Hybrid block successive approximation for one-sided nonconvex min-max problems: algorithms and applications. IEEE Trans. Signal Process. 68, 3676\u20133691 (2020)","journal-title":"IEEE Trans. Signal Process."},{"key":"3069_CR32","unstructured":"Luo, L., Li, Y., Chen, C.: Finding second-order stationary points in nonconvex-strongly-concave minimax optimization. Advances in Neural Information Processing Systems, pages 36667\u201336679 (2022)"},{"issue":"3","key":"3069_CR33","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1137\/22M1488752","volume":"33","author":"K Mishchenko","year":"2023","unstructured":"Mishchenko, K.: Regularized newton method with global $$\\cal{o} (1\/k^2)$$ convergence. SIAM J. Optim. 33(3), 1440\u20131462 (2023)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"3069_CR34","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1137\/11083085X","volume":"22","author":"RDC Monteiro","year":"2012","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of a newton proximal extragradient method for monotone variational inequalities and inclusion problems. SIAM J. Optim. 22(3), 914\u2013935 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3069_CR35","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence $$\\cal{o} (1\/t)$$ for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"key":"3069_CR36","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer (2018)","DOI":"10.1007\/978-3-319-91578-4"},{"key":"3069_CR37","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Cubic regularization of newton\u2019s method for convex problems with constraints. Econometric & Statistical Methods - Special Topics eJournal, Econometrics (2006)","DOI":"10.2139\/ssrn.921825"},{"issue":"2","key":"3069_CR38","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program. 109(2), 319\u2013344 (2007)","journal-title":"Math. Program."},{"key":"3069_CR39","doi-asserted-by":"crossref","unstructured":"Nocedal, J., Wright, S.J.: Numerical optimization. Springer (1999)","DOI":"10.1007\/b98874"},{"key":"3069_CR40","unstructured":"Nouiehed, M., Sanjabi, M., Huang, T., Lee, J.D.: Solving a class of non-convex min-max games using iterative first order methods. Advances in Neural Information Processing Systems, pages 14934\u201314942 (2019)"},{"key":"3069_CR41","doi-asserted-by":"crossref","unstructured":"Ostrovskii, D.M., Lowy, A., Razaviyayn, M.: Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems. SIAM J. Optim. 31(4), 2508\u20132538 (2021)","DOI":"10.1137\/20M1337600"},{"key":"3069_CR42","unstructured":"Ostroukhov, P., Kamalov, R., Dvurechensky, P., Gasnikov, A.: Tensor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities (2020). arXiv preprint arXiv:2012.15595"},{"issue":"1","key":"3069_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01420-0","volume":"185","author":"Y Ouyang","year":"2021","unstructured":"Ouyang, Y., Xu, Y.: Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. Math. Program. 185(1), 1\u201335 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"3069_CR44","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10589-020-00237-4","volume":"78","author":"W Pan","year":"2021","unstructured":"Pan, W., Shen, J., Xu, Z.: An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem. Comput. Optim. Appl. 78(1), 287\u2013306 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"3069_CR45","doi-asserted-by":"crossref","unstructured":"Popov, L.D.: A modification of the Arrow-Hurwicz method for search of saddle points. Mathematical notes of the Academy of Sciences of the USSR 28(5), 845\u2013848 (1980)","DOI":"10.1007\/BF01141092"},{"issue":"3","key":"3069_CR46","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1080\/10556788.2021.1895152","volume":"37","author":"H Rafique","year":"2022","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning. Optimization Methods and Software 37(3), 1087\u20131121 (2022)","journal-title":"Optimization Methods and Software"},{"issue":"2","key":"3069_CR47","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1137\/17M1134329","volume":"28","author":"CW Royer","year":"2018","unstructured":"Royer, C.W., Wright, S.J.: Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim. 28(2), 1448\u20131477 (2018)","journal-title":"SIAM J. Optim."},{"key":"3069_CR48","doi-asserted-by":"crossref","unstructured":"Royer, C.W., O\u2019Neill, M., Wright, S.J.: A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. Math. Program. 180, 451\u2013488 (2020)","DOI":"10.1007\/s10107-019-01362-7"},{"key":"3069_CR49","doi-asserted-by":"crossref","unstructured":"Sadiev, A., Beznosikov, A., Dvurechensky, P., Gasnikov, A.: Zeroth-order algorithms for smooth saddle-point problems. International Conference on Mathematical Optimization Theory and Operations Research. Springer, Cham, 71\u201385 (2021)","DOI":"10.1007\/978-3-030-86433-0_5"},{"key":"3069_CR50","unstructured":"Sinha, A., Namkoong, H., Duchi, J.: Certifiable distributional robustness with principled adversarial training. International Conference on Learning Representations (2018)"},{"key":"3069_CR51","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10898-022-01169-5","volume":"87","author":"J Shen","year":"2023","unstructured":"Shen, J., Wang, Z., Xu, Z.: Zeroth-order single-loop algorithms for nonconvex-linear minimax problems. J. Global Optim. 87, 551\u2013580 (2023)","journal-title":"J. Global Optim."},{"key":"3069_CR52","unstructured":"Thekumparampil, K.K., Jain, P., Netrapalli, P., Oh, S.: Efficient algorithms for smooth minimax optimization. Advances in Neural Information Processing Systems, pages 12680\u201312691 (2019)"},{"key":"3069_CR53","unstructured":"Wang, J., Yang, J., Xu, Z.: A fully parameter-free second-order algorithm for convex-concave minimax problems with optimal iteration complexity (2024). arXiv preprint arXiv:2407.03571"},{"key":"3069_CR54","unstructured":"Wang, Z., Balasubramanian, K., Ma, S., Razaviyayn, M.: Zeroth-order algorithms for nonconvex minimax problems with improved complexities (2020). arXiv preprint arXiv:2001.07819"},{"key":"3069_CR55","unstructured":"Xu, M., Jiang, B., Liu, Y.-F., So, A.M.-C.: A Riemannian alternating descent ascent algorithmic framework for nonconvex-linear minimax problems on Riemannian manifolds (2024). arXiv preprint arXiv:2409.19588"},{"key":"3069_CR56","unstructured":"Xu, T., Wang, Z., Liang, Y., Poor, H.V.: Gradient free minimax optimization: variance reduction and faster convergence (2020). arXiv preprint arXiv:2006.09361"},{"issue":"2","key":"3069_CR57","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1137\/23M1568168","volume":"34","author":"Z Xu","year":"2024","unstructured":"Xu, Z., Wang, Z., Shen, J., Dai, Y.: Derivative-free alternating projection algorithms for general nonconvex-concave minimax problems. SIAM J. Optim. 34(2), 1879\u20131908 (2024)","journal-title":"SIAM J. Optim."},{"issue":"313","key":"3069_CR58","first-page":"1","volume":"24","author":"Z Xu","year":"2023","unstructured":"Xu, Z., Wang, Z., Wang, J., Dai, Y.: Zeroth-order alternating gradient descent ascent algorithms for a class of nonconvex-nonconcave minimax problems. J. Mach. Learn. Res. 24(313), 1\u201325 (2023)","journal-title":"J. Mach. Learn. Res."},{"key":"3069_CR59","doi-asserted-by":"publisher","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. Mathematical Programming, Series A 201, 635\u2013706 (2023)","journal-title":"Mathematical Programming, Series A"},{"key":"3069_CR60","unstructured":"Yang, H., Luo, L., Li, J., Jordan, M.I., Fazel, M.: Accelerating inexact hypergradient descent for bilevel optimization. Workshop on Optimization for Machine Learning (NeurIPS Workshop) (2023)"},{"issue":"11","key":"3069_CR61","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"L Yann","year":"1998","unstructured":"Yann, L., L\u00e9on, B., Yoshua, B., Patrick, H.: Gradient-based learning applied to document recognition. Proceedings of IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proceedings of IEEE"},{"key":"3069_CR62","unstructured":"Yao, T., Xu, Z.: Two trust region type algorithms for solving nonconvex-strongly concave minimax problems. Science China Mathematics (Chinese) (2024). arXiv preprint arXiv:2402.09807"},{"key":"3069_CR63","unstructured":"Ying, Y., Wen, L., Lyu, S.: Stochastic online AUC maximization. Advances in Neural Information Processing Systems, pages 451\u2013459 (2016)"},{"key":"3069_CR64","first-page":"7377","volume":"33","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Xiao, P., Sun, R., Luo, Z.: A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems. Adv. Neural. Inf. Process. Syst. 33, 7377\u20137389 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"3069_CR65","volume-title":"The complexity of nonconvex-strongly-concave minimax optimization","author":"S Zhang","year":"2021","unstructured":"Zhang, S., Yang, J., Guzm\u00e1n, C., Kiyavash, N., He, N.: The complexity of nonconvex-strongly-concave minimax optimization. Uncertainty in Artificial Intelligence, PMLR (2021)"},{"key":"3069_CR66","unstructured":"Zhang, X., Xu, Q., Aybat, N.S.: AGDA+: proximal alternating gradient descent ascent method with a nonmonotone adaptive step-size search for nonconvex minimax problems (2024). arXiv preprint arXiv:2406.14371"},{"key":"3069_CR67","unstructured":"Zheng, T., Zhu, L., So, A.M.-C., Blanchet, J., Li, J.: Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization. Advances in Neural Information Processing Systems 36 (2023)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-03069-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-03069-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-03069-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T16:42:35Z","timestamp":1764693755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-03069-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,25]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["3069"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-03069-8","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,25]]},"assertion":[{"value":"27 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2025","order":6,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":7,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The affiliation for Zi Xu2 should be Zi Xu1,2. It has been corrected","order":8,"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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"41"}}