{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:03Z","timestamp":1740123183849,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Innsbruck and Medical University of Innsbruck"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we present a modular methodology that combines state-of-the-art methods in (stochastic) machine learning with well-established methods in inductive logic programming (ILP) and rule induction to provide efficient and scalable algorithms for the classification of vast data sets. By construction, these classifications are based on the synthesis of simple rules, thus providing direct explanations of the obtained classifications. Apart from evaluating our approach on the common large scale data sets <jats:italic>MNIST<\/jats:italic>, <jats:italic>Fashion-MNIST<\/jats:italic> and <jats:italic>IMDB<\/jats:italic>, we present novel results on explainable classifications of dental bills. The latter case study stems from an industrial collaboration with <jats:italic>Allianz Private Krankenversicherung<\/jats:italic> which is an insurance company offering diverse services in Germany.<\/jats:p>","DOI":"10.1007\/s10994-024-06556-5","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T19:01:23Z","timestamp":1720033283000},"page":"7479-7508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rule learning by modularity"],"prefix":"10.1007","volume":"113","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7688-9836","authenticated-orcid":false,"given":"Albert","family":"N\u00f6ssig","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Hell","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"6556_CR1","unstructured":"An, S., Lee, M.J., Park, S., Yang, H., So, J. (2020) An ensemble of simple convolutional neural network models for MNIST digit recognition. CoRR"},{"key":"6556_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.neucom.2016.01.010","volume":"191","author":"S Asadi","year":"2016","unstructured":"Asadi, S., & Shahrabi, J. (2016). RipMC: RIPPER for multiclass classification. Neurocomputing, 191, 19\u201333. https:\/\/doi.org\/10.1016\/j.neucom.2016.01.010","journal-title":"Neurocomputing"},{"key":"6556_CR3","doi-asserted-by":"publisher","unstructured":"Brunk, C., Pazzani, M.J.: An investigation of noise-tolerant relational concept learning algorithms. In: Proceedings of the Eighth International Workshop (ML91), pp. 389\u2013393 (1991). https:\/\/doi.org\/10.1016\/b978-1-55860-200-7.50080-5","DOI":"10.1016\/b978-1-55860-200-7.50080-5"},{"key":"6556_CR4","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.12228","author":"N Burkart","year":"2021","unstructured":"Burkart, N., & Huber, M. F. (2021). A survey on the explainability of supervised machine learning. Journal of Artificial Intelligence Research https:\/\/doi.org\/10.1613\/jair.1.12228","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6556_CR5","doi-asserted-by":"publisher","unstructured":"Burkhardt, S., Brugger, J., Wagner, N., Ahmadi, Z., Kersting, K., Kramer, S.: Rule extraction from binary neural networks with convolutional rules for model validation. Frontiers in Artificial Intelligence 4 (2021). https:\/\/doi.org\/10.3389\/frai.2021.642263","DOI":"10.3389\/frai.2021.642263"},{"key":"6556_CR6","doi-asserted-by":"publisher","unstructured":"Chen, T., Guestrin, C.: XGBoost: A scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201916, pp. 785\u2013794. ACM, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2939672.2939785.","DOI":"10.1145\/2939672.2939785"},{"key":"6556_CR7","doi-asserted-by":"publisher","unstructured":"Cohen, W.W. (1995) Fast effective rule induction. In: Machine Learning Proceedings 1995, San Francisco (CA), pp. 115\u2013123 . https:\/\/doi.org\/10.1016\/b978-1-55860-377-6.50023-2","DOI":"10.1016\/b978-1-55860-377-6.50023-2"},{"key":"6556_CR8","unstructured":"Cropper, A., Muggleton, S.H. (2016) Metagol System. https:\/\/github.com\/metagol\/metagol"},{"key":"6556_CR9","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13507","author":"A Cropper","year":"2022","unstructured":"Cropper, A., & Duman\u010di\u0107, S. (2022). Inductive logic programming at 30: A new introduction. Journal of Artificial Intelligence Research.https:\/\/doi.org\/10.1613\/jair.1.13507","journal-title":"Journal of Artificial Intelligence Research."},{"issue":"1","key":"6556_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10994-021-06089-1","volume":"111","author":"A Cropper","year":"2022","unstructured":"Cropper, A., Dumancic, S., Evans, R., & Muggleton, S. H. (2022). Inductive logic programming at 30. Machine Learning, 111(1), 147\u2013172. https:\/\/doi.org\/10.1007\/s10994-021-06089-1","journal-title":"Machine Learning"},{"issue":"4","key":"6556_CR11","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10994-020-05934-z","volume":"110","author":"A Cropper","year":"2021","unstructured":"Cropper, A., & Morel, R. (2021). Learning programs by learning from failures. Machine Learning, 110(4), 801\u2013856. https:\/\/doi.org\/10.1007\/s10994-020-05934-z","journal-title":"Machine Learning"},{"key":"6556_CR12","doi-asserted-by":"publisher","unstructured":"Cunnington, D., Law, M., Lobo, J., & Russo, A. (2022) Inductive learning of complex knowledge from raw data . https:\/\/doi.org\/10.48550\/arXiv.2205.12735","DOI":"10.48550\/arXiv.2205.12735"},{"key":"6556_CR13","unstructured":"De\u00a0Raedt, L., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery, pp. 2462\u20132467 (2007)"},{"key":"6556_CR14","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1038\/s41374-020-00525-x","volume":"101","author":"F Deng","year":"2021","unstructured":"Deng, F., Huang, J., Yuan, X., Cheng, C., & Zhang, L. (2021). Performance and efficiency of machine learning algorithms for analyzing rectangular biomedical data. Laboratory Investigation, 101, 430\u2013441. https:\/\/doi.org\/10.1038\/s41374-020-00525-x","journal-title":"Laboratory Investigation"},{"key":"6556_CR15","doi-asserted-by":"publisher","unstructured":"Dumancic, S., Blockeel, H. (2017). Clustering-based relational unsupervised representation learning with an explicit distributed representation, pp. 1631\u20131637 . https:\/\/doi.org\/10.24963\/ijcai.2017\/226","DOI":"10.24963\/ijcai.2017\/226"},{"key":"6556_CR16","unstructured":"Eldbib, K. (2016) Design and analysis of rule induction systems. PhD thesis, University of Birmingham, UK"},{"key":"6556_CR17","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, pp. 226\u2013231"},{"key":"6556_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.5714","volume":"61","author":"R Evans","year":"2018","unstructured":"Evans, R., & Grefenstette, E. (2018). Learning explanatory rules from noisy data. Journal of Artificial Intelligence Research, 61, 1\u201364. https:\/\/doi.org\/10.1613\/jair.5714","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6556_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10994-013-5392-1","volume":"94","author":"M Franca","year":"2014","unstructured":"Franca, M., Zaverucha, G., & Garcez, A. (2014). Fast relational learning using bottom clause propositionalization with artificial neural networks. Machine Learning, 94, 81\u2013104. https:\/\/doi.org\/10.1007\/s10994-013-5392-1","journal-title":"Machine Learning"},{"key":"6556_CR20","doi-asserted-by":"publisher","unstructured":"F\u00fcrnkranz, J., Widmer, G.: Incremental reduced error pruning. In: Machine Learning Proceedings 1994, San Francisco (CA), pp. 70\u201377 (1994). https:\/\/doi.org\/10.1016\/B978-1-55860-335-6.50017-9","DOI":"10.1016\/B978-1-55860-335-6.50017-9"},{"key":"6556_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75197-7","author":"J F\u00fcrnkranz","year":"2012","unstructured":"F\u00fcrnkranz, J., Gamberger, D., & Lavrac, N. (2012). Foundations of Rule Learning. Cognitive Technologies. https:\/\/doi.org\/10.1007\/978-3-540-75197-7","journal-title":"Cognitive Technologies"},{"key":"6556_CR22","unstructured":"Granmo, O.-C., Glimsdal, S., Jiao, L., Goodwin, M., Omlin, C.W., Berge, G.T.: The Convolutional Tsetlin Machine (2019)"},{"key":"6556_CR23","unstructured":"Jim\u00e9nez, P., Arjona, J.L., \u00c1lvarez, J.L.: On improving foil algorithm. (2011)"},{"key":"6556_CR24","doi-asserted-by":"publisher","DOI":"10.1145\/3516517","author":"K Kirkpatrick","year":"2022","unstructured":"Kirkpatrick, K. (2022). Still waiting for self-driving cars. CACM. https:\/\/doi.org\/10.1145\/3516517","journal-title":"CACM"},{"issue":"1","key":"6556_CR25","first-page":"13","volume":"4","author":"C Lamberton","year":"2017","unstructured":"Lamberton, C., Brigo, D., & Hoy, D. (2017). Impact of robotics, rpa and ai on the insurance industry: Challenges and opportunities. Journal of Financial Perspectives, 4(1), 13.","journal-title":"Journal of Financial Perspectives"},{"key":"6556_CR26","doi-asserted-by":"crossref","unstructured":"Law, M., Russo, A., Broda, K. (2020) The ILASP system for inductive learning of answer set programs. CoRR","DOI":"10.1007\/978-3-030-31423-1_6"},{"issue":"03","key":"6556_CR27","doi-asserted-by":"publisher","first-page":"2877","DOI":"10.1609\/aaai.v34i03.5678","volume":"34","author":"M Law","year":"2020","unstructured":"Law, M., Russo, A., Bertino, E., Broda, K., & Lobo, J. (2020). Fastlas: Scalable inductive logic programming incorporating domain-specific optimisation criteria. Proceedings of the AAAI Conference on Artificial Intelligence, 34(03), 2877\u20132885. https:\/\/doi.org\/10.1609\/aaai.v34i03.5678","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"6556_CR28","unstructured":"LeCun, Y., Cortes, C., & Burges, C. (2010) MNIST handwritten digit database. ATT Labs [Online]. Available: http:\/\/yann.lecun.com\/exdb\/mnist"},{"key":"6556_CR29","unstructured":"Liu, Y., Ott, M., Goyal, N., Du, J., Joshi, M., Chen, D., Levy, O., Lewis, M., Zettlemoyer, L., & Stoyanov, V. Roberta: A robustly optimized bert pretraining approach. arXiv (2019)"},{"key":"6556_CR30","unstructured":"Liu, H., Simonyan, K., Yang, Y. (2019) Darts: Differentiable architecture search. In: ICLR 2019"},{"key":"6556_CR31","unstructured":"Lundberg, S.M., Lee, S.: A unified approach to interpreting model predictions. In: Advances in Neural Information Processing Systems, pp. 4765\u20134774 (2017). https:\/\/proceedings.neurips.cc\/paper\/2017\/hash\/8a20a8621978632d76c43dfd28b67767-Abstract.html"},{"key":"6556_CR32","unstructured":"Maas, A.L., Daly, R.E., Pham, P.T., Huang, D., Ng, A.Y., & Potts, C. (2011) Learning word vectors for sentiment analysis. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Portland, Oregon, USA, pp. 142\u2013150"},{"key":"6556_CR33","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-49730-7_25","volume-title":"Algorithmic Learning Theory","author":"E McCreath","year":"1998","unstructured":"McCreath, E., & Sharma, A. (1998). Lime: A system for learning relations. In M. M. Richter, C. H. Smith, R. Wiehagen, & T. Zeugmann (Eds.), Algorithmic Learning Theory (pp. 336\u2013374). Berlin, Heidelberg: Springer."},{"key":"6556_CR34","doi-asserted-by":"crossref","unstructured":"McInnes, L., Healy, J. (2018) UMAP: uniform manifold approximation and projection for dimension reduction. CoRR","DOI":"10.21105\/joss.00861"},{"issue":"3\u20134","key":"6556_CR35","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1017\/S1471068418000248","volume":"18","author":"A Mitra","year":"2018","unstructured":"Mitra, A., & Baral, C. (2018). Incremental and iterative learning of answer set programs from mutually distinct examples. Theory Pract. Log. Program., 18(3\u20134), 623\u2013637. https:\/\/doi.org\/10.1017\/S1471068418000248","journal-title":"Theory Pract. Log. Program."},{"issue":"3\u20134","key":"6556_CR36","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 Gen. Comput., 13(3\u20134), 245\u2013286. https:\/\/doi.org\/10.1007\/BF03037227","journal-title":"New Gen. Comput."},{"issue":"3","key":"6556_CR37","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), 245\u2013286. https:\/\/doi.org\/10.1007\/BF03037227","journal-title":"New Generation Computing"},{"key":"6556_CR38","doi-asserted-by":"publisher","unstructured":"Nguyen, H.D., & Sakama, C.: Feature learning by least generalization. In: Inductive Logic Programming - 30th International Conference, ILP 2021. Lecture Notes in Computer Science, vol. 13191, pp. 193\u2013202 (2021). https:\/\/doi.org\/10.1007\/978-3-030-97454-1_14","DOI":"10.1007\/978-3-030-97454-1_14"},{"key":"6556_CR39","unstructured":"Payani, A., Fekri, F. (2019). Inductive logic programming via differentiable deep neural logic networks. CoRR"},{"key":"6556_CR40","unstructured":"Payani, A.: Differentiable neural logic networks and their application onto inductive logic programming. PhD thesis, Georgia Institute of Technology (2020)"},{"key":"6556_CR41","doi-asserted-by":"crossref","unstructured":"Purgal, S.J., Cerna, D.M., & Kaliszyk, C. (2021)Learning higher-order programs without meta-interpretive learning. CoRR","DOI":"10.24963\/ijcai.2022\/378"},{"key":"6556_CR42","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00117105","volume":"5","author":"JR Quinlan","year":"1990","unstructured":"Quinlan, J. R. (1990). Learning logical definitions from relations. Machine Learning, 5, 239\u2013266. https:\/\/doi.org\/10.1007\/BF00117105","journal-title":"Machine Learning"},{"issue":"2","key":"6556_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01574-8","volume":"10","author":"LD Raedt","year":"2016","unstructured":"Raedt, L. D., Kersting, K., Natarajan, S., & Poole, D. (2016). Statistical relational artificial intelligence: Logic, probability, and computation. Synthesis lectures on artificial intelligence and machine learning, 10(2), 1\u2013189.","journal-title":"Synthesis lectures on artificial intelligence and machine learning"},{"issue":"3","key":"6556_CR44","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.jal.2008.10.007","volume":"7","author":"O Ray","year":"2009","unstructured":"Ray, O. (2009). Nonmonotonic abductive inductive learning. Journal of Applied Logic, 7(3), 329\u2013340. https:\/\/doi.org\/10.1016\/j.jal.2008.10.007","journal-title":"Journal of Applied Logic"},{"key":"6556_CR45","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson, M., & Domingos, P. (2006). Markov logic networks. Machine Learning, 62, 107\u2013136. https:\/\/doi.org\/10.1007\/s10994-006-5833-1","journal-title":"Machine Learning"},{"key":"6556_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058680","author":"R Rivest","year":"2001","unstructured":"Rivest, R. (2001). Learning decision lists. Machine Learning. https:\/\/doi.org\/10.1007\/BF00058680","journal-title":"Machine Learning"},{"key":"6556_CR47","doi-asserted-by":"publisher","DOI":"10.3390\/ijms21010018","author":"G Scala","year":"2020","unstructured":"Scala, G., Federico, A., Fortino, V., Greco, D., & Majello, B. (2020). Knowledge generation with rule induction in cancer omics. International Journal of Molecular Sciences. https:\/\/doi.org\/10.3390\/ijms21010018","journal-title":"International Journal of Molecular Sciences"},{"key":"6556_CR48","unstructured":"Srinivasan, A. (2001) The Aleph Manual . https:\/\/www.cs.ox.ac.uk\/activities\/programinduction\/Aleph\/aleph.html"},{"issue":"4","key":"6556_CR49","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/3490699","volume":"65","author":"VC Storey","year":"2022","unstructured":"Storey, V. C., Lukyanenko, R., Maass, W., & Parsons, J. (2022). Explainable AI. Communications of the ACM, 65(4), 27\u201329. https:\/\/doi.org\/10.1145\/3490699","journal-title":"Communications of the ACM"},{"key":"6556_CR50","doi-asserted-by":"publisher","unstructured":"Tanveer, M., Khan, M.K., & Kyung, C. (2021). Fine-tuning darts for image classification. In: 2020 25th International Conference on Pattern Recognition (ICPR), Los Alamitos, CA, USA, pp. 4789\u20134796 https:\/\/doi.org\/10.1109\/ICPR48806.2021.9412221","DOI":"10.1109\/ICPR48806.2021.9412221"},{"key":"6556_CR51","unstructured":"Vilone, G., & Longo, L. (2020) Explainable artificial intelligence: a systematic review. CoRR"},{"key":"6556_CR52","unstructured":"Wang, H., & Gupta, G. (2022)old-se: Scalable explainable ai. ArXiv abs\/2208.07912"},{"key":"6556_CR53","unstructured":"Winston, P.H. (1970) Learning structural descriptions from examples. PhD thesis, Massachusetts Institute of Technology, USA"},{"key":"6556_CR54","unstructured":"Xiao, H., Rasul, K., & Vollgraf, R. (2017). Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms"},{"key":"6556_CR55","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-030-32236-6_51","volume":"11839","author":"F Xu","year":"2019","unstructured":"Xu, F., Uszkoreit, H., Du, Y., Fan, W., Zhao, D., & Zhu, J. (2019). Explainable AI: A brief survey on history, research areas, approaches and challenges. In Natural Language Processing and Chinese Computing - 8th CCF International Conference, NLPCC 2019. Lecture Notes in Computer Science, 11839, 563\u2013574. https:\/\/doi.org\/10.1007\/978-3-030-32236-6_51","journal-title":"Lecture Notes in Computer Science"},{"key":"6556_CR56","volume-title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","author":"Z Yang","year":"2019","unstructured":"Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R., & Le, Q. V. (2019). XLNet: Generalized Autoregressive Pretraining for Language Understanding. Red Hook, NY, USA: Curran Associates Inc."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06556-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-024-06556-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06556-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T21:07:24Z","timestamp":1729199244000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-024-06556-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":56,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["6556"],"URL":"https:\/\/doi.org\/10.1007\/s10994-024-06556-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2024,7,3]]},"assertion":[{"value":"13 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2024","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 have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The code and the experimental data are freely availabe at the indicated github page\u00a0.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}