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 14 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
Width Measures of Alternating Finite Automata
Casey Keeler, Kai Salomaa
2021· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affvenueunlabeled
Pisot Numbers from {0, 1}-Polynomials
Keshav Mukunda
2009· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
2
citations
affunlabeled
Universal cycles for permutation classes
Michael Albert, Julian West
2009· article· fr· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
2
citations
affunlabeled
Enumerating Types of Boolean Functions
Alasdair Urquhart
2009· article· en· Bulletin of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Linear Conjugacy
Benjamin Steinberg
2019· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
2
citations
affunlabeled
Optimal Regular Expressions for Permutations
Antonio Molina Lovett, Jeffrey Shallit
2018· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
Dyck Words, Pattern Avoidance, and Automatic Sequences
Lucas Mol, Narad Rampersad, Jeffrey Shallit
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
On 2-Symmetric Words in Nilpotent Groups
Gupta Rk, Waldemar Hołubowski
2002· article· en· Ukrainian Mathematical Journal· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
2
citations
affno abstractunlabeled
On the number of episturmian palindromes
Michelangelo Bucci, Aldo de Luca
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
2
citations
afffundno abstractunlabeled
Absolutely annihilator-flat monoids
Sydney Bulman‐Fleming
2002· article· en· Semigroup Forum· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
affunlabeled
D-finite numbers
2018· article· en· International Journal of Number Theory· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
State Complexity and Jacobsthal’s Function
Jeffrey Shallit
2001· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Properties of a class of Toeplitz words
Gabriele Fici, Jeffrey Shallit
2022· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
An Undecidable Nested Recurrence Relation
Marcel Celaya, Frank Ruskey
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
Half century of automata theory
Lila Kari
2000· article· en· ACM SIGACT News· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Insertions Yielding Equivalent Double Occurrence Words
Daniel A. Cruz, Margherita Maria Ferrari, Nataša Jonoska, Lukas Nabergall, Masahico Saito
2019· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
Binary distinguishability operation
Matthew Kozma
2024· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
2
citations
affunlabeled
Better Complexity Bounds for Cost Register Automata
Eric Allender, Andreas Krebs, Pierre McKenzie
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
2
citations
affno abstractunlabeled
Cycle Height of Finite Automata
Kai Salomaa
2018· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Two-pattern strings I—A recognition algorithm
František Franěk, Weilin Lu, W.F. Smyth
2003· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About