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
Author
Year range
→
Sort
Language
Type
Field
Venue
Topic
Topic Modeling
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.

2,769 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.
2,769 works in the cohort · of 4,299,418page 5 of 56

Labels cover 6 of 2,769 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 2,769 of 2,769 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
(Security) Assertions by Large Language Models
Rahul Kande, Hammond Pearce, Benjamin Tan, Brendan Dolan-Gavitt, Shailja Thakur, Ramesh Karri +1 more
2024· article· en· IEEE Transactions on Information Forensics and Security· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
venueno affunlabeled
LCC Approaches to Knowledge Base Population at TAC 2010.
John Lehmann, Sean Monahan, Luke Nezda, Arnold Jung, Ying Shi
2010· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
affno abstractunlabeled
An Instance Theory of Semantic Memory
Randall K. Jamieson, Johnathan E. Avery, Brendan T. Johns, Michael N. Jones
2018· article· en· Computational Brain & Behavior· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affunlabeled
Composable Sparse Fine-Tuning for Cross-Lingual Transfer
Alan Ansell, Edoardo Maria Ponti, Anna Korhonen, Ivan Vulić
2022· article· en· Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affunlabeled
Recurrent Batch Normalization
Tim Cooijmans, Nicolas Ballas, César Laurent, Çağlar Gülçehre, Aaron Courville
2016· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
← previousnext →

How this was built: Screen · Findings · About