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

fundno affunlabeled
The Tractable Cognition Thesis
2008· article· en· Cognitive Science· Computer Science
distilled prediction:candidate · stsconsensus · none
297
citations
affunlabeled
Scale-free geometry in OO programs
2005· article· en· Communications of the ACM· Computer Science
distilled prediction:candidate · open_scienceconsensus · open_science
198
citations
fundno affunlabeled
MIP* = RE
2021· article· en· Communications of the ACM· Computer Science
distilled prediction:candidate · open_scienceconsensus · open_science
167
citations
affunlabeled
Artificial Intelligence Review
2017· book-chapter· en· IGI Global eBooks· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
137
citations
affno abstractunlabeled
On the similarity metric and the distance metric
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communication+open_scienceconsensus · none
126
citations
affno abstractunlabeled
Bayes' theorem
2015· article· en· Nature Methods· Computer Science
distilled prediction:candidate · noneconsensus · none
113
citations
affunlabeled
The similarity metric
2003· article· en· UvA-DARE (University of Amsterdam)· Computer Science
distilled prediction:candidate · noneconsensus · none
98
citations
afffundunlabeled
Non-computable Julia sets
2005· article· en· Journal of the American Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
97
citations
affno abstractunlabeled
Factorization Machines
2018· book-chapter· en· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
71
citations
affunlabeled
Skill set analysis in knowledge structures
2002· article· en· British Journal of Mathematical and Statistical Psychology· Computer Science
distilled prediction:candidate · noneconsensus · none
58
citations
afffundunlabeled
Computability of Julia Sets
2008· article· en· Moscow Mathematical Journal· Computer Science
distilled prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
Mathematics in Computer Science
2013· paratext· en· Mathematics in Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+insufficient_payloadconsensus · metaepi_narrow+open_science
54
citations
fundno affno abstractunlabeled
Applying MDL to learn best model granularity
2000· article· en· Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
49
citations
affno abstractunlabeled
Introduction to Turing categories
2008· article· en· Annals of Pure and Applied Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
45
citations
affunlabeled
Reflective Artificial Intelligence
2024· article· en· Minds and Machines· Computer Science
distilled prediction:candidate · noneconsensus · none
40
citations
affunlabeled
All realizability is relative
2006· article· en· Mathematical Proceedings of the Cambridge Philosophical Society· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
37
citations
affunlabeled
Deterministic Complexity and Entropy
2004· article· en· ResearchSpace (University of Auckland)· Computer Science
distilled prediction:candidate · noneconsensus · none
34
citations
next →

How this was built: Screen · Findings · About