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 12 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
Universal Alternating Semiregular Polytopes
Barry Monson, Egon Schulte
2020· article· en· Canadian Journal of Mathematics· 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
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
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
affunlabeled
STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY
Cristian S. Calude, Kai Salomaa, Tania Roblot
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Maximal Existential and Universal Width
Casey Keeler, Kai Salomaa
2023· article· en· Scientific Annals of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · 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
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
Nondeterministic Tree Width of Regular Languages
Cezar Câmpeanu, Kai Salomaa
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · 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
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
Approximate Bit Vectors for Fast Unification
Matthew Skala, Gerald Penn
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Automatic Sets of Rational Numbers
2015· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
A General View of Approximation
Bernhard Banaschewski, Aleš Pultr
2006· article· en· Applied Categorical Structures· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
A New Approach to the Paperfolding Sequences
Daniel Goč, Hamoon Mousavi, Luke Schaeffer, Jeffrey Shallit
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
3
citations
affunlabeled
Asymptotic Density of Zimin Words
Joshua Cooper, Danny Rorabaugh
2016· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
3
citations
afffundunlabeled
Cubefree words with many squares
James D. Currie, Narad Rampersad
2010· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
3
citations
affunlabeled
Properties of a ternary infinite word
James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey Shallit
2023· article· en· RAIRO. Theoretical informatics and applications· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Codings of rotations on two intervals are full
Alexandre Blondin Massé, Srečko Brlek, Sebastien Labbé, Laurent Vuillon
2009· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Automatic sequences of rank two
Jason P. Bell, Jeffrey Shallit
2022· article· en· RAIRO. Theoretical informatics and applications· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Rudin-Shapiro Sums via Automata Theory and Logic
Narad Rampersad, Jeffrey Shallit
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Decidability of Trajectory-Based Equations
Michael Domaratzki, Kai Salomaa
2004· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About