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 111 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
Text Categorization via Similarity Search
Hubert Haoyang Duan, Vladimir Pestov, Varun Singla
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Basic Object Oriented Genetic Programming
Tony White, Jinfei Fan, Franz Oppacher
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Efficient Depth-Guided Urban View Synthesis
Jiaxin Huang, Dongfeng Bai, Weichao Qiu, Bingbing Liu, Andreas Geiger, Yiyi Liao
2024· book-chapter· en· Lecture notes in computer science· Environmental Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Basic Mereology with Equivalence Relations
Ryszard Janicki
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Surface Expansion from Range Data Sequences
Hagen Spies, Bernd Jähne, John A. Barron
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Off the Trail: Re-examining the CDCL Algorithm
Alexandra Goultiaeva, Fahiem Bacchus
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Modeling SystemC Fixed-Point Arithmetic in HOL
Behzad Akbarpour, Sofiène Tahar
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Improving Sense of Well-Being by Managing Memories of Experience
Mark Chignell, Chelsea de Guzman, Leon Zucherman, Jie Jiang, Jonathan Chan, Nipon Charoenkitkarn
2016· book-chapter· en· Lecture notes in computer science· Arts and Humanities
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Modeling the Supervisory Control Theory with Alloy
Benoît Fraikin, Marc Frappier, Richard St‐Denis
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
fundno affno abstractunlabeled
Biomimetic and Biohybrid Systems
Fabian Meder, Alexander Hunt, Laura Margheri, Anna Mura, Barbara Mazzolai
2023· book· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Computer Algebra in Scientific Computing
François Boulier, Matthew England, Ilias Kotsireas, Timur Sadykov, Evgenii V. Vorozhtsov
2023· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
A Propositional Proof System for Log Space
Steven Perron
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
A New Logic for Electronic Commerce Protocols
Kamel Adi, Mourad Debbabi, Mohamed Mejri
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Solving Modular Model Expansion: Case Studies
Shahab Tasharrofi, Xiongnan Wu, Eugenia Ternovska
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Optimal Double Circulant Z4-Codes
T. Aaron Gulliver, Masaaki Harada
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Trail Saving on Backtrack
Randy Hickey, Fahiem Bacchus
2020· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About