{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:09Z","timestamp":1750306929221,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS 0612203"],"award-info":[{"award-number":["IIS 0612203"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2480362.2480525","type":"proceedings-article","created":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T19:47:45Z","timestamp":1367437665000},"page":"846-852","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["CodeBlast"],"prefix":"10.1145","author":[{"given":"Anupam","family":"Bhattacharjee","sequence":"first","affiliation":[{"name":"Wayne State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan M.","family":"Jamil","sequence":"additional","affiliation":[{"name":"University of Idaho"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.90"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/832303.836911"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/850947.853341"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.3102\/00346543047004623"},{"key":"e_1_3_2_1_5_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. Introduction to Algorithms. MIT Press second edition 2001.   T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. Introduction to Algorithms . MIT Press second edition 2001."},{"volume-title":"University of Alberta","year":"1996","author":"Fortin S.","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","unstructured":"M. Fowler. Refactoring - Improving the Design of. Existing Code. Addison Wesley 2000.  M. Fowler. Refactoring - Improving the Design of. Existing Code . Addison Wesley 2000."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"volume-title":"USA","year":"1990","author":"Garey M. R.","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982415"},{"key":"e_1_3_2_1_11_1","first-page":"68","volume-title":"AISE","author":"Kontogiannis K.","year":"1995"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"M. Kubale. Graph Colorings. American Mathematical Society 2004.  M. Kubale. Graph Colorings . American Mathematical Society 2004.","DOI":"10.1090\/conm\/352"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.40"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150522"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/322063.322075"},{"issue":"11","key":"e_1_3_2_1_16_1","first-page":"1016","article-title":"Jplag: Finding plagiarism among a set of programs with jplag","volume":"8","author":"Prechelt L.","year":"2002","journal-title":"J. Universal Computer Science"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2008.42"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2009.02.007"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447830"}],"event":{"name":"SAC '13: SAC '13","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Coimbra Portugal","acronym":"SAC '13"},"container-title":["Proceedings of the 28th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480525","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2480362.2480525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:33Z","timestamp":1750235733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480525"}},"subtitle":["a two-stage algorithm for improved program similarity matching in large software repositories"],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":20,"alternative-id":["10.1145\/2480362.2480525","10.1145\/2480362"],"URL":"https:\/\/doi.org\/10.1145\/2480362.2480525","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}