{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:33:52Z","timestamp":1780763632048,"version":"3.54.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"North Dakota Established Program to Stimulate Competitive Research","award":["FAR0032069"],"award-info":[{"award-number":["FAR0032069"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3034932","type":"journal-article","created":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T20:19:27Z","timestamp":1604089167000},"page":"197581-197596","source":"Crossref","is-referenced-by-count":17,"title":["Language and Obfuscation Oblivious Source Code Authorship Attribution"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8693-3244","authenticated-orcid":false,"given":"Sarim","family":"Zafar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8195-0953","authenticated-orcid":false,"given":"Muhammad Usman","family":"Sarwar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saeed","family":"Salem","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muhammad Zubair","family":"Malik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"9593","article-title":"Lookahead optimizer: k steps forward, 1 step back","author":"zhang","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","article-title":"On the variance of the adaptive learning rate and beyond","author":"liu","year":"2019","journal-title":"arXiv 1908 03265"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298664"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/662\/5\/052010"},{"key":"ref31","article-title":"Character-level and multi-channel convolutional neural networks for large-scale authorship attribution","author":"ruder","year":"2016","journal-title":"arXiv 1609 06686"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2019.2891888"},{"key":"ref37","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","author":"glorot","year":"2010","journal-title":"Proc 13th Int Conf Artif Intell Statist"},{"key":"ref36","first-page":"2493","article-title":"Natural language processing (almost) from scratch","volume":"12","author":"collobert","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref35","first-page":"807","article-title":"Rectified linear units improve restricted Boltzmann machines","author":"nair","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn (ICML)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.123"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IPTC.2010.90"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44503-X_27"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/33.2.140"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2146"},{"key":"ref13","author":"gray","year":"1997","journal-title":"Software forensics Extending authorship analysis techniques to computer programs"},{"key":"ref14","author":"pellin","year":"2000","journal-title":"Using classification techniques to determine source code authorship"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICONIP.1999.843963"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1134285.1134445"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00887-0_61"},{"key":"ref18","first-page":"50","article-title":"Detecting outsourced student programming assignments","volume":"23","author":"elenbogen","year":"2008","journal-title":"J Comput Sci Colleges"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277364"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.145"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0053"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298682"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243738"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2943639"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.173"},{"key":"ref5","first-page":"255","article-title":"De-anonymizing programmers via code stylometry","author":"caliskan-islam","year":"2015","journal-title":"Proc 24th USENIX Secur Symp (USENIX Security)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.434"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.12.038"},{"key":"ref2","first-page":"1","article-title":"Identifying authorship by byte-level N-Grams: The source code author profile (SCAP) method","volume":"6","author":"frantzeskou","year":"2007","journal-title":"Int l J Digital Evidence"},{"key":"ref9","author":"aiken","year":"2004","journal-title":"Moss A System for detecting software plagiarism"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.750"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-4048(97)00005-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(03)00049-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0187204"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0075-7"},{"key":"ref24","first-page":"32","article-title":"Source code authorship attribution using n-grams","author":"burrows","year":"2007","journal-title":"Proc 12th Australas Document Comput Symp"},{"key":"ref41","first-page":"1135","article-title":"New algorithms for efficient high-dimensional nonparametric classification","volume":"7","author":"liu","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66399-9_16"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.100"},{"key":"ref25","article-title":"When coding style survives compilation: De-anonymizing programmers from executable binaries","author":"caliskan","year":"2015","journal-title":"arXiv 1512 08546"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09245552.pdf?arnumber=9245552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:47Z","timestamp":1642003067000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9245552\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3034932","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}