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 100 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
Advances on Genome Duplication Distances
Yves Gagnon, Olivier Tremblay Savard, Denis Bertrand, Nadia El-Mabrouk
2010· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
A BPEL Based Implementation of Online Auctions
Morad Benyoucef, Ronald Pringadi
2007· book-chapter· en· Lecture notes in computer science· Decision Sciences
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Constrained Routing Between Non-Visible Vertices
Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Bend Complexity and Hamiltonian Cycles in Grid Graphs
Rahnuma Islam Nishat, Sue Whitesides
2017· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Algorithms for Finding Maximal-Scoring Segment Sets
Miklós Csürös
2004· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
RFCT: An Association-Based Causality Miner
Kamran Karimi, Howard J. Hamilton
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Broadcasting in Split Graphs
Hovhannes A. Harutyunyan, Narek Hovhannisyan
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Preventing Arithmetic Overflows in Alloy
Aleksandar Milićević, Daniel Jackson
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Two New Secret Key Cryptosystems
Henk Meijer, Selim G. Akl
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Layered Modal Type Theory
Jason Z. S. Hu, Brigitte Pientka
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
The θ 5-Graph is a Spanner
Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Two Factor Option Pricing with Uncertain Volatility
David M. Pooley, Peter Forsyth, K.R. Vetzal
2003· book-chapter· en· Lecture notes in computer science· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Fractal Analysis Approaches to Granular Computing
JingTao Yao, Oladunni A. Oladimeji, Zhang Yan
2017· book-chapter· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About