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
Data Visualization and Analytics
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.

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

Labels cover 4 of 1,448 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 1,448 of 1,448 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
OA-graphs
Fouad Shoie Alallah, Dean Jin, Pourang Irani
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Reducing subject tree browsing complexity
Charles‐Antoine Julien, Pierre Tirilly, Jesse David Dinneen, Catherine Guastavino
2013· article· en· Journal of the American Society for Information Science and Technology· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Taking the community's pulse
Tapanee Tirapat, Cleo Espiritu, Eleni Stroulia
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affaboutunlabeled
Visual Analytics for cyber security and intelligence
Valérie Lavigne, Denis Gouin
2014· article· en· The Journal of Defense Modeling and Simulation Applications Methodology Technology· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
KMVQL
Jiwen Huo
2008· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
14
citations
affno abstractunlabeled
The Use of Diagrams in Science
Lillian P. Fanjoy, A. Luke MacNeill, Lisa A. Best
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
afffundunlabeled
A Visual Approach for Interactive Keyterm-Based Clustering
Seyednaser Nourashrafeddin, Ehsan Sherkat, Rosane Minghim, Evangelos Milios
2018· article· en· ACM Transactions on Interactive Intelligent Systems· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations

How this was built: Screen · Findings · About