MétaCan
Menu
Back to cohort
Record W4415397584 · doi:10.13003/478118fusruz

Powering FAIR with rich metadata

2025· report· W4415397584 on OpenAlexaboutno aff
Alexandre Bédard-Vallée

Bibliographic record

Venuenot available
Typereport
Language
FieldComputer Science
TopicResearch Data Management Practices
Canadian institutionsnot available
Fundersnot available
KeywordsMetadataInteroperabilityIdentifierLicenseGateway (web page)Unique identifierLinked dataData sharing

Abstract

fetched live from OpenAlex

Effective open science is more than removing paywalls. Indeed, it requires that research outputs are Findable, Accessible, Interoperable, and Reusable (FAIR). The engine that powers the FAIR principles at scale is high-quality, open metadata. This poster illustrates how Crossref's infrastructure empowers members to curate rich metadata for their records, offering a gateway to FAIR data. We demonstrate how our metadata directly support each principle: Research is findable through persistent identifiers and rich descriptive metadata, It becomes accessible through standardized resolution to the content itself, Interoperability is ensured by machine-readable formats and links to related identifiers from partner registrars such as ORCID and ROR, and create a connected graph of knowledge, And, finally, reusability is enhanced by explicit license information that clarifies how both the metadata and the research it describes can be reused. For Canadian organizations building their open science systems, understanding, leveraging, and enriching this metadata is crucial. This poster offers a guide for researchers, administrators, and funders on how to use Crossref’s open tools to ensure their research outputs are not just open, but truly FAIR and impactful.

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.154
metaresearch head score (Gemma)0.253
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Open science
Consensus categoriesnone
DomainCandidate signal: Reproducibility · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.996
Threshold uncertainty score0.813

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.1540.253
Meta-epidemiology (narrow)0.0010.002
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0150.012
Science and technology studies0.0100.016
Scholarly communication0.0360.082
Open science0.0040.046
Research integrity0.0050.010
Insufficient payload (model declined to judge)0.0260.013

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.150
GPT teacher head0.399
Teacher spread0.249 · 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 designNot applicable
DomainReproducibility
GenreOther

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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicResearch Data Management PracticesFrench-language works237,207