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
Computability, Logic, AI Algorithms
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.

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

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

affno abstractunlabeled
Caging AI
2025· article· en· Journal of Computer Science and Technology· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Ten Problems in Experimental Mathematics
2004· article· en· University of North Texas Digital Library (University of North Texas)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
The Fundamental Theorem of Arithmetic
2014· book-chapter· en· Undergraduate texts in mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
fundno affunlabeled
Pride and Probability
2024· article· en· Philosophy of Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The Synthesis and Decoding of Meaning
2021· article· en· Journal of Artificial General Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
COMPLEXITY, INFORMATION, ENERGY
2008· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
On the Complexity of Zero Gap MIP*
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
Non-computable Julia sets
2004· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · none
1
citations
venueno affno abstractunlabeled
Some Tree-book Ramsey Numbers.
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Toward a Model of Models: Part II
2005· book-chapter· en· Kluwer Academic Publishers eBooks· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · research_integrity
1
citations
aboutno affunlabeled
ACM Turing Award Lecture at SC22
2022· article· en· ACM SIGHPC Connect· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · open_science
1
citations
venueno affunlabeled
A Minimal Pair of Turing Degrees
2014· article· en· Journal of Mathematics Research· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About