{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:29Z","timestamp":1750307189181,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Educ."],"published-print":{"date-parts":[[2012,3]]},"abstract":"<jats:p>In academic courses, students frequently take advantage of someone else\u2019s work to improve their own evaluations or grades. This unethical behavior seriously threatens the integrity of the academic system, and teachers invest substantial effort in preventing and recognizing plagiarism.<\/jats:p>\n          <jats:p>When students take examinations requiring the production of computer programs, plagiarism detection can be semiautomated using analysis techniques such as JPlag and Moss. These techniques are useful but lose effectiveness when the text of the exam suggests some of the elements that should be structurally part of the solution. A loss of effectiveness is caused by the many common parts that are shared between programs due to the suggestions in the text of the exam rather than plagiarism.<\/jats:p>\n          <jats:p>In this article, we present the AuDeNTES anti-plagiarism technique. AuDeNTES detects plagiarism via the code fragments that better represent the individual students\u2019 contributions by filtering from students\u2019 submissions the parts that might be common to many students due to the suggestions in the text of the exam. The filtered parts are identified by comparing students\u2019 submissions against a reference solution, which is a solution of the exam developed by the teachers. Specifically, AuDeNTES first produces tokenized versions of both the reference solution and the programs that must be analyzed. Then, AuDeNTES removes from the tokenized programs the tokens that are included in the tokenized reference solution. Finally, AuDeNTES computes the similarity among the filtered tokenized programs and produces a ranked list of program pairs suspected of plagiarism.<\/jats:p>\n          <jats:p>An empirical comparison against multiple state-of-the-art plagiarism detection techniques using several sets of real students\u2019 programs collected in early programming courses demonstrated that AuDeNTES identifies more plagiarism cases than the other techniques at the cost of a small additional inspection effort.<\/jats:p>","DOI":"10.1145\/2133797.2133799","type":"journal-article","created":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T15:17:31Z","timestamp":1332861451000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["AuDeNTES"],"prefix":"10.1145","volume":"12","author":[{"given":"Leonardo","family":"Mariani","sequence":"first","affiliation":[{"name":"University of Milano Bicocca"}]},{"given":"Daniela","family":"Micucci","sequence":"additional","affiliation":[{"name":"University of Milano Bicocca"}]}],"member":"320","published-online":{"date-parts":[[2012,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315803.1315831"},{"volume-title":"Proceedings of the 29th Australasian Computer Science Conference (ACSC\u201906)","author":"Arwin C.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/832303.836911"},{"volume-title":"Proceedings of the International Conference on Software Maintenance (ICSM\u201998)","author":"Baxter I. D.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.70725"},{"volume-title":"Fron. Ed. Conf. 3, 13B3\/18--13B3\/22","author":"Bowyer K.","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.v37:2"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1227504.1227324"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368132"},{"key":"e_1_2_1_10_1","unstructured":"Grune D. and Vakgroep M. 1989. Detecting copied submissions in computer science workshops. Tech. rep. Informatica Faculteit Wiskunde Informatica Vrije Universiteit. Grune D. and Vakgroep M. 1989. Detecting copied submissions in computer science workshops. Tech. rep. Informatica Faculteit Wiskunde Informatica Vrije Universiteit."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TE.2007.906278"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/13.762946"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2002.1019480"},{"key":"e_1_2_1_14_1","article-title":"IEEE","author":"Kaynak O.","year":"2008","journal-title":"Trans. Ed. (Special Issue on Plagiarism), 51."},{"key":"e_1_2_1_15_1","unstructured":"Kennedy I. G. 2006. How to do Research. CD-ROM. How can I be original? Kennedy I. G. 2006. How to do Research . CD-ROM. How can I be original?"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.28"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150522"},{"volume-title":"Annual Proceedings of Vidzeme University College.","author":"Lukashenko R.","key":"e_1_2_1_18_1"},{"volume-title":"Proceedings of the 8th Australian Conference on Computing Education (ACCE\u201906)","author":"Mann S.","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","unstructured":"Prechelt L. Malpohl G. and Phlippsen M. 2000. JPlag: Finding plagiarisms among a set of programs. Tech. rep. Fakulty at fur Informatik University at Karlsruhe. Prechelt L. Malpohl G. and Phlippsen M. 2000. JPlag: Finding plagiarisms among a set of programs. Tech. rep. Fakulty at fur Informatik University at Karlsruhe."},{"key":"e_1_2_1_21_1","first-page":"1016","article-title":"Finding plagiarisms among a set of programs with JPlag","volume":"8","author":"Prechelt L.","year":"2002","journal-title":"J. Univers. Comput. Sci."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/22054952.2008.11464008"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"e_1_2_1_24_1","unstructured":"Sun. JavaCC. https:\/\/javacc.dev.java.net\/. Sun . JavaCC. https:\/\/javacc.dev.java.net\/."},{"key":"e_1_2_1_25_1","unstructured":"Wang W. Tao K. and Palsberg J. 2011. Java tree builder. http:\/\/compilers.cs.ucla.edu\/jtb\/jtb-2003\/. Wang W. Tao K. and Palsberg J. 2011. Java tree builder. http:\/\/compilers.cs.ucla.edu\/jtb\/jtb-2003\/."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/236452.236525"},{"volume-title":"Department of Computer Science","author":"Wise M. J.","key":"e_1_2_1_27_1"}],"container-title":["ACM Transactions on Computing Education"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2133797.2133799","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2133797.2133799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:05:52Z","timestamp":1750241152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2133797.2133799"}},"subtitle":["Automatic Detection of teNtative plagiarism according to a rEference Solution"],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.1145\/2133797.2133799"],"URL":"https:\/\/doi.org\/10.1145\/2133797.2133799","relation":{},"ISSN":["1946-6226"],"issn-type":[{"type":"electronic","value":"1946-6226"}],"subject":[],"published":{"date-parts":[[2012,3]]},"assertion":[{"value":"2010-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}