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
AI-based Problem Solving and Planning
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.

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

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

affno abstractunlabeled
Prefacr
2000· article· en· Foundations of Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Multiagent Systems
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Planning with Uncertainty
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Uncertain reasoning at FLAIRS
2015· article· en· Journal of Applied Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Individuals and Relations
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Individuals and Relations
2010· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Planning with Certainty
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Reasoning with Uncertainty
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
aboutno affunlabeled
Preface
2020· article· en· Journal of Physics Conference Series· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Core GRADE for evidence syntheses
2025· article· de· physioscience· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
afffundunlabeled
A computational framework for package planning
2006· article· en· International Journal of Knowledge-based and Intelligent Engineering Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Searching for Solutions
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
0
citations
affno abstractunlabeled
Introduction to MPI
2025· book-chapter· en· CMS/CAIMS books in mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Learning with Uncertainty
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Retrospect and Prospect
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Generalizing and Executing Plans
2021· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affgemma · no categorygpt · no categorymodels split
A library for constraint consistent learning
2020· article· en· Advanced Robotics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Propositions and Inference
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/s0029-7437(05)71328-8
2000· article· en· Time to knit· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Reasoning with Constraints
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About