{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:06:39Z","timestamp":1775790399970,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/rivf.2019.8713763","type":"proceedings-article","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:27:30Z","timestamp":1558027650000},"page":"1-6","source":"Crossref","is-referenced-by-count":6,"title":["The DOMJudge Based Online Judge System with Plagiarism Detection"],"prefix":"10.1109","author":[{"given":"Minh Tuan","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tan Bao","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","author":"eldering","year":"2018"},{"key":"ref3","article-title":"Sharif University","year":"2018","journal-title":"Sharif Online Judge Sharif University"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"ref5","author":"eldering","year":"2018"},{"key":"ref8","author":"eldering","year":"2018"},{"key":"ref7","first-page":"319","article-title":"Suffix arrays: a new method for online string searches","author":"manber","year":"1990","journal-title":"Proc 1st Annual ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref2","year":"2018","journal-title":"Directi Group Codechef Directi"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","article-title":"A guided tour to approximate string matching","volume":"33","author":"gonzalo","year":"2001","journal-title":"ACM Computing Surveys"},{"key":"ref1","author":"mirzayanov","year":"2018","journal-title":"CodeForces"}],"event":{"name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","location":"Danang, Vietnam","start":{"date-parts":[[2019,3,20]]},"end":{"date-parts":[[2019,3,22]]}},"container-title":["2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8705149\/8713612\/08713763.pdf?arnumber=8713763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:18:40Z","timestamp":1658247520000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8713763\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/rivf.2019.8713763","relation":{},"subject":[],"published":{"date-parts":[[2019,3]]}}}