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 40 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
Fault Diagnosis in Extended Finite State Machines
Khaled El‐Fakih, Svetlana Prokopenko, Nina Yevtushenko, Gregor von Bochmann
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Synthesizing SDL from Use Case Maps: An Experiment
Yong He, Daniel Amyot, Alan Williams
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Decidability Classes for Mobile Agents Computing
Pierre Fraigniaud, Andrzej Pelc
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Inductive Beluga: Programming Proofs
Brigitte Pientka, Andrew Cave
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Rapid User-Centred Evaluation for Context-Aware Systems
Eleanor O’Neill, David Lewis, Kris McGlinn, Simon Dobson
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Weakly Iterated Block Products of Finite Monoids
Howard Straubing, Denis Thérien
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
High Performance Computing and Communications
Laurence T. Yang, Omer Rana, Jack Dongarra
2005· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Introducing HOL Zero
Mark Adams
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Unsupervised Learning of Skeletons from Motion
David A. Ross, Daniel Tarlow, Richard S. Zemel
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Relational Methods in Computer Science
Wendy MacCaull, Michael Winter
2006· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
WGB: Towards a Universal Graph Benchmark
Khaled Ammar, M. TAMER ÖZSU
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Directly-Executable Earley Parsing
John Aycock, Nigel Horspool
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Architecture for a Grid Operating System
K. Krauter, Muthucumaru Maheswaran
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Simple Profile Rectifications Go a Long Way
Bo Wu, Mingzhou Zhou, Xipeng Shen, Yaoqing Gao, Raúl Silvera, Graham Yiu
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations

How this was built: Screen · Findings · About