{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:18:39Z","timestamp":1742955519801,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031194924"},{"type":"electronic","value":"9783031194931"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19493-1_31","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T06:03:14Z","timestamp":1666418594000},"page":"397-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unification of\u00a0Source-Code Re-Use Similarity Measures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7941-377X","authenticated-orcid":false,"given":"Ren\u00e9 Arnulfo","family":"Garc\u00eda-Hern\u00e1ndez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0766-542X","authenticated-orcid":false,"given":"Yulia","family":"Ledeneva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2811-0813","authenticated-orcid":false,"given":"\u00c1ngel","family":"Hern\u00e1ndez-Casta\u00f1eda","sequence":"additional","affiliation":[]},{"given":"Gabriela","family":"Villada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,23]]},"reference":[{"key":"31_CR1","unstructured":"Aiken, A.: MOSS (measure of software similarity) plagiarism detection system (2000). http:\/\/www.cs.berkeley.edu\/moss\/"},{"key":"31_CR2","unstructured":"Cede\u00f1o, L.A.B.: Detecci\u00f3n autom\u00e1tica de plagio en texto. Master\u2019s thesis, Universidad Polit\u00e9cnica de Valencia (2008)"},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1109\/TE.2007.906776","volume":"51","author":"G Cosma","year":"2008","unstructured":"Cosma, G., Joy, M.: Towards a definition of source-code plagiarism. IEEE Trans. Educ. 51(2), 195\u2013200 (2008)","journal-title":"IEEE Trans. Educ."},{"key":"31_CR4","unstructured":"Ram\u0131rez-de-la Cruz, A., Ram\u0131rez-de-la Rosa, G., S\u00e1nchez-S\u00e1nchez, C., Luna-Ram\u0131rez, W., Jim\u00e9nez-Salazar, H., Rodr\u0131guez-Lucatero, C.: UAM@ SOCO 2014: detection of source code reuse by means of combining different types of representations. FIRE [4] (2014)"},{"key":"31_CR5","unstructured":"Davey, N., Barson, P., Field, S., Frank, R., Tansley, D.: The development of a software clone detector. Int. J. Appl. Softw. Technol. (1995)"},{"key":"31_CR6","unstructured":"Espa\u00f1ola, R.A.: Rae. Diccionario de la lengua espa\u00f1ola 22 (2018)"},{"key":"31_CR7","unstructured":"Flores, E., Barr\u00f3n-Cedeno, A., Moreno, L., Rosso, P.: Cross-language source code re-use detection. In: Proceedings of the 3rd Spanish Conference on Information Retrieval (CERI), pp. 145\u2013156 (2014)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-22327-3_31","volume-title":"Natural Language Processing and Information Systems","author":"E Flores","year":"2011","unstructured":"Flores, E., Barr\u00f3n-Cede\u00f1o, A., Rosso, P., Moreno, L.: Towards the detection of cross-language source code reuse. In: Mu\u00f1oz, R., Montoyo, A., M\u00e9tais, E. (eds.) NLDB 2011. LNCS, vol. 6716, pp. 250\u2013253. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22327-3_31"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Flores, E., Moreno, L., Rosso, P.: Detecting source code re-use with ensemble models. In: Proceedings of the 4th Spanish Conference on Information Retrieval, pp. 1\u20137 (2016)","DOI":"10.1145\/2934732.2934738"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Flores, E., Rosso, P., Moreno, L., Villatoro-Tello, E.: PAN@ FIRE: overview of SOCO track on the detection of source code re-use. Notebook papers of FIRE 2014 (2014)","DOI":"10.1145\/2824864.2824878"},{"key":"31_CR11","unstructured":"Garc\u0131a-Hern\u00e1ndez, R., Lendeneva, Y.: Identification of similar source codes based on longest common substrings. FIRE [4] (2014)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/11671299_53","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"RA Garc\u00eda-Hern\u00e1ndez","year":"2006","unstructured":"Garc\u00eda-Hern\u00e1ndez, R.A., Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A.: A new algorithm for fast discovery of maximal sequential patterns in a document collection. In: Gelbukh, A. (ed.) CICLing 2006. LNCS, vol. 3878, pp. 514\u2013523. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671299_53"},{"key":"31_CR13","unstructured":"Hage, J., Rademaker, P., van Vugt, N.: Plagiarism detection for Java: a tool comparison. In: Computer Science Education Research Conference, pp. 33\u201346 (2011)"},{"issue":"7","key":"31_CR14","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1109\/TSE.2002.1019480","volume":"28","author":"T Kamiya","year":"2002","unstructured":"Kamiya, T., Kusumoto, S., Inoue, K.: CCFinder: a multilinguistic token-based code clone detection system for large scale source code. IEEE Trans. Software Eng. 28(7), 654\u2013670 (2002)","journal-title":"IEEE Trans. Software Eng."},{"key":"31_CR15","unstructured":"Konecki, M., Orehova\u010dki, T., Lovren\u010di\u0107, A.: Detecting code re-use potential. In: Proceedings of the 19th Central European Conference on Information and Intelligent Systems, pp. 627\u2013631 (2008)"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Muddu, B., Asadullah, A., Bhat, V.: CPDP: a robust technique for plagiarism detection in source code. In: 2013 7th International Workshop on Software Clones (IWSC), pp. 39\u201345. IEEE (2013)","DOI":"10.1109\/IWSC.2013.6613041"},{"issue":"11","key":"31_CR17","first-page":"1016","volume":"8","author":"L Prechelt","year":"2002","unstructured":"Prechelt, L., Malpohl, G., Philippsen, M., et al.: Finding plagiarisms among a set of programs with JPlag. J. Univers. Comput. Sci. 8(11), 1016 (2002)","journal-title":"J. Univers. Comput. Sci."},{"issue":"7","key":"31_CR18","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.scico.2009.02.007","volume":"74","author":"CK Roy","year":"2009","unstructured":"Roy, C.K., Cordy, J.R., Koschke, R.: Comparison and evaluation of code clone detection techniques and tools: a qualitative approach. Sci. Comput. Program. 74(7), 470\u2013495 (2009)","journal-title":"Sci. Comput. Program."},{"issue":"115","key":"31_CR19","first-page":"64","volume":"541","author":"CK Roy","year":"2007","unstructured":"Roy, C.K., Cordy, J.R.: A survey on software clone detection research. Queen\u2019s School Comput. TR 541(115), 64\u201368 (2007)","journal-title":"Queen\u2019s School Comput. TR"},{"issue":"3","key":"31_CR20","doi-asserted-by":"publisher","first-page":"491","DOI":"10.13053\/cys-18-3-2043","volume":"18","author":"G Sidorov","year":"2014","unstructured":"Sidorov, G., Gelbukh, A., G\u00f3mez-Adorno, H., Pinto, D.: Soft similarity and soft cosine measure: similarity of features in vector space model. Computaci\u00f3n y Sistemas 18(3), 491\u2013504 (2014)","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"31_CR21","unstructured":"Sommerville, I.: Ingenier\u00eda del software. Pearson educaci\u00f3n (2005)"},{"key":"31_CR22","unstructured":"Wise, M.J.: Neweyes: a system for comparing biological sequences using the running Karp-Rabin greedy string-tiling algorithm. In: ISMB, pp. 393\u2013401 (1995)"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.compedu.2013.08.005","volume":"70","author":"FP Yang","year":"2014","unstructured":"Yang, F.P., Jiau, H.C., Ssu, K.F.: Beyond plagiarism: an active learning method to analyze causes behind code-similarity. Comput. Educ. 70, 161\u2013172 (2014)","journal-title":"Comput. Educ."}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19493-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T07:08:12Z","timestamp":1666422492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19493-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031194924","9783031194931"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19493-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Monterrey","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 External reviewers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}