{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T06:24:21Z","timestamp":1768717461766,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["PA 3460\/1-1"],"award-info":[{"award-number":["PA 3460\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["PA 3460\/2-1"],"award-info":[{"award-number":["PA 3460\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz GmbH (DFKI)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Machine learning on trees has been mostly focused on trees as input. Much less research has investigated trees as output, which has many applications, such as molecule optimization for drug discovery, or hint generation for intelligent tutoring systems. In this work, we propose a novel autoencoder approach, called recursive tree grammar autoencoder (RTG-AE), which encodes trees via a bottom-up parser and decodes trees via a tree grammar, both learned via recursive neural networks that minimize the variational autoencoder loss. The resulting encoder and decoder can then be utilized in subsequent tasks, such as optimization and time series prediction. RTG-AEs are the first model to combine three features: recursive processing, grammatical knowledge, and deep learning. Our key message is that this unique combination of all three features outperforms models which combine any two of the three. Experimentally, we show that RTG-AE improves the autoencoding error, training time, and optimization score on synthetic as well as real datasets compared to four baselines. We further prove that RTG-AEs parse and generate trees in linear time and are expressive enough to handle all regular tree grammars.<\/jats:p>","DOI":"10.1007\/s10994-022-06223-7","type":"journal-article","created":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T20:02:25Z","timestamp":1659470545000},"page":"3393-3423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Recursive tree grammar autoencoders"],"prefix":"10.1007","volume":"111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3899-2450","authenticated-orcid":false,"given":"Benjamin","family":"Paa\u00dfen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Koprinska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalina","family":"Yacef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,2]]},"reference":[{"issue":"5","key":"6223_CR1","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1109\/TNNLS.2014.2329331","volume":"26","author":"F Aiolli","year":"2015","unstructured":"Aiolli, F., Da San, G. M., & Sperduti, A. (2015). An efficient topological distance-based tree kernel. IEEE Transactions on Neural Networks and Learning Systems, 26(5), 1115\u20131120. https:\/\/doi.org\/10.1109\/TNNLS.2014.2329331.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"6223_CR2","unstructured":"Allamanis, M., Chanthirasegaran, P., Kohli, P., & Sutton, C. (2017). Learning continuous semantic representations of symbolic expressions. In Proceedings of the ICML (pp. 80\u201388). http:\/\/proceedings.mlr.press\/v70\/allamanis17a.html."},{"key":"6223_CR3","doi-asserted-by":"publisher","unstructured":"Alon, U., Zilberstein, M., Levy, O., & Yahav, E. (2019). Code2vec: Learning distributed representations of code. In Proceedings of the ACM programming languages (Vol. 3). https:\/\/doi.org\/10.1145\/3290353.","DOI":"10.1145\/3290353"},{"key":"6223_CR4","unstructured":"Bacciu, D., Micheli, A., & Podda, M. (2019). Graph generation by sequential edge prediction. In M. Verleysen (Ed.), Proceedings of the ESANN (pp. 95\u2013100). https:\/\/www.elen.ucl.ac.be\/Proceedings\/esann\/esannpdf\/es2019-107.pdf."},{"issue":"1","key":"6223_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille, P. (2005). A survey on tree edit distance and related problems. Theoretical Computer Science, 337(1), 217\u2013239. https:\/\/doi.org\/10.1016\/j.tcs.2004.12.030.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"6223_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"WS Brainerd","year":"1969","unstructured":"Brainerd, W. S. (1969). Tree generating regular systems. Information and Control, 14(2), 217\u2013231. https:\/\/doi.org\/10.1016\/S0019-9958(69)90065-5.","journal-title":"Information and Control"},{"key":"6223_CR7","unstructured":"Burda, Y., Grosse, R. B., & Salakhutdinov, R. (2016). Importance weighted autoencoders. In Proceedings of the ICLR. arXiv:1509.00519."},{"issue":"1","key":"6223_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.5555\/973215.973219","volume":"25","author":"Z Chi","year":"1999","unstructured":"Chi, Z. (1999). Statistical properties of probabilistic context-free grammars. Computational Linguistics, 25(1), 131\u2013160. https:\/\/doi.org\/10.5555\/973215.973219.","journal-title":"Computational Linguistics"},{"key":"6223_CR9","doi-asserted-by":"crossref","unstructured":"Cho, K., van Merrienboer, B., G\u00fcl\u00e7ehre, \u00c7 ., Bougares, F., Schwenk, H., & Bengio, Y. (2014). Learning phrase representations using RNN encoder-decoder for statistical machine translation. In A. Moschitti (Ed.), Proceedings of the EMNLP (pp. 1724\u20131734). arXiv:1406.1078.","DOI":"10.3115\/v1\/D14-1179"},{"key":"6223_CR10","doi-asserted-by":"crossref","unstructured":"Collins, M., & Duffy, N. (2002). New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In P. Isabelle, E. Charniak, & D. Lin (Eds.), Proceedings of the ACL (pp.263\u2013270). http:\/\/www.aclweb.org\/anthology\/P02-1034.pdf","DOI":"10.3115\/1073083.1073128"},{"key":"6223_CR11","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., & Tommasi, M. (2008). Tree automata techniques and applications. Lyon, France: HAL open science. https:\/\/hal.inria.fr\/ hal-03367725."},{"key":"6223_CR12","unstructured":"Dai, H., Tian, Y., Dai, B., Skiena, S., & Song, L. (2018). Syntax-directed variational autoencoder for structured data. In Y. Bengio, & Y. LeCun (Eds.), Proceedings of the ICLR. Retrieved from https:\/\/openreview.net\/forum?id=SyqShMZRb."},{"key":"6223_CR13","unstructured":"Dyer, C., Kuncoro, A., Ballesteros, M., & Smith, N. A. (2016). Recurrent neural network grammars. In Proceedings of the NAACL (pp. 199\u2013209). https:\/\/www.aclweb.org\/anthology\/N16-1024.pdf."},{"key":"6223_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.neucom.2012.08.017","volume":"101","author":"C Gallicchio","year":"2013","unstructured":"Gallicchio, C., & Micheli, A. (2013). Tree echo state networks. Neurocomputing, 101, 319\u2013337. https:\/\/doi.org\/10.1016\/j.neucom.2012.08.017.","journal-title":"Neurocomputing"},{"issue":"2","key":"6223_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S1389-0417(01)00056-0","volume":"3","author":"B Hammer","year":"2002","unstructured":"Hammer, B. (2002). Recurrent networks for structured data-A unifying approach and its properties. Cognitive Systems Research, 3(2), 145\u2013165. https:\/\/doi.org\/10.1016\/S1389-0417(01)00056-0.","journal-title":"Cognitive Systems Research"},{"key":"6223_CR16","unstructured":"Jin, W., Barzilay, R., & Jaakkola, T. (2018). Junction tree variational autoencoder for molecular graph generation. In J. Dy & A. Krause (Eds.), Proceedings of the ICML (pp. 2323\u20132332). Retrieved from http:\/\/proceedings.mlr.press\/v80\/jin18a.html."},{"key":"6223_CR17","unstructured":"Kanade, A., Maniatis, P., Balakrishnan, G., & Shi, K. (2020). Learning and evaluating contextual embedding of source code. In H.D. III & A. Singh (Eds.), Proceedings of the ICML (pp. 5110\u20135121). Retrieved from http:\/\/proceedings.mlr.press\/v119\/kanade20a.html."},{"key":"6223_CR18","unstructured":"Kim, Y., Dyer, C., & Rush, A. M. (2019). Compound probabilistic contextfree grammars for grammar induction. In Proceedings of the ACL (pp. 2369\u20132385). Retrieved from https:\/\/www.aclweb.org\/anthology\/P19-1228.pdf."},{"key":"6223_CR19","unstructured":"Kingma, D., & Ba, J. (2015). Adam: A method for stochastic optimization. In Y. Bengio & Y. LeCun (Eds.), Proceedings of the ICLR. arXiv:1412.6980."},{"issue":"4","key":"6223_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1561\/2200000056","volume":"12","author":"DP Kingma","year":"2019","unstructured":"Kingma, D. P., & Welling, M. (2019). An introduction to variational autoencoders. Foundations and Trends in Machine Learning, 12(4), 307\u2013392. https:\/\/doi.org\/10.1561\/2200000056.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"6223_CR21","unstructured":"Kipf, T., & Welling, M. (2017). Semi-supervised classification with graph convolutional networks. Y. Bengio & Y. LeCun (Eds.), Proceedings of the ICLR. Retrieved from https:\/\/openreview.net\/forum?id=SJU4ayYgl."},{"key":"6223_CR22","unstructured":"Kusner, M. J., Paige, B., & Hern\u00e1ndez-Lobato, J. M. (2017). Grammar variational autoencoder. D. Precup & Y. W. Teh (Eds.), Proceedings of the ICML (pp. 1945\u20131954). http:\/\/proceedings.mlr.press\/v70\/kusner17a.html."},{"key":"6223_CR23","doi-asserted-by":"publisher","unstructured":"Li, B., Cheng, J., Liu, Y., & Keller, F. (2019). Dependency grammar induction with a neural variational transition-based parser. In Proceedings of the AAAI (pp. 6658\u20136665). https:\/\/doi.org\/10.1609\/aaai.v33i01.33016658.","DOI":"10.1609\/aaai.v33i01.33016658"},{"key":"6223_CR24","unstructured":"Liu, Q., Allamanis, M., Brockschmidt, M., & Gaunt, A. (2018). Constrained graph variational autoencoders for molecule design. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, & R. Garnett (Eds.), Proceedings of the NeurIPS (pp. 7795\u20137804). Retrieved from http:\/\/papers.nips.cc\/paper\/8005-constrained-graph-variational-autoencoders-for-molecule-design."},{"key":"6223_CR25","unstructured":"Loshchilov, I., & Hutter, F. (2016). CMA-ES for hyperparameter optimization of deep neural networks. arXiv, 1604.07269 . arXiv:1604.07269."},{"issue":"3","key":"6223_CR26","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/TNN.2008.2010350","volume":"20","author":"A Micheli","year":"2009","unstructured":"Micheli, A. (2009). Neural network for graphs: A contextual constructive approach. IEEE Transactions on Neural Networks, 20(3), 498\u2013511. https:\/\/doi.org\/10.1109\/TNN.2008.2010350.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6223_CR27","unstructured":"Paa\u00dfen, B., Grattarola, D., Zambon, D., Alippi, C., & Hammer, B. (2021). Graph edit networks. In S. Mohamed, K. Hofmann, A. Oh, N. Murray, & I. Titov (Eds.), Proceedings of the ICLR. https:\/\/openreview.net\/forum?id=dlEJsyHGeaL."},{"issue":"1","key":"6223_CR28","first-page":"1","volume":"10","author":"B Paa\u00dfen","year":"2018","unstructured":"Paa\u00dfen, B., Hammer, B., Price, T., Barnes, T., Gross, S., & Pinkwart, N. (2018). The continuous hint factory\u2013providing hints in vast and sparsely populated edit distance spaces. Journal of Educational Data Mining, 10(1), 1\u201335.","journal-title":"Journal of Educational Data Mining"},{"key":"6223_CR29","doi-asserted-by":"publisher","unstructured":"Paa\u00dfen, B., Koprinska, I., & Yacef, K. (2020). Tree echo state autoencoders with grammars. In A. Roy (Ed.), Proceedings of the IJCNN (pp. 1\u20138). Retrieved from https:\/\/doi.org\/10.1109\/IJCNN48605.2020.9207165","DOI":"10.1109\/IJCNN48605.2020.9207165"},{"key":"6223_CR30","unstructured":"Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Chintala, S. (2019). Pytorch: An imperative style, high-performance deep learning library. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9 Buc, E. Fox, & R. Garnett (Eds.), Proceedings of the NeurIPS (pp. 8026\u20138037). http:\/\/papers.nips.cc\/paper\/9015-pytorch-an-imperative-style-high-performance-deep-learning-library."},{"issue":"1","key":"6223_CR31","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0004-3702(90)90005-K","volume":"46","author":"JB Pollack","year":"1990","unstructured":"Pollack, J. B. (1990). Recursive distributed representations. Artificial Intelligence, 46(1), 77\u2013105. https:\/\/doi.org\/10.1016\/0004-3702(90)90005-K.","journal-title":"Artificial Intelligence"},{"issue":"6400","key":"6223_CR32","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1126\/science.aat2663","volume":"361","author":"B Sanchez-Lengeling","year":"2018","unstructured":"Sanchez-Lengeling, B., & Aspuru-Guzik, A. (2018). Inverse molecular design using machine learning: Generative models for matter engineering. Science, 361(6400), 360\u2013365. https:\/\/doi.org\/10.1126\/science.aat2663.","journal-title":"Science"},{"issue":"1","key":"6223_CR33","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2009","unstructured":"Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009). The graph neural network model. IEEE Transactions on Neural Networks, 20(1), 61\u201380. https:\/\/doi.org\/10.1109\/TNN.2008.2005605.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"4","key":"6223_CR34","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1080\/09540099408915733","volume":"6","author":"A Sperduti","year":"1994","unstructured":"Sperduti, A. (1994). Labelling recursive auto-associative memory. Connection Science, 6(4), 429\u2013459. https:\/\/doi.org\/10.1080\/09540099408915733.","journal-title":"Connection Science"},{"issue":"3","key":"6223_CR35","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/72.572108","volume":"8","author":"A Sperduti","year":"1997","unstructured":"Sperduti, A., & Starita, A. (1997). Supervised neural networks for the classification of structures. IEEE Transactions on Neural Networks, 8(3), 714\u2013735. https:\/\/doi.org\/10.1109\/72.572108.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6223_CR36","unstructured":"S\u00f8nderby, C. K., Raiko, T., Maal\u00f8e, L., S\u00f8nderby, S. K., Winther, O. (2016). Ladder variational autoencoders. In D. Lee, M. Sugiyama, U. Luxburg, I. Guyon, & R. Garnett (Eds.), Proceedings of the NeurIPS. https:\/\/proceedings.neurips.cc\/paper\/2016\/file\/6ae07dcb33ec3b7c814df797cbda0f87-Paper.pdf."},{"key":"6223_CR37","doi-asserted-by":"crossref","unstructured":"Tai, K. S., Socher, R., & Manning, C. D. (2015). Improved semantic representations from tree-structured long short-term memory networks. In Proceedings of the ACL (pp. 1556\u20131566).","DOI":"10.3115\/v1\/P15-1150"},{"issue":"8","key":"6223_CR38","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1162\/08997660360675099","volume":"15","author":"P Ti\u0148o","year":"2003","unstructured":"Ti\u0148o, P., & Hammer, B. (2003). Architectural bias in recurrent neural networks: Fractal analysis. Neural Computation, 15(8), 1931\u20131957. https:\/\/doi.org\/10.1162\/08997660360675099.","journal-title":"Neural Computation"},{"key":"6223_CR39","first-page":"271","volume":"6","author":"G Tur\u00e1n","year":"1983","unstructured":"Tur\u00e1n, G. (1983). On the complexity of graph grammars. Acta Cybernetica, 6, 271\u2013281.","journal-title":"Acta Cybernetica"},{"issue":"1","key":"6223_CR40","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1021\/ci00057a005","volume":"28","author":"D Weininger","year":"1988","unstructured":"Weininger, D. (1988). Smiles, a chemical language and information system. 1. Introduction to methodology and encoding rules. Journal of Chemical Information and Computer Sciences, 28(1), 31\u201336. https:\/\/doi.org\/10.1021\/ci00057a005.","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"6223_CR41","unstructured":"Xu, K., Hu, W., Leskovec, J., & Jegelka, S. (2019). How powerful are graph neural networks? In T. Sainath, A. Rush, S. Levine, K. Livescu, & S. Mohamed (Eds.), Proceedings of the ICLR. arXiv:1810.00826."},{"key":"6223_CR42","unstructured":"Yogatama, D., Blunsom, P., Dyer, C., Grefenstette, E., & Ling, W. (2017). Learning to compose words into sentences with reinforcement learning. In Y. Bengio & Y. LeCun (Eds.), Proceedings of the ICLR. https:\/\/openreview.net\/forum?id=Skvgqgqxe."},{"key":"6223_CR43","unstructured":"You, J., Ying, R., Ren, X., Hamilton, W., & Leskovec, J. (2018). GraphRNN: Generating realistic graphs with deep auto-regressive models. In J. Dy & A. Krause (Eds.), Proceedings of the ICML (pp. 5708\u20135717). Retrieved from http:\/\/proceedings.mlr.press\/v80\/you18a.html."},{"key":"6223_CR44","unstructured":"Zaremba, W., Kurach, K., & Fergus, R. (2014). Learning to discover efficient mathematical identities. In Proceedings of the neurips (Vol. 27, pp. 1278\u20131286). https:\/\/proceedings.neurips.cc\/paper\/2014\/file\/08419be897405321542838d77f855226-Paper.pdf."},{"key":"6223_CR45","doi-asserted-by":"publisher","unstructured":"Zhang, J., Wang, X., Zhang, H., Sun, H., Wang, K., Liu, X. (2019). A novel neural source code representation based on abstract syntax tree. In Proceedings of the ICSE (pp. 783-794). https:\/\/doi.org\/10.1109\/ICSE.2019.00086.","DOI":"10.1109\/ICSE.2019.00086"},{"issue":"6","key":"6223_CR46","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang, K., & Shasha, D. (1989). Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing, 18(6), 1245\u20131262. https:\/\/doi.org\/10.1137\/0218082.","journal-title":"SIAM Journal on Computing"},{"key":"6223_CR47","unstructured":"Zhang, M., Jiang, S., Cui, Z., Garnett, R., Chen, Y. (2019). D-VAE: A variational autoencoder for directed acyclic graphs. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9 Buc, E. Fox, & R. Garnett (Eds.), Proceedings of the NeurIPS (pp. 1586\u20131598). http:\/\/papers.nips.cc\/paper\/8437-d-vae-a-variational-autoencoder-for-directed-acyclic-graphs."},{"key":"6223_CR48","doi-asserted-by":"publisher","unstructured":"Zhao, S., Song, J., Ermon, S. (2019, Jul.). Infovae: Balancing learning and inference in variational autoencoders. In Proceedings of the AAAI (pp. 5885\u20135892). https:\/\/doi.org\/10.1609\/aaai.v33i01.33015885.","DOI":"10.1609\/aaai.v33i01.33015885"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06223-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06223-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06223-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T23:13:19Z","timestamp":1663283599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06223-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":48,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["6223"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06223-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"16 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2022","order":4,"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 conflict of interest (beyond the funding acknowledged above).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}