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 130 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
Implementation and Application of Automata
Michael Domaratzki, Kai Salomaa
2011· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Applied Cryptography and Network Security Workshops
Jianying Zhou, Sridhar Adepu, Cristina Alcaraz, Lejla Batina, Emiliano Casalicchio, Sudipta Chattopadhyay +11 more
2022· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Not-So Hidden Information:
Jeremy Clark, Urs Hengartner, Kate Larson
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Latest News about Demonic Algebra with Domain
Jean-Lou De Carufel, Jules Desharnais
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Adaptive Tuple Differential Coding
Jean-Paul Deveaux, Andrew Rau‐Chaplin, Norbert Zeh
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Anomaly Detection via Coupled Gaussian Kernels
Guichong Li, Nathalie Japkowicz, Yang Lian
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Scalable Uncertainty Management
Jörg Siekmann, Thomas Lukasiewicz, Sergio Greco
2008· book· en· Lecture notes in computer science· Decision Sciences
machine prediction:candidate · noneconsensus · none
3
citations
fundno affno abstractunlabeled
Learning Ranking Functions by Genetic Programming Revisited
Ricardo Baeza‐Yates, Alfredo Cuzzocrea, Domenico Crea, Giovanni Lo Bianco
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Accessible Digital Media
Deborah I. Fels
2002· book-chapter· en· Lecture notes in computer science· Arts and Humanities
machine prediction:candidate · insufficient_payloadconsensus · none
3
citations
affno abstractunlabeled
Combining Epistemic Logic and Hennessy-Milner Logic
Sophia Knight, Radu Mardare, Prakash Panangaden
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Reconfiguration over Tree Decompositions
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna
2014· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Illumination Invariant Face Recognition
Guangyi Chen, Sridhar Krishnan, Yongjia Zhao, Wenfang Xie
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Simplification of Cylindrical Algebraic Formulas
Changbo Chen, Marc Moreno Maza
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Social-Affiliation Networks: Patterns and the SOAR Model
Dhivya Eswaran, Reihaneh Rabbany, Artur Dubrawski, Christos Faloutsos
2019· book-chapter· en· Lecture notes in computer science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Should Static Search Trees Ever Be Unbalanced?
Prosenjit Bose, Karim Douïeb
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Lower Bounds on Fast Searching
Donald Stanley, Boting Yang
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About