{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,4]],"date-time":"2026-11-04T23:20:57Z","timestamp":1793834457876,"version":"4.6.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-025-10790-9","type":"journal-article","created":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T07:21:47Z","timestamp":1753514507000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing"],"prefix":"10.1038","volume":"15","author":[{"given":"Julio","family":"Ju\u00e1rez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jes\u00fas Guillermo","family":"Falc\u00f3n-Cardona","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9 Carlos","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,26]]},"reference":[{"key":"10790_CR1","first-page":"11","volume":"1","author":"U Eliiyi","year":"2009","unstructured":"Eliiyi, U. & Eliiyi, D. T. Applications of bin packing models through the supply chain. Int. J. Bus. Manag. 1, 11\u201319 (2009).","journal-title":"Int. J. Bus. Manag."},{"key":"10790_CR2","doi-asserted-by":"publisher","first-page":"111617","DOI":"10.1016\/j.asoc.2024.111617","volume":"159","author":"Q Luo","year":"2024","unstructured":"Luo, Q., Rao, Y. & Du, B. An effective discrete artificial bee colony for the rectangular cutting problem with guillotine in transformer manufacturing. Appl. Soft Comput. 159, 111617 (2024).","journal-title":"Appl. Soft Comput."},{"key":"10790_CR3","doi-asserted-by":"publisher","first-page":"108060","DOI":"10.1016\/j.asoc.2021.108060","volume":"114","author":"Q Luo","year":"2022","unstructured":"Luo, Q., Rao, Y. & Peng, D. Ga and gwo algorithm for the special bin packing problem encountered in field of aircraft arrangement. Appl. Soft Comput. 114, 108060 (2022).","journal-title":"Appl. Soft Comput."},{"key":"10790_CR4","unstructured":"Coffman, E. G., Garey, M. R. & Johnson, D. S. Approximation algorithms for bin packing: a survey, 46\u201393 (PWS Publishing Co., USA, 1996)."},{"key":"10790_CR5","doi-asserted-by":"crossref","unstructured":"Korte, B. & Vygen, J. Bin-Packing, 489\u2013507 Springer (2018).","DOI":"10.1007\/978-3-662-56039-6_18"},{"key":"10790_CR6","first-page":"636","volume":"30","author":"C Munien","year":"2021","unstructured":"Munien, C. & Ezugwu, A. E. Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications. J. Intell. Syst. 30, 636\u2013663 (2021).","journal-title":"J. Intell. Syst."},{"key":"10790_CR7","first-page":"31","volume":"48","author":"N Pillay","year":"2012","unstructured":"Pillay, N. A study of evolutionary algorithm selection hyper-heuristics for the one-dimensional bin-packing problem. S. Afr. Comput. J. 48, 31\u201340 (2012).","journal-title":"S. Afr. Comput. J."},{"key":"10790_CR8","doi-asserted-by":"crossref","unstructured":"Ortiz-Bayliss, J.\u00a0C., Ju\u00e1rez, J. & Falc\u00f3n-Cardona, J.\u00a0G. Using $$\\mu$$ genetic algorithms for hyper-heuristic development: A preliminary study on bin packing problems. In: 2023 10th International Conference on Soft Computing & Machine Intelligence (ISCMI), 54\u201358 (IEEE, 2023).","DOI":"10.1109\/ISCMI59957.2023.10458597"},{"key":"10790_CR9","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.18.2.438","volume":"18","author":"WT Rhee","year":"1993","unstructured":"Rhee, W. T. & Talagrand, M. On line bin packing with items of random size. Math. Oper. Res. 18, 438\u2013445 (1993).","journal-title":"Math. Oper. Res."},{"key":"10790_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R. & Graham, R. L. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3, 299\u2013325 (1974).","journal-title":"SIAM J. Comput."},{"key":"10790_CR11","doi-asserted-by":"crossref","unstructured":"Coffman, E.G., Galambos, G., Martello, S. & Vigo, D. Bin packing approximation algorithms: Combinatorial analysis. Handbook of Combinatorial Optimization: Supplement Volume A 151\u2013207 (1999).","DOI":"10.1007\/978-1-4757-3023-4_3"},{"key":"10790_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C. & Roli, A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. (CSUR) 35, 268\u2013308 (2003).","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"10790_CR13","doi-asserted-by":"crossref","unstructured":"Falkenauer, E. & Delchambre, A. A genetic algorithm for bin packing and line balancing. In: Proceedings 1992 IEEE International Conference on Robotics and Automation, 1186\u20131192 (IEEE, 1992).","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"10790_CR14","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2014.10.010","volume":"55","author":"M Quiroz-Castellanos","year":"2015","unstructured":"Quiroz-Castellanos, M. et al. A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. Operat. Res. 55, 52\u201364 (2015).","journal-title":"Comput. Operat. Res."},{"key":"10790_CR15","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","volume":"145","author":"JF Gon\u00e7alves","year":"2013","unstructured":"Gon\u00e7alves, J. F. & Resende, M. G. A biased random key genetic algorithm for 2d and 3d bin packing problems. Int. J. Prod. Econ. 145, 500\u2013510 (2013).","journal-title":"Int. J. Prod. Econ."},{"key":"10790_CR16","first-page":"1","volume":"54","author":"Y Tian","year":"2021","unstructured":"Tian, Y. et al. Evolutionary large-scale multi-objective optimization: A survey. ACM Comput. Surv. (CSUR) 54, 1\u201334 (2021).","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"10790_CR17","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E. K. et al. Hyper-heuristics: A survey of the state of the art. J. Operat. Res. Soc. 64, 1695\u20131724 (2013).","journal-title":"J. Operat. Res. Soc."},{"key":"10790_CR18","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Hyde, M. R. & Kendall, G. Evolving Bin Packing Heuristics with Genetic Programming. In: Parallel Problem Solving from Nature - PPSN IX, 860\u2013869 (Springer (eds Runarsson, T. P. et al.) (Berlin Heidelberg, Berlin, Heidelberg, 2006).","DOI":"10.1007\/11844297_87"},{"key":"10790_CR19","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn, H., Far\u00edas Z\u00e1rate, C.J., Ross, P. & Valenzuela-Rend\u00f3n, M. A ga-based method to produce generalized hyper-heuristics for the 2d-regular cutting stock problem. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201906, 591-598 (ACM, New York, NY, USA, 2006).","DOI":"10.1145\/1143997.1144102"},{"key":"10790_CR20","doi-asserted-by":"publisher","first-page":"6876","DOI":"10.1016\/j.eswa.2014.04.043","volume":"41","author":"E L\u00f3pez-Camacho","year":"2014","unstructured":"L\u00f3pez-Camacho, E., Terashima-Marin, H., Ross, P. & Ochoa, G. A unified hyper-heuristic framework for solving bin packing problems. Exp. Syst. Appl. 41, 6876\u20136889 (2014).","journal-title":"Exp. Syst. Appl."},{"key":"10790_CR21","doi-asserted-by":"crossref","unstructured":"Coello Coello, C. A. & Toscano Pulido, G. A micro-genetic algorithm for multiobjective optimization. In: Evolutionary Multi-Criterion Optimization, 126\u2013140 (Springer (eds Zitzler, E. et al.) (Berlin Heidelberg, Berlin, Heidelberg, 2001).","DOI":"10.1007\/3-540-44719-9_9"},{"key":"10790_CR22","unstructured":"Goldberg, D.E. Sizing populations for serial and parallel genetic algorithms. In: Proceedings of the Third International Conference on Genetic Algorithms, 70\u201379 (Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1989)."},{"key":"10790_CR23","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10492-014-0069-z","volume":"59","author":"A Agapie","year":"2014","unstructured":"Agapie, A. & Wright, A. H. Theorerical analysis of steady state genetic algorithms. Appl. Math. 59, 509\u2013525 (2014).","journal-title":"Appl. Math."},{"key":"10790_CR24","doi-asserted-by":"crossref","unstructured":"Ortiz-Bayliss, J.C., G\u00e1rate-Escamilla, A.K. & Terashima-Mar\u00edn, H. Missing data and their effect on algorithm selection for the bin packing problem. In Mezura-Montes, E., Acosta-Mesa, H.\u00a0G., Carrasco-Ochoa, J.\u00a0A., Mart\u00ednez-Trinidad, J.\u00a0F. & Olvera-L\u00f3pez, J.\u00a0A. (eds.) Pattern Recognition, 34\u201343 (Springer Nature Switzerland, Cham, 2024).","DOI":"10.1007\/978-3-031-62836-8_4"},{"key":"10790_CR25","doi-asserted-by":"crossref","unstructured":"Silva-G\u00e1lvez, A. et al. Discovering action regions for solving the bin packing problem through hyper-heuristics. In : 2020 IEEE Symposium Series on Computational Intelligence (SSCI), 822\u2013828 (IEEE, 2020).","DOI":"10.1109\/SSCI47803.2020.9308538"},{"key":"10790_CR26","unstructured":"D\u00f3sa, G. & Sgall, J. First fit bin packing: A tight analysis. In : 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) (Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik, 2013)."},{"key":"10790_CR27","doi-asserted-by":"crossref","unstructured":"D\u00f3sa, G. & Sgall, J. Optimal analysis of best fit bin packing. In: International Colloquium on Automata, Languages, and Programming, 429\u2013441 (Springer, 2014).","DOI":"10.1007\/978-3-662-43948-7_36"},{"key":"10790_CR28","doi-asserted-by":"publisher","first-page":"227438","DOI":"10.1109\/ACCESS.2020.3046185","volume":"8","author":"C Munien","year":"2020","unstructured":"Munien, C. et al. Metaheuristic approaches for one-dimensional bin packing problem: A comparative performance study. IEEE Access 8, 227438\u2013227465 (2020).","journal-title":"IEEE Access"},{"key":"10790_CR29","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF02125404","volume":"63","author":"C Reeves","year":"1996","unstructured":"Reeves, C. Hybrid genetic algorithms for bin-packing and related problems. Ann. Oper. Res. 63, 371\u2013396 (1996).","journal-title":"Ann. Oper. Res."},{"key":"10790_CR30","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/00207169708804561","volume":"63","author":"S Hussain","year":"1997","unstructured":"Hussain, S. & Sastry, V. Application of genetic algorithm for bin packing. Int. J. Comput. Math. 63, 203\u2013214 (1997).","journal-title":"Int. J. Comput. Math."},{"key":"10790_CR31","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1057\/palgrave.jors.2601771","volume":"55","author":"J Levine","year":"2004","unstructured":"Levine, J. & Ducatelle, F. Ant colony optimization and local search for bin packing and cutting stock problems. J. Operat. Res. Soc. 55, 705\u2013716 (2004).","journal-title":"J. Operat. Res. Soc."},{"key":"10790_CR32","doi-asserted-by":"publisher","first-page":"105565","DOI":"10.1016\/j.asoc.2019.105565","volume":"82","author":"WH El-Ashmawi","year":"2019","unstructured":"El-Ashmawi, W. H. & Abd Elminaam, D. S. A modified squirrel search algorithm based on improved best fit heuristic and operator strategy for bin packing problem. Appl. Soft Comput. 82, 105565 (2019).","journal-title":"Appl. Soft Comput."},{"key":"10790_CR33","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E. A hybrid grouping genetic algorithm for bin packing. J. Heurist. 2, 5\u201330 (1996).","journal-title":"J. Heurist."},{"key":"10790_CR34","doi-asserted-by":"crossref","unstructured":"Iima, H. & Yakawa, T. A new design of genetic algorithm for bin packing. In: The 2003 Congress on Evolutionary Computation, 2003. CEC\u201903., vol.\u00a02, 1044\u20131049 (IEEE, 2003).","DOI":"10.1109\/CEC.2003.1299783"},{"key":"10790_CR35","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s12293-013-0121-7","volume":"6","author":"A Salhi","year":"2014","unstructured":"Salhi, A. & V\u00e1zquez Rodr\u00edguez, J. A. Tailoring hyper-heuristics to specific instances of a scheduling problem using affinity and competence functions. Memet. Comput. 6, 77\u201384 (2014).","journal-title":"Memet. Comput."},{"key":"10790_CR36","doi-asserted-by":"crossref","unstructured":"Alissa, M., Sim, K. & Hart, E. Algorithm selection using deep learning without feature extraction. In: Proceedings of the Genetic and Evolutionary Computation Conference, 198\u2013206 (2019).","DOI":"10.1145\/3321707.3321845"},{"key":"10790_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-022-09505-4","volume":"29","author":"M Alissa","year":"2023","unstructured":"Alissa, M., Sim, K. & Hart, E. Automated algorithm selection: from feature-based to feature-free approaches. J. Heurist. 29, 1\u201338 (2023).","journal-title":"J. Heurist."},{"key":"10790_CR38","doi-asserted-by":"publisher","first-page":"111168","DOI":"10.1016\/j.asoc.2023.111168","volume":"151","author":"S Ali","year":"2024","unstructured":"Ali, S., Ramos, A. G., Carravilla, M. A. & Oliveira, J. F. Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead. Appl. Soft Comput. 151, 111168 (2024).","journal-title":"Appl. Soft Comput."},{"key":"10790_CR39","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10710-017-9301-4","volume":"19","author":"JC Gomez","year":"2018","unstructured":"Gomez, J. C. & Terashima-Mar\u00edn, H. Evolutionary hyper-heuristics for tackling bi-objective 2d bin packing problems. Genet. Program Evolvable Mach. 19, 151\u2013181 (2018).","journal-title":"Genet. Program Evolvable Mach."},{"key":"10790_CR40","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10462-016-9466-x","volume":"46","author":"JC Ortiz-Bayliss","year":"2016","unstructured":"Ortiz-Bayliss, J. C., Terashima-Mar\u00edn, H. & Conant-Pablos, S. E. Combine and conquer: An evolutionary hyper-heuristic approach for solving constraint satisfaction problems. Artif. Intell. Rev. 46, 327\u2013349 (2016).","journal-title":"Artif. Intell. Rev."},{"key":"10790_CR41","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D. H. & Macready, W. G. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997).","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10790_CR42","unstructured":"Whitley, D. The genitor algorithm and selection pressure: why rank-based allocation of reproductive trials is best. In: Proceedings of the Third International Conference on Genetic Algorithms, 116\u2013121 (1989)."},{"key":"10790_CR43","first-page":"289","volume":"1196","author":"K Krishnakumar","year":"1990","unstructured":"Krishnakumar, K. Micro-genetic algorithms for stationary and non-stationary function optimization. Intell. Control Adapt. Syst. 1196, 289\u2013296 (1990).","journal-title":"Intell. Control Adapt. Syst."},{"key":"10790_CR44","doi-asserted-by":"publisher","first-page":"12711","DOI":"10.1007\/s00500-019-03822-w","volume":"23","author":"LF Plata-Gonz\u00e1lez","year":"2019","unstructured":"Plata-Gonz\u00e1lez, L. F. et al. Evolutionary-based tailoring of synthetic instances for the knapsack problem. Soft. Comput. 23, 12711\u201312728 (2019).","journal-title":"Soft. Comput."},{"key":"10790_CR45","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11590-017-1192-z","volume":"12","author":"M Delorme","year":"2018","unstructured":"Delorme, M., Iori, M. & Martello, S. Bpplib: A library for bin packing and cutting stock problems. Optim. Lett. 12, 235\u2013250 (2018).","journal-title":"Optim. Lett."},{"key":"10790_CR46","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/S0377-2217(02)00239-4","volume":"146","author":"S Umetani","year":"2003","unstructured":"Umetani, S., Yagiura, M. & Ibaraki, T. One-dimensional cutting stock problem to minimize the number of different patterns. Eur. J. Oper. Res. 146, 388\u2013402 (2003).","journal-title":"Eur. J. Oper. Res."},{"key":"10790_CR47","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10951-010-0164-2","volume":"14","author":"K Matsumoto","year":"2011","unstructured":"Matsumoto, K., Umetani, S. & Nagamochi, H. On the one-dimensional stock cutting problem in the paper tube industry. J. Sched. 14, 281\u2013290 (2011).","journal-title":"J. Sched."},{"key":"10790_CR48","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A Scholl","year":"1997","unstructured":"Scholl, A., Klein, R. & J\u00fcrgens, C. Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Operat. Res. 24, 627\u2013645 (1997).","journal-title":"Comput. Operat. Res."},{"key":"10790_CR49","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01539705","volume":"18","author":"G W\u00e4scher","year":"1996","unstructured":"W\u00e4scher, G. & Gau, T. Heuristics for the integer one-dimensional cutting stock problem: A computational study. Operat-Res-Spekt 18, 131\u2013144 (1996).","journal-title":"Operat-Res-Spekt"},{"key":"10790_CR50","unstructured":"Schoenfield, J. E. Fast, exact solution of open bin packing problems without linear programming (Draft, US Army Space and Missile Defense Command, Huntsville, Alabama, USA, 2002)."},{"key":"10790_CR51","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1287\/ijoc.2015.0670","volume":"28","author":"T Gschwind","year":"2016","unstructured":"Gschwind, T. & Irnich, S. Dual inequalities for stabilized column generation revisited. INFORMS J. Comput. 28, 175\u2013194 (2016).","journal-title":"INFORMS J. Comput."},{"key":"10790_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M. & Martello, S. Bin packing and cutting stock problems: Mathematical models and exact algorithms. In EJOR 255, 1\u201320 (2016).","journal-title":"In EJOR"},{"key":"10790_CR53","doi-asserted-by":"crossref","unstructured":"Fonseca, C.M., Guerreiro, A.P., L\u00f3pez-Ib\u00e1\u00f1ez, M. & Paquete, L. On the Computation of the Empirical Attainment Function. In Takahashi, R.H., Deb, K., Wanner, E.F. & Grecco, S. (eds.) Evolutionary Multi-Criterion Optimization, 6th International Conference, EMO 2011, 106\u2013120 (Springer. Lecture Notes in Computer Science Vol. 6576, Ouro Preto, Brazil, 2011).","DOI":"10.1007\/978-3-642-19893-9_8"},{"key":"10790_CR54","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","volume":"285","author":"JH Drake","year":"2020","unstructured":"Drake, J. H., Kheiri, A., \u00d6zcan, E. & Burke, E. K. Recent advances in selection hyper-heuristics. EJOR 285, 405\u2013428 (2020).","journal-title":"EJOR"}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-10790-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-10790-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-10790-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T01:08:36Z","timestamp":1757293716000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-10790-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,26]]},"references-count":54,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["10790"],"URL":"https:\/\/doi.org\/10.1038\/s41598-025-10790-9","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,26]]},"assertion":[{"value":"11 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"27220"}}