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 99 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
Continual Learning Under Language Shift
Evangelia Gogoulou, Timothée Lesort, Magnus Boman, Joakim Nivre
2024· book-chapter· en· Lecture notes in computer science· Arts and Humanities
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Approximation and Online Algorithms
Laura Sanità, Martin Skutella
2015· book· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Cartesian Ad Hoc Routing Protocols
Larry Hughes, Kafil Shumon, Ying Zhang
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Hierarchical Verification of Quantum Circuits
Sidi Mohamed Beillahi, Mohamed Yousri Mahmoud, Sofiène Tahar
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
A Path to Generative Artificial Selves
Liane Gabora, Joscha Bach
2023· book-chapter· en· Lecture notes in computer science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Lightweight Conceptual Modeling for Crowdsourcing
Roman Lukyanenko, Jeffrey Parsons
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
A {k, n}-Secret Sharing Scheme for Color Images
Rastislav Lukàč, Konstantinos N. Plataniotis, A.N. Venetsanopoulos
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
fundno affno abstractunlabeled
Electronic Government
2023· book· en· Lecture notes in computer science· Engineering
machine prediction:candidate · insufficient_payloadconsensus · none
6
citations
affno abstractunlabeled
Quantum Wireless Sensor Networks
Naya Nagy, Marius Nagy, Selim G. Akl
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Planar Subgraphs without Low-Degree Nodes
Evangelos Kranakis, Oscar Morales Ponce, Jukka Suomela
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Complements in Distributive Allegories
Michael Winter
2009· book-chapter· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
RFCT: An Association-Based Causality Miner
Kamran Karimi, Howard J. Hamilton
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Overview of the CLEF 2024 JOKER Track
Liana Ermakova, Anne-Gwenn Bosser, Tristan Miller, Victor Manuel Palma Preciado, Grigori Sidorov, Adam Jatowt
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Rough Sets: Trends, Challenges, and Prospects
Wojciech Ziarko
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About