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

affunlabeled
MULTIPSEUDOPERIODIC WORDS
Alexandre Blondin Massé, SARAH DESMEULES, Sébastien Gaboury, Sylvain Hallé
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
On dominions of certain ample monoids
Sohail Nasir, Abdullahi Umar
2023· article· en· Acta et Commentationes Universitatis Tartuensis de Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Robot Positioning Using Torus Packing for Multisets
Chung Shue Chen, Peter Keevash, Seán Kennedy, Élie de Panafieu, Adrian Vetta
2024· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
A symmetry property of Christoffel words
Yan Lanciault, Christophe Reutenauer
2025· article· RAIRO. Theoretical informatics and applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Lexicographically Least Square-Free Word with a Given Prefix
Siddharth Berera, Andrés Gómez-Colunga, Joey Lakerdas-Gayle, John F. López, Mauditra Matin, Daniel Roebuck +3 more
2023· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Self-verifying Predicates in Büchi Arithmetic
Mazen Khodier, Luke Schaeffer, Jeffrey Shallit
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Incoherent Coxeter Groups
Kasia Jankiewicz, Daniel T. Wise
2015· preprint· en· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Idempotent tree languages
Klaus Denecke, N. Sarasit, Shelly L. Wismath
2013· article· en· Demonstratio Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Bifix codes and interval exchanges
Valérie Berthé, Clelia De Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer +1 more
2014· preprint· en· Archipelago (Université du Québec à Montréal)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On the superimposition of Christoffel words
Geneviève Paquin, Christophe Reutenauer
2010· preprint· en· Archipelago (Université du Québec à Montréal)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Synchronizing Times for $k$-sets in Automata
Natalie Behague, Robert T. Johnson
2022· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
The simplest binary word with only three squares
Daniel Gabrić, Jeffrey Shallit
2021· preprint· en· RAIRO - Theoretical Informatics and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Equations Over ω-Automata
Tiziano Villa, Nina Yevtushenko, Robert K. Brayton, Alan Mishchenko, Alexandre Petrenko, Alberto Sangiovanni‐Vincentelli
2011· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
PRODUCTS OF COMMUTATORS IN FREE GROUPS
Mehri Akhavan-Malayeri, A. H. Rhemtulla
2003· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Problem Set 6
Joan Bresnan, Ash Asudeh, Ida Toivonen, Stephen Wechsler
2015· other· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Algorithms and Graphs
Giri Narasimhan, Michiel Smid
2007· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About