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 1 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
Algebraic Results on Quantum Automata
Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Ķikusts, Mark Mercer, Denis Thérien
2005· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affno abstractunlabeled
Quotient Complexity of Closed Languages
Janusz Brzozowski, Galina Jirásková, Chenglong Zou
2013· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affno abstractunlabeled
Linear-Space Data Structures for Range Mode Query in Arrays
Timothy M. Chan, Stéphane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson
2013· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Searching for Black Holes in Subways
Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro
2011· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
afffundno abstractunlabeled
Tight Bounds for Adopt-Commit Objects
James Aspnes, Faith Ellen
2013· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
The Coolest Way to Generate Binary Strings
Brett Stevens, Aaron Williams
2013· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
Additive Number Theory via Automata Theory
Aayush Rajasekaran, Jeffrey Shallit, Tim Smith
2019· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Stable Marriage with General Preferences
Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
2016· article· en· Theory of Computing Systems· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
A Note on MODp - MODm Circuits
Howard Straubing, Denis Thérien
2005· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
(Approximate) Uncertain Skylines
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
2012· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Tilings and Submonoids of Metabelian Groups
Markus Lohrey, Benjamin Steinberg
2010· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Routing in Series Parallel Networks
Paola Flocchini, Flaminia L. Luccio
2003· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Separation Logic with One Quantified Variable
Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry
2017· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Incremental Branching Programs
Anna Gál, Michal Koucký, Pierre McKenzie
2007· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Probabilistic k-Median Clustering in Data Streams
Christiane Lammersen, Melanie Schmidt, Christian Sohler
2014· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Syntactic Complexity of Regular Ideals
Janusz Brzozowski, Marek Szykuła, Yuli Ye
2017· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Braess’s Paradox for Flows over Time
Martin Macko, Kate Larson, Ľuboš Steskal
2013· article· en· Theory of Computing Systems· Decision Sciences
machine prediction:candidate · noneconsensus · none
11
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
9
citations
afffundno abstractunlabeled
Computing Parameters of Sequence-Based Dynamic Graphs
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
2018· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
The Feline Josephus Problem
Frank Ruskey, Aaron Williams
2011· article· en· Theory of Computing Systems· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Advice Complexity of Priority Algorithms
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
2019· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About