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
Advanced Text Analysis Techniques
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.

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

Labels cover 2 of 552 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 552 of 552 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.

affno abstractunlabeled
The Statistical Analysis of Recurrent Events
Richard J. Cook, Jerald F. Lawless
2007· book· en· Statistics for biology and health· Computer Science
machine prediction:candidate · noneconsensus · none
738
citations
fundno affno abstractunlabeled
A rational model of function learning
Christopher G. Lucas, Thomas L. Griffiths, Joseph Jay Williams, Michael L. Kalish
2015· review· en· Psychonomic Bulletin & Review· Computer Science
machine prediction:candidate · noneconsensus · none
112
citations
affno abstractunlabeled
A multi-centrality index for graph-based keyword extraction
Didier A. Vega‐Oliveros, Pedro Spoljaric Gomes, Evangelos Milios, Lilian Berton
2019· article· en· Information Processing & Management· Computer Science
machine prediction:candidate · noneconsensus · none
92
citations
afffundunlabeled
The invariant distribution of references in scientific articles
Marc Bertin, Iana Atanassova, Yves Gingras, Vincent Larivière
2015· article· en· Journal of the Association for Information Science and Technology· Computer Science
machine prediction:candidate · bibliometricsconsensus · none
88
citations
affunlabeled
The p-value fallacy and how to avoid it.
Peter Dixon
2003· article· en· Canadian Journal of Experimental Psychology/Revue canadienne de psychologie expérimentale· Computer Science
machine prediction:candidate · metaresearchconsensus · none
88
citations
affunlabeled
Review spotlight
Koji Yatani, Michael Novati, Andrew Trusty, Khai N. Truong
2011· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
83
citations
affunlabeled
KEA
Ian H. Witten, Gordon W. Paynter, Eibe Frank, Carl Gutwin, Craig G. Nevill-Manning
2004· book-chapter· en· IGI Global eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
73
citations
affunlabeled
Story Forest
Bang Liu, Fred X. Han, Di Niu, Linglong Kong, Kunfeng Lai, Yu Xu
2020· article· en· ACM Transactions on Knowledge Discovery from Data· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
affunlabeled
Distributed specificity for automatic terminology extraction
Ehsan Amjadian, Diana Inkpen, T. Sima Paribakht, Farahnaz Faez
2018· article· en· Terminology International Journal of Theoretical and Applied Issues in Specialized Communication· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affunlabeled
The scientific study of literature
Peter Dixon, Marisa Bortolussi
2011· article· en· Scientific Study of Literature· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affaboutunlabeled
When experts agree
Krishna Bharat, George A. Mihaila
2001· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
43
citations

How this was built: Screen · Findings · About