{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T07:00:00Z","timestamp":1780729200754,"version":"3.54.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032279965","type":"print"},{"value":"9783032279972","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27997-2_11","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:11:07Z","timestamp":1780726267000},"page":"90-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Method for\u00a0Process Model Matching with\u00a0LLMs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1596-2585","authenticated-orcid":false,"given":"Francesca","family":"Zampino","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8746-8826","authenticated-orcid":false,"given":"Laura","family":"Genga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6902-0160","authenticated-orcid":false,"given":"Antonella","family":"Longo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8277-9390","authenticated-orcid":false,"given":"Marco Salvatore","family":"Zappatore","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4083-0036","authenticated-orcid":false,"given":"Remco","family":"Dijkman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, N., Kwok, H.C., Hamdaqa, M., Assun\u00e7\u00e3o, W.K.G.: SMATCH-M-LLM: semantic similarity in metamodel matching with large language models. In: Proceedings of the 2025 Mining Software Repositories(MSR) Conference. IEEE (2025)","DOI":"10.1109\/MSR66628.2025.00040"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"99239","DOI":"10.1109\/ACCESS.2020.2997097","volume":"8","author":"M Ali","year":"2020","unstructured":"Ali, M., Shahzad, K., Muzaffar, S.I., Malik, M.K.: Deep analysis of process model matching techniques. IEEE Access 8, 99239\u201399253 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2997097","journal-title":"IEEE Access"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Bell, D., et al.: Candace. Dice similarity coefficient (2020). https:\/\/doi.org\/10.53347\/rID-75056","DOI":"10.53347\/rID-75056"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Cayoglu, U., Dijkman, R., Dumas, M., Fettke, P.: The Process Model Matching Contest 2013. Business Process Management Workshops, pp. 442\u2013463. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-642-03848-8_5","DOI":"10.1007\/978-3-642-03848-8_5"},{"key":"11_CR5","unstructured":"Chen, Z., He, Z., Zhu, Q., Liu, S.: Unleashing the potential of prompt engineering for large language models: a comprehensive review. arXiv preprint arXiv:2310.14735 (2023)"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Dijkman, R., Dumas, M., Garc\u00eda-Ba\u00f1uelos, L.: Graph matching algorithms for business process model similarity search. In: LNCS 5701, pp. 48-63. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03848-8_5","DOI":"10.1007\/978-3-642-03848-8_5"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.is.2010.09.006","volume":"36","author":"R Dijkman","year":"2011","unstructured":"Dijkman, R., Dumas, M., Van Dongen, B., K\u00e4\u00e4rik, R., Mendling, J.: Similarity of business process models: metrics and evaluation. Inf. Syst. 36(2), 498\u2013516 (2011)","journal-title":"Inf. Syst."},{"key":"11_CR8","unstructured":"Hewing, L., Leinhos, L.: The prompt canvas: a literature-based practitioner guide for creating effective prompts in large language models. arXiv preprint arXiv:2412.05127 (2024)"},{"key":"11_CR9","unstructured":"Kolb, J., et al.: In: The Process Model Matching Contest 2015. In: Enterprise Modelling and Information Systems Architectures. Lecture Notes in Informatics (LNI), pp. 127\u2013140. Gesellschaft f\u00fcr Informatik, Bonn (2015)"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Kotu, V., Deshpande, B.: Chapter 4: Classification. 2nd edn. In: Data Science, pp. 65\u2013163. Morgan Kaufman (2019). https:\/\/doi.org\/10.1016\/B978-0-12-814761-0.00004-6","DOI":"10.1016\/B978-0-12-814761-0.00004-6"},{"issue":"7","key":"11_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.3390\/fi15070229","volume":"15","author":"MSM Rudwan","year":"2023","unstructured":"Rudwan, M.S.M., Fonou-Dombeu, J.V.: Hybridizing fuzzy string matching and machine learning for improved ontology alignment. Future Internet 15(7), 229 (2023). https:\/\/doi.org\/10.3390\/fi15070229","journal-title":"Future Internet"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Steck, H., Ekanadham, C., Kallus, N.: Is cosine-similarity of embeddings really about similarity? In: Companion Proceedings of the ACM Web Conference 2024, pp. 887\u2013890. Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3589335.3651526","DOI":"10.1145\/3589335.3651526"},{"key":"11_CR13","unstructured":"Parciak, M., Vandevoort, B., Neven, F., Peeters, L., Vansummeren, S.: Schema matching with large language models: an experimental study. ArXiv pre-print arXiv:2407.11852v1 (2024)"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Po, D.: Similarity based information retrieval using levenshtein distance algorithm. Int. J. Adv. Sci. Res. Eng. 06, 06\u201317 (2020). https:\/\/doi.org\/10.31695\/IJASRE.2020.33780","DOI":"10.31695\/IJASRE.2020.33780"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Zampino, F., Longo, A.: Exploring business process model similarity with LLMs. In: Grabis, J., Wautelet, Y. (eds) *Advanced Information Systems Engineering Workshops*, CAiSE 2025, LNBI, vol. 556. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-94931-9-20","DOI":"10.1007\/978-3-031-94931-9-20"}],"container-title":["Lecture Notes in Business Information Processing","Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27997-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:11:09Z","timestamp":1780726269000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27997-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032279965","9783032279972"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27997-2_11","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"value":"1865-1348","type":"print"},{"value":"1865-1356","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAiSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Verona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caise2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caise26.polimi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}