MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
→
Sort
Language
Type
Field
Venue
Mathematical Structures in Computer Science
Topic
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

72 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
72 works in the cohort · of 4,299,418page 2 of 2

Labels cover 0 of 72 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 72 of 72 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

fundno affunlabeled
Three extensional models of type theory
Benno van den Berg
2009· article· en· Mathematical Structures in Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Univalent categories of modules
Jarl G. Taxerås Flaten
2023· article· en· Mathematical Structures in Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
aboutno affunlabeled
Foreword: special issue on coalgebraic logic
Ernst–Erich Doberkat, Alexander Kurz
2011· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Preface to Special Issue: LSFA 2019 and 2020
Amy Felty, Giselle Reis
2022· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
A cubical Squier’s theorem
Maxime Lucas
2020· preprint· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Displayed type theory and semi-simplicial types
Astra Kolomatskaia, Michael Shulman
2025· article· en· Mathematical Structures in Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
← previous

How this was built: Screen · Findings · About