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 209 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
Exploring Positional Linear Go
Noah Weninger, Ryan Hayward
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Data-driven and On-Demand Conceptual Modeling
Damianos Chatziantoniou, Verena Kantere
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On Formal MOM Modeling
Hanmei Cui, Jessica Chen
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
ADLER: Adaptive Sampling for Precise Monitoring
Arnamoy Bhattacharyya, Cristiana Amza
2019· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On the Message Complexity of Global Computations
Doron Nussbaum, Nicola Santoro
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A New Numerical Scheme for Anisotropic Diffusion
Hongwen. Yi, Peter H. Gregson
2004· book-chapter· en· Lecture notes in computer science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Hierarchical MCMC Sampling
Paul Fieguth
2004· book-chapter· en· Lecture notes in computer science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Learning a Ring Cheaply and Fast
Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Fragile Complexity of Adaptive Algorithms
Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
2021· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Insuring Risk-Averse Agents
Greg Hines, Kate Larson
2009· book-chapter· en· Lecture notes in computer science· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Visualization of Linear Algebra Algorithms in Apt Apprentice
Christopher Andrews, Rodney H. Cooper, Ghislain Deslongchamps, Olivier Spet
2005· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Touring Convex Polygons in Polygonal Domain Fences
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About