{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T10:54:59Z","timestamp":1771930499306,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001655","name":"Deutscher Akademischer Austauschdienst","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Interdisciplinary Public Policy Mainz"},{"name":"Johannes Gutenberg-Universit\u00e4t Mainz"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Denoising autoencoder genetic programming (DAE-GP) is a novel neural network-based estimation of distribution genetic programming approach that uses denoising autoencoder long short-term memory networks as a probabilistic model to replace the standard mutation and recombination operators of genetic programming. At each generation, the idea is to capture promising properties of the parent population in a probabilistic model and to use corruption to transfer variations of these properties to the offspring. This work studies the influence of corruption and sampling steps on search. Corruption partially mutates candidate solutions that are used as input to the model, whereas the number of sampling steps defines how often we re-use the output during model sampling as input to the model. We study the generalization of the royal tree problem, the Airfoil problem, and the Pagie-1 problem, and find that both corruption strength and the number of sampling steps influence exploration and exploitation in search and affect performance: exploration increases with stronger corruption and lower number of sampling steps. The results indicate that both corruption and sampling steps are key to the success of the DAE-GP: it permits us to balance the exploration and exploitation behavior in search, resulting in an improved search quality. However, also selection is important for exploration and exploitation and should be chosen wisely.<\/jats:p>","DOI":"10.1007\/s10710-023-09462-2","type":"journal-article","created":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T19:01:37Z","timestamp":1699470097000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Denoising autoencoder genetic programming: strategies to control exploration and exploitation in search"],"prefix":"10.1007","volume":"24","author":[{"given":"David","family":"Wittenberg","sequence":"first","affiliation":[]},{"given":"Franz","family":"Rothlauf","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Gagn\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,8]]},"reference":[{"issue":"2","key":"9462_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10710-013-9205-x","volume":"15","author":"K Kim","year":"2014","unstructured":"K. Kim, Y. Shan, X.H. Nguyen, R.I. McKay, Probabilistic model building in genetic programming: a critical review. Genet. Program Evolvable Mach. 15(2), 115\u2013167 (2014). https:\/\/doi.org\/10.1007\/s10710-013-9205-x","journal-title":"Genet. Program Evolvable Mach."},{"key":"9462_CR2","unstructured":"M. Pelikan, M.W. Hauschild, F.G. Lobo, Introduction to estimation of distribution algorithms. Missouri Estimation of Distribution Algorithms Laboratory (MEDAL), Report Nr. 2012003 (2012)"},{"key":"9462_CR3","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":"J.H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence (University of Michigan Press, Ann Arbor, 1975)"},{"key":"9462_CR4","doi-asserted-by":"publisher","unstructured":"D. Wittenberg, F. Rothlauf, D. Schweim, DAE-GP: Denoising autoencoder LSTM networks as probabilistic models in estimation of distribution genetic programming, in Proceedings of the 2020 Genetic and Evolutionary Computation Conference. GECCO\u201920 (ACM, New York, 2020), pp. 1037\u20131045. https:\/\/doi.org\/10.1145\/3377930.3390180","DOI":"10.1145\/3377930.3390180"},{"key":"9462_CR5","doi-asserted-by":"publisher","unstructured":"P. Vincent, H. Larochelle, Y. Bengio, P.A. Manzagol, Extracting and composing robust features with denoising autoencoders, in Proceedings of the 25th International Conference on Machine Learning (ICML\u201908) (ACM, Helsinki, 2008), pp. 1096\u20131103. https:\/\/doi.org\/10.1145\/1390156.1390294","DOI":"10.1145\/1390156.1390294"},{"issue":"78","key":"9462_CR6","first-page":"1","volume":"21","author":"M Probst","year":"2020","unstructured":"M. Probst, F. Rothlauf, Harmless overfitting: Using denoising autoencoders in estimation of distribution algorithms. J. Mach. Learn. Res. 21(78), 1\u201331 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"9462_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72962-4","volume-title":"Design of Modern Heuristics: Principles and Application","author":"F Rothlauf","year":"2011","unstructured":"F. Rothlauf, Design of Modern Heuristics: Principles and Application, 1st edn. (Springer, Berlin, 2011). https:\/\/doi.org\/10.1007\/978-3-540-72962-4","edition":"1"},{"key":"9462_CR8","doi-asserted-by":"publisher","unstructured":"D. Wittenberg, Using denoising autoencoder genetic programming to control exploration and exploitation in search, in Genetic Programming: 25th European Conference, EuroGP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20\u201322, 2022, Proceedings (Springer, Berlin, 2022), pp. 102\u2013117. https:\/\/doi.org\/10.1007\/978-3-031-02056-8_7","DOI":"10.1007\/978-3-031-02056-8_7"},{"issue":"2","key":"9462_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1137\/1025045","volume":"25","author":"JB Kruskal","year":"1983","unstructured":"J.B. Kruskal, An overview of sequence comparison: time warps, string edits, and macromolecules. Soc. Ind. Appl. Math. (SIAM) Rev. 25(2), 201\u2013237 (1983). https:\/\/doi.org\/10.1137\/1025045","journal-title":"Soc. Ind. Appl. Math. (SIAM) Rev."},{"key":"9462_CR10","unstructured":"T.F. Brooks, D.S. Pope, M.A. Marcolini, Airfoil Self-noise and Prediction, vol. 1218. National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Division (1989)"},{"issue":"4","key":"9462_CR11","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1162\/evco.1997.5.4.401","volume":"5","author":"L Pagie","year":"1997","unstructured":"L. Pagie, P. Hogeweg, Evolutionary consequences of coevolving targets. Evol. Comput. 5(4), 401\u2013418 (1997)","journal-title":"Evol. Comput."},{"key":"9462_CR12","doi-asserted-by":"publisher","unstructured":"D. Wittenberg, F. Rothlauf, Denoising autoencoder genetic programming for real-world symbolic regression, in Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO\u201922 (Association for Computing Machinery, New York, 2022), pp. 612\u2013614. https:\/\/doi.org\/10.1145\/3520304.3528921","DOI":"10.1145\/3520304.3528921"},{"key":"9462_CR13","doi-asserted-by":"publisher","unstructured":"D. Wittenberg, F. Rothlauf, Small solutions for real-world symbolic regression using denoising autoencoder genetic programming, in Genetic Programming: 26th European Conference, EuroGP 2023, Held as Part of EvoStar 2023, Brno, Czech Republic, April 12\u201314, 2023, Proceedings (Springer, Berlin, 2023), pp. 101\u2013116. https:\/\/doi.org\/10.1007\/978-3-031-29573-7_7","DOI":"10.1007\/978-3-031-29573-7_7"},{"key":"9462_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-34954-9_6","volume-title":"Scalable Optimization Via Probabilistic Modeling","author":"Y Shan","year":"2006","unstructured":"Y. Shan, R. McKay, D. Essam, H. Abbass, A survey of probabilistic model building genetic programming, in Scalable Optimization Via Probabilistic Modeling. ed. by M. Pelikan, K. Sastry, E. Cant\u00faPaz (Springer, Berlin, 2006), pp.121\u2013160"},{"issue":"2","key":"9462_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1162\/evco.1997.5.2.123","volume":"5","author":"R Salustowicz","year":"1997","unstructured":"R. Salustowicz, J. Schmidhuber, Probabilistic incremental program evolution. Evol. Comput. 5(2), 123\u2013141 (1997). https:\/\/doi.org\/10.1162\/evco.1997.5.2.123","journal-title":"Evol. Comput."},{"key":"9462_CR16","doi-asserted-by":"publisher","unstructured":"K. Yanai, H. Iba, Estimation of distribution programming based on Bayesian network, in IEEE Congress on Evolutionary Computation (CEC\u201903) (IEEE, Canberra, 2003), pp. 1618\u20131625. https:\/\/doi.org\/10.1109\/CEC.2003.1299866","DOI":"10.1109\/CEC.2003.1299866"},{"key":"9462_CR17","unstructured":"Y. Hasegawa, H. Iba, Estimation of Bayesian network for program generation, in Proceedings of the Third Asian-Pacific Workshop on Genetic Programming Hanoi, Vietnam (2006), pp. 35\u201346"},{"issue":"6","key":"9462_CR18","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/tevc.2008.915999","volume":"12","author":"Y Hasegawa","year":"2008","unstructured":"Y. Hasegawa, H. Iba, A Bayesian network approach to program generation. IEEE Trans. Evol. Comput. 12(6), 750\u2013764 (2008). https:\/\/doi.org\/10.1109\/tevc.2008.915999","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9462_CR19","doi-asserted-by":"crossref","unstructured":"A. Ratle, M. Sebag, Avoiding the bloat with probabilistic grammar-based genetic programming, in 5th International Conference on Artificial Evolution (EA\u201901) (Springer, Le Creusot, 2001), pp. 255\u2013266","DOI":"10.1007\/3-540-46033-0_21"},{"key":"9462_CR20","doi-asserted-by":"publisher","unstructured":"Y. Hasegawa, H. Iba, Estimation of distribution algorithm based on probabilistic grammar with latent annotations, in Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201917) (IEEE, Singapore, 2007), pp. 1043\u20131050. https:\/\/doi.org\/10.1109\/CEC.2007.4424585","DOI":"10.1109\/CEC.2007.4424585"},{"key":"9462_CR21","doi-asserted-by":"crossref","unstructured":"P.-K. Wong, L.-Y. Lo, M.-L. Wong, K.-S. Leung, Grammar-based genetic programming with Bayesian network, in IEEE Congress on Evolutionary Computation (CEC\u201914) (IEEE, Beijing, 2014), pp. 739\u2013746","DOI":"10.1109\/CEC.2014.6900423"},{"key":"9462_CR22","doi-asserted-by":"publisher","unstructured":"P.-K. Wong, L.-Y. Lo, M.-L. Wong, K.-S. Leung, grammar-based genetic programming with dependence learning and Bayesian network classifier, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201914) (ACM, Vancouver, 2014), pp. 959\u2013966. https:\/\/doi.org\/10.1145\/2576768.2598256","DOI":"10.1145\/2576768.2598256"},{"key":"9462_CR23","doi-asserted-by":"crossref","unstructured":"R. Poli, N.F. McPhee, A Linear estimation-of-distribution GP system, in Proceedings of the 11th European Conference on Genetic Programming (EuroGP\u201908) (Springer, Neapel, 2008), pp. 206\u2013217","DOI":"10.1007\/978-3-540-78671-9_18"},{"key":"9462_CR24","doi-asserted-by":"publisher","unstructured":"E. Hemberg, K. Veeramachaneni, J. McDermott, C. Berzan, U.-M. O\u2019Reilly, An investigation of local patterns for estimation of distribution genetic programming, in Proceedings of the genetic and evolutionary computation conference (GECCO \u201912) (ACM, Philadelphia, 2012), pp. 767\u2013774. https:\/\/doi.org\/10.1145\/2330163.2330270","DOI":"10.1145\/2330163.2330270"},{"key":"9462_CR25","doi-asserted-by":"publisher","unstructured":"P. Liskowski, K. Krawiec, N.E. Toklu, J. Swan, Program synthesis as latent continuous optimization: evolutionary search in neural embeddings, in Proceedings of the 2020 Genetic and Evolutionary Computation Conference. GECCO\u201920 (Association for Computing Machinery, New York, 2020), pp. 359\u2013367. https:\/\/doi.org\/10.1145\/3377930.3390213","DOI":"10.1145\/3377930.3390213"},{"key":"9462_CR26","doi-asserted-by":"crossref","unstructured":"M. Probst, Denoising autoencoders for fast combinatorial black box optimization, in Proceedings of the Companion Publication of the Annual Conference on Genetic and Evolutionary Computation (ACM, Madrid, 2015), pp. 1459\u20131460","DOI":"10.1145\/2739482.2764691"},{"key":"9462_CR27","doi-asserted-by":"publisher","unstructured":"N. Srivastava, E. Mansimov, R. Salakhutdinov, Unsupervised learning of video representations using LSTMs, in Proceedings of the 32nd International Conference on Machine Learning (ICML\u201915) (ACM, Lille, 2015), pp. 843\u2013852. https:\/\/doi.org\/10.5555\/3045118.3045209","DOI":"10.5555\/3045118.3045209"},{"issue":"8","key":"9462_CR28","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"S. Hochreiter, J. Schmidhuber, Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997). https:\/\/doi.org\/10.1162\/neco.1997.9.8.1735","journal-title":"Neural Comput."},{"key":"9462_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-020-09828-w","author":"D Schweim","year":"2021","unstructured":"D. Schweim, D. Wittenberg, F. Rothlauf, On sampling error in genetic programming. Natural Comput. (2021). https:\/\/doi.org\/10.1007\/s11047-020-09828-w","journal-title":"Natural Comput."},{"key":"9462_CR30","unstructured":"Y. Bengio, L. Yao, G. Alain, P. Vincent, Generalized denoising auto-encoders as generative models, in Advances on Neural Information Processing Systems (NIPS\u201913), vol. 26, pp. 899\u2013907 (2013)"},{"key":"9462_CR31","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"J.R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection (MIT press, Cambridge, 1992)"},{"key":"9462_CR32","first-page":"299","volume-title":"Advances in Genetic Programming II","author":"B Punch","year":"1996","unstructured":"B. Punch, D. Zongker, E. Goodman, The royal tree problem, a benchmark for single and multi-population genetic programming, in Advances in Genetic Programming II. ed. by P.J. Angeline, K.E. Kinnear Jr. (MIT Press, Cambridge, 1996), pp.299\u2013316"},{"key":"9462_CR33","doi-asserted-by":"publisher","unstructured":"J.F.B.S. Martins, L.O.V.B. Oliveira, L.F. Miranda, F. Casadei, G.L. Pappa, Solving the exponential growth of symbolic regression trees in geometric semantic genetic programming, in Proceedings of the Genetic and Evolutionary Computation Conference. GECCO\u201918 (Association for Computing Machinery, New York, 2018), pp. 1151\u20131158. https:\/\/doi.org\/10.1145\/3205455.3205593","DOI":"10.1145\/3205455.3205593"},{"key":"9462_CR34","doi-asserted-by":"publisher","unstructured":"V.V. de Melo, D.V. Vargas, W. Banzhaf, Batch tournament selection for genetic programming: The quality of lexicase, the speed of tournament, in Proceedings of the Genetic and Evolutionary Computation Conference. GECCO\u201919 (Association for Computing Machinery, New York, 2019), pp. 994\u20131002. https:\/\/doi.org\/10.1145\/3321707.3321793","DOI":"10.1145\/3321707.3321793"},{"issue":"2","key":"9462_CR35","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1162\/evco_a_00278","volume":"29","author":"M Virgolin","year":"2021","unstructured":"M. Virgolin, T. Alderliesten, C. Witteveen, P.A.N. Bosman, Improving model-based genetic programming for symbolic regression of small expressions. Evol. Comput. 29(2), 211\u2013237 (2021). https:\/\/doi.org\/10.1162\/evco_a_00278","journal-title":"Evol. Comput."},{"key":"9462_CR36","unstructured":"D. Dua, C. Graff, UCI Machine Learning Repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"9462_CR37","doi-asserted-by":"publisher","unstructured":"J. McDermott, D.R. White, S. Luke, L. Manzoni, M. Castelli, L. Vanneschi, W. Jaskowski, K. Krawiec, R. Harper, K. De Jong, U.-M. O\u2019Reilly, Genetic programming needs better benchmarks, in Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation. GECCO\u201912 (Association for Computing Machinery, New York, 2012), pp. 791\u2013798. https:\/\/doi.org\/10.1145\/2330163.2330273","DOI":"10.1145\/2330163.2330273"},{"issue":"1","key":"9462_CR38","first-page":"2171","volume":"13","author":"FA Fortin","year":"2012","unstructured":"F.A. Fortin, F.M. De Rainville, M.A. Gardner, M. Parizeau, C. Gag\u0144e, DEAP: Evolutionary algorithms made easy. J. Mach. Learn. Res. 13(1), 2171\u20132175 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9462_CR39","unstructured":"F. Chollet, keras. GitHub (2015). https:\/\/github.com\/fchollet\/keras"},{"issue":"1","key":"9462_CR40","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/TEVC.2012.2195319","volume":"17","author":"J Ni","year":"2013","unstructured":"J. Ni, R.H. Drieberg, P.I. Rockett, The use of an analytic quotient operator in genetic programming. IEEE Trans. Evol. Comput. 17(1), 146\u2013152 (2013). https:\/\/doi.org\/10.1109\/TEVC.2012.2195319","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9462_CR41","unstructured":"D.P. Kingma, J. Ba, Adam: A method for stochastic optimization, in International Conference on Learning Representations, San Diego, CA, USA (2015)"},{"key":"9462_CR42","doi-asserted-by":"publisher","unstructured":"U.-M. O\u2019Reilly, Using a distance metric on genetic programs to understand genetic operators, in 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, vol. 5 (1997), pp. 4092\u20134097. https:\/\/doi.org\/10.1109\/ICSMC.1997.637337","DOI":"10.1109\/ICSMC.1997.637337"},{"key":"9462_CR43","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-030-16670-0_5","volume-title":"Genetic Programming","author":"J Kelly","year":"2019","unstructured":"J. Kelly, E. Hemberg, U.-M. O\u2019Reilly, Improving genetic programming with novel exploration\u2013exploitation control, in Genetic Programming. ed. by L. Sekanina, T. Hu, N. Louren\u00e7o, H. Richter, P. Garc\u00eda-S\u00e1nchez (Springer, Cham, 2019), pp.64\u201380"},{"key":"9462_CR44","doi-asserted-by":"publisher","unstructured":"W. La Cava, L. Spector, K. Danai, Epsilon-lexicase selection for regression, in Proceedings of the Genetic and Evolutionary Computation Conference 2016. GECCO\u201916 (Association for Computing Machinery, New York, 2016), pp. 741\u2013748. https:\/\/doi.org\/10.1145\/2908812.2908898","DOI":"10.1145\/2908812.2908898"},{"key":"9462_CR45","doi-asserted-by":"publisher","unstructured":"C. Olmscheid, D. Wittenberg, D. Sobania, F. Rothlauf, Improving estimation of distribution genetic programming with novelty initialization, in Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO\u201921 (Association for Computing Machinery, New York, 2021), pp. 261\u2013262. https:\/\/doi.org\/10.1145\/3449726.3459410","DOI":"10.1145\/3449726.3459410"},{"key":"9462_CR46","doi-asserted-by":"publisher","unstructured":"J. Reiter, D. Schweim, D. Wittenberg, Pretraining reduces runtime in denoising autoencoder genetic programming by an order of magnitude, in Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO\u201923 (Association for Computing Machinery, New York, 2023). https:\/\/doi.org\/10.1145\/3583133.3596332","DOI":"10.1145\/3583133.3596332"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-023-09462-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10710-023-09462-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-023-09462-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T18:03:23Z","timestamp":1730484203000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10710-023-09462-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,8]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9462"],"URL":"https:\/\/doi.org\/10.1007\/s10710-023-09462-2","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,8]]},"assertion":[{"value":"11 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2023","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":"Typo in corresponding email address has been corrected","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"17"}}