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 4 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 affno abstractunlabeled
Algorithmic and Symbolic Combinatorics
2020· book· en· Texts & monographs in symbolic computation/Texts and monographs in symbolic computation· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrityconsensus · metaepi_narrow+research_integrity
8
citations
affno abstractunlabeled
Logical Decision Rules: Teaching C4.5 to Speak Prolog
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
8
citations
affno abstractunlabeled
Algorithms and Computation
2002· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
8
citations
affunlabeled
Differential recursion
2009· article· en· ACM Transactions on Computational Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Bounding homogenous models
2007· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
fundno affno abstractunlabeled
Algorithmic Game Theory
2015· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
7
citations
fundno affunlabeled
Information complexity is computable
2015· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_science+insufficient_payloadconsensus · metaepi_narrow+open_science
7
citations
affunlabeled
Schnorr triviality and genericity
2010· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Provable computable functions on abstract data types
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
7
citations
affunlabeled
Nonuniversality explained
2015· article· en· International Journal of Parallel Emergent and Distributed Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Parallel stochastic grammar induction
2002· article· en· Proceedings of International Conference on Neural Networks (ICNN'97)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
venueno affunlabeled
La pyramide algorithmique
2017· article· fr· Sens public· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · none
6
citations
fundno affunlabeled
Degree Spectra of Relations on a Cone
2018· article· en· Memoirs of the American Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
A Lewisian regularity theory
2024· article· en· Philosophical Studies· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Categorical simulations
2010· article· en· Journal of Pure and Applied Algebra· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Yet Another Hat Game
2010· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Never Say Always Again: Reflections on the Numbers Game
2010· book-chapter· en· Open Book Publishers· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · insufficient_payload
6
citations
affno abstractunlabeled
Generalized inflations and null extensions
2004· article· en· Discussiones Mathematicae - General Algebra and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
← previousnext →

How this was built: Screen · Findings · About