MétaCan
Menu
Back to cohort
Record W2901297776 · doi:10.2172/1481626

Toward a Compatible Reproducibility Taxonomy for Computational and Computing Sciences

2018· report· en· W2901297776 on OpenAlexfundno aff
Michael A. Heroux, Lorena A. Barba, Manish Parashar, Victoria Stodden, Michela Taufer

Bibliographic record

Venuenot available
Typereport
Languageen
FieldDecision Sciences
TopicScientific Computing and Data Management
Canadian institutionsnot available
FundersNational Institute of Standards and TechnologyUniversity of PittsburghYork UniversitySandia National LaboratoriesU.S. Department of EnergyNational Science Foundation
KeywordsComputer scienceTaxonomy (biology)Replication (statistics)Data scienceReproducibilityManagement scienceMathematicsEngineeringBiologyEcology

Abstract

fetched live from OpenAlex

Reproducibility is an essential ingredient of the scientific enterprise. The ability to reproduce results builds trust that we can rely on the results as foundations for future scientific exploration. Presently, the fields of computational and computing sciences provide two opposing definitions of reproducible and replicable. In computational sciences, reproducible research means authors provide all necessary data and computer codes to run analyses again, so others can re-obtain the results (J. Claerbout et al., 1992). The concept was adopted and extended by several communities, where it was distinguished from replication: collecting new data to address the same question, and arriving at consistent findings (Peng et al. 2006). The Association of Computing Machinery (ACM), representing computer science and industry professionals, recently established a reproducibility initiative, adopting essentially opposite definitions. The purpose of this report is to raise awareness of the opposite definitions and propose a path to a compatible taxonomy.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.168
metaresearch head score (Gemma)0.202
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch
Consensus categoriesnone
DomainCandidate signal: Reproducibility · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.832
Threshold uncertainty score0.888

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.1680.202
Meta-epidemiology (narrow)0.0030.003
Meta-epidemiology (broad)0.0040.005
Bibliometrics0.0260.026
Science and technology studies0.0140.029
Scholarly communication0.0400.077
Open science0.0120.022
Research integrity0.0150.026
Insufficient payload (model declined to judge)0.0040.004

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.667
GPT teacher head0.495
Teacher spread0.171 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

Study designTheoretical or conceptual
DomainReproducibility
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations17
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicScientific Computing and Data ManagementFrench-language works237,207