{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T17:13:05Z","timestamp":1784394785048,"version":"3.55.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"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":["62373316"],"award-info":[{"award-number":["62373316"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10107-025-02217-0","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T10:02:21Z","timestamp":1743242541000},"page":"193-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An accelerated distributed stochastic gradient method with momentum"],"prefix":"10.1007","volume":"215","author":[{"given":"Kun","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shi","family":"Pu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angelia","family":"Nedi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,26]]},"reference":[{"key":"2217_CR1","first-page":"1877","volume":"33","author":"T Brown","year":"2020","unstructured":"Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al.: Language models are few-shot learners. Adv. Neural. Inf. Process. Syst. 33, 1877\u20131901 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"240","key":"2217_CR2","first-page":"1","volume":"24","author":"A Chowdhery","year":"2023","unstructured":"Chowdhery, A., Narang, S., Devlin, J., Bosma, M., Mishra, G., Roberts, A., Barham, P., Chung, H.W., Sutton, C., Gehrmann, S., et al.: Palm: scaling language modeling with pathways. J. Machine Learning Res. 24(240), 1\u2013113 (2023)","journal-title":"J. Machine Learning Res."},{"key":"2217_CR3","unstructured":"Zhang, S., Roller, S., Goyal, N., Artetxe, M., Chen, M., Chen, S., Dewan, C., Diab, M., Li, X., Lin, X.V., et al.: Opt: open pre-trained transformer language models. arXiv preprint arXiv:2205.01068 (2022)"},{"key":"2217_CR4","unstructured":"OpenAI: GPT-4 technical report (2023)"},{"key":"2217_CR5","first-page":"25464","volume":"35","author":"B Yuan","year":"2022","unstructured":"Yuan, B., He, Y., Davis, J., Zhang, T., Dao, T., Chen, B., Liang, P.S., Re, C., Zhang, C.: Decentralized training of foundation models in heterogeneous environments. Adv. Neural. Inf. Process. Syst. 35, 25464\u201325477 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2217_CR6","unstructured":"Wang, J., Lu, Y., Yuan, B., Chen, B., Liang, P., De\u00a0Sa, C., Re, C., Zhang, C.: Cocktailsgd: fine-tuning foundation models over 500mbps networks. In: International Conference on Machine Learning, pp. 36058\u201336076. PMLR (2023)"},{"issue":"5","key":"2217_CR7","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1109\/JPROC.2018.2817461","volume":"106","author":"A Nedi\u0107","year":"2018","unstructured":"Nedi\u0107, A., Olshevsky, A., Rabbat, M.G.: Network topology and communication-computation tradeoffs in decentralized optimization. Proc. IEEE 106(5), 953\u2013976 (2018)","journal-title":"Proc. IEEE"},{"issue":"1","key":"2217_CR8","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","volume":"54","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Distributed subgradient methods for multi-agent optimization. IEEE Trans. Autom. Control 54(1), 48\u201361 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"2217_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/MSP.2020.2975212","volume":"37","author":"S Pu","year":"2020","unstructured":"Pu, S., Olshevsky, A., Paschalidis, I.C.: Asymptotic network independence in distributed stochastic optimization for machine learning: examining distributed and centralized stochastic gradient descent. IEEE Signal Process. Mag. 37(3), 114\u2013122 (2020)","journal-title":"IEEE Signal Process. Mag."},{"key":"2217_CR10","unstructured":"Lian, X., Zhang, C., Zhang, H., Hsieh, C.-J., Zhang, W., Liu, J.: Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent. In: NIPS, pp. 5336\u20135346 (2017)"},{"issue":"11","key":"2217_CR11","doi-asserted-by":"publisher","first-page":"5900","DOI":"10.1109\/TAC.2021.3126253","volume":"67","author":"S Pu","year":"2021","unstructured":"Pu, S., Olshevsky, A., Paschalidis, I.C.: A sharp estimate on the transient time of distributed stochastic gradient descent. IEEE Trans. Autom. Control 67(11), 5900\u20135915 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"7","key":"2217_CR12","first-page":"4127","volume":"68","author":"K Huang","year":"2022","unstructured":"Huang, K., Pu, S.: Improving the transient times for distributed stochastic gradient methods. IEEE Trans. Autom. Control 68(7), 4127\u20134142 (2022)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2217_CR13","unstructured":"Tang, H., Lian, X., Yan, M., Zhang, C., Liu, J.: D2: decentralized training over decentralized data. In: International Conference on Machine Learning, pp. 4848\u20134856 (2018)"},{"issue":"58","key":"2217_CR14","first-page":"1","volume":"21","author":"A Spiridonoff","year":"2020","unstructured":"Spiridonoff, A., Olshevsky, A., Paschalidis, I.C.: Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions. J. Mach. Learn. Res. 21(58), 1\u201347 (2020)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2217_CR15","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-020-01487-0","volume":"187","author":"S Pu","year":"2021","unstructured":"Pu, S., Nedi\u0107, A.: Distributed stochastic gradient tracking methods. Math. Program. 187(1), 409\u2013457 (2021)","journal-title":"Math. Program."},{"key":"2217_CR16","doi-asserted-by":"publisher","first-page":"3264","DOI":"10.1109\/TSP.2022.3184770","volume":"70","author":"SA Alghunaim","year":"2022","unstructured":"Alghunaim, S.A., Yuan, K.: A unified and refined convergence analysis for non-convex decentralized learning. IEEE Trans. Signal Process. 70, 3264\u20133279 (2022)","journal-title":"IEEE Trans. Signal Process."},{"issue":"280","key":"2217_CR17","first-page":"1","volume":"24","author":"K Yuan","year":"2021","unstructured":"Yuan, K., Alghunaim, S.A., Huang, X.: Removing data heterogeneity influence enhances network topology dependence of decentralized SGD. J. Mach. Learn. Res. 24(280), 1\u201353 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"2217_CR18","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1109\/TSP.2021.3062553","volume":"69","author":"R Xin","year":"2021","unstructured":"Xin, R., Khan, U.A., Kar, S.: An improved convergence analysis for decentralized online stochastic non-convex optimization. IEEE Trans. Signal Process. 69, 1842\u20131858 (2021)","journal-title":"IEEE Trans. Signal Process."},{"key":"2217_CR19","unstructured":"Huang, K., Pu, S.: CEDAS: a compressed decentralized stochastic gradient method with improved convergence (2023)"},{"key":"2217_CR20","unstructured":"Koloskova, A., Stich, S.U., Jaggi, M.: Decentralized stochastic optimization and gossip algorithms with compressed communication. International Conference on Machine Learning, pp. 3478\u20133487 (2019)"},{"key":"2217_CR21","unstructured":"Scaman, K., Bach, F., Bubeck, S., Lee, Y.T., Massouli\u00e9, L.: Optimal algorithms for smooth and strongly convex distributed optimization in networks. In: International Conference on Machine Learning, pp. 3027\u20133036. PMLR (2017)"},{"key":"2217_CR22","unstructured":"Lu, Y., De\u00a0Sa, C.: Optimal complexity in decentralized training. In: International Conference on Machine Learning, pp. 7111\u20137123. PMLR (2021)"},{"key":"2217_CR23","first-page":"36382","volume":"35","author":"K Yuan","year":"2022","unstructured":"Yuan, K., Huang, X., Chen, Y., Zhang, X., Zhang, Y., Pan, P.: Revisiting optimal convergence rate for smooth and non-convex stochastic decentralized optimization. Adv. Neural. Inf. Process. Syst. 35, 36382\u201336395 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2217_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-023-01997-7","volume":"207","author":"Z Song","year":"2023","unstructured":"Song, Z., Shi, L., Pu, S., Yan, M.: Optimal gradient tracking for decentralized optimization. Math. Program. 207, 1\u201353 (2023)","journal-title":"Math. Program."},{"key":"2217_CR25","unstructured":"Khaled, A., Richt\u00e1rik, P.: Better theory for SGD in the nonconvex world. Trans. Machine Learning Res. (2023) https:\/\/openreview.net\/forum?id=AU4qHN2VkS"},{"key":"2217_CR26","first-page":"33107","volume":"35","author":"X Li","year":"2022","unstructured":"Li, X., Milzarek, A.: A unified convergence theorem for stochastic optimization methods. Adv. Neural Info. Proces. Syst. 35, 33107\u201333119 (2022)","journal-title":"Adv. Neural Info. Proces. Syst."},{"issue":"10","key":"2217_CR27","doi-asserted-by":"publisher","first-page":"4394","DOI":"10.1109\/TNNLS.2019.2952219","volume":"31","author":"Y Lei","year":"2019","unstructured":"Lei, Y., Hu, T., Li, G., Tang, K.: Stochastic gradient descent for nonconvex learning without bounded gradient assumptions. IEEE Trans. Neural Netw. Learn. Syst. 31(10), 4394\u20134400 (2019)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"2217_CR28","doi-asserted-by":"crossref","unstructured":"Chen, J., Sayed, A.H.: On the limiting behavior of distributed optimization strategies. In: 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1535\u20131542 (2012). IEEE","DOI":"10.1109\/Allerton.2012.6483402"},{"issue":"11","key":"2217_CR29","doi-asserted-by":"publisher","first-page":"2798","DOI":"10.1109\/TSP.2017.2666771","volume":"65","author":"G Morral","year":"2017","unstructured":"Morral, G., Bianchi, P., Fort, G.: Success and failure of adaptation-diffusion algorithms with decaying step size in multiagent networks. IEEE Trans. Signal Process. 65(11), 2798\u20132813 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"2217_CR30","doi-asserted-by":"publisher","first-page":"3487","DOI":"10.1109\/TIT.2015.2427360","volume":"61","author":"J Chen","year":"2015","unstructured":"Chen, J., Sayed, A.H.: On the learning behavior of adaptive networks\u2014part I: transient analysis. IEEE Trans. Inf. Theory 61(6), 3487\u20133517 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2217_CR31","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/opre.2017.1666","volume":"1","author":"S Pu","year":"2018","unstructured":"Pu, S., Garcia, A.: A flocking-based approach for distributed stochastic optimization. Oper. Res. 1, 267\u2013281 (2018)","journal-title":"Oper. Res."},{"issue":"4","key":"2217_CR32","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1137\/17M1111085","volume":"56","author":"S Pu","year":"2018","unstructured":"Pu, S., Garcia, A.: Swarming for faster convergence in stochastic optimization. SIAM J. Control Optim. 56(4), 2997\u20133020 (2018)","journal-title":"SIAM J. Control Optim."},{"issue":"11","key":"2217_CR33","doi-asserted-by":"publisher","first-page":"5900","DOI":"10.1109\/TAC.2021.3126253","volume":"67","author":"S Pu","year":"2021","unstructured":"Pu, S., Olshevsky, A., Paschalidis, I.C.: A sharp estimate on the transient time of distributed stochastic gradient descent. IEEE Trans. Autom. Control 67(11), 5900\u20135915 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2217_CR34","first-page":"11422","volume":"34","author":"A Koloskova","year":"2021","unstructured":"Koloskova, A., Lin, T., Stich, S.U.: An improved analysis of gradient tracking for decentralized machine learning. Adv. Neural. Inf. Process. Syst. 34, 11422\u201311435 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2217_CR35","unstructured":"Xiao, T., Chen, X., Balasubramanian, K., Ghadimi, S.: A one-sample decentralized proximal algorithm for non-convex stochastic composite optimization. Uncertainty in Artificial Intelligence, pp. 2324\u20132334 (2023)"},{"key":"2217_CR36","unstructured":"Ye, H., Chang, X.: Snap-shot decentralized stochastic gradient tracking methods. arXiv preprint arXiv:2212.05273 (2022)"},{"key":"2217_CR37","unstructured":"Luo, L., Ye, H.: An optimal stochastic algorithm for decentralized nonconvex finite-sum optimization. arXiv preprint arXiv:2210.13931 (2022)"},{"key":"2217_CR38","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/TSP.2023.3262181","volume":"71","author":"K Huang","year":"2023","unstructured":"Huang, K., Li, X., Milzarek, A., Pu, S., Qiu, J.: Distributed random reshuffling over networks. IEEE Trans. Signal Process. 71, 1143\u20131158 (2023)","journal-title":"IEEE Trans. Signal Process."},{"key":"2217_CR39","doi-asserted-by":"crossref","unstructured":"Huang, K., Zhou, L., Pu, S.: Distributed random reshuffling methods with improved convergence (2023)","DOI":"10.1109\/TSP.2023.3262181"},{"issue":"5","key":"2217_CR40","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":"1","key":"2217_CR41","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1137\/18M1230542","volume":"30","author":"S Ghadimi","year":"2020","unstructured":"Ghadimi, S., Ruszczynski, A., Wang, M.: A single timescale stochastic approximation method for nested stochastic optimization. SIAM J. Optim. 30(1), 960\u2013979 (2020)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2217_CR42","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10589-022-00432-5","volume":"84","author":"J Gao","year":"2023","unstructured":"Gao, J., Liu, X.-W., Dai, Y.-H., Huang, Y., Gu, J.: Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization. Comput. Optim. Appl. 84(2), 531\u2013572 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"2217_CR43","doi-asserted-by":"crossref","unstructured":"Yuan, K., Chen, Y., Huang, X., Zhang, Y., Pan, P., Xu, Y., Yin, W.: Decentlam: decentralized momentum SGD for large-batch deep training. In: Proceedings of the IEEE\/CVF International Conference on Computer Vision, pp. 3029\u20133039 (2021)","DOI":"10.1109\/ICCV48922.2021.00302"},{"key":"2217_CR44","doi-asserted-by":"publisher","first-page":"4486","DOI":"10.1109\/TSP.2021.3097211","volume":"69","author":"Z Wang","year":"2021","unstructured":"Wang, Z., Zhang, J., Chang, T.-H., Li, J., Luo, Z.-Q.: Distributed stochastic consensus optimization with momentum for nonconvex nonsmooth problems. IEEE Trans. Signal Process. 69, 4486\u20134501 (2021)","journal-title":"IEEE Trans. Signal Process."},{"key":"2217_CR45","unstructured":"Lin, T., Karimireddy, S.P., Stich, S.U., Jaggi, M.: Quasi-global momentum: accelerating decentralized deep learning on heterogeneous data. In: International Conference on Machine Learning, vol 139 (2021). JMLR-Journal Machine Learning Research"},{"issue":"2","key":"2217_CR46","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"2217_CR47","doi-asserted-by":"publisher","unstructured":"Huang, K., Li, X., Pu, S.: Distributed stochastic optimization under a general variance condition. IEEE Trans. Auto. Control 69(9), 6105\u20136120 (2024). https:\/\/doi.org\/10.1109\/TAC.2024.3393169","DOI":"10.1109\/TAC.2024.3393169"},{"key":"2217_CR48","unstructured":"Takezawa, Y., Bao, H., Niwa, K., Sato, R., Yamada, M.: Momentum tracking: momentum acceleration for decentralized deep learning on heterogeneous data. Trans. Machine Learning Res. (2023). https:\/\/openreview.net\/forum?id=8koy8QuTZD"},{"key":"2217_CR49","doi-asserted-by":"crossref","unstructured":"Yan, Y., Yang, T., Li, Z., Lin, Q., Yang, Y.: A unified analysis of stochastic momentum methods for deep learning. In: IJCAI International Joint Conference on Artificial Intelligence (2018)","DOI":"10.24963\/ijcai.2018\/410"},{"key":"2217_CR50","doi-asserted-by":"crossref","unstructured":"Ghadimi, E., Feyzmahdavian, H.R., Johansson, M.: Global convergence of the heavy-ball method for convex optimization. In: 2015 European Control Conference (ECC), pp. 310\u2013315. IEEE (2015)","DOI":"10.1109\/ECC.2015.7330562"},{"key":"2217_CR51","first-page":"18261","volume":"33","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Gao, Y., Yin, W.: An improved analysis of stochastic gradient descent with momentum. Adv. Neural. Inf. Process. Syst. 33, 18261\u201318271 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2217_CR52","first-page":"17309","volume":"33","author":"K Mishchenko","year":"2020","unstructured":"Mishchenko, K., Khaled Ragab Bayoumi, A., Richt\u00e1rik, P.: Random reshuffling: simple analysis with vast improvements. Adv. Neural Inf. Process. Syst. 33, 17309\u201317320 (2020)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2217_CR53","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":"2217_CR54","unstructured":"Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images (2009)"}],"updated-by":[{"DOI":"10.1007\/s10107-025-02228-x","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T00:00:00Z","timestamp":1745452800000}}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02217-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-025-02217-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02217-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T12:20:57Z","timestamp":1768047657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-025-02217-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,26]]},"references-count":54,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["2217"],"URL":"https:\/\/doi.org\/10.1007\/s10107-025-02217-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,26]]},"assertion":[{"value":"19 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2025","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original online version of this article was revised due to incorrect data in the fourth column first row headed \u201cTransient time nonconvex\u201d in Table 1. Now, it has been corrected.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2025","order":8,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":9,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":10,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10107-025-02228-x","URL":"https:\/\/doi.org\/10.1007\/s10107-025-02228-x","order":11,"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 there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}