{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T16:36:58Z","timestamp":1792946218606,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,8,20]]},"DOI":"10.1145\/1150402.1150522","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"872-881","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":286,"title":["GPLAG"],"prefix":"10.1145","author":[{"given":"Chao","family":"Liu","sequence":"first","affiliation":[{"name":"University of Illinois-UC, Urbana, IL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Illinois-UC, Urbana, IL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[{"name":"University of Illinois-UC, Urbana, IL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/832303.836911"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/850947.853341"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/846219.847313"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"e_1_3_2_1_5_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . Freeman , 1979 .]] M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-11493-9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803896"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of 10th Int. Conf. on Image Analysis and Processing","author":"Hopcroft J. E.","year":"1999","unstructured":"J. E. Hopcroft and J. K. Wong . Performance evaluation of the VF graph matching algorithm . In Proc. of 10th Int. Conf. on Image Analysis and Processing , 1999 .]] J. E. Hopcroft and J. K. Wong. Performance evaluation of the VF graph matching algorithm. In Proc. of 10th Int. Conf. on Image Analysis and Processing, 1999.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2002.1019480"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/647170.718283"},{"key":"e_1_3_2_1_11_1","volume-title":"Working Notes of 3rd Workshop on AI and Software Engineering","author":"Kontogiannis K.","year":"1995","unstructured":"K. Kontogiannis , M. Galler , and R. DeMori . Detecting code similarity using patterns . In Working Notes of 3rd Workshop on AI and Software Engineering , 1995 .]] K. Kontogiannis, M. Galler, and R. DeMori. Detecting code similarity using patterns. In Working Notes of 3rd Workshop on AI and Software Engineering, 1995.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/832308.837142"},{"key":"e_1_3_2_1_13_1","volume-title":"Testing Statistical Hypotheses","author":"Lehmann E.","year":"1997","unstructured":"E. Lehmann . Testing Statistical Hypotheses . Springer Verlag , 2 nd edition, 1997 .]] E. Lehmann. Testing Statistical Hypotheses. Springer Verlag, 2nd edition, 1997.]]","edition":"2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.10"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.26"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081754"},{"issue":"11","key":"e_1_3_2_1_17_1","article-title":"Finding plagiarisms among a set of programs with JPlag","volume":"8","author":"Prechelt L.","year":"2002","unstructured":"L. Prechelt , G. Malpohl , and M. Philippsen . Finding plagiarisms among a set of programs with JPlag . J. of Universal Computer Science , 8 ( 11 ), 2002 .]] L. Prechelt, G. Malpohl, and M. Philippsen. Finding plagiarisms among a set of programs with JPlag. J. of Universal Computer Science, 8(11), 2002.]]","journal-title":"J. of Universal Computer Science"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"e_1_3_2_1_19_1","volume-title":"Biometry: the principles and practice of statistics in biological research","author":"Sokal R. R.","year":"1994","unstructured":"R. R. Sokal and F. J. Rohlf . Biometry: the principles and practice of statistics in biological research . Freeman , 3 rd edition, 1994 .]] R. R. Sokal and F. J. Rohlf. Biometry: the principles and practice of statistics in biological research. Freeman, 3rd edition, 1994.]]","edition":"3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"}],"event":{"name":"KDD06: The 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Philadelphia PA USA","acronym":"KDD06","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1150402.1150522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T09:31:14Z","timestamp":1673170274000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1150402.1150522"}},"subtitle":["detection of software plagiarism by program dependence graph analysis"],"short-title":[],"issued":{"date-parts":[[2006,8,20]]},"references-count":21,"alternative-id":["10.1145\/1150402.1150522","10.1145\/1150402"],"URL":"https:\/\/doi.org\/10.1145\/1150402.1150522","relation":{},"subject":[],"published":{"date-parts":[[2006,8,20]]},"assertion":[{"value":"2006-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}