{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:59:11Z","timestamp":1772614751223,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T00:00:00Z","timestamp":1738108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T00:00:00Z","timestamp":1738108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10479-025-06496-w","type":"journal-article","created":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T08:49:11Z","timestamp":1738140551000},"page":"1213-1247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Network restructuring for dynamic flow improvement"],"prefix":"10.1007","volume":"347","author":[{"given":"Tanka Nath","family":"Dhamala","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6491-5515","authenticated-orcid":false,"given":"Durga Prasad","family":"Khanal","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Dempe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,29]]},"reference":[{"key":"6496_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2584-2","author":"S Akter","year":"2017","unstructured":"Akter, S., & Wamba, S. F. (2017). Big data and disaster management: A systematic review and agenda for future research. Annals of Operation Research. https:\/\/doi.org\/10.1007\/s10479-017-2584-2","journal-title":"Annals of Operation Research"},{"key":"6496_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.ejor.2005.05.016","volume":"175","author":"N Altay","year":"2006","unstructured":"Altay, N., & Green, I.I.I.-W.G. (2006). OR\/MS research in disaster operations management. European Journal of Operational Research, 175, 475\u2013493.","journal-title":"European Journal of Operational Research"},{"key":"6496_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10479-014-1581-y","volume":"223","author":"AM Anaya-Arenas","year":"2014","unstructured":"Anaya-Arenas, A. M., Renaud, J., & Ruiz, A. (2014). Relief distribution networks: A systematic review. Annals of Operation Research, 223, 53\u201379.","journal-title":"Annals of Operation Research"},{"key":"6496_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"JE Aronson","year":"1989","unstructured":"Aronson, J. E. (1989). A survey of dynamic network flows. Annals of Operations Research, 20, 1\u201366.","journal-title":"Annals of Operations Research"},{"key":"6496_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.dam.2006.04.030","volume":"155","author":"N Baumann","year":"2007","unstructured":"Baumann, N., & K\u00f6hler, E. (2007). Approximating earliest arrival flows with flow-dependent transit times. Discrete Applied Mathematics, 155, 161\u2013171.","journal-title":"Discrete Applied Mathematics"},{"key":"6496_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1287\/moor.1090.0382","volume":"34","author":"N Baumann","year":"2009","unstructured":"Baumann, N., & Skutella, M. (2009). Earliest arrival flows with multiple sources. Mathematics of Operations Research, 34, 499\u2013512.","journal-title":"Mathematics of Operations Research"},{"key":"6496_CR7","unstructured":"Berlin, G.N. (1979). The use of directed routes for assigning escape potential. In National Fire Protection Association."},{"key":"6496_CR8","first-page":"31","volume":"37","author":"RE Burkard","year":"1993","unstructured":"Burkard, R. E., Dlaska, K., & Klinz, B. (1993). The quickest flow problem, ZOR- Methods and Models of. Operational Research, 37, 31\u201358.","journal-title":"Operational Research"},{"key":"6496_CR9","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"T Cova","year":"2003","unstructured":"Cova, T., & Johnson, J. P. (2003). A network flow model for lane-based evacuation routing. Transportation Research Part A: Policy and Practice, 37, 579\u2013604.","journal-title":"Transportation Research Part A: Policy and Practice"},{"issue":"3","key":"6496_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.6886\/IJOR.201809_15(3).0002","volume":"15","author":"TN Dhamala","year":"2018","unstructured":"Dhamala, T. N., Pyakurel, U., & Dempe, S. (2018). A critical survey on the network optimization algorithms for evacuation planning problems. International Journal of Operations Research, 15(3), 101\u2013133. https:\/\/doi.org\/10.6886\/IJOR.201809_15(3).0002","journal-title":"International Journal of Operations Research"},{"issue":"12","key":"6496_CR11","doi-asserted-by":"publisher","first-page":"8851","DOI":"10.3934\/jimo.2023064","volume":"19","author":"TN Dhamala","year":"2023","unstructured":"Dhamala, T. N., Wagle, S., & Pyakurel, U. (2023). FlowLoc problem with maximum excess flow. Journal of Industrial and Management Optimization (JIMO), 19(12), 8851\u20138870.","journal-title":"Journal of Industrial and Management Optimization (JIMO)"},{"key":"6496_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische mathematik, 1, 269\u2013271.","journal-title":"Numerische mathematik"},{"key":"6496_CR13","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"LK Fleischer","year":"2007","unstructured":"Fleischer, L. K., & Skutella, M. (2007). Quickest flows over time. SIAM Journal of Computing, 36, 1600\u20131630.","journal-title":"SIAM Journal of Computing"},{"key":"6496_CR14","volume-title":"Flows in networks","author":"LR Ford","year":"1962","unstructured":"Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton, New jersey: Princeton University Press."},{"issue":"1","key":"6496_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D Gale","year":"1959","unstructured":"Gale, D. (1959). Transient flows in networks. Michigan Mathematical Journal, 6(1), 59\u201363.","journal-title":"Michigan Mathematical Journal"},{"issue":"3","key":"6496_CR16","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg, A. V., & Tarjan, R. E. (1990). Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research, 15(3), 430\u2013466.","journal-title":"Mathematics of Operations Research"},{"key":"6496_CR17","doi-asserted-by":"crossref","unstructured":"Gro\u00df, M. & Skutella, M. (2012). Generalized maximum flows over time. In  International workshop on approximation and online algorithms, pp. 247\u2013260.","DOI":"10.1007\/978-3-642-29116-6_21"},{"key":"6496_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-023-05210-y","author":"SP Gupta","year":"2023","unstructured":"Gupta, S. P., Pyakurel, U., & Dhamala, T. N. (2023). Multi-commodity flow problem on lossy network with partial lane reversals. Annals of Operations Research (ANOR). https:\/\/doi.org\/10.1007\/s10479-023-05210-y","journal-title":"Annals of Operations Research (ANOR)"},{"key":"6496_CR19","doi-asserted-by":"crossref","unstructured":"Hall, A., Hippler, S., & Skutella, M. (2007a). Multi-commodity flows over time: Efficient and complexity. Theoretical Computer Science, 379, 387\u2013404.","DOI":"10.1016\/j.tcs.2007.02.046"},{"key":"6496_CR20","doi-asserted-by":"crossref","unstructured":"Hall, A., Langkau, K., & Skutella, M. (2007b). An FPTAS for quickest flow multi-commodity flows with inflow-dependent transit times. Algorithmica, 47(3), 299\u2013321.","DOI":"10.1007\/s00453-006-0196-3"},{"key":"6496_CR21","unstructured":"Hamacher, H.W. & Tjandra, S.A. (2002). Mathematical modeling of evacuation problems: A state of the art. In M. Schreckenberger and S.D. Sharma (Eds.), Pedestrain and Evacuation Dynamics, (pp. 227-266). Springer."},{"key":"6496_CR22","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B Hoppe","year":"2000","unstructured":"Hoppe, B., & Tardos, E. (2000). The quickest transshipment problem. Mathematics of Operations Research, 25, 36\u201362.","journal-title":"Mathematics of Operations Research"},{"key":"6496_CR23","unstructured":"Kappmeier, P.W. (2015). Generalizations of flows over time with application in evacuation optimization. PhD Thesis, Technical University, Berlin, Germany."},{"key":"6496_CR24","unstructured":"Khanal, D.P. (2024). Multi-commodity dynamic flow problems with intermediate storage and varying transit times, PhD Thesis, Tribhuvan University, Institute of Science and Technology, Kathmandu, Nepal."},{"key":"6496_CR25","doi-asserted-by":"crossref","unstructured":"Khanal, D.P., Pyakurel, U., Dhamala, T.N. & Dempe, S. (2022). Efficient algorithms for abstract flow with partial switching. In Operations Research Forum, (Vol. 3(4), p. 55). Cham: Springer International Publishing.","DOI":"10.1007\/s43069-022-00168-2"},{"key":"6496_CR26","doi-asserted-by":"publisher","unstructured":"Khanal, D. P., Pyakurel, U., & Dhamala, T. N. (2021). Maximum multi-commodity flow with intermediate storage. Mathematical Problems in Engineering, 2021, 5063207. https:\/\/doi.org\/10.1155\/2021\/5063207","DOI":"10.1155\/2021\/5063207"},{"key":"6496_CR27","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1109\/TKDE.2007.190722","volume":"20","author":"S Kim","year":"2008","unstructured":"Kim, S., Shekhar, S., & Min, M. (2008). Contraflow transportation network reconfiguration for evacuation route planning. IEEE transactions on Knowledge and Data Engineering, 20, 1115\u20131129.","journal-title":"IEEE transactions on Knowledge and Data Engineering"},{"key":"6496_CR28","doi-asserted-by":"crossref","unstructured":"K\u00f6hler, E., Langkau, K. & Skutella, M. (2002). Time expanded graphs for flow depended transit times. In R. Moehring and R. Raman (Eds.)  ESA 2002, LNCS 2461, (pp. 599-611), Springer-Verlag.","DOI":"10.1007\/3-540-45749-6_53"},{"key":"6496_CR29","doi-asserted-by":"crossref","unstructured":"K\u00f6hler, E., & Skutella, M. (2005). Flows over time with load-dependent transit times. SIAM Journal of Optimization, 15(4), 1185\u20131202.","DOI":"10.1137\/S1052623403432645"},{"key":"6496_CR30","doi-asserted-by":"crossref","unstructured":"Kotsireas, I.S., Nagurney, A. & Pardalos, P.M. (Eds.). (2015). Dynamics of Disasters\u2013Key Concepts, Models, Algorithms, and Insights: Kalamata, Greece, June\u2013July 2015 (Springer Proceedings in Mathematics & Statistics, 185) Softcover reprint of the original 1st ed. 2016.","DOI":"10.1007\/978-3-319-43709-5"},{"key":"6496_CR31","doi-asserted-by":"crossref","unstructured":"Lin, M. & Jaillet, P. (2015). On the quickest flow problem in dynamic networks: a parametric min-cost flow approach. In Proceeding of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia: Society for Industrial and Applied Mathmatics (pp. 1343-1356).","DOI":"10.1137\/1.9781611973730.89"},{"key":"6496_CR32","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N Megiddo","year":"1974","unstructured":"Megiddo, N. (1974). Optimal flows in networks with multiple sources and sinks. Mathematical Programming, 7, 97\u2013107.","journal-title":"Mathematical Programming"},{"key":"6496_CR33","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E Minieka","year":"1973","unstructured":"Minieka, E. (1973). Maximal lexicographic and dynamic network flows. Operations Research, 21, 517\u2013527.","journal-title":"Operations Research"},{"key":"6496_CR34","unstructured":"Moriarty, K.D., Ni, D. & Collura, J. (2007). Modeling traffic flow under emergency evacuation situations: Current practice and future directions. In 86th Transportation Research Board Annual Meeting, Washington, D.C."},{"issue":"1","key":"6496_CR35","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s12597-023-00690-9","volume":"61","author":"HN Nath","year":"2023","unstructured":"Nath, H. N., Dhamala, T. N., & Dempe, S. (2023). Saving a path minimizing egress time of a dynamic contraflow: A Bi-objective programming approach. OPSEARCH, 61(1), 98\u2013120.","journal-title":"OPSEARCH"},{"key":"6496_CR36","doi-asserted-by":"publisher","unstructured":"Nath, H. N., Pyakurel, U., & Dhamala, T. N. (2021b). Network reconfiguration with orientation-dependent transit times. International Journal of Mathematics and Mathematical Sciences. https:\/\/doi.org\/10.1155\/2021\/6613622","DOI":"10.1155\/2021\/6613622"},{"key":"6496_CR37","doi-asserted-by":"publisher","unstructured":"Nath, H. N., Pyakurel, U., Dhamala, T. N., & Dempe, S. (2021a). Dynamic network flow location models and algorithms for quickest evacuation planning. Journal of Industrial and Management Optimization, 17(5), 2943\u20132970. https:\/\/doi.org\/10.3934\/jimo.2020102","DOI":"10.3934\/jimo.2020102"},{"issue":"3","key":"6496_CR38","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1109\/TCT.1966.1082612","volume":"13","author":"K Onaga","year":"1966","unstructured":"Onaga, K. (1966). Dynamic programming of optimum flows in lossy communication nets. IEEE Transactions on Circuit Theory, 13(3), 282\u2013287.","journal-title":"IEEE Transactions on Circuit Theory"},{"issue":"4","key":"6496_CR39","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0016-0032(67)90046-4","volume":"283","author":"K Onaga","year":"1967","unstructured":"Onaga, K. (1967). Optimum flows in general communication networks. Journal of the Franklin Institute, 283(4), 308\u2013327.","journal-title":"Journal of the Franklin Institute"},{"issue":"1","key":"6496_CR40","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-006-0068-x","volume":"147","author":"MMB Pascoal","year":"2006","unstructured":"Pascoal, M. M. B., Captivo, M. E. V., & Climacom, J. C. N. (2006). A comprehensive survey on the quickest path problem. Annals of Operations Research, 147(1), 5\u201321.","journal-title":"Annals of Operations Research"},{"key":"6496_CR41","series-title":"Handbooks in operations research and management science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0927-0507(05)80107-0","volume-title":"Network Routing","author":"WB Powell","year":"1995","unstructured":"Powell, W. B., Jaillet, P., & Odoni, A. (1995). Stochastic and dynamic networks and routing. Handbooks in operations research and management scienceIn M. O. Ball, T. L. Magnanti, C. L. Monma, & G. L. Nemhauser (Eds.), Network Routing (Vol. 8, pp. 141\u2013295). NorthHolland: Amsterdam, The Netherlands."},{"key":"6496_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s43069-020-00033-0","author":"U Pyakurel","year":"2020","unstructured":"Pyakurel, U., & Dempe, S. (2020). Network flow with intermediate storage: models and algorithms. SN Operations Research Forum. https:\/\/doi.org\/10.1007\/s43069-020-00033-0","journal-title":"SN Operations Research Forum"},{"key":"6496_CR43","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s10479-016-2302-5","volume":"253","author":"U Pyakurel","year":"2017","unstructured":"Pyakurel, U., & Dhamala, T. N. (2017). Continuous dynamic contraflow approach for evacuation planning. Annals of Operation Research (ANOR), 253, 573\u2013598.","journal-title":"Annals of Operation Research (ANOR)"},{"key":"6496_CR44","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10479-017-2427-1","volume":"254","author":"U Pyakurel","year":"2017","unstructured":"Pyakurel, U., Dhamala, T. N., & Dempe, S. (2017). Efficient continuous contraflow algorithms for evacuation planning problems. Annals of Operations Research (ANOR), 254, 335\u2013364.","journal-title":"Annals of Operations Research (ANOR)"},{"key":"6496_CR45","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/2676378","author":"U Pyakurel","year":"2020","unstructured":"Pyakurel, U., Gupta, S. P., Khanal, D. P., & Dhamala, T. N. (2020). Efficient algorithms on multi-commodity flow over time with partial lane reversals. Journal of Mathematics and Mathematical Sciences. https:\/\/doi.org\/10.1155\/2020\/2676378","journal-title":"Journal of Mathematics and Mathematical Sciences"},{"issue":"1","key":"6496_CR46","first-page":"27","volume":"3","author":"U Pyakurel","year":"2014","unstructured":"Pyakurel, U., Hamacher, H. W., & Dhamala, T. N. (2014). Generalized maximum dynamic contraflow on lossy network. International Journal of Operations Research Nepal, 3(1), 27\u201344.","journal-title":"International Journal of Operations Research Nepal"},{"issue":"3","key":"6496_CR47","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1016\/j.ejor.2022.06.054","volume":"305","author":"U Pyakurel","year":"2023","unstructured":"Pyakurel, U., Khanal, D. P., & Dhamala, T. N. (2023). Abstract network flow with intermediate storage for evacuation planning. European Journal of Operational Research, 305(3), 1178\u20131193.","journal-title":"European Journal of Operational Research"},{"key":"6496_CR48","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1007\/s11425-017-9264-3","volume":"61","author":"U Pyakurel","year":"2018","unstructured":"Pyakurel, U., Nath, H. N., & Dhamala, T. N. (2018). Efficient contraflow algorithms for quickest evacuation planning. Science China Mathematics, 61, 2079\u20132100. https:\/\/doi.org\/10.1007\/s11425-017-9264-3","journal-title":"Science China Mathematics"},{"issue":"1\u20132","key":"6496_CR49","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10479-018-3031-8","volume":"283","author":"U Pyakurel","year":"2019","unstructured":"Pyakurel, U., Nath, H. N., & Dhamala, T. N. (2019). Partial contraflow with path reversals for evacuation planning. Annals of Operations Research (ANOR), 283(1\u20132), 591\u2013612. https:\/\/doi.org\/10.1007\/s10479-018-3031-8","journal-title":"Annals of Operations Research (ANOR)"},{"key":"6496_CR50","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s10878-008-9175-8","volume":"19","author":"S Rebennack","year":"2010","unstructured":"Rebennack, S., Arulselvan, A., Elefteriadou, L., & Pardalos, P. M. (2010). Complexity analysis for maximum flow problems with arc reversals. Journal of Combinatorial Optimization, 19, 200\u2013216.","journal-title":"Journal of Combinatorial Optimization"},{"key":"6496_CR51","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/net.20398","volume":"10","author":"S Ruzika","year":"2011","unstructured":"Ruzika, S., Sperber, H., & Steiner, M. (2011). Earliest arrival flows on series-parallel graphs. Network, 10, 169\u2013173.","journal-title":"Network"},{"key":"6496_CR52","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.physa.2013.10.048","volume":"395","author":"JMG Smith","year":"2014","unstructured":"Smith, J. M. G., & Cruz, E. R. B. (2014). $$M\\backslash G\\backslash c\\backslash c$$ state dependent travel time models and properties. Physica A, 395, 560\u2013579.","journal-title":"Physica A"},{"key":"6496_CR53","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"WL Wilkinson","year":"1971","unstructured":"Wilkinson, W. L. (1971). An algorithm for universal maximal dynamic flows in a network. Operations Research, 19, 1602\u20131612.","journal-title":"Operations Research"},{"key":"6496_CR54","doi-asserted-by":"crossref","unstructured":"Yusoff, M., Ariffin, J., & Mohamed, A. (2008). Optimization approaches for macroscopic emergency evacuation planning: a survey. In Information Technology, ITSim, International Symposium (vol.3(26\u201328), pp. 1\u20137) IEEE.","DOI":"10.1109\/ITSIM.2008.4631982"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06496-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06496-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06496-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T16:23:11Z","timestamp":1746721391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06496-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,29]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["6496"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06496-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,29]]},"assertion":[{"value":"27 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2025","order":3,"name":"first_online","label":"First Online","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 regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}