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
Theory of Computing Systems
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.

83 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.
83 works in the cohort · of 4,299,418page 2 of 2

Labels cover 0 of 83 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 83 of 83 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
Efficient Exploration of Faulty Trees
Ευριπίδης Μάρκου, Andrzej Pelc
2006· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
More Fun with Symmetric Venn Diagrams
Frank Ruskey, Mark Weston
2005· article· en· Theory of Computing Systems· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Maintaining Privacy on a Line
Evangelos Kranakis, Danny Kriz̧anc
2011· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
On Recognizing a String on an Anonymous Ring
Evangelos Kranakis, Danny Kriz̧anc, Flaminia L. Luccio
2000· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Fault-Tolerant Sequential Scan
Paola Flocchini, Andrzej Pelc, Nicola Santoro
2007· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
The Reflection Complexity of Sequences Over Finite Alphabets
Jean‐Paul Allouche, John M. Campbell, Shuo Li, Jeffrey Shallit, Manon Stipulanti
2025· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
TCP is Competitive with Resource Augmentation
Jeff Edmonds, Suprakash Datta, Patrick Dymond
2010· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface
Andreǐ A. Bulatov, Edward Hirsch, Jean-Éric Pin
2017· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Preface
Andreǐ A. Bulatov, Stephan Kreutzer
2016· article· en· Theory of Computing Systems· Social Sciences
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundno abstractunlabeled
The Algebraic Theory of Parikh Automata
Michaël Cadilhac, Andreas Krebs, Pierre McKenzie
2017· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Algorithms in the W-Hierarchy
Jonathan F. Buss, Tarique Islam
2007· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Space Lower Bounds for the Signal Detection Problem
Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu
2020· article· en· Theory of Computing Systems· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Visit-Bounded Stack Automata
Jozef Jirásek, Ian McQuillan
2023· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Normality, Relativization, and Randomness
Wesley Calvert, Elvira Mayordomo, Daniel Turetsky, Java Darleen Villano
2025· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About