Conference Paper: “Advancing Computational Reproducibility in the Dataverse Data Repository Platform” (Preprint)
The paper linked to below by researchers at Harvard was recently shared on arXiv. It will be presented at P-RECS’20, June 23, 2020, Stockholm, Sweden.
Title
Advancing Computational Reproducibility in the Dataverse Data Repository Platform
Authors
Ana Trisovic
Harvard University
Philip Durbin
Harvard University
Tania Schlatter
Harvard University
Gustavo Durand
Harvard University
Sonia Barbosa
Harvard University
Danny Brooke
Harvard University
Mercè Crosas
Harvard University
Source
via arXiv
Abstract
Recent reproducibility case studies have raised concerns showing that much of the deposited research has not been reproducible. One of their conclusions was that the way data repositories store research data and code cannot fully facilitate reproducibility due to the absence of a runtime environment needed for the code execution. New specialized reproducibility tools provide cloud-based computational environments for code encapsulation, thus enabling research portability and reproducibility. However, they do not often enable research discoverability, standardized data citation, or long-term archival like data repositories do. This paper addresses the shortcomings of data repositories and reproducibility tools and how they could be overcome to improve the current lack of computational reproducibility in published and archived research outputs.
Direct to Full Text Paper
6 pages; PDF.
Filed under: Data Files, Journal Articles, News, Open Access, Publishing
About Gary Price
Gary Price (gprice@gmail.com) is a librarian, writer, consultant, and frequent conference speaker based in the Washington D.C. metro area. He earned his MLIS degree from Wayne State University in Detroit. Price has won several awards including the SLA Innovations in Technology Award and Alumnus of the Year from the Wayne St. University Library and Information Science Program. From 2006-2009 he was Director of Online Information Services at Ask.com.