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 222 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
Linear Arrangement Problems and Interval Graphs
Alain Quilliot, Djamal Rebaïne
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Two-Stage BP Maximization Under p-matroid Constraint
Hong Chang, Zhicheng Liu, Donglei Du, Xiaoyan Zhang
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Perspective-Aware AI in Extended Reality
Daniel Platnick, Matti Gruener, Marjan Alirezaie, Kent Larson, Dava J. Newman, Hossein Rahnama
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Repair Singleton IDs on the Fly
Xingcan Cui, Xiaohui Yu, De Guo
2016· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Mis/Dis-Information Problem Is Hard to Solve
Gregory Hagen, Reihaneh Safavi–Naini, Moti Yung
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Scoring and Classifying with Gated Auto-Encoders
Daniel Jiwoong Im, Graham W. Taylor
2015· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A Cellular Automaton for Blocking Queen Games
Matthew Cook, Urban Larsson, Turlough Neary
2015· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Towards Autonomous Robotic Systems
2024· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Learning with Trees:
Eric Spero, Milica Stojmenović, Ali Arya, Robert Biddle
2019· book-chapter· en· Lecture notes in computer science· Psychology
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
P2NIA: Privacy-Preserving Non-iterative Auditing
Jade Garcia Bourrée, Hadrien Lautraite, Sébastien Gambs, Gilles Trédan, Erwan Le Merrer, Benoît Rottembourg
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Iterated Global Models for Complex Networks
Anthony Bonato, Erin Meger
2020· preprint· en· Lecture notes in computer science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A Scalable Toolkit for Modeling 3D Surface-Based Brain Geometry
Yanghee Im, Leila Nabulsi, Melody J.Y. Kang, Sophia I. Thomopoulos, Ana M. Díaz Zuluaga, Anders M. Dale +66 more
2025· book-chapter· en· Lecture notes in computer science· Neuroscience
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A higher order modal fixed point logic
Mahesh Viswanathan, Ramesh Viswanathan
2004· article· en· Lecture notes in computer science· Arts and Humanities
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Feasible Combinatorial Matrix Theory
Ariel Fernández, Michael Soltys
2013· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About