MétaCan
Menu
Back to cohort

Versioned data: why it is needed and how it can be achieved (easily and cheaply)

2017· preprint· en· W2767364566 on OpenAlexaff
Daniel S. Falster, Richard G. FitzJohn, Matthew W. Pennell, William K. Cornwell

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldDecision Sciences
TopicScientific Computing and Data Management
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsSoftware versioningComputer scienceData sharingData scienceCornerstoneData publishingProcess (computing)SoftwareData managementData model (GIS)PublishingWorld Wide WebData miningProgramming language

Abstract

fetched live from OpenAlex

The sharing and re-use of data has become a cornerstone of modern science. Multiple platforms now allow quick and easy data sharing. So far, however, data publishing models have not accommodated on-going scientific improvements in data: for many problems, datasets continue to grow with time -- more records are added, errors fixed, and new data structures are created. In other words, datasets, like scientific knowledge, advance with time. We therefore suggest that many datasets would be usefully published as a series of versions, with a simple naming system to allow users to perceive the type of change between versions. In this article, we argue for adopting the paradigm and processes for versioned data, analogous to software versioning. We also introduce a system called Versioned Data Delivery and present tools for creating, archiving, and distributing versioned data easily, quickly, and cheaply. These new tools allow for individual research groups to shift from a static model of data curation to a dynamic and versioned model that more naturally matches the scientific process.

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.061
metaresearch head score (Gemma)0.197
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Open science
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.995
Threshold uncertainty score0.322

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0610.197
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0040.008
Science and technology studies0.0040.016
Scholarly communication0.0270.070
Open science0.0050.009
Research integrity0.0060.012
Insufficient payload (model declined to judge)0.0070.005

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.406
GPT teacher head0.424
Teacher spread0.018 · 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

Citations3
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicScientific Computing and Data ManagementFrench-language works237,207