{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T07:10:02Z","timestamp":1784013002252,"version":"3.55.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T00:00:00Z","timestamp":1753056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T00:00:00Z","timestamp":1753056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["No.2022YFB2901400"],"award-info":[{"award-number":["No.2022YFB2901400"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2023YFB2904100"],"award-info":[{"award-number":["2023YFB2904100"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>With the continuous expansion of global Internet infrastructure, wide area networks play a crucial role in transmitting traffic between multiple data centers and users worldwide. However, efficient traffic management has become a core challenge due to the high costs of building and maintaining these networks. Traditional traffic engineering methods based on linear programming achieve optimal solutions but suffer from exponential computational complexity growth with network size, making them impractical for real-time applications in large-scale networks. Recent machine learning approaches show promise but still face fundamental limitations in handling complex network constraints and maintaining performance across different network scales. This paper proposes GRL-TE (Graph-based Reinforcement Learning for Traffic Engineering), a novel framework that achieves near-optimal performance while maintaining computational efficiency across diverse network scales. GRL-TE introduces three key innovations: (1) TopoFlowNet, a graph neural network architecture that models WANs as bipartite graphs with edge nodes representing physical links and path nodes representing candidate paths, enabling efficient bidirectional information propagation through GINConv layers while MLP modules handle collaborative relationships among paths serving the same demand; (2) A one-step A2C mechanism specifically designed for TE with immediate reward structure, eliminating the need for future state estimation and significantly simplifying training; (3) Integration of ADMM as a post-processing step to iteratively reduce constraint violations while improving solution quality. Extensive experiments on six real-world WAN topologies ranging from 12 to 1,739 nodes demonstrate that GRL-TE achieves an overall average demand satisfaction rate of 89.36%, outperforming state-of-the-art learning-based methods (Teal: 82.04%, Figret: 82.20%) and the clustering-based NCFlow (76.48%), while providing 3-4 orders of magnitude speedup compared to LP solvers on large-scale networks. The framework maintains robust performance under link failures and meets real-time scheduling requirements for production deployment.<\/jats:p>","DOI":"10.1007\/s44443-025-00133-z","type":"journal-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T12:23:08Z","timestamp":1753100588000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Graph-based reinforcement learning for software-defined networking traffic engineering"],"prefix":"10.1007","volume":"37","author":[{"given":"Jingwen","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaowei","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenyu","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjuan","family":"Xing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,21]]},"reference":[{"key":"133_CR1","unstructured":"Abuzaid F, Kandula S, Arzani B, Menache I, Zaharia M, Bailis P (2021) Contracting wide-area network topologies to solve flow problems quickly. In: 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21), pp 175\u2013200"},{"key":"133_CR2","doi-asserted-by":"crossref","unstructured":"Applegate D, Cohen E (2003) Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications, pp 313\u2013324","DOI":"10.1145\/863955.863991"},{"key":"133_CR3","doi-asserted-by":"crossref","unstructured":"Awduche D, Chiu A, Elwalid A, Widjaja I, Xiao X (2002) Overview and principles of internet traffic engineering. Technical report","DOI":"10.17487\/rfc3272"},{"key":"133_CR4","doi-asserted-by":"crossref","unstructured":"Bern\u00e1rdez G, Su\u00e1rez-Varela J, L\u00f3pez A, Wu B, Xiao S, Cheng X, Barlet-Ros P, Cabellos-Aparicio A (2021) Is machine learning ready for traffic engineering optimization? In: 2021 IEEE 29th International Conference on Network Protocols (ICNP), pp 1\u201311. IEEE","DOI":"10.1109\/ICNP52444.2021.9651930"},{"key":"133_CR5","doi-asserted-by":"crossref","unstructured":"Bogle J, Bhatia N, Ghobadi M, Menache I, Bj\u00f8rner N, Valadarsky A, Schapira M (2019) Teavar: striking the right utilization-availability balance in wan traffic engineering. In: Proceedings of the ACM special interest group on data communication, pp 29\u201343","DOI":"10.1145\/3341302.3342069"},{"key":"133_CR6","unstructured":"CAIDA (2022) The CAIDA AS relationships dataset. http:\/\/www.caida.org\/data\/active\/as-relationships\/"},{"key":"133_CR7","unstructured":"Diederik PK (2014) Adam: a method for stochastic optimization. (No Title)"},{"key":"133_CR8","doi-asserted-by":"publisher","first-page":"103927","DOI":"10.1016\/j.jnca.2024.103927","volume":"229","author":"M Ding","year":"2024","unstructured":"Ding M, Guo Y, Huang Z, Lin B, Luo H (2024) Grom: a generalized routing optimization method with graph neural network and deep reinforcement learning. J Netw Comput Appl 229:103927","journal-title":"J Netw Comput Appl"},{"issue":"10","key":"133_CR9","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/MCOM.2002.1039866","volume":"40","author":"B Fortz","year":"2002","unstructured":"Fortz B, Rexford J, Thorup M (2002) Traffic engineering with traditional ip routing protocols. IEEE Commun Mag 40(10):118\u2013124","journal-title":"IEEE Commun Mag"},{"key":"133_CR10","doi-asserted-by":"crossref","unstructured":"Fortz B, Thorup M (2000) Internet traffic engineering by optimizing ospf weights. In: Proceedings IEEE INFOCOM 2000. Conference on computer communications. Nineteenth annual joint conference of the IEEE computer and communications societies (Cat. No. 00CH37064), vol 2, pp 519\u2013528. IEEE","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"133_CR11","doi-asserted-by":"crossref","unstructured":"Geng N, Xu M, Yang Y, Liu C, Yang J, Li Q, Zhang S (2021) Distributed and adaptive traffic engineering with deep reinforcement learning. In: 2021 IEEE\/ACM 29th International Symposium on Quality of Service (IWQOS), pp 1\u201310. IEEE","DOI":"10.1109\/IWQOS52092.2021.9521303"},{"key":"133_CR12","doi-asserted-by":"crossref","unstructured":"Gui F, Wang S, Li D, Chen L, Gao K, Min C, Wang Y (2024) Redte: mitigating subsecond traffic bursts with real-time and distributed traffic engineering. In: Proceedings of the ACM SIGCOMM 2024 conference, pp 71\u201385","DOI":"10.1145\/3651890.3672231"},{"key":"133_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103116","volume":"189","author":"Y Guo","year":"2021","unstructured":"Guo Y, Wang W, Zhang H, Guo W, Wang Z, Tian Y, Yin X, Wu J (2021) Traffic engineering in hybrid software defined network via reinforcement learning. J Netw Comput Appl 189:103116","journal-title":"J Netw Comput Appl"},{"key":"133_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2024.103981","volume":"231","author":"Y Guo","year":"2024","unstructured":"Guo Y, Ding M, Zhou W, Lin B, Chen C, Luo H (2024) Mate: a multi-agent reinforcement learning approach for traffic engineering in hybrid software defined networks. J Netw Comput Appl 231:103981","journal-title":"J Netw Comput Appl"},{"key":"133_CR15","doi-asserted-by":"crossref","unstructured":"Guo Y, Zhou W, Hu C, Lin B, Deng Y, Min G (2025) Dite: achieving distributed intelligent traffic engineering with sparse network-wide guidance. IEEE Trans Netw Sci Eng","DOI":"10.1109\/TNSE.2025.3576353"},{"key":"133_CR16","unstructured":"Gurobi\u00a0Optimization L (2023) Gurobi optimizer reference manual. https:\/\/www.gurobi.com"},{"key":"133_CR17","doi-asserted-by":"crossref","unstructured":"Hong C-Y, Kandula S, Mahajan R, Zhang M, Gill V, Nanduri M, Wattenhofer R (2013) Achieving high utilization with software-driven wan. In: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM, pp 15\u201326","DOI":"10.1145\/2486001.2486012"},{"key":"133_CR18","doi-asserted-by":"crossref","unstructured":"Hong C-Y, Mandal S, Al-Fares M, Zhu M, Alimi R, Bhagat C, Jain S, Kaimal J, Liang S, Mendelev K et al (2018) B4 and after: managing hierarchy, partitioning, and asymmetry for availability and scale in google\u2019s software-defined wan. In: Proceedings of the 2018 conference of the ACM special interest group on data communication, pp 74\u201387","DOI":"10.1145\/3230543.3230545"},{"issue":"4","key":"133_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2534169.2486019","volume":"43","author":"S Jain","year":"2013","unstructured":"Jain S, Kumar A, Mandal S, Ong J, Poutievski L, Singh A, Venkata S, Wanderer J, Zhou J, Zhu M et al (2013) B4: experience with a globally-deployed software defined wan. ACM SIGCOMM Comput Commun Rev 43(4):3\u201314","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"10","key":"133_CR20","doi-asserted-by":"publisher","first-page":"9011","DOI":"10.1016\/j.jksuci.2022.08.026","volume":"34","author":"SZM Jamaludin","year":"2022","unstructured":"Jamaludin SZM, Romli NA, Kasihmuddin MSM, Baharum A, Mansor MA, Marsani MF (2022) Novel logic mining incorporating log linear approach. J King Saud Univ-Comput Inf Sci 34(10):9011\u20139027","journal-title":"J King Saud Univ-Comput Inf Sci"},{"key":"133_CR21","doi-asserted-by":"crossref","unstructured":"Jin X, Li Y, Wei D, Li S, Gao J, Xu L, Li G, Xu W, Rexford J (2016) Optimizing bulk transfers with software-defined optical wan. In: Proceedings of the 2016 ACM SIGCOMM conference, pp 87\u2013100","DOI":"10.1145\/2934872.2934904"},{"issue":"9","key":"133_CR22","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1109\/JSAC.2011.111002","volume":"29","author":"S Knight","year":"2011","unstructured":"Knight S, Nguyen HX, Falkner N, Bowden R, Roughan M (2011) The internet topology zoo. IEEE J Sel Areas Commun 29(9):1765\u20131775","journal-title":"IEEE J Sel Areas Commun"},{"key":"133_CR23","unstructured":"Krishnaswamy U, Singh R, Bj\u00f8rner N, Raj H (2022) Decentralized cloud wide-area network traffic engineering with $$\\{$$BLASTSHIELD$$\\}$$. In: 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), pp 325\u2013338"},{"key":"133_CR24","doi-asserted-by":"crossref","unstructured":"Laoutaris N, Sirivianos M, Yang X, Rodriguez P (2011) Inter-datacenter bulk transfers with Netstitcher. In: Proceedings of the ACM SIGCOMM 2011 conference, pp 74\u201385","DOI":"10.1145\/2018436.2018446"},{"key":"133_CR25","doi-asserted-by":"crossref","unstructured":"Liu HH, Kandula S, Mahajan R, Zhang M, Gelernter D (2014) Traffic engineering with forward fault correction. In: Proceedings of the 2014 ACM conference on SIGCOMM, pp 527\u2013538","DOI":"10.1145\/2619239.2626314"},{"key":"133_CR26","doi-asserted-by":"crossref","unstructured":"Liu X, Zhao S, Cui Y, Wang X (2024) Figret: fine-grained robustness-enhanced traffic engineering. In: Proceedings of the ACM SIGCOMM 2024 conference, pp 117\u2013135","DOI":"10.1145\/3651890.3672258"},{"key":"133_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2024.110913","volume":"256","author":"J Lu","year":"2025","unstructured":"Lu J, Tang C, Chen Z, Guo J, Zou A, Yang W, Tang C (2025) Intraflow temporal correlation-based network traffic prediction. Comput Netw 256:110913","journal-title":"Comput Netw"},{"key":"133_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2024.104054","volume":"234","author":"Y Ma","year":"2025","unstructured":"Ma Y, Guo Y, Yang R, Luo H (2025) Frrl: a reinforcement learning approach for link failure recovery in a hybrid sdn. J Netw Comput Appl 234:104054","journal-title":"J Netw Comput Appl"},{"key":"133_CR29","doi-asserted-by":"crossref","unstructured":"Marouani S, Singh K, Jeudy B, Bradai A, Habrard A (2024) Advanced traffic engineering in wan using graph attention networks. In: 2024 20th International conference on Wireless and Mobile Computing, Networking and Communications (WiMob), pp 657\u2013662. IEEE","DOI":"10.1109\/WiMob61911.2024.10770461"},{"issue":"2","key":"133_CR30","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1355734.1355746","volume":"38","author":"N McKeown","year":"2008","unstructured":"McKeown N, Anderson T, Balakrishnan H, Parulkar G, Peterson L, Rexford J, Shenker S, Turner J (2008) Openflow: enabling innovation in campus networks. ACM SIGCOMM Comput Commun Rev 38(2):69\u201374","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"2","key":"133_CR31","doi-asserted-by":"publisher","first-page":"96","DOI":"10.23919\/JCC.fa.2022-0860.202402","volume":"21","author":"S Mehraban","year":"2024","unstructured":"Mehraban S, Yadav RK (2024) Traffic engineering and quality of service in hybrid software defined networks. China Commun 21(2):96\u2013121","journal-title":"China Commun"},{"key":"133_CR32","doi-asserted-by":"crossref","unstructured":"Nance-Hall M, Barford P, Foerster K-T, Durairajan R (2023) Improving scalability in traffic engineering via optical topology programming. IEEE Trans Netw Serv Manag","DOI":"10.1109\/TNSM.2023.3335898"},{"key":"133_CR33","doi-asserted-by":"crossref","unstructured":"Narayanan D, Kazhamiaka F, Abuzaid F, Kraft P, Agrawal A, Kandula S, Boyd S, Zaharia M (2021) Solving large-scale granular resource allocation problems efficiently with pop. In: Proceedings of the ACM SIGOPS 28th symposium on operating systems principles, pp 521\u2013537","DOI":"10.1145\/3477132.3483588"},{"key":"133_CR34","doi-asserted-by":"crossref","unstructured":"Roughan M, Greenberg A, Kalmanek C, Rumsewicz M, Yates J, Zhang Y (2002) Experience in measuring backbone traffic variability: models, metrics, measurements and meaning. In: Proceedings of the 2nd ACM SIGCOMM workshop on internet measurement, pp 91\u201392","DOI":"10.1145\/637201.637213"},{"issue":"5","key":"133_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2023.101554","volume":"35","author":"N Rusdi","year":"2023","unstructured":"Rusdi N, Kasihmuddin MSM, Romli NA, Manoharam G, Mansor MA (2023) Multi-unit discrete hopfield neural network for higher order supervised learning through logic mining: optimal performance design and attribute selection. J King Saud Univ-Comput Inf Sci 35(5):101554","journal-title":"J King Saud Univ-Comput Inf Sci"},{"key":"133_CR36","doi-asserted-by":"crossref","unstructured":"Rusek K, Su\u00e1rez-Varela J, Mestres A, Barlet-Ros P, Cabellos-Aparicio A (2019) Unveiling the potential of graph neural networks for network modeling and optimization in sdn. In: Proceedings of the 2019 ACM symposium on SDN research, pp 140\u2013151","DOI":"10.1145\/3314148.3314357"},{"key":"133_CR37","unstructured":"Saxena MC, Sabharwal M, Bajaj P (2023) Comparative study and proposal to use enhanced bellman-ford algorithm for faster path computation on sdwan controller. J Theor Appl Inf Technol 101(16)"},{"key":"133_CR38","doi-asserted-by":"crossref","unstructured":"Schlinker B, Kim H, Cui T, Katz-Bassett E, Madhyastha HV, Cunha I, Quinn J, Hasan S, Lapukhov P, Zeng H (2017) Engineering egress with edge fabric: steering oceans of content to the world. In: Proceedings of the conference of the ACM special interest group on data communication, pp 418\u2013431","DOI":"10.1145\/3098822.3098853"},{"issue":"7839","key":"133_CR39","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1038\/s41586-020-03051-4","volume":"588","author":"J Schrittwieser","year":"2020","unstructured":"Schrittwieser J, Antonoglou I, Hubert T, Simonyan K, Sifre L, Schmitt S, Guez A, Lockhart E, Hassabis D, Graepel T et al (2020) Mastering Atari, go, chess and shogi by planning with a learned model. Nature 588(7839):604\u2013609","journal-title":"Nature"},{"key":"133_CR40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.comcom.2021.07.025","volume":"178","author":"A Swaminathan","year":"2021","unstructured":"Swaminathan A, Chaba M, Sharma DK, Ghosh U (2021) Graphnet: graph neural networks for routing optimization in software defined networks. Comput Commun 178:169\u2013182","journal-title":"Comput Commun"},{"issue":"4","key":"133_CR41","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1109\/TNET.2020.2987866","volume":"28","author":"Y Tian","year":"2020","unstructured":"Tian Y, Wang Z, Yin X, Shi X, Guo Y, Geng H, Yang J (2020) Traffic engineering in partially deployed segment routing over ipv6 network with deep reinforcement learning. IEEE\/ACM Trans Netw 28(4):1573\u20131586","journal-title":"IEEE\/ACM Trans Netw"},{"key":"133_CR42","doi-asserted-by":"crossref","unstructured":"Tinhofer G, Tinhofer G (1976) Graphen und matrizen. Methoden der angewandten Graphentheorie, pp 73\u201393","DOI":"10.1007\/978-3-7091-2301-0_3"},{"issue":"1","key":"133_CR43","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/1111322.1111341","volume":"36","author":"S Uhlig","year":"2006","unstructured":"Uhlig S, Quoitin B, Lepropre J, Balon S (2006) Providing public intradomain traffic matrices to the research community. ACM SIGCOMM Comput Commun Rev 36(1):83\u201386","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"133_CR44","doi-asserted-by":"crossref","unstructured":"Xu Z, Yan FY, Singh R, Chiu JT, Rush AM, Yu M et al (2023) Learning-accelerated optimization of wan traffic engineering. In: Proceedings of the ACM SIGCOMM 2023 conference, pp 378\u2013393","DOI":"10.1145\/3603269.3604857"},{"key":"133_CR45","doi-asserted-by":"crossref","unstructured":"Yap K-K, Motiwala M, Rahe J, Padgett S, Holliman M, Baldus G, Hines M, Kim T, Narayanan A, Jain A et al (2017) Taking the edge off with espresso: scale, reliability and programmability for global internet peering. In: Proceedings of the conference of the ACM special interest group on data communication, pp 432\u2013445","DOI":"10.1145\/3098822.3098854"},{"issue":"4","key":"133_CR46","doi-asserted-by":"publisher","first-page":"5229","DOI":"10.1109\/TII.2023.3330340","volume":"20","author":"J Zhang","year":"2023","unstructured":"Zhang J, Li Y, Li Q, Xiao W (2023) Variance-constrained local-global modeling for device-free localization under uncertainties. IEEE Trans Ind Inform 20(4):5229\u20135240","journal-title":"IEEE Trans Ind Inform"},{"key":"133_CR47","doi-asserted-by":"crossref","unstructured":"Zhang M, Liu B, Zhang B (2009) Multi-commodity flow traffic engineering with hybrid mpls\/ospf routing. In: GLOBECOM 2009-2009 IEEE global telecommunications conference, pp 1\u20136 IEEE","DOI":"10.1109\/GLOCOM.2009.5426135"},{"key":"133_CR48","doi-asserted-by":"crossref","unstructured":"Zhang J, Xue J, Li Y, Cotton SL (2025) Leveraging online learning for domain-adaptation in wi-fi-based device-free localization. IEEE Trans Mob Comput","DOI":"10.1109\/TMC.2025.3552538"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00133-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00133-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00133-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T16:27:39Z","timestamp":1757262459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00133-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,21]]},"references-count":48,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["133"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00133-z","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,21]]},"assertion":[{"value":"10 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 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 they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"119"}}