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
Year range
→
Sort
Language
Type
Field
Venue
Topic
Logic, programming, and type systems
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.

928 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.
928 works in the cohort · of 4,299,418page 3 of 19

Labels cover 1 of 928 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 928 of 928 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
A Tale of Four Grammars
2002· article· en· Studia Logica· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
A database of categories
2003· article· en· Journal of Symbolic Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Typage et déduction dans le calcul de réécriture
2005· preprint· fr· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
25
citations
affunlabeled
Dynamic Programming Algorithms
2008· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
24
citations
affunlabeled
Wellfounded recursion with copatterns
2013· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
24
citations
affunlabeled
Contracts for concurrency
2008· article· en· Formal Aspects of Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Featherweight generic confinement
2006· article· en· Journal of Functional Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Probabilistic Predicative Programming
2004· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
23
citations
affno abstractunlabeled
Demonic Algebra with Domain
2006· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
23
citations
affno abstractunlabeled
Automated Theorem Proving
2001· book· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
23
citations
venueno affunlabeled
Categories in Control
2015· preprint· en· Theory and applications of categories· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
afffundunlabeled
Beyond contracts for concurrency
2008· article· en· Formal Aspects of Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
22
citations
affunlabeled
A new “feasible” arithmetic
2002· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
Capturing Types
2023· article· en· ACM Transactions on Programming Languages and Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Algebras and Update Strategies
2020· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · scholarly_communication+insufficient_payloadconsensus · none
20
citations
affunlabeled
Gradual type-and-effect systems
2016· article· en· Journal of Functional Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
← previousnext →

How this was built: Screen · Findings · About