The Failure of Plagiarism Detection in Competitive Programming
Ethan Dickey

TL;DR
This paper analyzes the limitations of current plagiarism detection methods in competitive programming, especially against AI-generated code, and advocates for a multi-faceted approach combining technology and authentic assessments.
Contribution
It provides an in-depth analysis of detection failures, reviews existing tools, and offers preliminary recommendations for improving academic integrity in programming courses.
Findings
Automated checkers can be bypassed by code transformations and AI-generated code.
Human interviews are effective but labor-intensive.
Current tools have significant limitations in competitive programming environments.
Abstract
Plagiarism in programming courses remains a persistent challenge, especially in competitive programming contexts where assignments often have unique, known solutions. This paper examines why traditional code plagiarism detection methods frequently fail in these environments and explores the implications of emerging factors such as generative AI (genAI). Drawing on the author's experience teaching a Competitive Programming 1 (CP1) course over seven semesters at Purdue University (with students each term) and completely redesigning the CP1/2/3 course sequence, we provide an academically grounded analysis. We review literature on code plagiarism in computer science education, survey current detection tools (Moss, Kattis, etc.) and methods (manual review, code-authorship interviews), and analyze their strengths and limitations. Experience-based observations are presented to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
