{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T11:31:32Z","timestamp":1768303892308,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032093172","type":"print"},{"value":"9783032093189","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"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-09318-9_21","type":"book-chapter","created":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T06:22:30Z","timestamp":1762582950000},"page":"301-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Code Similarity Detection Using Complexity-Based Birthmarks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4936-9082","authenticated-orcid":false,"given":"Rares","family":"Folea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4815-9227","authenticated-orcid":false,"given":"Mihai","family":"Dascalu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0222-1002","authenticated-orcid":false,"given":"Emil","family":"Slusanschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,9]]},"reference":[{"key":"21_CR1","unstructured":"Allamanis, M., Brockschmidt, M., Khademi, M.: Learning to represent programs with graphs. arXiv preprint arXiv:1711.00740 (2017)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Alon, U., Zilberstein, M., Levy, O., Yahav, E.: code2vec: learning distributed representations of code. Proc. ACM Program. Lang. 3(POPL), 1\u201329 (2019)","DOI":"10.1145\/3290353"},{"key":"21_CR3","unstructured":"Ben-Nun, T., Jakobovits, A.S., Hoefler, T.: Neural code comprehension: a learnable representation of code semantics. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS 2018, pp. 3589\u20133601. Curran Associates Inc., Red Hook, NY, USA (2018)"},{"key":"21_CR4","unstructured":"Buratti, L., et al.: Exploring software naturalness through neural language models. CoRR abs\/2006.12641 (2020). https:\/\/arxiv.org\/abs\/2006.12641"},{"key":"21_CR5","unstructured":"Chistyakov, A., Lobacheva, E., Kuznetsov, A., Romanenko, A.: Semantic embeddings for program behavior patterns. CoRR abs\/1804.03635 (2018). http:\/\/arxiv.org\/abs\/1804.03635"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Folea, R., Iacob, R., Slusanschi, E., Rebedea, T.: Complexity-based code embeddings. In: Nguyen, N.T. (ed.) Computational Collective Intelligence, pp. 256\u2013269. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-41456-5_20"},{"issue":"7","key":"21_CR7","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.3390\/math12071073","volume":"12","author":"R Folea","year":"2024","unstructured":"Folea, R., Slusanschi, E.: Code comments: a way of identifying similarities in the source code. Mathematics 12(7), 1073 (2024)","journal-title":"Mathematics"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Folea, R., Slusanschi, E.I.: A new metric for evaluating the performance and complexity of computer programs: a new approach to the traditional ways of measuring the complexity of algorithms and estimating running times. In: 2021 23rd International Conference on Control Systems and Computer Science (CSCS), pp. 157\u2013164. IEEE (2021)","DOI":"10.1109\/CSCS52396.2021.00033"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3446371","volume":"54","author":"IU Haq","year":"2021","unstructured":"Haq, I.U., Caballero, J.: A survey of binary code similarity. ACM Comput. Surv. (CSUR) 54(3), 1\u201338 (2021)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Hurtik, P., Tomasiello, S., Hula, J., Hynar, D.: Binary cross-entropy with dynamical clipping. Neural Comput. Appl. 1\u201313 (2022). https:\/\/doi.org\/10.1007\/s00521-022-07091-x","DOI":"10.1007\/s00521-022-07091-x"},{"issue":"10","key":"21_CR11","doi-asserted-by":"publisher","first-page":"2485","DOI":"10.1109\/TSE.2024.3411072","volume":"50","author":"S Jiang","year":"2024","unstructured":"Jiang, S., Fu, C., He, S., Lv, J., Han, L., Hu, H.: Bincola: diversity-sensitive contrastive learning for binary code similarity detection. IEEE Trans. Software Eng. 50(10), 2485\u20132497 (2024). https:\/\/doi.org\/10.1109\/TSE.2024.3411072","journal-title":"IEEE Trans. Software Eng."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Koc, U., Saadatpanah, P., Foster, J.S., Porter, A.A.: Learning a classifier for false positive error reports emitted by static code analysis tools. In: Proceedings of the 1st ACM SIGPLAN International Workshop on Machine Learning and Programming Languages, pp. 35\u201342 (2017)","DOI":"10.1145\/3088525.3088675"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-642-41278-3_74","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2013","author":"B Li","year":"2013","unstructured":"Li, B., Han, L.: Distance weighted cosine similarity measure for text classification. In: Yin, H., et al. (eds.) IDEAL 2013. LNCS, vol. 8206, pp. 611\u2013618. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41278-3_74"},{"key":"21_CR14","unstructured":"Liashchynskyi, P., Liashchynskyi, P.: Grid search, random search, genetic algorithm: a big comparison for NAS. arXiv preprint arXiv:1912.06059 (2019)"},{"key":"21_CR15","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, vol. 26 (2013)"},{"key":"21_CR16","unstructured":"Mou, L., Li, G., Jin, Z., Zhang, L., Wang, T.: TBCNN: a tree-based convolutional neural network for programming language processing. CoRR abs\/1409.5718 (2014). http:\/\/arxiv.org\/abs\/1409.5718"},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3313290","volume":"19","author":"M Novak","year":"2019","unstructured":"Novak, M., Joy, M., Kermek, D.: Source-code similarity detection and detection tools used in academia: a systematic review. ACM Trans. Comput. Educ. (TOCE) 19(3), 1\u201337 (2019)","journal-title":"ACM Trans. Comput. Educ. (TOCE)"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"2464","DOI":"10.1007\/s10664-017-9564-7","volume":"23","author":"C Ragkhitwetsagul","year":"2018","unstructured":"Ragkhitwetsagul, C., Krinke, J., Clark, D.: A comparison of code similarity analysers. Empir. Softw. Eng. 23, 2464\u20132519 (2018)","journal-title":"Empir. Softw. Eng."},{"key":"21_CR19","unstructured":"Redmond, K., Luo, L., Zeng, Q.: A cross-architecture instruction embedding model for natural language processing-inspired binary code analysis. CoRR abs\/1812.09652 (2018). http:\/\/arxiv.org\/abs\/1812.09652"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Svyatkovskiy, A., Lee, S., Hadjitofi, A., Riechert, M., Franco, J.V., Allamanis, M.: Fast and memory-efficient neural code completion. In: 2021 IEEE\/ACM 18th International Conference on Mining Software Repositories (MSR), pp. 329\u2013340. IEEE (2021)","DOI":"10.1109\/MSR52588.2021.00045"},{"key":"21_CR21","doi-asserted-by":"publisher","unstructured":"Wang, K., Su, Z.: Blended, precise semantic program embeddings. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2020, pp. 121\u2013134. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3385412.3385999","DOI":"10.1145\/3385412.3385999"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Wang, K., Yan, M., Zhang, H., Hu, H.: Unified abstract syntax tree representation learning for cross-language program classification. In: Proceedings of the 30th IEEE\/ACM International Conference on Program Comprehension, pp. 390\u2013400 (2022)","DOI":"10.1145\/3524610.3527915"},{"key":"21_CR23","unstructured":"Folea, R., Slusanschi, E.: Properties of calculus in R-complexity"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09318-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:02:40Z","timestamp":1768280560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09318-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,9]]},"ISBN":["9783032093172","9783032093189"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09318-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,9]]},"assertion":[{"value":"9 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ho Chi Minh City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}