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 84 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
Independence of Tabulation-Based Hash Classes
Toryn Q. Klassen, Philipp Woelfel
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Teaching Formal Methods: An Experience Report
Mehrnoosh Askarpour, Marcello M. Bersani
2020· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
On Implicit Meanings
Verónica Dahl
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Braess’s Paradox for Flows over Time
2010· book-chapter· en· Lecture notes in computer science· Decision Sciences
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Semantic-Based Cross-Media Image Retrieval
Ahmed Id Oumohmed, Max Mignotte, Jian‐Yun Nie
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
fundno affno abstractunlabeled
Applications of Evolutionary Computation
2024· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
General Game Playing with Ants
Shiven Sharma, Ziad Kobti, Scott D. Goodwin
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Correcting Errors in Message Passing Systems
Jan Bækgaard Pedersen, Alan Wagner
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Computational Modeling of Criminal Activity
Uwe Glässer, Mona Vajihollahi
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
An Ontology-Based Reasoning Approach for Electric Power Utilities
Mohamed Gaha, Arnaud Zinflou, Christian Langheit, Alexandre Bouffard, Mathieu Viau, Luc Vouligny
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Meet-in-the-Middle Attacks on Reduced-Round Hierocrypt-3
Ahmed Abdelkhalek, Riham AlTawy, Mohamed F. Tolba, Amr Youssef
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Executable Counterexamples in Software Model Checking
Jeffrey Gennari, Arie Gurfinkel, Temesghen Kahsai, Jorge A. Navas, Edward J. Schwartz
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
fundno affno abstractunlabeled
Algorithmic Game Theory
Martin Hoefer
2015· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About