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

afffundno abstractunlabeled
Complexity of suffix-free regular languages
Janusz Brzozowski, Marek Szykuła
2017· article· en· Journal of Computer and System Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
A Dynamical Proof of Pisot's Theorem
Jarosław Kwapisz
2006· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
5
citations
affno abstractunlabeled
Specular sets
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin +2 more
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communication+open_scienceconsensus · sts
5
citations
affunlabeled
Semilinearity of Families of Languages
Óscar H. Ibarra, Ian McQuillan
2020· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Unary NFAs with Limited Nondeterminism
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
Descriptional Complexity of Error Detection
Timothy Ng, David Rappaport, Kai Salomaa
2016· book-chapter· en· Emergence, complexity and computation· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
Quasi-Distances and Weighted Finite Automata
Timothy Ng, David Rappaport, Kai Salomaa
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affunlabeled
Disproving Hooley’s conjecture
Daniel Fiorilli, Greg Martin
2022· article· en· Journal of the European Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Undecidability of the Free Adjoint Construction
Robert J. MacG. Dawson, Robert Paré, Dorette Pronk
2003· article· en· Applied Categorical Structures· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Most Complex Non-Returning Regular Languages
Janusz Brzozowski, Sylvie Davies
2019· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
4
citations
affunlabeled
STATE COMPLEXITY AND APPROXIMATION
Yuan Gao, Sheng Yü
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Counting Lyndon Factors
Amy Glen, Jamie Simpson, W. F. Smyth
2017· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Counting Subwords and Regular Languages
Charles J. Colbourn, Ryan E. Dougherty, Thomas F. Lidbetter, Jeffrey Shallit
2018· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affno abstractunlabeled
Finite Nondeterminism vs. DFAs with Multiple Initial States
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
4
citations
affno abstractunlabeled
Extremal words in morphic subshifts
James D. Currie, Narad Rampersad, Kalle Saari, Luca Q. Zamboni
2014· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Unambiguous Constrained Automata
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affunlabeled
Undecidability of state complexity
Arto Salomaa, Kai Salomaa, Sheng Yü
2012· article· en· International Journal of Computer Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
← previousnext →

How this was built: Screen · Findings · About