Prof. Dubach mentioned that, in MOSS, it's annoying to jump back and forth between different project pairs when deciding whether a trio of students each plagiarized off of one another.
This should be doable in the frontend. As a simple first implementation, we could just update the project pairs view. For every match, add a list of all the projects where that code occurs. A more advanced version might show a weighted graph where each node is a project and the weight of the edge between projects is proportional to the number of matches between them. Prof. Dubach also suggested somehow overlaying code from multiple projects such that matching code is highlighted and overlapping, like how images of faces can be overlaid to highlight similarities and differences.
Prof. Dubach mentioned that, in MOSS, it's annoying to jump back and forth between different project pairs when deciding whether a trio of students each plagiarized off of one another.
This should be doable in the frontend. As a simple first implementation, we could just update the project pairs view. For every match, add a list of all the projects where that code occurs. A more advanced version might show a weighted graph where each node is a project and the weight of the edge between projects is proportional to the number of matches between them. Prof. Dubach also suggested somehow overlaying code from multiple projects such that matching code is highlighted and overlapping, like how images of faces can be overlaid to highlight similarities and differences.