{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T04:05:03Z","timestamp":1750133103009,"version":"3.41.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T00:00:00Z","timestamp":1746748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T00:00:00Z","timestamp":1746748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003401","name":"Funda\u00e7\u00e3o de Amparo \u00e1 Pesquisa do Estado de Alagoas","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003401","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10479-025-06609-5","type":"journal-article","created":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T13:21:04Z","timestamp":1746796864000},"page":"1749-1783","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Biased random-key genetic algorithms for the weighted minimum broadcast time problem"],"prefix":"10.1007","volume":"349","author":[{"given":"Alfredo","family":"Lima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Nogueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8759-6286","authenticated-orcid":false,"given":"Rian G. S.","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,9]]},"reference":[{"key":"6609_CR1","doi-asserted-by":"crossref","unstructured":"Al-Sarawi, S. , Anbar, M. , Alieyan, K. & Alzubaidi, M. (2017). Internet of things (iot) communication protocols: Review. In: 2017 8th International Conference on Information Technology (ICIT) (pp. 685\u2013690).","DOI":"10.1109\/ICITECH.2017.8079928"},{"issue":"5","key":"6609_CR2","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/BF01184933","volume":"27","author":"A Bar-Noy","year":"1994","unstructured":"Bar-Noy, A., & Kipnis, S. (1994). Designing broadcasting algorithms in the postal model for message-passing systems. Mathematical Systems Theory, 27(5), 431\u2013452. https:\/\/doi.org\/10.1007\/BF01184933","journal-title":"Mathematical Systems Theory"},{"issue":"6","key":"6609_CR3","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas, A. (1950). Communication patterns in task-oriented groups. The Journal of the Acoustical Society of America, 22(6), 725\u2013730. https:\/\/doi.org\/10.1121\/1.1906679","journal-title":"The Journal of the Acoustical Society of America"},{"issue":"2","key":"6609_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. INFORMS Journal on Computing, 6(2), 154\u2013160. https:\/\/doi.org\/10.1287\/ijoc.6.2.154","journal-title":"INFORMS Journal on Computing"},{"key":"6609_CR5","first-page":"97","volume-title":"A neighborhood search technique for the freeze tag problem. Extending the horizons: Advances in computing, optimization, and decision technologies","author":"D Bucantanschi","year":"2007","unstructured":"Bucantanschi, D., Hoffmann, B., Hutson, K. R., & Kretchmar, R. M. (2007). A neighborhood search technique for the freeze tag problem. Extending the horizons: Advances in computing, optimization, and decision technologies (pp. 97\u2013113). Springer."},{"issue":"2","key":"6609_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1002\/sat.1212","volume":"36","author":"X Chu","year":"2018","unstructured":"Chu, X., & Chen, Y. (2018). Time division inter-satellite link topology generation problem: Modeling and solution. International Journal of Satellite Communications and Networking, 36(2), 194\u2013206. https:\/\/doi.org\/10.1002\/sat.1212","journal-title":"International Journal of Satellite Communications and Networking"},{"issue":"1\u20132","key":"6609_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10479-018-2796-0","volume":"286","author":"ARV da Silva","year":"2020","unstructured":"da Silva, A. R. V., Ochi, L. S., Barros, B. J., & Pinheiro, R. G. S. (2020). Efficient approaches for the flooding problem on graphs. Annals of Operations Research, 286(1\u20132), 33\u201354. https:\/\/doi.org\/10.1007\/s10479-018-2796-0","journal-title":"Annals of Operations Research"},{"issue":"3","key":"6609_CR8","first-page":"93","volume":"24","author":"A Dekker","year":"2002","unstructured":"Dekker, A. (2002). Applying social network analysis concepts to military C4ISR architectures. Connections, 24(3), 93\u2013103.","journal-title":"Connections"},{"key":"6609_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.endm.2018.07.022","volume":"69","author":"A de Sousa","year":"2018","unstructured":"de Sousa, A., Gallo, G., Gutierrez, S., Robledo, F., Rodr\u00edguez-Bocca, P., & Romero, P. (2018). Heuristics for the minimum broadcast time. Electronic Notes in Discrete Mathematics, 69, 165\u2013172. https:\/\/doi.org\/10.1016\/j.endm.2018.07.022","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"6609_CR10","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(1), 269\u2013271. https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numerische Mathematik"},{"key":"6609_CR11","doi-asserted-by":"publisher","unstructured":"Elkin, M., & Kortsarz, G. (2003). Sublogarithmic approximation for telephone multicast: Path out of jungle. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 77\u201385. . https:\/\/doi.org\/10.1145\/644108.644120","DOI":"10.1145\/644108.644120"},{"key":"6609_CR12","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman & Co."},{"issue":"4","key":"6609_CR13","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E. N. (1959). Random graphs. The Annals of Mathematical Statistics, 30(4), 1141\u20131144. https:\/\/doi.org\/10.1214\/aoms\/1177706098","journal-title":"The Annals of Mathematical Statistics"},{"key":"6609_CR14","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"J Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J., & Resende, M. (2011). Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics, 17, 487\u2013525. https:\/\/doi.org\/10.1007\/s10732-010-9143-1","journal-title":"Journal of Heuristics"},{"key":"6609_CR15","doi-asserted-by":"crossref","unstructured":"Harutyunyan, H.A., & Kamali, S. (2008). Efficient broadcasting in networks with weighted nodes. 2008 14th IEEE International Conference on Parallel and Distributed Systems (pp.\u00a0879-884).","DOI":"10.1109\/ICPADS.2008.27"},{"key":"6609_CR16","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.dam.2016.09.029","volume":"216","author":"HA Harutyunyan","year":"2017","unstructured":"Harutyunyan, H. A., & Kamali, S. (2017). Efficient broadcast trees for weighted vertices. Discrete Applied Mathematics, 216, 598\u2013608. https:\/\/doi.org\/10.1016\/j.dam.2016.09.029","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"6609_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1002\/1097-0037(200103)37:2<94::AID-NET4>3.0.CO;2-6","volume":"37","author":"HA Harutyunyan","year":"2001","unstructured":"Harutyunyan, H. A., & Liestman, A. L. (2001). Improved upper and lower bounds for k-broadcasting. Networks, 37(2), 94\u2013101.","journal-title":"Networks"},{"key":"6609_CR18","first-page":"501","volume-title":"Parallel Problem Solving from Nature PPSN","author":"Y Hasson","year":"2004","unstructured":"Hasson, Y., & Sipper, M., et al. (2004). A novel ant algorithm for solving the minimum broadcast time problem. In X. Yao (Ed.), Parallel Problem Solving from Nature PPSN (Vol. VII, pp. 501\u2013510). Berlin Heidelberg: Springer."},{"key":"6609_CR19","doi-asserted-by":"publisher","first-page":"100822","DOI":"10.1016\/j.disopt.2024.100822","volume":"51","author":"D Haugland","year":"2024","unstructured":"Haugland, D. (2024). Tighter bounds on the minimum broadcast time. Discrete Optimization, 51, 100822. https:\/\/doi.org\/10.1016\/j.disopt.2024.100822","journal-title":"Discrete Optimization"},{"issue":"4","key":"6609_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi, S. M., Hedetniemi, S. T., & Liestman, A. L. (1988). A survey of gossiping and broadcasting in communication networks. Networks, 18(4), 319\u2013349. https:\/\/doi.org\/10.1002\/net.3230180406","journal-title":"Networks"},{"key":"6609_CR21","first-page":"247","volume-title":"Smart combat simulations in terms of industry 4.0. Simulation for industry 4.0","author":"MF Hocao\u011flu","year":"2019","unstructured":"Hocao\u011flu, M. F., & Gen\u00e7, \u0130. (2019). Smart combat simulations in terms of industry 4.0. Simulation for industry 4.0 (pp. 247\u2013273). Springer."},{"key":"6609_CR22","doi-asserted-by":"crossref","unstructured":"Hoelting, C.J. , Schoenefeld, D.A. & Wainwright, R.L. (1996). A genetic algorithm for the minimum broadcast time problem using a global precedence vector. Proceedings of the 1996 ACM Symposium on Applied Computing (pp.\u00a0258\u2013262). New York, NY, USA:Association for Computing Machinery.","DOI":"10.1145\/331119.331187"},{"key":"6609_CR23","volume-title":"Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland, J. H. (1975). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control and artificial intelligence. University of Michigan Press."},{"key":"6609_CR24","unstructured":"Ivanova, M. (2019). Optimization problems in communication networks and multi-agent path finding (Unpublished doctoral dissertation). The University of Bergen."},{"issue":"1","key":"6609_CR25","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1111\/itor.13304","volume":"32","author":"M Ivanova","year":"2025","unstructured":"Ivanova, M., Haugland, D., & Tvedt, B. H. (2025). Strong bounds and exact solutions to the minimum broadcast time problem. International Transactions in Operational Research, 32(1), 314\u2013352. https:\/\/doi.org\/10.1111\/itor.13304","journal-title":"International Transactions in Operational Research"},{"key":"6609_CR26","doi-asserted-by":"crossref","unstructured":"Keshavarz, H. , Bagheri, A. , Layeghi, K. & Seyed Iman Mahdavi. (2011). A simulated annealing approach for the freeze-tag problem. International Conference on Recent Trends in Information Systems (pp.\u00a094-98).","DOI":"10.1109\/ReTIS.2011.6146847"},{"issue":"10","key":"6609_CR27","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1109\/12.93751","volume":"40","author":"J Koh","year":"1991","unstructured":"Koh, J., & Tcha, D. (1991). Information dissemination in trees with nonuniform edge transmission times. IEEE Transactions on Computers, 40(10), 1174\u20131177. https:\/\/doi.org\/10.1109\/12.93751","journal-title":"IEEE Transactions on Computers"},{"key":"6609_CR28","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0035167","volume-title":"Theory of computing and systems","author":"G Kortsarz","year":"1992","unstructured":"Kortsarz, G., & Peleg, D. (1992). Approximation algorithms for minimum time broadcast. In D. Dolev, Z. Galil, & M. Rodeh (Eds.), Theory of computing and systems (pp. 67\u201378). Springer."},{"issue":"1","key":"6609_CR29","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/s0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1), 48\u201348. https:\/\/doi.org\/10.1090\/s0002-9939-1956-0078686-7","journal-title":"Proceedings of the American Mathematical Society"},{"key":"6609_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0166-218X(92)90147-3","volume":"37\u201338","author":"E Lazard","year":"1992","unstructured":"Lazard, E. (1992). Broadcasting in dma-bound bounded degree graphs. Discrete Applied Mathematics, 37\u201338, 387\u2013400.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"6609_CR31","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1111\/itor.13146","volume":"31","author":"A Lima","year":"2024","unstructured":"Lima, A., Aquino, A. L. L., Nogueira, B., & Pinheiro, R. G. S. (2024). A matheuristic approach for the minimum broadcast time problem using a biased random-key genetic algorithm. International Transactions in Operational Research, 31(1), 246\u2013273. https:\/\/doi.org\/10.1111\/itor.13146","journal-title":"International Transactions in Operational Research"},{"key":"6609_CR32","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L. P., Birattari, M., & St\u00fctzle, T. (2016). The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3, 43\u201358. https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Operations Research Perspectives"},{"issue":"1","key":"6609_CR33","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s11750-011-0176-x","volume":"20","author":"MGC Resende","year":"2011","unstructured":"Resende, M. G. C. (2011). Biased random-key genetic algorithms with applications in telecommunications. TOP, 20(1), 130\u2013153. https:\/\/doi.org\/10.1007\/s11750-011-0176-x","journal-title":"TOP"},{"issue":"6","key":"6609_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3284358","volume":"51","author":"JA Rico-Gallego","year":"2019","unstructured":"Rico-Gallego, J. A., D\u00edaz-Mart\u00edn, J. C., Manumachu, R. R., & Lastovetsky, A. L. (2019). A survey of communication performance models for high-performance computing. ACM Computing Surveys (CSUR), 51(6), 1\u201336. https:\/\/doi.org\/10.1145\/3284358","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"6609_CR35","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-030-64583-0_40","volume-title":"Machine learning, optimization, and data science","author":"F Robledo","year":"2020","unstructured":"Robledo, F., Rodr\u00edguez-Bocca, P., & Romero, P., et al. (2020). Optimal broadcast strategy in homogeneous point-to-point networks. In G. Nicosia (Ed.), Machine learning, optimization, and data science (pp. 448\u2013457). Springer International Publishing."},{"key":"6609_CR36","doi-asserted-by":"publisher","unstructured":"Scheuermann, & Wu. (1984). Heuristic algorithms for broadcasting in point-to-point computer networks. IEEE Transactions on Computers C, 33(9), 804\u2013811. https:\/\/doi.org\/10.1109\/TC.1984.1676496","DOI":"10.1109\/TC.1984.1676496"},{"issue":"1","key":"6609_CR37","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s11464-009-0050-4","volume":"5","author":"W Shang","year":"2010","unstructured":"Shang, W., Wan, P., & Hu, X. (2010). Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks. Frontiers of Mathematics in China, 5(1), 75\u201387. https:\/\/doi.org\/10.1007\/s11464-009-0050-4","journal-title":"Frontiers of Mathematics in China"},{"issue":"4","key":"6609_CR38","doi-asserted-by":"publisher","first-page":"6920","DOI":"10.1137\/0210052","volume":"10","author":"PJ Slater","year":"1981","unstructured":"Slater, P. J., Cockayne, E. J., & Hedetniemi, S. T. (1981). Information dissemination in trees. SIAM Journal on Computing, 10(4), 6920\u2013701. https:\/\/doi.org\/10.1137\/0210052","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"6609_CR39","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1504\/IJMHEUR.2020.111611","volume":"7","author":"AD Sousa","year":"2020","unstructured":"Sousa, A. D., Gallo, G., Guti\u00e9rrez, S., Robledo, F., Rodr\u00edguez-Bocca, P., & Romero, P. (2020). A tree-block decomposition-based heuristic for the minimum broadcast time. International Journal of Metaheuristics, 7(4), 379\u2013401. https:\/\/doi.org\/10.1504\/IJMHEUR.2020.111611","journal-title":"International Journal of Metaheuristics"},{"key":"6609_CR40","unstructured":"Spears, V.M., & Jong, K.A.D. (1991). On the virtues of parameterized uniform crossover. In Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 230\u2013236)."},{"key":"6609_CR41","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2016.01.031","volume":"621","author":"YH Su","year":"2016","unstructured":"Su, Y. H., Lin, C. C., & Lee, D. (2016). Broadcasting in weighted trees under the postal model. Theoretical Computer Science, 621, 73\u201381. https:\/\/doi.org\/10.1016\/j.tcs.2016.01.031","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6609_CR42","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/10556788.2021.1884250","volume":"30","author":"RF Toso","year":"2015","unstructured":"Toso, R. F., & Resende, M. G. (2015). A C++ application programming interface for biased random-key genetic algorithms. Optimization Methods and Software, 30(1), 81\u201393. https:\/\/doi.org\/10.1080\/10556788.2021.1884250","journal-title":"Optimization Methods and Software"},{"issue":"4","key":"6609_CR43","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/s10878-012-9493-8","volume":"25","author":"CH Tsou","year":"2013","unstructured":"Tsou, C. H., Chen, G. H., Yu, H. I., & Lin, C. C. (2013). The broadcast median problem in heterogeneous postal model. Journal of Combinatorial Optimization, 25(4), 602\u2013616. https:\/\/doi.org\/10.1007\/s10878-012-9493-8","journal-title":"Journal of Combinatorial Optimization"},{"key":"6609_CR44","unstructured":"Wojciechowska, I., & Scoy, F.L. (1999). Broadcasting in grid graphs (Unpublished doctoral dissertation). USA, West Virginia University. (AAI9967246)"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06609-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06609-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06609-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T17:09:26Z","timestamp":1750093766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06609-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,9]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["6609"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06609-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2025,5,9]]},"assertion":[{"value":"26 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}