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 20 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. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

fundno affunlabeled
Christoffel words and Markoff triples
Christophe Reutenauer
2008· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
[no title]
2024· other· es· Directory of Open access Books (OAPEN Foundation)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundunlabeled
Words with many Palindrome Pair Factors
Adam Borchert, Narad Rampersad
2015· preprint· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Branching Measures and Nearly Acyclic NFAs
Chris Keeler, Kai Salomaa
2019· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Semigroups of Matrices
Heydar Radjavi, Peter Rosenthal
2000· book-chapter· en· Universitext· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Abelian Primitive Words
Michael Domaratzki, Narad Rampersad
2010· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Repetition Complexity of Words.
Lucian Ilie, Sheng Yü, Kaizhong Zhang
2002· article· en· DCFS· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On Lazy Representations and Sturmian Graphs
Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Weak repetitions in Sturmian strings
A. Karaman
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Mesosome Avoidance.
Robert Cummings, Jeffrey Shallit, Paul Staadecker
2021· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Subword Complexity and k-Synchronization
Daniel Goč, Luke Schaeffer, Jeffrey Shallit
2012· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Conservative groupoids recognize only regular languages
Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson
2014· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Longest path starting at a vertex
Naidan Ji
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The far side of recursion
Michael A. Wirth
2015· article· en· Teaching Mathematics and Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Avoidance bases for formulas with reversal
James D. Currie, Lucas Mol, Narad Rampersad
2018· preprint· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Periodicity in Rectangular Arrays
Guilhem Gamard, Gwénaël Richomme, Jeffrey Shallit, Taylor J. Smith
2016· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Two Extensions of Cover Automata
Cezar Câmpeanu
2021· article· en· Axioms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affno abstractunlabeled
Council of Canada.
2012· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
afffundunlabeled
An unusual continued fraction
Dzmitry Badziahin, Jeffrey Shallit
2015· preprint· en· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Lower Bounds against Weakly Uniform Circuits.
Ruiwen Chen, Valentine Kabanets
2012· article· en· Electronic colloquium on computational complexity· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Asymptotic behaviour of functional identities
А. С. Гордиенко
2012· article· en· Bulgarian Digital Mathematics Library (BulDML) at IMI-BAS (Institute of Mathematics and Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Cogrowth series for free products of finite groups
Jason P. Bell, Haggai Liu, Marni Mishna
2022· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affvenueunlabeled
Deciding the Existence of Minority Terms
Alexandr Kazda, Jakub Opršal, Matthew Valeriote, Dmitriy Zhuk
2019· preprint· en· Canadian Mathematical Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About