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 2 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
Lazard's Theorem for<i>S</i>‐posets
Sydney Bulman‐Fleming, Valdis Laan
2005· article· en· Mathematische Nachrichten· Computer Science
distilled prediction:candidate · noneconsensus · none
50
citations
fundno affunlabeled
On the binary expansions of algebraic numbers
David H. Bailey, Jonathan M. Borwein, Richard E. Crandall, Carl Pomerance
2009· article· lv· Journal de Théorie des Nombres de Bordeaux· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
49
citations
afffundno abstractunlabeled
State complexity of power
Michael Domaratzki, Alexander Okhotin
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
49
citations
fundno affunlabeled
Sums of Digits, Overlaps, and Palindromes
Jean‐Paul Allouche, Jeffrey Shallit
2000· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
48
citations
afffundunlabeled
A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE
Karl Dilcher, Kenneth B. Stolarsky
2007· article· en· International Journal of Number Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
48
citations
affno abstractunlabeled
Deletion along trajectories
Michael Domaratzki
2004· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
47
citations
afffundno abstractunlabeled
On a special class of primitive words
Lila Kari, Shinnosuke Seki
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Binary bubble languages and cool-lex order
Frank Ruskey, Joe Sawada, Aaron Williams
2011· article· en· Journal of Combinatorial Theory Series A· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
afffundunlabeled
Quivers of monoids with basic algebras
Stuart Margolis, Benjamin Steinberg
2012· article· en· Compositio Mathematica· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
COLORING SUBGRAPHS OF THE RADO GRAPH
N. Sauer
2006· article· en· COMBINATORICA· Computer Science
distilled prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
The state complexity of and
Narad Rampersad
2006· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Even faster generalized LR parsing
John Aycock, Nigel Horspool, Jan Janoušek, Bořivoj Melichar
2001· article· en· Acta Informatica· Computer Science
distilled prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Algorithms for Computing Small NFAs
Lucian Ilie, Sheng Yü
2002· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
41
citations
affunlabeled
Monomials as sums of powers: The real binary case
Mats Boij, Enrico Carlini, Anthony V. Geramita
2011· article· lv· Proceedings of the American Mathematical Society· Computer Science
distilled prediction:candidate · stsconsensus · none
39
citations
affunlabeled
The Logical Approach to Automatic Sequences
Jeffrey Shallit
2022· book· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
39
citations
affno abstractunlabeled
A new characteristic property of rich words
Michelangelo Bucci, Alessandro De Luca, Amy Glen, Luca Q. Zamboni
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
37
citations
affunlabeled
Generic complexity of undecidable problems
Alexei Myasnikov, Alexander Rybalov
2008· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
36
citations
affunlabeled
Christoffel Words and Markoff Triples
Christophe Reutenauer
2009· article· en· Integers· Computer Science
distilled prediction:candidate · noneconsensus · none
36
citations
afffundno abstractunlabeled
Repetitions in Sturmian strings
František Franěk, A. Karaman, W.F. Smyth
2000· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Metric Lexical Analysis
Cristian S. Calude, Kai Salomaa, Sheng Yü
2001· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
35
citations
affno abstractunlabeled
Avoiding large squares in infinite binary words
Narad Rampersad, Jeffrey Shallit, Ming‐Wei Wang
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
Finite state complexity
Cristian S. Calude, Kai Salomaa, Tania Roblot
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
35
citations
affno abstractunlabeled
Reducing NFAs by invariant equivalences
Lucian Ilie, Sheng Yü
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Recurrent words with constant Abelian complexity
James D. Currie, Narad Rampersad
2010· article· en· Advances in Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
32
citations

How this was built: Screen · Findings · About