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

afffundno abstractunlabeled
Synchronization
Helmut Jürgensen
2008· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Palindromic factors of billiard words
Jean-Pierre Borel, Christophe Reutenauer
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Palindromic complexity of codings of rotations
Alexandre Blondin Massé, Srečko Brlek, Sebastien Labbé, Laurent Vuillon
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
23
citations
affunlabeled
LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
Jurek Czyzowicz, Wojciech Frączak, Andrzej Pelc, Wojciech Rytter
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Mergible states in large NFA
Cezar Câmpeanu, Nicolae Sântean, Sheng Yü
2004· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Littlewood Pisot numbers
Keshav Mukunda
2005· article· en· Journal of Number Theory· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
22
citations
affno abstractunlabeled
Combinatorial properties of smooth infinite words
Srečko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon
2006· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
22
citations
affno abstractunlabeled
Automatic Theorem-Proving in Combinatorics on Words
Daniel Goč, Dane Henshall, Jeffrey Shallit
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
21
citations
affunlabeled
THE MINIMAL GROWTH OF A -REGULAR SEQUENCE
Jason P. Bell, Michael James Coons, Kevin G. Hare
2014· article· en· Bulletin of the Australian Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Circular Words Avoiding Patterns
James D. Currie, D. Sean Fitzpatrick
2003· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
20
citations
affno abstractunlabeled
Decision problems for convex languages
Janusz Brzozowski, Jeffrey Shallit, Zhi Xu
2010· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Enumerating Regular Expressions and Their Languages
Jonathan Lee, Jeffrey Shallit
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
20
citations
affno abstractunlabeled
On the number of unbordered factors
Hamoon Mousavi, Jeffrey Shallit
2013· book-chapter· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
19
citations
affunlabeled
Transition Complexity of Incomplete DFAs
Yuan Gao, Kai Salomaa, Sheng Yü
2011· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Subword conditions and subword histories
Arto Salomaa, Sheng Yü
2006· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
afffundno abstractunlabeled
Additive Number Theory via Automata Theory
Aayush Rajasekaran, Jeffrey Shallit, Tim Smith
2019· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
18
citations
afffundunlabeled
On tractability and congruence distributivity
Emil W. Kiss, Matthew Valeriote
2007· article· en· Logical Methods in Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Weakly Iterated Block Products of Finite Monoids
Howard Straubing, Denis Thérien
2002· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
18
citations
affunlabeled
Rigidity and Substitutive Dendric Words
Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy, Dominique Perrin
2018· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Avoiding Patterns in the Abelian Sense
James D. Currie, Václav Linek
2001· article· en· Canadian Journal of Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Semigroups embeddable in hyperplane face monoids
Stuart Margolis, Franco Saliola, Benjamin Steinberg
2013· article· en· Semigroup Forum· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
17
citations
affunlabeled
COMPLEXITY OF ATOMS OF REGULAR LANGUAGES
Janusz Brzozowski, Hellis Tamm
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Pattern expressions and pattern automata
Cezar Câmpeanu, Sheng Yü
2004· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations

How this was built: Screen · Findings · About