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

afffundunlabeled
Becker’s conjecture on Mahler functions
Jason P. Bell, Frédéric Chyzak, Michael James Coons, Philippe Dumas
2019· preprint· en· Transactions of the American Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Languages with Bounded Multiparty Communication Complexity
Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Márió Szegedy, Pascal Tesson, Denis Thérien
2007· article· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Generating the Pseudo-Powers of a Word
Lila Kari, Manasi S. Kulkarni
2014· article· en· Justus-Liebig-Universität Gießen· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
String Attractors for Automatic Sequences
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
2
citations
affunlabeled
On intervals of the consecutive pattern poset
Sergi Elizalde, Peter R. W. McNamara
2020· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Square-Free Words with Square-Free Self-Shuffles
James D. Currie, Kalle Saari
2014· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
2
citations
affno abstractunlabeled
Cascade Decompositions are Bit-Vector Algorithms
Anne Bergeron, Sylvie Hamel
2002· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
A contribution to infinite disjoint covering systems
János Barát, Péter P. Varjú
2008· article· lv· Journal de Théorie des Nombres de Bordeaux· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
2
citations
affno abstractunlabeled
Completely Regular Semigroup Varieties
Mario Petrich, Norman R. Reilly
2024· book· en· Synthesis lectures on mathematics and statistics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
On Sillke's bijection
Robert Cori, Christophe Reutenauer
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
State grammars with stores
Óscar H. Ibarra, Ian McQuillan
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Unique decipherability in formal languages
Paul C. Bell, Daniel Reidenbach, Jeffrey Shallit
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Deterministic Caterpillar Expressions
Kai Salomaa, Sheng Yü, Jinfeng Zan
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Hereditary Rigid Relations.
Miguel Couceiro, Lucien Haddad, Maurice Pouzet, Karsten Schölzel
2015· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
fundno affno abstractunlabeled
Descriptional Complexity of Formal Systems
2023· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Sheng Yu (1950–2012) In Memoriam
Arto Salomaa, Kai Salomaa, Andrew L. Szilard
2012· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations
affaboutunlabeled
The semantical hyperunification problem
Klaus Denecke, Jörg Koppitz, Shelly L. Wismath
2001· article· en· Discussiones Mathematicae - General Algebra and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
The upper density of an automatic set is rational
Jason P. Bell
2020· preprint· fr· Journal de Théorie des Nombres de Bordeaux· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affvenueunlabeled
Density dichotomy in random words
Joshua Cooper, Danny Rorabaugh
2018· article· en· Contributions to Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
String C-groups of order 1024
Yasushi Gomi, Mark L. Loyola, Ma. Louise Antonette N. De Las Peñas
2018· article· en· Contributions to Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Paperfolding sequences
2022· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundunlabeled
On the definition of stochastic λ-transducers
Stavros Konstantinidis, Nicolae Sântean
2008· article· en· International Journal of Computer Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
The Algebraic Theory of Parikh Automata
Michaël Cadilhac, Andreas Krebs, Pierre McKenzie
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
1
citations
afffundunlabeled
On Constructing Bent Functions From Cyclotomic Mappings
Xi Xie, Nian Li, Qiang Wang, Xiangyong Zeng
2024· article· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations

How this was built: Screen · Findings · About