MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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

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
Length Codes, Products of Languages and Primality
Arto Salomaa, Kai Salomaa, Sheng Yü
2008· 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
afffundunlabeled
Quantifier elimination in valued Ore modules
Luc Bélair, Françoise Point
2010· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On the Simon’s Congruence Neighborhood of Languages
Sung-Min Kim, Yo-Sub Han, Sang‐Ki Ko, Kai Salomaa
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
afffundno abstractunlabeled
On Simon's congruence closure of a string
Sung-Min Kim, Yo-Sub Han, Sang‐Ki Ko, Kai Salomaa
2023· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Additive Number Theory via Approximation by Regular Languages
Jason P. Bell, Thomas F. Lidbetter, Jeffrey Shallit
2018· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
6
citations
affunlabeled
Exactness of Proximal Groupoid Homomorphisms
James F. Peters, Mehmet Ali̇ Öztürk, Mustafa Uçkun
2015· article· tr· DergiPark (Istanbul University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affno abstractunlabeled
Avoiding 3/2-powers over the natural numbers
Eric Rowland, Jeffrey Shallit
2012· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Number of variables is equivalent to space
Neil Immerman, Jonathan F. Buss, David A. Mix Barrington
2001· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Variants of codes and indecomposable languages
Arto Salomaa, Kai Salomaa, Sheng Yü
2009· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
There are <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si47.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-uniform cubefree binary morphisms for all <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si48.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi><mml:mo>≥</mml:mo><mml:mn>0</mml:mn></mml:math>
James D. Currie, Narad Rampersad
2009· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity
6
citations
affno abstractunlabeled
Effective dimension of finite semigroups
Volodymyr Mazorchuk, Benjamin Steinberg
2012· article· en· Journal of Pure and Applied Algebra· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
Some Semigroup Laws in Groups
Β Neumann
2001· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
6
citations
affunlabeled
Unboundedness Problems for Machines with Reversal-Bounded Counters
Pascal Baumann, Flavio D’Alessandro, Moses Ganardi, Óscar H. Ibarra, Ian McQuillan, Lia Schütze +1 more
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
6
citations
affno abstractunlabeled
Predictable semiautomata
Janusz Brzozowski, Nicolae Sântean
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Most Complex Regular Ideal Languages
2016· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
6
citations
affno abstractunlabeled
Profinite automata
Eric Rowland, Reem Yassawi
2016· article· en· Advances in Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
PROFINITE TOPOLOGIES IN FREE PRODUCTS OF GROUPS
Luis Ribes, Pavel Zalesskii
2004· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Interpreted Trajectories
Michael Domaratzki, Grzegorz Rozenberg, Kai Salomaa
2006· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Twin-roots of words and their properties
Lila Kari, Kalpana Mahalingam, Shinnosuke Seki
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Abelian-square-rich words
Gabriele Fici, Filippo Mignosi, Jeffrey Shallit
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communication+open_scienceconsensus · sts
6
citations
affunlabeled
NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs
Michael Domaratzki, Keith Ellul, JEFFREY SHALLIT, Ming‐Wei Wang
2005· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Space proof complexity for random 3-CNFs
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
2017· preprint· en· Information and Computation· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
6
citations
affno abstractunlabeled
An application of a Theorem of Ash to finite covers
Karl Auinger, Gracinda M. S. Gomes, Victoria Gould, Benjamin Steinberg
2004· article· en· Studia Logica· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On integer sequences whose first iterates are linear
Jean‐Paul Allouche, Narad Rampersad, Jeffrey Shallit
2005· article· en· Aequationes Mathematicae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
6
citations
← previousnext →

How this was built: Screen · Findings · About