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
Lecture notes in computer science
Topic
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.

11,332 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.
11,332 works in the cohort · of 4,299,418page 172 of 227

Labels cover 8 of 11,332 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 11,332 of 11,332 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
Fast Searching on k-Combinable Graphs
Yuan Xue, Boting Yang, Sandra Zilles
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
SCADA Radio Blackbox Reverse Engineering
Jean-Benoit Larouche, Sébastien Roy, Frédéric Mailhot, Pierre-Martin Tardif, Marc Frappier
2023· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Externalization of Data Analytics Models:
Arman Didandeh, Kamran Sedig
2016· book-chapter· en· Lecture notes in computer science· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Formally Certified Approximate Model Counting
Yong Kiam Tan, Jiong Yang, Mate Soos, Magnus O. Myreen, Kuldeep S. Meel
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
How to Cool a Graph
Anthony Bonato, Holden Milne, Trent G. Marbach, Teddy Mishura
2024· book-chapter· en· Lecture notes in computer science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Biform Theories: Project Description
Jacques Carette, William M. Farmer, Yasmine Sharoda
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Direct Marketing with Fewer Mistakes
Eileen A. Ni, Charles X. Ling
2011· book-chapter· en· Lecture notes in computer science· Decision Sciences
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About