{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:24:56Z","timestamp":1787495096338,"version":"build-2736575974"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T00:00:00Z","timestamp":1623542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T00:00:00Z","timestamp":1623542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["EMR\/2016\/002766"],"award-info":[{"award-number":["EMR\/2016\/002766"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10994-021-05966-z","type":"journal-article","created":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T12:02:17Z","timestamp":1623585737000},"page":"1609-1636","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Incorporating symbolic domain knowledge into graph neural networks"],"prefix":"10.1007","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5965-8286","authenticated-orcid":false,"given":"Tirtharaj","family":"Dash","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashwin","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lovekesh","family":"Vig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,13]]},"reference":[{"key":"5966_CR1","doi-asserted-by":"crossref","unstructured":"Alphonse, \u00c9. (2004). Macro-operators revisited in inductive logic programming. In International Conference on Inductive Logic Programming. pp. 8\u201325. Springer","DOI":"10.1007\/978-3-540-30109-7_6"},{"issue":"6","key":"5966_CR2","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1021\/mp060034z","volume":"3","author":"HY Ando","year":"2006","unstructured":"Ando, H. Y., Dehaspe, L., Luyten, W., Van Craenenbroeck, E., Vandecasteele, H., & Van Meervelt, L. (2006). Discovering h-bonding rules in crystals with inductive logic programming. Molecular pharmaceutics, 3(6), 665\u2013674.","journal-title":"Molecular pharmaceutics"},{"key":"5966_CR3","unstructured":"Barcel\u00f3, P., Kostylev, E. V., Monet, M., P\u00e9rez, J., Reutter, J., & Silva, J. P. (2020). The logical expressiveness of graph neural networks. In International Conference on Learning Representations, https:\/\/openreview.net\/forum?id=r1lZ7AEKvB"},{"issue":"4","key":"5966_CR4","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1021\/ci940128y","volume":"37","author":"II Baskin","year":"1997","unstructured":"Baskin, I. I., Palyulin, V. A., & Zefirov, N. S. (1997). A neural device for searching direct correlations between structures and properties of chemical compounds. Journal of Chemical Information and Computer Sciences, 37(4), 715\u2013721.","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"5966_CR5","unstructured":"Besold, T. R., Garcez, A. d., Bader, S., Bowman, H., Domingos, P., Hitzler, P., K\u00fchnberger, K. U., Lamb, L. C., Lowd, D., & Lima, P.M.V., et\u00a0al. (2017). Neural-symbolic learning and reasoning: A survey and interpretation. arXiv preprint arXiv:1711.03902"},{"key":"5966_CR6","unstructured":"Bianchi, F. M., Grattarola, D., Alippi, C., & Livi, L. (2019). Graph neural networks with convolutional arma filters. arXiv preprint arXiv:1901.01343"},{"key":"5966_CR7","unstructured":"Cangea, C., Veli\u010dkovi\u0107, P., Jovanovi\u0107, N., Kipf, T., & Li\u00f2, P. (2018). Towards sparse hierarchical graph classifiers. arXiv preprint arXiv:1811.01287"},{"key":"5966_CR8","doi-asserted-by":"crossref","unstructured":"Castillo, L.P., & Wrobel, S. (2002). Macro-operators in multirelational learning: a search-space reduction technique. In European Conference on Machine Learning. pp. 357\u2013368. Springer","DOI":"10.1007\/3-540-36755-1_30"},{"issue":"5","key":"5966_CR9","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2018","unstructured":"Cui, P., Wang, X., Pei, J., & Zhu, W. (2018). A survey on network embedding. IEEE Transactions on Knowledge and Data Engineering, 31(5), 833\u2013852.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"5966_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1008328630915","volume":"11","author":"AS d\u2019Avila Garcez","year":"1999","unstructured":"d\u2019Avila Garcez, A. S., & Zaverucha, G. (1999). The connectionist inductive learning and logic programming system. Appl. Intell., 11(1), 59\u201377.","journal-title":"Appl. Intell."},{"key":"5966_CR11","doi-asserted-by":"crossref","unstructured":"Dash, T., Srinivasan, A., Vig, L., Orhobor, O. I., & King, R. D. (2018). Large-scale assessment of deep relational machines. In International Conference on Inductive Logic Programming. pp. 22\u201337. Springer","DOI":"10.1007\/978-3-319-99960-9_2"},{"key":"5966_CR12","doi-asserted-by":"crossref","unstructured":"Dash, T., Srinivasan, A., Joshi, R.S., & Baskar, A. (2019). Discrete stochastic search and its application to feature-selection for deep relational machines. In International Conference on Artificial Neural Networks. pp. 29\u201345. Springer","DOI":"10.1007\/978-3-030-30484-3_3"},{"key":"5966_CR13","unstructured":"De\u00a0Raedt, L., Manhaeve, R., Dumancic, S., Demeester, T., & Kimmig, A. (2019). Neuro-symbolic= neural+ logical+ probabilistic. In NeSy\u201919@ IJCAI, the 14th International Workshop on Neural-Symbolic Learning and Reasoning. pp. 1\u20134"},{"key":"5966_CR14","doi-asserted-by":"crossref","unstructured":"Ding, B., Wang, Q., Wang, B., & Guo, L. (2018). Improving knowledge graph embedding using simple constraints. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). pp. 110\u2013121. Association for Computational Linguistics, Melbourne, Australia, https:\/\/www.aclweb.org\/anthology\/P18-1011","DOI":"10.18653\/v1\/P18-1011"},{"key":"5966_CR15","doi-asserted-by":"crossref","unstructured":"Faruquie, T. A., Srinivasan, A., & King, R. D. (2012). Topic models with relational features for drug design. In International conference on inductive logic programming. pp. 45\u201357. Springer.","DOI":"10.1007\/978-3-642-38812-5_4"},{"key":"5966_CR16","doi-asserted-by":"publisher","first-page":"3558","DOI":"10.1609\/aaai.v33i01.33013558","volume":"33","author":"Y Feng","year":"2019","unstructured":"Feng, Y., You, H., Zhang, Z., Ji, R., & Gao, Y. (2019). Hypergraph neural networks. Proceedings of the AAAI Conference on Artificial Intelligence., 33, 3558\u20133565.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence."},{"key":"5966_CR17","unstructured":"Fey, M., & Lenssen, J. E. (2019). Fast graph representation learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds"},{"issue":"1","key":"5966_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10994-013-5392-1","volume":"94","author":"M.V Fran\u00e7a","year":"2014","unstructured":"Fran\u00e7a, M. .V., Zaverucha, G., & Garcez, A. S. d. (2014). Fast relational learning using bottom clause propositionalization with artificial neural networks. Machine learning, 94(1), 81\u2013104.","journal-title":"Machine learning"},{"key":"5966_CR19","unstructured":"Fran\u00e7a, M.V.M., Zaverucha, G., & Garcez, A. S. d. (2015). Neural relational learning through semi-propositionalization of bottom clauses. In 2015 AAAI Spring Symposium Series"},{"key":"5966_CR20","unstructured":"Fran\u00e7a, M.V.M., d\u2019Avila Garcez, A. S., & Zaverucha, G. (2015). Relational knowledge extraction from neural networks. In Proceedings of the NIPS Workshop on Cognitive Computation: Integrating Neural and Symbolic Approaches co-located with the 29th Annual Conference on Neural Information Processing Systems (NIPS 2015), Montreal, Canada, December 11-12, 2015."},{"issue":"6","key":"5966_CR21","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MIC.2019.2960071","volume":"23","author":"M Gaur","year":"2019","unstructured":"Gaur, M., Kursuncu, U., & Wickramarachchi, R. (2019). Shades of knowledge-infused learning for enhancing deep learning. IEEE Internet Computing, 23(6), 54\u201363.","journal-title":"IEEE Internet Computing"},{"key":"5966_CR22","doi-asserted-by":"crossref","unstructured":"Gori, M., Monfardini, G., & Scarselli, F. (2005). A new model for learning in graph domains. In Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005. vol.\u00a02, pp. 729\u2013734 vol. 2","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"5966_CR23","unstructured":"Hamilton, W., Ying, Z., & Leskovec, J. (2017). Inductive representation learning on large graphs. In Advances in neural information processing systems. pp. 1024\u20131034"},{"key":"5966_CR24","doi-asserted-by":"crossref","unstructured":"Jiang, J., Wei, Y., Feng, Y., Cao, J., & Gao, Y. (2019). Dynamic hypergraph neural networks. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI). pp. 2635\u20132641","DOI":"10.24963\/ijcai.2019\/366"},{"key":"5966_CR25","doi-asserted-by":"crossref","unstructured":"Joshi, S., Ramakrishnan, G., & Srinivasan, A. (2008). Feature construction using theory-guided sampling and randomised search. In International Conference on Inductive Logic Programming. pp. 140\u2013157. Springer","DOI":"10.1007\/978-3-540-85928-4_14"},{"key":"5966_CR26","unstructured":"Kingma, D. P., & Ba, J. (2014). Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980"},{"issue":"1","key":"5966_CR27","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1073\/pnas.93.1.438","volume":"93","author":"RD King","year":"1996","unstructured":"King, R. D., Muggleton, S. H., Srinivasan, A., & Sternberg, M. (1996). Structure-activity relationships derived by machine learning: The use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming. Proceedings of the National Academy of Sciences, 93(1), 438\u2013442.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"6971","key":"5966_CR28","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1038\/nature02236","volume":"427","author":"RD King","year":"2004","unstructured":"King, R. D., Whelan, K. E., Jones, F. M., Reiser, P. G., Bryant, C. H., Muggleton, S. H., et al. (2004). Functional genomic hypothesis generation and experimentation by a robot scientist. Nature, 427(6971), 247\u2013252.","journal-title":"Nature"},{"key":"5966_CR29","unstructured":"Kipf, T.N., & Welling, M. (2017). Semi-supervised classification with graph convolutional networks. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings"},{"key":"5966_CR30","doi-asserted-by":"crossref","unstructured":"Kramer, S., Lavra\u010d, N., & Flach, P. (2001). Propositionalization approaches to relational data mining. In Relational data mining, pp. 262\u2013291. Springer","DOI":"10.1007\/978-3-662-04599-2_11"},{"key":"5966_CR31","doi-asserted-by":"crossref","unstructured":"Krogel, M.,A., Rawles, S., \u017delezn\u1ef3, F., Flach, P. A., Lavra\u010d, N., & Wrobel, S. (2003). Comparative evaluation of approaches to propositionalization. In International Conference on Inductive Logic Programming. pp. 197\u2013214. Springer","DOI":"10.1007\/978-3-540-39917-9_14"},{"key":"5966_CR32","unstructured":"Kursuncu, U., Gaur, M., & Sheth, A. (2019). Knowledge infused learning (k-il): Towards deep incorporation of knowledge in deep learning. arXiv preprint arXiv:1912.00512"},{"key":"5966_CR33","doi-asserted-by":"crossref","unstructured":"Lavra\u010d, N., D\u017eeroski, S., & Grobelnik, M. (1991). Learning nonrecursive definitions of relations with linus. In European Working Session on Learning. pp. 265\u2013281. Springer","DOI":"10.1007\/BFb0017020"},{"key":"5966_CR34","unstructured":"Lee, J., Lee, I., & Kang, J. (2019). Self-attention graph pooling. In International Conference on Machine Learning. pp. 3734\u20133743"},{"key":"5966_CR35","doi-asserted-by":"crossref","unstructured":"Lodhi, H. (2013). Deep relational machines. In International Conference on Neural Information Processing. pp. 212\u2013219. Springer","DOI":"10.1007\/978-3-642-42042-9_27"},{"issue":"5","key":"5966_CR36","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1021\/ci034050+","volume":"43","author":"KA Marx","year":"2003","unstructured":"Marx, K. A., O\u2019Neil, P., Hoffman, P., & Ujwal, M. (2003). Data mining the nci cancer cell line compound gi50 values: identifying quinone subtypes effective against melanoma and leukemia cell classes. Journal of chemical information and computer sciences, 43(5), 1652\u20131667.","journal-title":"Journal of chemical information and computer sciences"},{"key":"5966_CR37","volume-title":"Compendium of chemical terminology","author":"AD McNaught","year":"1997","unstructured":"McNaught, A. D., Wilkinson, A., et al. (1997). Compendium of chemical terminology (Vol. 1669). Oxford: Blackwell Science Oxford."},{"key":"5966_CR38","doi-asserted-by":"publisher","first-page":"4602","DOI":"10.1609\/aaai.v33i01.33014602","volume":"33","author":"C Morris","year":"2019","unstructured":"Morris, C., Ritzert, M., Fey, M., Hamilton, W. L., Lenssen, J. E., Rattan, G., & Grohe, M. (2019). Weisfeiler and leman go neural: Higher-order graph neural networks. Proceedings of the AAAI Conference on Artificial Intelligence., 33, 4602\u20134609.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence."},{"issue":"3\u20134","key":"5966_CR39","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S Muggleton","year":"1995","unstructured":"Muggleton, S. (1995). Inverse entailment and progol. New generation computing, 13(3\u20134), 245\u2013286.","journal-title":"New generation computing"},{"issue":"1","key":"5966_CR40","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-011-5259-2","volume":"86","author":"S Muggleton","year":"2012","unstructured":"Muggleton, S., De Raedt, L., Poole, D., Bratko, I., Flach, P., Inoue, K., & Srinivasan, A. (2012). Ilp turns 20. Machine learning, 86(1), 3\u201323.","journal-title":"Machine learning"},{"key":"5966_CR41","unstructured":"Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., & Antiga, L., et\u00a0al. (2019). Pytorch: An imperative style, high-performance deep learning library. In Advances in Neural Information Processing Systems. pp. 8024\u20138035"},{"key":"5966_CR42","unstructured":"Plotkin, G. (1971). Automatic Methods of Inductive Inference. Ph.D. thesis, Edinburgh University"},{"key":"5966_CR43","doi-asserted-by":"crossref","unstructured":"Prechelt, L. (1998). Early stopping-but when? In Neural Networks: Tricks of the trade, pp. 55\u201369. Springer","DOI":"10.1007\/3-540-49430-8_3"},{"issue":"8","key":"5966_CR44","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.neunet.2005.07.009","volume":"18","author":"L Ralaivola","year":"2005","unstructured":"Ralaivola, L., Swamidass, S. J., Saigo, H., & Baldi, P. (2005). Graph kernels for chemical informatics. Neural networks, 18(8), 1093\u20131110.","journal-title":"Neural networks"},{"key":"5966_CR45","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, G., Joshi, S., Balakrishnan, S., & Srinivasan, A. (2007) Using ilp to construct features for information extraction from semi-structured text. In International Conference on Inductive Logic Programming. pp. 211\u2013224. Springer","DOI":"10.1007\/978-3-540-78469-2_22"},{"key":"5966_CR46","doi-asserted-by":"crossref","unstructured":"Saha, A., Srinivasan, A., & Ramakrishnan, G. (2012). What kinds of relational features are useful for statistical learning? In International Conference on Inductive Logic Programming. pp. 209\u2013224. Springer","DOI":"10.1007\/978-3-642-38812-5_15"},{"key":"5966_CR47","unstructured":"Sato, R. (2020). A survey on the expressive power of graph neural networks. arXiv preprint arXiv:2003.04078"},{"issue":"1","key":"5966_CR48","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2008","unstructured":"Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2008). The graph neural network model. IEEE Transactions on Neural Networks, 20(1), 61\u201380.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"3","key":"5966_CR49","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.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"5966_CR50","unstructured":"Srinivasan, A. (2001). The aleph manual. https:\/\/www.cs.ox.ac.uk\/activities\/programinduction\/Aleph\/aleph.html"},{"issue":"1","key":"5966_CR51","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1009815821645","volume":"3","author":"A Srinivasan","year":"1999","unstructured":"Srinivasan, A., & King, R. D. (1999). Feature construction with inductive logic programming: A study of quantitative predictions of biological activity aided by structural attributes. Data Mining and Knowledge Discovery, 3(1), 37\u201357.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5966_CR52","unstructured":"Stevens, R., Taylor, V., Nichols, J., Maccabe, A. B., Yelick, K., & Brown, D. (2020). Ai for science. Tech. rep., Argonne National Lab.(ANL), Argonne, IL (United States)."},{"key":"5966_CR53","unstructured":"Van\u00a0Craenenbroeck, E., Vandecasteele, H., & Dehaspe, L. (2002). Dmax\u2019s functional group and ring library. https:\/\/dtai.cs.kuleuven.be\/software\/dmax\/"},{"key":"5966_CR54","unstructured":"Velic\u0306kovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., & Bengio, Y. (2018). Graph attention networks. In International Conference on Learning Representations, https:\/\/openreview.net\/forum?id=rJXMpikCZ"},{"key":"5966_CR55","doi-asserted-by":"crossref","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Philip, S. Y. (2020). A comprehensive survey on graph neural networks. IEEE Transactions on Neural Networks and Learning Systems","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"5966_CR56","unstructured":"Xu, K., Hu, W., Leskovec, J., & Jegelka, S. (2019). How powerful are graph neural networks? In International Conference on Learning Representations, https:\/\/openreview.net\/forum?id=ryGs6iA5Km"},{"key":"5966_CR57","unstructured":"Yadati, N., Nimishakavi, M., Yadav, P., Nitin, V., Louis, A., & Talukdar, P. (2019). Hypergcn: A new method for training graph convolutional networks on hypergraphs. In Advances in Neural Information Processing Systems. pp. 1509\u20131520"},{"key":"5966_CR58","unstructured":"Zhang, D., Yin, J., Zhu, X., & Zhang, C. (2018). Network representation learning: A survey. IEEE transactions on Big Data"},{"key":"5966_CR59","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., & Sch\u00f6lkopf, B. (2007). Learning with hypergraphs: Clustering, classification, and embedding. In Advances in neural information processing systems. pp. 1601\u20131608","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"5966_CR60","unstructured":"Zhou, J., Cui, G., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C. & Sun, M. (2018). Graph neural networks: A review of methods and applications. arXiv preprint arXiv:1812.08434"},{"key":"5966_CR61","doi-asserted-by":"crossref","unstructured":"Ziegler, K., Caelen, O., Garchery, M., Granitzer, M., He-Guelton, L., Jurgovsky, J., Portier, P.E., & Zwicklbauer, S. (2017). Injecting semantic background knowledge into neural networks using graph embeddings. In 2017 IEEE 26th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE). pp. 200\u2013205. IEEE","DOI":"10.1109\/WETICE.2017.36"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05966-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-05966-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05966-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T17:13:51Z","timestamp":1699118031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-05966-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,13]]},"references-count":61,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["5966"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-05966-z","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,13]]},"assertion":[{"value":"15 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}