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

venueno affno abstractunlabeled
Minimum Degree and the Number of Chords.
Jan Kára, Daniel Král͏̌
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
An Inequality for the Number of Periods in a Word
Daniel Gabrić, Narad Rampersad, Jeffrey Shallit
2021· preprint· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Power-free complementary binary morphisms
Jeffrey Shallit, Arseny M. Shur, Stefan Zorcic
2024· article· en· Journal of Combinatorial Theory Series A· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Block-counting sequences are not purely morphic
Antoine Abram, Yining Hu, Shuo Li
2024· article· en· Advances in Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
RUNS IN PAPERFOLDING SEQUENCES
Jeffrey Shallit
2025· article· en· Bulletin of the Australian Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Repetition Avoidance in Circular Factors
Hamoon Mousavi, Jeffrey Shallit
2013· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Collapse: A Fibonacci and Sturmian Game
Dennis D. A. Epple, Jason Siefken
2015· article· en· American Mathematical Monthly· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Disambiguation of finite-state transducers
N. Smaili, Patrick Cardinal, Gilles Boulianne, Pierre Dumouchel
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
GRAPH SEMIGROUPS
Vlastimil Dlab, TOMÁŠ POSPÍCHAL
2003· article· en· Advances in Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Fife's Theorem Revisited
Jeffrey Shallit
2011· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Shuffle operations on discrete paths
Srečko Brlek, Gilbert Labelle, Annie Lacasse
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
The palindromization map
Dominique Perrin, Christophe Reutenauer
2023· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Completely Regular Semigroup Varieties
Mario Petrich, Norman R. Reilly
2025· book· en· Synthesis lectures on mathematics and statistics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On Weakly Ambiguous Finite Transducers
Nicolae Sântean, Sheng Yü
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
ON THE ROOT OF LANGUAGES
Paolo Massazza
2001· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Suffix Conjugates for a Class of Morphic Subshifts
James D. Currie, Narad Rampersad, Kalle Saari
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the Recursive Sequence Order-k.
Tugba Parpar, Ayşe Nallı
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
A Profinite Approach to Stable Pairs
Karsten Henckell, John Rhodes, Benjamin Steinberg
2006· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
A Note on Roman Bondage Number of Graphs.
Saieed Akbari, Sahar Qajar
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Some properties of a Rudin–Shapiro-like sequence
Philip Lafrance, Narad Rampersad, Randy Yee
2014· preprint· en· Advances in Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About