{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T01:32:47Z","timestamp":1789176767679,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T00:00:00Z","timestamp":1601856000000},"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":[[2020,10,5]]},"DOI":"10.1145\/3382494.3410685","type":"proceedings-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T16:59:24Z","timestamp":1603472364000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Effect of Technical and Social Factors on Pull Request Quality for the NPM Ecosystem"],"prefix":"10.1145","author":[{"given":"Tapajit","family":"Dey","sequence":"first","affiliation":[{"name":"University of Tennessee, Knoxville, TN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Audris","family":"Mockus","sequence":"additional","affiliation":[{"name":"University of Tennessee, Knoxville, TN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,10,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Odds ratios should be avoided when events are common. Bmj 317, 7168","author":"Altman Douglas G","year":"1998","unstructured":"Douglas G Altman , Jonathon J Deeks , and David L Sackett . 1998. Odds ratios should be avoided when events are common. Bmj 317, 7168 ( 1998 ), 1318. Douglas G Altman, Jonathon J Deeks, and David L Sackett. 1998. Odds ratios should be avoided when events are common. Bmj 317, 7168 (1998), 1318."},{"key":"e_1_3_2_1_2_1","volume-title":"Towards Engineering Free\/Libre Open Source Software (FLOSS) Ecosystems for Impact and Sustainability","author":"Amreen Sadika","unstructured":"Sadika Amreen , Bogdan Bichescu , Randy Bradley , Tapajit Dey , Yuxing Ma , Audris Mockus , Sara Mousavi , and Russell Zaretzki . 2019. A methodology for measuring FLOSS ecosystems . In Towards Engineering Free\/Libre Open Source Software (FLOSS) Ecosystems for Impact and Sustainability . Springer , Singapore , 1--29. Sadika Amreen, Bogdan Bichescu, Randy Bradley, Tapajit Dey, Yuxing Ma, Audris Mockus, Sara Mousavi, and Russell Zaretzki. 2019. A methodology for measuring FLOSS ecosystems. In Towards Engineering Free\/Libre Open Source Software (FLOSS) Ecosystems for Impact and Sustainability. Springer, Singapore, 1--29."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2012.54"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145204.2145396"},{"key":"e_1_3_2_1_5_1","volume-title":"Iain Kinloch Crombie, and Manouche Tavakoli","author":"Oakley Davies Huw Talfryn","year":"1998","unstructured":"Huw Talfryn Oakley Davies , Iain Kinloch Crombie, and Manouche Tavakoli . 1998 . When can odds ratios mislead? Bmj 316, 7136 (1998), 989--991. Huw Talfryn Oakley Davies, Iain Kinloch Crombie, and Manouche Tavakoli. 1998. When can odds ratios mislead? Bmj 316, 7136 (1998), 989--991."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196398.3196401"},{"key":"e_1_3_2_1_7_1","volume-title":"Representation of Developer Expertise in Open Source Software. arXiv preprint arXiv:2005.10176","author":"Dey Tapajit","year":"2020","unstructured":"Tapajit Dey , Andrey Karnauch , and Audris Mockus . 2020. Representation of Developer Expertise in Open Source Software. arXiv preprint arXiv:2005.10176 ( 2020 ). Tapajit Dey, Andrey Karnauch, and Audris Mockus. 2020. Representation of Developer Expertise in Open Source Software. arXiv preprint arXiv:2005.10176 (2020)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3345629.3345634"},{"key":"#cr-split#-e_1_3_2_1_9_1.1","doi-asserted-by":"crossref","unstructured":"Tapajit Dey and Audris Mockus. 2018. Are Software Dependency Supply Chain MetricsUsefulinPredictingChangeofPopularityofNPMPackages?.InProceedings of the 14th International Conference on Predictive Models and Data Analytics in Software Engineering (PROMISE'18). Association for Computing Machinery New York NY USA 66--69. https:\/\/doi.org\/10.1145\/3273934.3273942 10.1145\/3273934.3273942","DOI":"10.1145\/3273934.3273942"},{"key":"#cr-split#-e_1_3_2_1_9_1.2","doi-asserted-by":"crossref","unstructured":"Tapajit Dey and Audris Mockus. 2018. Are Software Dependency Supply Chain MetricsUsefulinPredictingChangeofPopularityofNPMPackages?.InProceedings of the 14th International Conference on Predictive Models and Data Analytics in Software Engineering (PROMISE'18). Association for Computing Machinery New York NY USA 66--69. https:\/\/doi.org\/10.1145\/3273934.3273942","DOI":"10.1145\/3273934.3273942"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3273934.3273941"},{"key":"e_1_3_2_1_11_1","volume-title":"A Dataset of Pull Requests and A Trained Random Forest Model for predicting Pull Request Acceptance. (May","author":"Dey Tapajit","year":"2020","unstructured":"Tapajit Dey and Audris Mockus . 2020. A Dataset of Pull Requests and A Trained Random Forest Model for predicting Pull Request Acceptance. (May 2020 ). https:\/\/doi.org\/10.5281\/zenodo.3858046 10.5281\/zenodo.3858046 Tapajit Dey and Audris Mockus. 2020. A Dataset of Pull Requests and A Trained Random Forest Model for predicting Pull Request Acceptance. (May 2020). https:\/\/doi.org\/10.5281\/zenodo.3858046"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-019-09791-w"},{"key":"e_1_3_2_1_13_1","volume-title":"Detecting and Characterizing Bots that Commit Code. arXiv preprint arXiv:2003.03172","author":"Dey Tapajit","year":"2020","unstructured":"Tapajit Dey , Sara Mousavi , Eduardo Ponce , Tanner Fry , Bogdan Vasilescu , Anna Filippova , and Audris Mockus . 2020. Detecting and Characterizing Bots that Commit Code. arXiv preprint arXiv:2003.03172 ( 2020 ). Tapajit Dey, Sara Mousavi, Eduardo Ponce, Tanner Fry, Bogdan Vasilescu, Anna Filippova, and Audris Mockus. 2020. Detecting and Characterizing Bots that Commit Code. arXiv preprint arXiv:2003.03172 (2020)."},{"key":"e_1_3_2_1_14_1","volume-title":"An Exploratory Study of Bot Commits. arXiv preprint arXiv:2003.07961","author":"Dey Tapajit","year":"2020","unstructured":"Tapajit Dey , Bogdan Vasilescu , and Audris Mockus . 2020. An Exploratory Study of Bot Commits. arXiv preprint arXiv:2003.07961 ( 2020 ). Tapajit Dey, Bogdan Vasilescu, and Audris Mockus. 2020. An Exploratory Study of Bot Commits. arXiv preprint arXiv:2003.07961 (2020)."},{"key":"e_1_3_2_1_15_1","volume-title":"Greedy function approximation: a gradient boosting machine. Annals of statistics","author":"Friedman Jerome H","year":"2001","unstructured":"Jerome H Friedman . 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics ( 2001 ), 1189--1232. Jerome H Friedman. 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics (2001), 1189--1232."},{"key":"e_1_3_2_1_16_1","volume-title":"A Dataset and an Approach for Identity Resolution of 38 Million Author IDs extracted from 2B Git Commits. arXiv preprint arXiv:2003.08349","author":"Fry Tanner","year":"2020","unstructured":"Tanner Fry , Tapajit Dey , Andrey Karnauch , and Audris Mockus . 2020. A Dataset and an Approach for Identity Resolution of 38 Million Author IDs extracted from 2B Git Commits. arXiv preprint arXiv:2003.08349 ( 2020 ). Tanner Fry, Tapajit Dey, Andrey Karnauch, and Audris Mockus. 2020. A Dataset and an Approach for Identity Resolution of 38 Million Author IDs extracted from 2B Git Commits. arXiv preprint arXiv:2003.08349 (2020)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884826"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2818754.2818800"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2016.10.006"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2487085.2487111"},{"key":"e_1_3_2_1_21_1","first-page":"18","article-title":"Classification and Regression by randomForest","volume":"2","author":"Liaw Andy","year":"2002","unstructured":"Andy Liaw and Matthew Wiener . 2002 . Classification and Regression by randomForest . R News 2 , 3 (2002), 18 -- 22 . http:\/\/CRAN.R-project.org\/doc\/Rnews\/ Andy Liaw and Matthew Wiener. 2002. Classification and Regression by randomForest. R News 2, 3 (2002), 18--22. http:\/\/CRAN.R-project.org\/doc\/Rnews\/","journal-title":"R News"},{"key":"e_1_3_2_1_22_1","volume-title":"World of Code: An Infrastructure for Mining the Universe of Open Source VCS Data. In IEEE Working Conference on Mining Software Repositories. papers\/WoC.pdf","author":"Ma Yuxing","year":"2019","unstructured":"Yuxing Ma , Chris Bogart , Sadika Amreen , Russell Zaretzki , and Audris Mockus . 2019 . World of Code: An Infrastructure for Mining the Universe of Open Source VCS Data. In IEEE Working Conference on Mining Software Repositories. papers\/WoC.pdf Yuxing Ma, Chris Bogart, Sadika Amreen, Russell Zaretzki, and Audris Mockus. 2019. World of Code: An Infrastructure for Mining the Universe of Open Source VCS Data. In IEEE Working Conference on Mining Software Repositories. papers\/WoC.pdf"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338906.3340457"},{"key":"e_1_3_2_1_24_1","unstructured":"Stephen Milborrow. 2019. Plotting regression surfaces with plotmo. (2019).  Stephen Milborrow. 2019. Plotting regression surfaces with plotmo. (2019)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/567793.567795"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597073.2597121"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594458"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695856"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180208"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568315"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236054"},{"key":"e_1_3_2_1_32_1","volume-title":"Automatically Prioritizing Pull Requests. In 2015 IEEE\/ACM 12th Working Conference on Mining Software Repositories. 357--361","author":"Veen E. v. d.","year":"2015","unstructured":"E. v. d. Veen , G. Gousios , and A. Zaidman . 2015 . Automatically Prioritizing Pull Requests. In 2015 IEEE\/ACM 12th Working Conference on Mining Software Repositories. 357--361 . https:\/\/doi.org\/10.1109\/MSR. 2015 .40 10.1109\/MSR.2015.40 E. v. d. Veen, G. Gousios, and A. Zaidman. 2015. Automatically Prioritizing Pull Requests. In 2015 IEEE\/ACM 12th Working Conference on Mining Software Repositories. 357--361. https:\/\/doi.org\/10.1109\/MSR.2015.40"},{"key":"e_1_3_2_1_33_1","volume-title":"how many npm users are there?","author":"Voss Laurie","year":"2016","unstructured":"Laurie Voss . 2016. how many npm users are there? ( 2016 ). https:\/\/blog.npmjs.org\/post\/143451680695\/how-many-npm-users-are-there Laurie Voss. 2016. how many npm users are there? (2016). https:\/\/blog.npmjs.org\/post\/143451680695\/how-many-npm-users-are-there"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1370750.1370767"},{"key":"e_1_3_2_1_35_1","volume-title":"ggplot2: Elegant Graphics for Data Analysis","author":"Wickham Hadley","unstructured":"Hadley Wickham . 2016. ggplot2: Elegant Graphics for Data Analysis . Springer-Verlag New York . https:\/\/ggplot2.tidyverse.org Hadley Wickham. 2016. ggplot2: Elegant Graphics for Data Analysis. Springer-Verlag New York. https:\/\/ggplot2.tidyverse.org"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ESEM.2013.62"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2015.42"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2014.107"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.2014.57"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2016.01.004"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2018.00067"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950364"}],"event":{"name":"ESEM '20: ACM \/ IEEE International Symposium on Empirical Software Engineering and Measurement","location":"Bari Italy","acronym":"ESEM '20","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the 14th ACM \/ IEEE International Symposium on Empirical Software Engineering and Measurement (ESEM)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382494.3410685","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382494.3410685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:26Z","timestamp":1750199906000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382494.3410685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,5]]},"references-count":43,"alternative-id":["10.1145\/3382494.3410685","10.1145\/3382494"],"URL":"https:\/\/doi.org\/10.1145\/3382494.3410685","relation":{},"subject":[],"published":{"date-parts":[[2020,10,5]]},"assertion":[{"value":"2020-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}