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 8 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
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
affunlabeled
Intercode Regular Languages
Yo-Sub Han, Kai Salomaa, Derick Wood
2007· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
The Thue–Morse word contains circular <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>5</mml:mn><mml:mo>/</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msup></mml:math> power free words of every length
Ali Aberkane, James D. Currie
2005· article· lv· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
8
citations
affunlabeled
On Tribonacci Sequences
Elena Barcucci, Luc B
2004· article· en· ˜The œFibonacci quarterly· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
8
citations
affno abstractunlabeled
Algorithmic decomposition of shuffle on words
Franziska Biegler, Mark Daley, Ian McQuillan
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Words avoiding repetitions in arithmetic progressions
Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit, Manuel Silva
2007· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
Maximally Atomic Languages
Janusz Brzozowski, Gareth Davies
2014· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
UNAMBIGUOUS CONSTRAINED AUTOMATA
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Concatenation State Machines and Simple Functions
Wojciech Dębski, Wojciech Frączak
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affunlabeled
Extensions to Barrington's M-program model
François Bédard, François Lemieux, Pierre McKenzie
2002· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
8
citations
affno abstractunlabeled
Solid varieties of arbitrary type
Klaus Denecke, Jörg Koppitz, Shelly L. Wismath
2002· article· en· Algebra Universalis· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Branching Measures and Nearly Acyclic NFAs
Kai Salomaa
2017· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
7
citations
affno abstractunlabeled
Schema for Parallel Insertion and Deletion
Lila Kari, Shinnosuke Seki
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations
affno abstractunlabeled
On Finite-Index Indexed Grammars and Their Restrictions
Flavio D’Alessandro, Óscar H. Ibarra, Ian McQuillan
2017· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
7
citations
affunlabeled
On the Density of Context-Free and Counter Languages
Joseph Eremondi, Óscar H. Ibarra, Ian McQuillan
2018· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
k-Automatic Sets of Rational Numbers
Eric Rowland, Jeffrey Shallit
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations
fundno affno abstractunlabeled
Combinatorics on Words
2017· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
7
citations
affno abstractunlabeled
Comments on the spectra of Pisot numbers
David Garth, Kevin G. Hare
2006· article· en· Journal of Number Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
The many faces of a translation
Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2005· article· en· Journal of Computer and System Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Centrality in Rees-Sushkevich varieties
Edmond W. H. Lee, Norman R. Reilly
2008· article· en· Algebra Universalis· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
The New Periodicity Lemma revisited
Haoyue Bai, František Franěk, William F. Smyth
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
State Trade-Offs in Unranked Tree Automata
Xiaoxue Piao, Kai Salomaa
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
7
citations

How this was built: Screen · Findings · About