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
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 1 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
Automatic Sequences
2003· book· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
609
citations
affno abstractunlabeled
The ring of k-regular sequences, II
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
227
citations
affno abstractunlabeled
Palindromic richness
2008· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
151
citations
affno abstractunlabeled
Follow automata
2003· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
122
citations
fundno affno abstractunlabeled
Palindrome complexity
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
116
citations
affno abstractunlabeled
State complexity of combined operations
2007· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
88
citations
affno abstractunlabeled
Subword histories and Parikh matrices
2003· article· en· Journal of Computer and System Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
85
citations
affno abstractunlabeled
Algebraic Results on Quantum Automata
2005· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
74
citations
afffundno abstractunlabeled
Theory of átomata
2014· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
74
citations
affno abstractunlabeled
Combinatorics on Words
2008· book· en· CRM monograph series· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
74
citations
affunlabeled
On Christoffel classes
2005· article· en· RAIRO - Theoretical Informatics and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
67
citations
affunlabeled
Free compact 2-categories
2007· article· en· Mathematical Structures in Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
67
citations
affno abstractunlabeled
Lyndon words, permutations and trees
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
Completeness results for graph isomorphism
2003· article· en· Journal of Computer and System Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
61
citations
affno abstractunlabeled
Synchronizing groups and automata
2006· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
59
citations
affno abstractunlabeled
Dejean’s conjecture and Sturmian words
2006· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
58
citations
affno abstractunlabeled
Quotient Complexity of Closed Languages
2013· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
56
citations
affno abstractunlabeled
Acyclic, connected and tree sets
2014· article· de· Monatshefte für Mathematik· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
54
citations
affunlabeled
IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
52
citations
next →

How this was built: Screen · Findings · About