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 30 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
Transactions on Rough Sets X
James F. Peters, Wei-Zhi Wu, Marcin Wolski, Andrzej Skowron, Mihir K. Chakraborty
2009· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
HOT: Hypergraph-Based Outlier Test for Categorical Data
Wei Li, Weining Qian, Aoying Zhou, Wen Jin, Jeffrey Xu Yu
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Licensing the Mizar Mathematical Library
Jesse Alama, Michael Kohlhase, Lionel Mamane, Adam Naumowicz, Piotr Rudnicki, Josef Urban
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Mining Popular Patterns from Transactional Databases
Carson K. Leung, Syed Khairuzzaman Tanbeer
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Fast Pruning of Geometric Spanners
Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Formal Stability Analysis of Optical Resonators
Umair Siddique, Vincent Aravantinos, Sofiène Tahar
2013· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
23
citations
afffundno abstractunlabeled
Hypergraphic LP Relaxations for Steiner Trees
Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Formal Methods in Computer-Aided Design
Mark D. Aagaard, John O’Leary
2002· book· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
A Fast SVM Training Algorithm
Jianxiong Dong, Adam Krzyżak, Ching Y. Suen
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Partial Pattern Databases
K O Anderson, Robert C. Holte, Jonathan Schaeffer
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Transactions on Computational Science IV
Marina L. Gavrilova, Edward David Moreno, C. J. Kenneth Tan
2009· book· en· Lecture notes in computer science· Decision Sciences
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Demonic Algebra with Domain
Jean-Lou De Carufel, Jules Desharnais
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
On Multi-enabledness in Time Petri Nets
Hanifa Boucheneb, Didier Lime, Olivier Roux
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Debugging in Domain-Specific Modelling
Raphael Mannadiar, Hans Vangheluwe
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
On the Structure of Small Motif Recognition Instances
Christina Boucher, Daniel G. Brown, Stéphane Durocher
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Specifying Big Data Benchmarks
Tilmann Rabl, Hans‐Arno Jacobsen, Chaitanya Baru, Meikel Poess
2013· book· en· Lecture notes in computer science· Decision Sciences
machine prediction:candidate · noneconsensus · none
23
citations

How this was built: Screen · Findings · About