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 58 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
Flexible Query Answering in Data Cubes
Sami Naouali, Rokia Missaoui
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Deciding on a Pattern
Jonathan C. McPhail, Dwight Deugo
2001· book-chapter· en· Lecture notes in computer science· Social Sciences
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Intelligent Robotics and Applications
Chun‐Yi Su, Honghai Liu, Subhash Rakheja
2012· book· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Implementing MSC Tests with Quiescence Observation
Sergiy Boroday, Alexandre Petrenko, Andreas Ulrich
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Artificial General Intelligence
2016· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Generating Combinations by Prefix Shifts
Frank Ruskey, Aaron Williams
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Image and Signal Processing
Abderrahim Elmoataz, Driss Aboutajdine, Fathallah Nouboud, Olivier Lézoray, Driss Mammass
2012· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Improving Phenotype Name Recognition
Maryam Khordad, Robert E. Mercer, Peter K. Rogan
2011· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
A CBR-Based Approach for Ship Collision Avoidance
Yuhong Liu, Chunsheng Yang, Xuanmin Du
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
A Simple Fast Hybrid Pattern-Matching Algorithm
František Franěk, Christopher G. Jennings, William F. Smyth
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Mining Contrast Subspaces
Lei Duan, Guanting Tang, Jian Pei, James Bailey, Guozhu Dong, Akiko Campbell +1 more
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Magic Labelings on Cycles and Wheels
Andrew Baker, Joe Sawada
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Domain Adaptation for Detecting Mild Cognitive Impairment
Vaden Masrani, Gabriel Murray, Thalia S. Field, Giuseppe Carenini
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations

How this was built: Screen · Findings · About