{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:59:52Z","timestamp":1776106792542,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T00:00:00Z","timestamp":1685404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T00:00:00Z","timestamp":1685404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100016378","name":"Technische Universit\u00e4t Dortmund","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100016378","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we present Forest GUMP (for Generalized, Unifying Merge Process) a tool for verification and precise explanation of Random forests. Besides pre\/post-condition-based verification and equivalence checking, Forest GUMP also supports three concepts of explanation, the well-known <jats:italic>model explanation<\/jats:italic> and <jats:italic>outcome explanation<\/jats:italic>, as well as <jats:italic>class characterization<\/jats:italic>, i.e., the precise characterization of all samples that are equally classified. Key technology to achieve these results is algebraic aggregation, i.e., the transformation of a Random Forest into a semantically equivalent, concise white-box representation in terms of Algebraic Decision Diagrams (ADDs). The paper sketches the method and demonstrates the use of Forest GUMP along illustrative examples. This way readers should acquire an intuition about the tool, and the way how it should be used to increase the understanding not only of the considered dataset, but also of the character of Random Forests and the ADD technology, here enriched to comprise infeasible path elimination. As Forest GUMP is publicly available all experiments can be reproduced, modified, and complemented using any dataset that is available in the ARFF format.<\/jats:p>","DOI":"10.1007\/s10009-023-00702-5","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T11:02:27Z","timestamp":1685444547000},"page":"287-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Forest GUMP: a tool for verification and explanation"],"prefix":"10.1007","volume":"25","author":[{"given":"Alnis","family":"Murtovi","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Bainczyk","sequence":"additional","affiliation":[]},{"given":"Gerrit","family":"Nolte","sequence":"additional","affiliation":[]},{"given":"Maximilian","family":"Schl\u00fcter","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"issue":"6","key":"702_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"S.B. Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. 27(6), 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"702_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/ICCAD.1993.580054","volume-title":"Proceedings of 1993 International Conference on Computer Aided Design (ICCAD)","author":"R. Bahar","year":"1993","unstructured":"Bahar, R., Frohm, E., Gaona, C., Hachtel, G., Macii, E., Pardo, A., Somenzi, F.: Algebraic decision diagrams and their applications. In: Proceedings of 1993 International Conference on Computer Aided Design (ICCAD), pp.\u00a0188\u2013191 (1993). https:\/\/doi.org\/10.1109\/ICCAD.1993.580054"},{"issue":"1","key":"702_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L. Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"issue":"8","key":"702_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","journal-title":"IEEE Trans. Comput."},{"key":"702_CR5","first-page":"12317","volume-title":"Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019","author":"H. Chen","year":"2019","unstructured":"Chen, H., Zhang, H., Si, S., Li, Y., Boning, D.S., Hsieh, C.: Robustness verification of tree-based models. In: Wallach, H.M., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E.B., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, pp.\u00a012317\u201312328 (2019). https:\/\/papers.nips.cc\/paper\/2019\/hash\/cd9508fdaa5c1390e9cc329001cf1459-Abstract.html"},{"key":"702_CR6","first-page":"84","volume-title":"Proceedings of the 30th Symposium on the Interface","author":"H.A. Chipman","year":"1998","unstructured":"Chipman, H.A., George, E.I., McCulloh, R.E.: Making sense of a forest of trees. In: Weisberg, S. (ed.) Proceedings of the 30th Symposium on the Interface, pp.\u00a084\u201392. Interface Foundation of North America, Fairfax Station, VA (1998)"},{"issue":"4","key":"702_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s41060-018-0144-8","volume":"7","author":"H. Deng","year":"2019","unstructured":"Deng, H.: Interpreting tree ensembles with inTrees. Int. J. Data Sci. Anal. 7(4), 277\u2013287 (2019). https:\/\/doi.org\/10.1007\/s41060-018-0144-8","journal-title":"Int. J. Data Sci. Anal."},{"issue":"1\u20134","key":"702_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S1088-467X(98)00023-7","volume":"2","author":"P.M. Domingos","year":"1998","unstructured":"Domingos, P.M.: Knowledge discovery via multiple models. Intell. Data Anal. 2(1\u20134), 187\u2013202 (1998). https:\/\/doi.org\/10.1016\/S1088-467X(98)00023-7","journal-title":"Intell. Data Anal."},{"key":"702_CR9","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1609\/aaai.v33i01.33012446","volume-title":"The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence","author":"G. Einziger","year":"2019","unstructured":"Einziger, G., Goldstein, M., Sa\u2019ar, Y., Segall, I.: Verifying robustness of gradient boosted models. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019, pp.\u00a02446\u20132453. AAAI Press, New York (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33012446"},{"issue":"1","key":"702_CR10","first-page":"3133","volume":"15","author":"M. Fern\u00e1ndez-Delgado","year":"2014","unstructured":"Fern\u00e1ndez-Delgado, M., Cernadas, E., Barro, S., Amorim, D.: Do we need hundreds of classifiers to solve real world classification problems? J. Mach. Learn. Res. 15(1), 3133\u20133181 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"702_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"7","author":"R.A. Fisher","year":"1936","unstructured":"Fisher, R.A.: The use of multiple measurements in taxonomic problems. Ann. Eugen. 7(2), 179\u2013188 (1936)","journal-title":"Ann. Eugen."},{"key":"702_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-021-00635-x","author":"F. Gossen","year":"2021","unstructured":"Gossen, F., Steffen, B.: Algebraic aggregation of random forests: towards explainability and rapid evaluation. Int. J. Softw. Tools Technol. Transf. (2021). https:\/\/doi.org\/10.1007\/s10009-021-00635-x","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"702_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-030-03418-4_33","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Modeling - 8th International Symposium, Proceedings, Part I","author":"F. Gossen","year":"2018","unstructured":"Gossen, F., Margaria, T., Murtovi, A., Naujokat, S., Steffen, B.: Dsls for decision services: a tutorial introduction to language-driven engineering. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation. Modeling - 8th International Symposium, Proceedings, Part I, ISoLA 2018, Limassol, Cyprus, November 5-9, 2018. Lecture Notes in Computer Science, vol.\u00a011244, pp.\u00a0546\u2013564. Springer, Berlin (2018). https:\/\/doi.org\/10.1007\/978-3-030-03418-4_33"},{"issue":"4","key":"702_CR14","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MITP.2020.3005640","volume":"22","author":"F. Gossen","year":"2020","unstructured":"Gossen, F., Margaria, T., Steffen, B.: Towards explainability in machine learning: the formal methods way. IT Prof. 22(4), 8\u201312 (2020). https:\/\/doi.org\/10.1109\/MITP.2020.3005640","journal-title":"IT Prof."},{"issue":"6","key":"702_CR15","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MITP.2021.3123495","volume":"23","author":"F. Gossen","year":"2021","unstructured":"Gossen, F., Margaria, T., Steffen, B.: Formal methods boost experimental performance for explainable AI. IT Prof. 23(6), 8\u201312 (2021). https:\/\/doi.org\/10.1109\/MITP.2021.3123495.","journal-title":"IT Prof."},{"key":"702_CR16","unstructured":"Gossen, F., Murtovi, A., Linden, J., Steffen, B.: The java library for algebraic decision diagrams. https:\/\/add-lib.scce.info. Accessed 2023-02-22"},{"issue":"5","key":"702_CR17","doi-asserted-by":"publisher","DOI":"10.1145\/3236009","volume":"51","author":"R. Guidotti","year":"2019","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., Pedreschi, D.: A survey of methods for explaining black box models. ACM Comput. Surv. 51(5), 93 (2019). https:\/\/doi.org\/10.1145\/3236009","journal-title":"ACM Comput. Surv."},{"key":"702_CR18","series-title":"PMLR Proceedings of Machine Learning Research","first-page":"77","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"S. Hara","year":"2018","unstructured":"Hara, S., Hayashi, K.: Making tree ensembles interpretable: a Bayesian model selection approach. In: Storkey, A.J., P\u00e9rez-Cruz, F. (eds.) International Conference on Artificial Intelligence and Statistics, AISTATS 2018, 9-11 April 2018, Playa Blanca, Lanzarote, Canary Islands, Spain. PMLR Proceedings of Machine Learning Research, vol.\u00a084, pp.\u00a077\u201385. (2018). http:\/\/proceedings.mlr.press\/v84\/hara18a.html"},{"key":"702_CR19","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/ICDAR.1995.598994","volume-title":"Proceedings of 3rd International Conference on Document Analysis and Recognition","author":"T.K. Ho","year":"1995","unstructured":"Ho, T.K.: Random decision forests. In: Proceedings of 3rd International Conference on Document Analysis and Recognition, vol.\u00a01, pp.\u00a0278\u2013282 (1995). https:\/\/doi.org\/10.1109\/ICDAR.1995.598994"},{"key":"702_CR20","unstructured":"Hungar, H., Steffen, B., Margaria, T.: Methods for generating selection structures, for making selections according to selection structures and for creating selection descriptions. USPTO Patent number: 9141708 (Sep 2015). https:\/\/patents.justia.com\/patent\/9141708"},{"key":"702_CR21","series-title":"JMLR Workshop and Conference Proceedings","first-page":"2387","volume-title":"Proceedings of the 33nd International Conference on Machine Learning","author":"A. Kantchelian","year":"2016","unstructured":"Kantchelian, A., Tygar, J.D., Joseph, A.D.: Evasion and hardening of tree ensemble classifiers. In: Balcan, M., Weinberger, K.Q. (eds.) Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19-24, 2016 JMLR Workshop and Conference Proceedings, vol.\u00a048, pp.\u00a02387\u20132396 (2016). http:\/\/proceedings.mlr.press\/v48\/kantchelian16.html"},{"issue":"4","key":"702_CR22","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C.Y. Lee","year":"1959","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. Bell Syst. Tech. J. 38(4), 985\u2013999 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"702_CR23","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/2339530.2339556","volume-title":"The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Y. Lou","year":"2012","unstructured":"Lou, Y., Caruana, R., Gehrke, J.: Intelligible models for classification and regression. In: Yang, Q., Agarwal, D., Pei, J. (eds.) The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201912, Beijing, China, August 12-16, 2012 pp.\u00a0150\u2013158. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2339530.2339556"},{"key":"702_CR24","first-page":"272","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"P. Mangla","year":"2020","unstructured":"Mangla, P., Singh, V., Balasubramanian, V.N.: On saliency maps and adversarial robustness. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp.\u00a0272\u2013288. Springer, Berlin (2020)"},{"key":"702_CR25","unstructured":"Mundhenk, T.N., Chen, B.Y., Friedland, G.: Efficient saliency maps for explainable ai. Arxiv preprint (2019). arXiv:1911.11293"},{"key":"702_CR26","doi-asserted-by":"publisher","unstructured":"Murtovi, A., Bainczyk, A., Steffen, B.: Forest gump: a tool for explanation (tacas 2022 artifact) (Nov 2021). https:\/\/doi.org\/10.5281\/zenodo.5733107","DOI":"10.5281\/zenodo.5733107"},{"key":"702_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-030-99527-0_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, Proceedings, Part II","author":"A. Murtovi","year":"2022","unstructured":"Murtovi, A., Bainczyk, A., Steffen, B.: Forest GUMP: a tool for explanation. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, Proceedings, Part II, ETAPS 2022, Munich, Germany, April 2-7, 2022. Lecture Notes in Computer Science, vol.\u00a013244, pp.\u00a0314\u2013331. Springer, Berlin (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_17."},{"key":"702_CR28","doi-asserted-by":"publisher","unstructured":"Nolte, G., Schl\u00fcter, M., Murtovi, A., Bernhard, S.: The power of Typed Affine Decision Structures: a case study. Int. J. Softw. Tools Technol. Transf. (2023, in this issue). https:\/\/doi.org\/10.1007\/s10009-023-00701-6","DOI":"10.1007\/s10009-023-00701-6"},{"issue":"1","key":"702_CR29","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00116251","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"key":"702_CR30","first-page":"5478","volume-title":"The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence","author":"F. Ranzato","year":"2020","unstructured":"Ranzato, F., Zanella, M.: Abstract interpretation of decision tree ensemble classifiers. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020. pp.\u00a05478\u20135486. AAAI Press, New York (2020). https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/5998"},{"key":"702_CR31","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1145\/2939672.2939778","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"M.T. Ribeiro","year":"2016","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy should I trust you?\u201d explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.\u00a01135\u20131144 (2016)"},{"key":"702_CR32","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1145\/2939672.2939778","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"M.T. Ribeiro","year":"2016","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy should I trust you?\u201d: explaining the predictions of any classifier. In: Krishnapuram, B., Shah, M., Smola, A.J., Aggarwal, C.C., Shen, D., Rastogi, R. (eds.) Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, August 13-17, 2016 pp.\u00a01135\u20131144. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2939672.2939778"},{"key":"702_CR33","doi-asserted-by":"crossref","unstructured":"Sato, N., Kuruma, H., Nakagawa, Y., Ogawa, H.: Formal verification of decision-tree ensemble model and detection of its violating-input-value ranges. CoRR (2019). arXiv:1904.11753","DOI":"10.1587\/transinf.2019EDP7120"},{"key":"702_CR34","doi-asserted-by":"publisher","unstructured":"Schl\u00fcter, M., Nolte, G., Murtovi, A., Bernhard, S.: Towards rigorous understanding of Neural Networks via semantics-preserving transformations. Int. J. Softw. Tools Technol. Transf. (2023, in this issue). https:\/\/doi.org\/10.1007\/s10009-023-00700-7","DOI":"10.1007\/s10009-023-00700-7"},{"key":"702_CR35","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-91908-9_17","volume-title":"Language-Driven Engineering: From General-Purpose to Purpose-Specific Languages","author":"B. Steffen","year":"2019","unstructured":"Steffen, B., Gossen, F., Naujokat, S., Margaria, T.: Language-Driven Engineering: From General-Purpose to Purpose-Specific Languages, pp.\u00a0311\u2013344. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91908-9_17"},{"key":"702_CR36","series-title":"Revised Selected Papers. Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-12988-0_4","volume-title":"Formal Techniques for Safety-Critical Systems - 6th International Workshop","author":"J. T\u00f6rnblom","year":"2018","unstructured":"T\u00f6rnblom, J., Nadjm-Tehrani, S.: Formal verification of random forests in safety-critical applications. In: Artho, C., \u00d6lveczky, P.C. (eds.) Formal Techniques for Safety-Critical Systems - 6th International Workshop, FTSCS 2018, Gold Coast, Australia, November 16, 2018, Revised Selected Papers. Communications in Computer and Information Science, vol.\u00a01008, pp.\u00a055\u201371. Springer, New York (2018). https:\/\/doi.org\/10.1007\/978-3-030-12988-0_4"},{"key":"702_CR37","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-540-74958-5_39","volume-title":"Machine Learning: ECML 2007","author":"A. Van Assche","year":"2007","unstructured":"Van Assche, A., Blockeel, H.: Seeing the forest through the trees: learning a comprehensible model from an ensemble. In: Kok, J.N., Koronacki, J., Mantaras, R.L.D., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) Machine Learning: ECML 2007, pp.\u00a0418\u2013429. Springer, Berlin (2007)"},{"key":"702_CR38","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E., Hall, M.A., Pal, C.J.: Data Mining: Practical Machine Learning Tools and Techniques, vol.\u00a02 (2005)"},{"key":"702_CR39","volume-title":"Data Mining, Fourth Edition: Practical Machine Learning Tools and Techniques","author":"I.H. Witten","year":"2016","unstructured":"Witten, I.H., Frank, E., Hall, M.A., Pal, C.J.: Data Mining, Fourth Edition: Practical Machine Learning Tools and Techniques 4th edn. Morgan Kaufmann, San Francisco (2016)","edition":"4"},{"key":"702_CR40","volume-title":"Interpreting Models via Single Tree Approximation","author":"Y. Zhou","year":"2016","unstructured":"Zhou, Y., Hooker, G.: Interpreting Models via Single Tree Approximation (2016)"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-023-00702-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10009-023-00702-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-023-00702-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T09:10:17Z","timestamp":1695114617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10009-023-00702-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,30]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["702"],"URL":"https:\/\/doi.org\/10.1007\/s10009-023-00702-5","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,30]]},"assertion":[{"value":"10 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}