{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T05:44:58Z","timestamp":1771652698235,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,14]],"date-time":"2016-05-14T00:00:00Z","timestamp":1463184000000},"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":[],"published-print":{"date-parts":[[2016,5,14]]},"DOI":"10.1145\/2889160.2889202","type":"proceedings-article","created":{"date-parts":[[2016,5,16]],"date-time":"2016-05-16T12:27:23Z","timestamp":1463401643000},"page":"481-490","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["SolMiner"],"prefix":"10.1145","author":[{"given":"Lannan","family":"Luo","sequence":"first","affiliation":[{"name":"The Pennsylvania State University, University Park, PA"}]},{"given":"Qiang","family":"Zeng","sequence":"additional","affiliation":[{"name":"Temple University, Philadelphia, PA"}]}],"member":"320","published-online":{"date-parts":[[2016,5,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E93.D.208"},{"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.1016\/S0360-1315(03)00030-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11528043_26"},{"key":"e_1_3_2_1_5_1","unstructured":"CodeChef. https:\/\/www.codechef.com\/.  CodeChef. https:\/\/www.codechef.com\/."},{"key":"e_1_3_2_1_6_1","unstructured":"CodeForces. http:\/\/codeforces.com\/.  CodeForces. http:\/\/codeforces.com\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368132"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2157136.2157267"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699751"},{"key":"e_1_3_2_1_10_1","unstructured":"Hackerrank. https:\/\/www.hackerrank.com\/.  Hackerrank. https:\/\/www.hackerrank.com\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the New Zealand Computer Science Research Student Conference","author":"Huang A.","year":"2008","unstructured":"A. Huang . Similarity measures for text document clustering . In Proceedings of the New Zealand Computer Science Research Student Conference , 2008 . A. Huang. Similarity measures for text document clustering. In Proceedings of the New Zealand Computer Science Research Student Conference, 2008."},{"key":"e_1_3_2_1_13_1","volume-title":"MOOCshop","author":"Huang J.","year":"2013","unstructured":"J. Huang , C. Piech , A. Nguyen , and L. J. Guibas . Syntactic and functional variability of a million code submissions in a machine learning MOOC . In MOOCshop , 2013 . J. Huang, C. Piech, A. Nguyen, and L. J. Guibas. Syntactic and functional variability of a million code submissions in a machine learning MOOC. In MOOCshop, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1930464.1930480"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985899"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1268784.1268807"},{"key":"e_1_3_2_1_18_1","volume-title":"ICWL","author":"Kosowski A.","year":"2007","unstructured":"A. Kosowski and T. N. Michal Malafiejski . Application of an online judge & contester system in academic tuition . In ICWL , 2007 . A. Kosowski and T. N. Michal Malafiejski. Application of an online judge & contester system in academic tuition. In ICWL, 2007."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759548.1759580"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-1315(01)00018-5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150522"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635900"},{"key":"e_1_3_2_1_23_1","unstructured":"MOSS\n  : A System for Detecting Software Plagiarism. http:\/\/theory.stanford.edu\/~aiken\/moss\/ 2013.  MOSS: A System for Detecting Software Plagiarism. http:\/\/theory.stanford.edu\/~aiken\/moss\/ 2013."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568023"},{"key":"e_1_3_2_1_25_1","volume-title":"JPlag: Finding plagiarisms among a set of programs. Technical report","author":"Prechelt L.","year":"2000","unstructured":"L. Prechelt , G. Malpohl , and M. Phlippsen . JPlag: Finding plagiarisms among a set of programs. Technical report , Univ. of Karlsruhe , 2000 . L. Prechelt, G. Malpohl, and M. Phlippsen. JPlag: Finding plagiarisms among a set of programs. Technical report, Univ. of Karlsruhe, 2000."},{"key":"e_1_3_2_1_26_1","volume-title":"Olympiads In Informatics","author":"Revilla M. A.","year":"2008","unstructured":"M. A. Revilla , S. Manzoor , and R. Liu . Competitive learning in informatics: The UVa online judge experience . In Olympiads In Informatics , 2008 . M. A. Revilla, S. Manzoor, and R. Liu. Competitive learning in informatics: The UVa online judge experience. In Olympiads In Informatics, 2008."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/377435.377666"},{"key":"e_1_3_2_1_28_1","unstructured":"Soot. http:\/\/sable.github.io\/soot\/.  Soot. http:\/\/sable.github.io\/soot\/."},{"key":"e_1_3_2_1_29_1","unstructured":"Sphere. http:\/\/www.spoj.com\/.  Sphere. http:\/\/www.spoj.com\/."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2401796.2401806"},{"key":"e_1_3_2_1_31_1","volume-title":"ISFST","author":"Tamada H.","year":"2004","unstructured":"H. Tamada , K. Okamoto , M. Nakamura , and A. Monden . Dynamic software birthmarks to detect the theft of Windows applications . In ISFST , 2004 . H. Tamada, K. Okamoto, M. Nakamura, and A. Monden. Dynamic software birthmarks to detect the theft of Windows applications. In ISFST, 2004."},{"key":"e_1_3_2_1_32_1","unstructured":"Timus. http:\/\/acm.timus.ru\/.  Timus. http:\/\/acm.timus.ru\/."},{"key":"e_1_3_2_1_33_1","unstructured":"TopCoder. https:\/\/www.topcoder.com\/.  TopCoder. https:\/\/www.topcoder.com\/."},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the Sixth Australasian Conference on Computing Education","author":"Truong N.","year":"1991","unstructured":"N. Truong , P. Roe , and P. Bancroft . Static analysis of students' Java programs . In Proceedings of the Sixth Australasian Conference on Computing Education , 1991 . N. Truong, P. Roe, and P. Bancroft. Static analysis of students' Java programs. In Proceedings of the Sixth Australasian Conference on Computing Education, 1991."},{"key":"e_1_3_2_1_35_1","unstructured":"UVa. https:\/\/uva.onlinejudge.org\/.  UVa. https:\/\/uva.onlinejudge.org\/."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653696"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2009.24"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380210706"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0361-3"}],"event":{"name":"ICSE '16: 38th International Conference on Software Engineering","location":"Austin Texas","acronym":"ICSE '16","sponsor":["ACM Association for Computing Machinery","SIGSOFT ACM Special Interest Group on Software Engineering","IEEE-CS\\TCSE TC on Software Engineering","IEEE-CS\\DATC IEEE Computer Society"]},"container-title":["Proceedings of the 38th International Conference on Software Engineering Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2889160.2889202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2889160.2889202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:12Z","timestamp":1750221552000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2889160.2889202"}},"subtitle":["mining distinct solutions in programs"],"short-title":[],"issued":{"date-parts":[[2016,5,14]]},"references-count":39,"alternative-id":["10.1145\/2889160.2889202","10.1145\/2889160"],"URL":"https:\/\/doi.org\/10.1145\/2889160.2889202","relation":{},"subject":[],"published":{"date-parts":[[2016,5,14]]},"assertion":[{"value":"2016-05-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}