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 16 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.

fundno affunlabeled
On the atoms of algebraic lattices arising in 𝔮-theory
Attila Egri-Nagy, Marcel Jackson, John Rhodes, Benjamin Steinberg
2017· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
The Repetition Threshold for Ternary Rich Words
James D. Currie, Lucas Mol, Jarkko Peltomäki
2025· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
CHANNEL SYNTHESIS FOR FINITE TRANSDUCERS
Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier Roux, Mathieu Sassolas
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Kleene automata and recursion theory
John Mullins
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
On the number of squares in a finite word
Srečko Brlek, Shuo Li
2025· article· en· Combinatorial Theory· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Periodic and Sturmian languages
Lucian Ilie, Solomon Marcus, Ion Petre
2006· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Nesting Until and Since in Linear Temporal Logic
Denis Thérien, Thomas Wilke
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Amenability of quadratic automaton groups
Gideon Amir, Omer Angel, Bálint Virág
2024· article· en· Groups Geometry and Dynamics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Mini-Workshop: Combinatorics on Words
Valérie Berthé, Juhani Karhumäki, Dirk Nowotka, Jeffrey Shallit
2011· article· en· Oberwolfach Reports· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Antisquares and Critical Exponents
Aseem Baranwal, James D. Currie, L. A. S. Mόl, Pascal Ochem, Narad Rampersad, Jeffrey Shallit
2023· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Birecurrent sets
Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone
2018· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Faithful Loops for Aperiodic E-Ordered Monoids
Martin Beaudry, François Lemieux
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Remarks on Privileged Words
Michael Forsyth, Amlesh Jayakumar
2016· preprint· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Transcendence tests for Mahler functions
Jason P. Bell, Michael James Coons
2016· preprint· en· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Infinite Strings Generated by Insertions
Oleg Golubitsky, Sean M. Falconer
2004· article· en· Programming and Computer Software· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On commutation semigroups of dihedral groups
Darien DeWolf, Charles C. Edmunds, C.J. Levy
2013· article· en· Semigroup Forum· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
On the difference set of two transductions
Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Juraj Šebej
2024· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Maximal universal width of an AFA is NP-hard
John Alajaji, Kai Salomaa
2025· article· en· Theoretical Computer Science· 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
venueno affunlabeled
On the Construction of Normal Subgroups
Lijiang Zeng
2010· article· en· Studies in mathematical sciences· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Low uniform versions of NC1.
Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie
2011· article· en· Electronic colloquium on computational complexity· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Quotient Complexity of Star-Free Languages
Janusz Brzozowski, Bo Liu
2010· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About