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
Topic
semigroups and automata theory
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.

1,153 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.
1,153 works in the cohort · of 4,299,418page 18 of 24

Labels cover 1 of 1,153 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 1,153 of 1,153 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
Quasi-Distances and Weighted Finite Automata
Timothy Ng, David Rappaport, Kai Salomaa
2017· book-chapter· en· WORLD SCIENTIFIC eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On the rational subset problem for groups
Mark Kambites, Pedro V. Silva, Benjamin Steinberg
2006· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A note on the Lie complexity and beyond
Shuo Li
2023· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Problem Set 1
Joan Bresnan, Ash Asudeh, Ida Toivonen, Stephen Wechsler
2015· other· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundno abstractunlabeled
Critical exponents of infinite balanced words
Narad Rampersad, Jeffrey Shallit, Élise Vandomme
2018· preprint· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Communication Complexity of Correlation
Prahladh Harsha, Rahul Jain, David McAllester, Jaikumar Radhakrishnan
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preliminaries
Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Łukasz Mikulski
2022· book-chapter· en· Studies in computational intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Relative position in binary substitutions
Michael James Coons, Christopher Bronk Ramsey, Nicolae Strungaru
2024· preprint· en· arXiv (Cornell University)· Computer Science
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
afffundunlabeled
When is an automatic set an additive basis?
Jason P. Bell, Kathryn E. Hare, Jeffrey Shallit
2018· preprint· en· Proceedings of the American Mathematical Society Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Modularität
Verena Gottschling
2024· book-chapter· de· J.B. Metzler eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Theory of Atomata
Janusz Brzozowski, Hellis Tamm
2011· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Binary Right-Distinguishability Operation
Cezar Câmpeanu
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Incremental branching programs
Anna Gál, Pierre McKenzie, Michal Koucký
2006· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Words Avoiding Half-Flips
James Currie, Narad Rampersad
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Overpals, Underlaps, and Underpals
Aayush Rajasekaran, Narad Rampersad, Jeffrey Shallit
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Random graph languages
Haizhong Shi, Yue Shi
2017· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Sums of Proper Divisors with Missing Digits
Kübra Benli̇, Giulia Cesana, Cécile Dartyge, Charlotte Dombrowsky, Lola Thompson
2024· book-chapter· en· Association for Women in Mathematics series· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On the complexity of the cogrowth sequence
Jason P. Bell, Marni Mishna
2020· preprint· en· Journal of Combinatorial Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Semantics
William M. Farmer
2023· book-chapter· en· Computer science foundations and applied logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Finite Variable Logics
Leonid Libkin
2004· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A Note on the Parallel Cleaning of Cliques
Alejandro Angeli Ayello, Margaret-Ellen Messinger
2019· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Locally Commutative Categories
Arkadev Chattopadhyay, Denis Thérien
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Complexity Column
Andreǐ A. Bulatov
2023· article· en· ACM SIGLOG News· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About