MétaCan
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.

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 15 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
Tulip
Marek Lipczak, Arash Koushkestani, Evangelos Milios
2014· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
15
citations
affunlabeled
Question Answering in Knowledge Bases
Richong Zhang, Yue Wang, Yongyi Mao, Jinpeng Huai
2019· article· en· ACM Transactions on Information Systems· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Dynabench: Rethinking Benchmarking in NLP
Douwe Kiela, Max Bartolo, Yixin Nie, Divyansh Kaushik, Atticus Geiger, Zhengxuan Wu +13 more
2021· preprint· en· Computer Science
machine prediction:candidate · metaresearchconsensus · none
14
citations
afffundunlabeled
Overview of COLIEE 2017
Yoshinobu Kano, Mi-Young Kim, Randy Goebel, Ken Satoh
2018· article· en· EPiC series in computing· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Search-Oriented Conversational Query Editing
Kelong Mao, Zhicheng Dou, Bang Liu, Hongjin Qian, Fengran Mo, Xiangli Wu +2 more
2023· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
venueno affunlabeled
AUEB at TAC 2008
Dimitrios Galanis, Prodromos Malakasiotis
2008· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
14
citations
affunlabeled
Gated Orthogonal Recurrent Units: On Learning to Forget
Jing Li, Çağlar Gülçehre, John Peurifoy, Yichen Shen, Max Tegmark, Marin Soljačić +1 more
2017· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations

How this was built: Screen · Findings · About