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

afffundunlabeled
Noncommutative rational Pólya series
Jason P. Bell, Daniel Smertnig
2021· preprint· en· Selecta Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Word Length, Bias and Bijections in Penney's Ante
Matthew Drexel, Xuanshan Peng, Jacob Richey
2025· article· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/s0197-2510(10)70261-8
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Palindromic complexity of trees
Srečko Brlek, Nadia Lafrenière, Xavier Provençal
2015· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
State Complexity of Deletion
Yo-Sub Han, Sang‐Ki Ko, Kai Salomaa
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Pushes in words-a primitive sorting algorithm
Margaret Archibald, Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Toufik Mansour
2022· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On Palindromic Periodicities
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affno abstractunlabeled
Canadian sum set
Rick Darby
2013· article· en· AeroSafety world./AeroSafety world· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Table of knots and links
Dale Rolfsen
2003· book-chapter· en· American Mathematical Society eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Cobham’s Theorem and Automaticity
Lucas Mol, Narad Rampersad, Jeffrey Shallit, Manon Stipulanti
2019· preprint· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Undirected Repetition Threshold
James D. Currie, Lucas Mol
2019· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
On the conjugates of Christoffel words
Y. Bugeaud, C. Reutenauer
2025· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On the Number of Distinct Squares.
František Franěk
2014· article· en· Prague Stringology Conference· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Channel Synthesis for Finite Transducers
Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier Roux, Mathieu Sassolas
2011· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Integration on ℋ_{𝓅}×ℋ
Henri Darmon
2003· book-chapter· en· Regional conference series in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A characterization of words of linear complexity
Julien Cassaigne, Anna E. Frid
2019· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Cornering Robots to Synchronize a Dfa
Alexander Clow, Peter Bradshaw, Ladislav Stacho
2024· preprint· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Lyndon words and Fibonacci numbers
Kalle Saari
2012· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Nearest constrained circular words
Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, Élise Vandomme
2018· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Exploring Tetris as a Transformation Semigroup
P Jentsch, Chrystopher L. Nehaniv
2021· preprint· en· Springer proceedings in mathematics & statistics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Relative Prefix Distance Between Languages
Timothy Ng, David Rappaport, Kai Salomaa
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
State Complexity of Suffix Distance
Timothy Ng, David Rappaport, Kai Salomaa
2019· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About