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 10 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.

affunlabeled
Proof Complexity and Beyond
2018· article· en· Oberwolfach Reports· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Information Distance and Applications
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
aboutno affunlabeled
The Hyperdimensional Tar Pit
2012· article· en· Queue· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Cordial Forests
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
0
citations
affno abstractunlabeled
Hayashi’s Quantification Theory Type III
2018· book-chapter· en· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Games and Algebras
2024· book-chapter· en· Operator Theory· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affunlabeled
Asymptotic Growth
2024· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
The Puzzling Asymmetry
2018· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affno abstractunlabeled
Normality, Relativization, and Randomness
2025· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Blum Static Complexity and Encoding Spaces
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
0
citations
affunlabeled
The Second Incompleteness Theorem
2003· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
The Incompressibility Method
2019· book-chapter· en· Texts in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · open_science
0
citations
affunlabeled
Set Theory
2025· article· en· Oberwolfach Reports· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Occurrence Download
2018· dataset· en· Global Biodiversity Information Facility· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Algorithmic Complexity
2019· book-chapter· en· Texts in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · none
0
citations
aboutno affunlabeled
Philetus Melander
2016· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
fundno affunlabeled
Approximability in the GPAC
2019· preprint· en· Logical Methods in Computer Science· Computer Science
distilled prediction:candidate · metaresearch+metaepi_narrow+scholarly_communication+open_science+research_integrityconsensus · open_science
0
citations
affunlabeled
TuringLang/Turing.jl: v0.40.0
2025· other· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Introduction to Programming
2025· book-chapter· en· Texts in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
0
citations
affunlabeled
Toric Geometry
2023· article· de· Oberwolfach Reports· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Inductive Sets and Types
2025· book-chapter· en· Computer science foundations and applied logic· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
0
citations
affno abstractunlabeled
Von Neumann Algebras
2025· book-chapter· en· CMS/CAIMS books in mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About