{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:50:57Z","timestamp":1782971457505,"version":"3.54.5"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T00:00:00Z","timestamp":1738713600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T00:00:00Z","timestamp":1738713600000},"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":["12301408"],"award-info":[{"award-number":["12301408"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2023YFA1009300"],"award-info":[{"award-number":["2023YFA1009300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["12125108"],"award-info":[{"award-number":["12125108"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["12226008"],"award-info":[{"award-number":["12226008"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991021"],"award-info":[{"award-number":["11991021"]}],"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":["11991020"],"award-info":[{"award-number":["11991020"]}],"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":["12021001"],"award-info":[{"award-number":["12021001"]}],"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":["12288201"],"award-info":[{"award-number":["12288201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research Program of Frontier Sciences, Chinese Academy of Sciences","award":["ZDBS-LY-7022"],"award-info":[{"award-number":["ZDBS-LY-7022"]}]},{"name":"CAS AMSS-PolyU Joint Laboratory of Applied Mathematics"}],"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-02798-0","type":"journal-article","created":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T14:20:32Z","timestamp":1738765232000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Learning-Rate-Free Momentum SGD with Reshuffling Converges in Nonsmooth Nonconvex Optimization"],"prefix":"10.1007","volume":"102","author":[{"given":"Xiaoyin","family":"Hu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2725-2633","authenticated-orcid":false,"given":"Nachuan","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"key":"2798_CR1","volume-title":"Differential Inclusions: Set-valued Maps and Viability Theory","author":"JP Aubin","year":"2012","unstructured":"Aubin, J.P., Cellina, A.: Differential Inclusions: Set-valued Maps and Viability Theory, vol. 264. Springer (2012)"},{"key":"2798_CR2","doi-asserted-by":"crossref","unstructured":"Bena\u00efm, M.: Dynamics of stochastic approximation algorithms. In: Seminaire de Probabilites XXXIII, pp. 1\u201368. Springer, Cham (2006)","DOI":"10.1007\/BFb0096509"},{"issue":"1","key":"2798_CR3","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/S0363012904439301","volume":"44","author":"M Bena\u00efm","year":"2005","unstructured":"Bena\u00efm, M., Hofbauer, J., Sorin, S.: Stochastic approximations and differential inclusions. SIAM J. Control. Optim. 44(1), 328\u2013348 (2005)","journal-title":"SIAM J. Control. Optim."},{"key":"2798_CR4","unstructured":"Bhaskara, A., Cutkosky, A., Kumar, R., Purohit, M.: Online learning with imperfect hints. In: International Conference on Machine Learning, pp. 822\u2013831. PMLR (2020)"},{"issue":"3","key":"2798_CR5","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1007\/s11228-022-00638-z","volume":"30","author":"P Bianchi","year":"2022","unstructured":"Bianchi, P., Hachem, W., Schechtman, S.: Convergence of constant step stochastic gradient descent for non-smooth non-convex functions. Set-Valued Var. Anal. 30(3), 1117\u20131147 (2022)","journal-title":"Set-Valued Var. Anal."},{"key":"2798_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF02699126","volume":"67","author":"E Bierstone","year":"1988","unstructured":"Bierstone, E., Milman, P.D.: Semianalytic and subanalytic sets. Publications Math\u00e9matiques de l\u2019IH\u00c9S 67, 5\u201342 (1988)","journal-title":"Publications Math\u00e9matiques de l\u2019IH\u00c9S"},{"issue":"2","key":"2798_CR7","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."},{"key":"2798_CR8","first-page":"13537","volume":"34","author":"J Bolte","year":"2021","unstructured":"Bolte, J., Le, T., Pauwels, E., Silveti-Falls, T.: Nonsmooth implicit differentiation for machine-learning and optimization. Adv. Neural Inf. Process. Syst. 34, 13537\u201313549 (2021)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2798_CR9","first-page":"10809","volume":"33","author":"J Bolte","year":"2020","unstructured":"Bolte, J., Pauwels, E.: A mathematical model for automatic differentiation in machine learning. Adv. Neural. Inf. Process. Syst. 33, 10809\u201310819 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"1","key":"2798_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-020-01501-5","volume":"188","author":"J Bolte","year":"2021","unstructured":"Bolte, J., Pauwels, E.: Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning. Math. Program. 188(1), 19\u201351 (2021)","journal-title":"Math. Program."},{"key":"2798_CR11","unstructured":"Borkar, V.S.: Stochastic Approximation: A Dynamical Systems Viewpoint, vol. 48. Springer (2009)"},{"key":"2798_CR12","unstructured":"Carmon, Y., Hinder, O.: Making SGD parameter-free. In: Conference on Learning Theory, pp. 2360\u20132389. PMLR (2022)"},{"issue":"1","key":"2798_CR13","first-page":"5977","volume":"22","author":"C Castera","year":"2021","unstructured":"Castera, C., Bolte, J., F\u00e9votte, C., Pauwels, E.: An inertial Newton algorithm for deep learning. J. Mach. Learn. Res. 22(1), 5977\u20136007 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"2798_CR14","doi-asserted-by":"crossref","unstructured":"Chen, K., Langford, J., Orabona, F.: Better parameter-free stochastic optimization with ODE updates for coin-betting. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 6239\u20136247 (2022)","DOI":"10.1609\/aaai.v36i6.20573"},{"key":"2798_CR15","unstructured":"Chen, X., Liang, C., Huang, D., Real, E., Wang, K., Liu, Y., Pham, H., Dong, X., Luong, T., Hsieh, C.J., et\u00a0al.: Symbolic discovery of optimization algorithms. Preprint at arXiv:2302.06675 (2023)"},{"key":"2798_CR16","doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis, vol.\u00a05. SIAM (1990)","DOI":"10.1137\/1.9781611971309"},{"key":"2798_CR17","unstructured":"Cutkosky, A., Orabona, F.: Black-box reductions for parameter-free online learning in banach spaces. In: Conference On Learning Theory, pp. 1493\u20131529. PMLR (2018)"},{"issue":"1","key":"2798_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10208-018-09409-5","volume":"20","author":"D Davis","year":"2020","unstructured":"Davis, D., Drusvyatskiy, D., Kakade, S., Lee, J.D.: Stochastic subgradient method converges on tame functions. Found. Comput. Math. 20(1), 119\u2013154 (2020)","journal-title":"Found. Comput. Math."},{"key":"2798_CR19","unstructured":"Defazio, A., Mishchenko, K.: Learning-rate-free learning by D-adaptation. In: International Conference on Machine Learning, pp. 7449\u20137479. PMLR (2023)"},{"key":"2798_CR20","doi-asserted-by":"crossref","unstructured":"Deng, J., Dong, W., Socher, R., Li, L.J., Li, K., Fei-Fei, L.: Imagenet: A large-scale hierarchical image database. In: 2009 IEEE conference on computer vision and pattern recognition, pp. 248\u2013255. IEEE (2009)","DOI":"10.1109\/CVPR.2009.5206848"},{"issue":"7","key":"2798_CR21","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12(7), 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"2798_CR22","doi-asserted-by":"crossref","unstructured":"Fu, Q., Song, L., Du, W., Zhang, Y.: End-to-end AMR coreference resolution. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pp. 4204\u20134214. Association for Computational Linguistics, Online (2021)","DOI":"10.18653\/v1\/2021.acl-long.324"},{"key":"2798_CR23","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"issue":"8","key":"2798_CR24","first-page":"2","volume":"14","author":"G Hinton","year":"2012","unstructured":"Hinton, G., Srivastava, N., Swersky, K.: Neural networks for machine learning lecture 6a overview of mini-batch gradient descent. Cited on 14(8), 2 (2012)","journal-title":"Cited on"},{"key":"2798_CR25","doi-asserted-by":"crossref","unstructured":"Hu, X., Xiao, N., Liu, X., Toh, K.C.: A constraint dissolving approach for nonsmooth optimization over the Stiefel manifold. IMA J. Numer. Anal. drad098 (2023)","DOI":"10.1093\/imanum\/drad098"},{"key":"2798_CR26","unstructured":"Ivgi, M., Hinder, O., Carmon, Y.: DoG is SGD\u2019s best friend: A parameter-free dynamic step size schedule. In: International Conference on Machine Learning, pp. 14465\u201314499. PMLR (2023)"},{"key":"2798_CR27","unstructured":"Jacobsen, A., Cutkosky, A.: Parameter-free mirror descent. In: Conference on Learning Theory, pp. 4160\u20134211. PMLR (2022)"},{"key":"2798_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ins.2021.12.021","volume":"587","author":"H Jin","year":"2022","unstructured":"Jin, H., Chen, J., Zheng, H., Wang, Z., Xiao, J., Yu, S., Ming, Z.: Roby: evaluating the adversarial robustness of a deep model by its decision boundaries. Inf. Sci. 587, 97\u2013122 (2022)","journal-title":"Inf. Sci."},{"key":"2798_CR29","doi-asserted-by":"crossref","unstructured":"Josz, C., Lai, L.: Global stability of first-order methods for coercive tame functions. Math. Program. 1\u201326 (2023)","DOI":"10.1007\/s10107-023-02020-9"},{"issue":"1","key":"2798_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-023-01936-6","volume":"202","author":"C Josz","year":"2023","unstructured":"Josz, C., Lai, L.: Lyapunov stability of the subgradient method with constant step size. Math. Program. 202(1), 387\u2013396 (2023)","journal-title":"Math. Program."},{"key":"2798_CR31","unstructured":"Kempka, M., Kotlowski, W., Warmuth, M.K.: Adaptive scale-invariant online algorithms for learning linear models. In: International Conference on Machine Learning, pp. 3321\u20133330. PMLR (2019)"},{"key":"2798_CR32","unstructured":"Khaled, A., Jin, C.: Tuning-free stochastic optimization. Preprint at arXiv:2402.07793 (2024)"},{"key":"2798_CR33","first-page":"6748","volume":"36","author":"A Khaled","year":"2023","unstructured":"Khaled, A., Mishchenko, K., Jin, C.: DoWG unleashed: an efficient universal parameter-free gradient descent method. Adv. Neural. Inf. Process. Syst. 36, 6748\u20136769 (2023)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2798_CR34","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. In: Proceedings of the 3rd International Conference for Learning Representations (2015)"},{"key":"2798_CR35","unstructured":"Kreisler, I., Ivgi, M., Hinder, O., Carmon, Y.: Accelerated parameter-free stochastic optimization. Preprint at arXiv:2404.00666 (2024)"},{"key":"2798_CR36","unstructured":"Krizhevsky, A., Hinton, G., et\u00a0al.: Learning multiple layers of features from tiny images (2009)"},{"issue":"2","key":"2798_CR37","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s10957-024-02408-3","volume":"201","author":"T Le","year":"2024","unstructured":"Le, T.: Nonsmooth nonconvex stochastic heavy ball. J. Optim. Theory Appl. 201(2), 699\u2013719 (2024)","journal-title":"J. Optim. Theory Appl."},{"key":"2798_CR38","unstructured":"Luo, H., Schapire, R.E.: Achieving all with no parameters: Adanormalhedge. In: Conference on Learning Theory, pp. 1286\u20131304. PMLR (2015)"},{"key":"2798_CR39","unstructured":"Mhammedi, Z., Koolen, W.M.: Lipschitz and comparator-norm adaptivity in online learning. In: Conference on Learning Theory, pp. 2858\u20132887. PMLR (2020)"},{"key":"2798_CR40","unstructured":"Mishchenko, K., Defazio, A.: Prodigy: An expeditiously adaptive parameter-free learner. Preprint at arXiv:2306.06101 (2023)"},{"key":"2798_CR41","unstructured":"Orabona, F.: Simultaneous model selection and optimization through parameter-free stochastic learning. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"key":"2798_CR42","unstructured":"Orabona, F., P\u00e1l, D.: Coin betting and parameter-free online learning. Adv. Neural Inf. Process. Syst. 29 (2016)"},{"key":"2798_CR43","unstructured":"Orabona, F., Tommasi, T.: Training deep networks without learning rates through coin betting. Adv. Neural Inf. Process. Syst. 30 (2017)"},{"issue":"1","key":"2798_CR44","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s10957-021-01883-2","volume":"190","author":"E Pauwels","year":"2021","unstructured":"Pauwels, E.: Incremental without replacement sampling in nonconvex optimization. J. Optim. Theory Appl. 190(1), 274\u2013299 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2798_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11228-023-00682-3","volume":"31","author":"E Pauwels","year":"2023","unstructured":"Pauwels, E.: Conservative parametric optimality and the ridge method for tame min\u2013max problems. Set-Valued Var. Anal. 31(3), 1\u201324 (2023)","journal-title":"Set-Valued Var. Anal."},{"issue":"5","key":"2798_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"7","key":"2798_CR47","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1007\/s11590-020-01537-8","volume":"14","author":"A Ruszczy\u0144ski","year":"2020","unstructured":"Ruszczy\u0144ski, A.: Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization. Optim. Lett. 14(7), 1615\u20131625 (2020)","journal-title":"Optim. Lett."},{"key":"2798_CR48","unstructured":"Streeter, M., McMahan, H.B.: No-regret algorithms for unconstrained online convex optimization. Preprint at arXiv:1211.2260 (2012)"},{"issue":"9","key":"2798_CR49","doi-asserted-by":"publisher","first-page":"4579","DOI":"10.1109\/JBHI.2023.3286572","volume":"27","author":"J Wang","year":"2023","unstructured":"Wang, J., Zhou, C., Chen, S., Hu, J., Wu, M., Jiang, X., Xu, C., Qian, D.: Chromosome detection in metaphase cell images using morphological priors. IEEE J. Biomed. Health Inform. 27(9), 4579\u20134590 (2023)","journal-title":"IEEE J. Biomed. Health Inform."},{"issue":"1","key":"2798_CR50","first-page":"9047","volume":"21","author":"R Ward","year":"2020","unstructured":"Ward, R., Wu, X., Bottou, L.: Adagrad stepsizes: sharp convergence over nonconvex landscapes. J. Mach. Learn. Res. 21(1), 9047\u20139076 (2020)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"2798_CR51","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1109\/TNNLS.2020.2986823","volume":"32","author":"L Wei","year":"2021","unstructured":"Wei, L., Zhao, S., Bourahla, O.F., Li, X., Wu, F., Zhuang, Y., Han, J., Xu, M.: End-to-end video saliency detection via a deep contextual spatiotemporal network. IEEE Trans. Neural Netw. Learn. Syst. 32(4), 1691\u20131702 (2021). https:\/\/doi.org\/10.1109\/TNNLS.2020.2986823","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"4","key":"2798_CR52","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1090\/S0894-0347-96-00216-0","volume":"9","author":"AJ Wilkie","year":"1996","unstructured":"Wilkie, A.J.: Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function. J. Am. Math. Soc. 9(4), 1051\u20131094 (1996)","journal-title":"J. Am. Math. Soc."},{"issue":"48","key":"2798_CR53","first-page":"1","volume":"25","author":"N Xiao","year":"2024","unstructured":"Xiao, N., Hu, X., Liu, X., Toh, K.C.: Adam-family methods for nonsmooth optimization with convergence guarantees. J. Mach. Learn. Res. 25(48), 1\u201353 (2024)","journal-title":"J. Mach. Learn. Res."},{"key":"2798_CR54","unstructured":"Xiao, N., Hu, X., Toh, K.C.: Convergence guarantees for stochastic subgradient methods in nonsmooth nonconvex optimization. Preprint at arXiv:2307.10053 (2023)"},{"key":"2798_CR55","unstructured":"Zhang, Z., Cutkosky, A., Paschalidis, I.: PDE-based optimal strategy for unconstrained online learning. In: International Conference on Machine Learning, pp. 26085\u201326115. PMLR (2022)"},{"issue":"6","key":"2798_CR56","doi-asserted-by":"publisher","first-page":"3217","DOI":"10.1109\/TCSS.2022.3207987","volume":"10","author":"B Zhou","year":"2022","unstructured":"Zhou, B., Chen, L., Zhao, S., Li, S., Zheng, Z., Pan, G.: Unsupervised domain adaptation for crime risk prediction across cities. IEEE Trans. Comput. Soc. Syst. 10(6), 3217\u20133227 (2022)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"2798_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2022.106264","volume":"152","author":"B Zhou","year":"2023","unstructured":"Zhou, B., Zhou, H., Zhang, X., Xu, X., Chai, Y., Zheng, Z., Kot, A.C., Zhou, Z.: Tempo: a transformer-based mutation prediction framework for sars-cov-2 evolution. Comput. Biol. Med. 152, 106264 (2023)","journal-title":"Comput. Biol. Med."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02798-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02798-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02798-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T17:43:56Z","timestamp":1739900636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02798-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,5]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2798"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02798-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,5]]},"assertion":[{"value":"26 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2025","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":"5 February 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 no Conflict of interest to declare that are relevant to this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"85"}}