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 7 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Decidability for Sturmian words
Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey Shallit
2024· article· en· Logical Methods in Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
On patterns occurring in binary algebraic numbers
Boris Adamczewski, Narad Rampersad
2008· article· en· Proceedings of the American Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Another proof of Soittola’s theorem
Jean Berstel, Christophe Reutenauer
2007· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
10
citations
fundno affunlabeled
Properties of the extremal infinite smooth words
Srečko Brlek, Guy Mélançon, Geneviève Paquin
2007· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
10
citations
fundno affunlabeled
THE SEMIGROUP OF CONJUGATES OF A WORD
Peter M. Higgins
2006· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Sums of Palindromes: an Approach via Automata
Aayush Rajasekaran, Jeffrey Shallit, Tim Smith
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
affno abstractunlabeled
Periodicity, morphisms, and matrices
Sabin Cautis, Filippo Mignosi, Jeffrey Shallit, Ming‐Wei Wang, Soroosh Yazdani
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Modelling Concurrency with Quotient Monoids
Ryszard Janicki, Dai Le
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
affunlabeled
From automatic structures to automatic groups
Olga Kharlampovich, Bakhadyr Khoussainov, Alexei Miasnikov
2014· preprint· en· Groups Geometry and Dynamics· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
9
citations
affno abstractunlabeled
Boolean Grammars
Alexander Okhotin
2003· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
fundno affunlabeled
On the critical exponent of generalized Thue-Morse words
Alexandre Blondin Massé, Srečko Brlek, Amy Glen, Sebastien Labbé
2007· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
9
citations
affno abstractunlabeled
Equations on palindromes and circular words
Alexandre Blondin Massé, Srečko Brlek, A. Garon, Sebastien Labbé
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Sets Represented as the Length-n Factors of a Word
Jeffrey Shallit
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
9
citations
affno abstractunlabeled
Decision Problems for Convex Languages
Janusz Brzozowski, Jeffrey Shallit, Zhi Xu
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
affno abstractunlabeled
Cool-lex order and k-ary Catalan structures
Stéphane Durocher, Pak Ching Li, Debajyoti Mondal, Frank Ruskey, Aaron Williams
2012· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Theory of Átomata
Janusz Brzozowski, Hellis Tamm
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
9
citations
affno abstractunlabeled
On a Special Class of Primitive Words
Lila Kari, Shinnosuke Seki
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
fundno affunlabeled
Better Complexity Bounds for Cost Register Automata
Rajeev Alur, Loris D’Antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman, Yifei Yuan
2011· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affunlabeled
SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
2002· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations

How this was built: Screen · Findings · About