MétaCan
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.

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

affno abstractunlabeled
A self-generating sequence
Benoit Cloitre, Jeffrey Shallit
2025· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
RELATIVE REWRITING SYSTEMS
Stephen J. Pride, Jing Wang
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface
Manfred Droste, Ilias Kotsireas, Robert Rolland
2019· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Maximal 2-Dimensional Binary Words of Bounded Degree
Alexandre Blondin Massé, A Goupil, Raphael L’ Heureux
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Codes and formal series
Jean Berstel, Christophe Reutenauer
2010· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Language Quotients Revisited
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
2025· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Generating functions of substitutions
Aisling Pouti, Christopher Bronk Ramsey, Nicolae Strungaru
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Polák Theorem
Mario Petrich, Norman R. Reilly
2024· book-chapter· en· Synthesis lectures on mathematics and statistics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On Enumeration of Müller Automata
Michael Domaratzki
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
L-Presheaves and Their Stalks.
Abdelaziz E. Radwan, Shawgy Hussien
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Transition Complexity of Incomplete DFAs
Yuan Gao, Kai Salomaa, Sheng Yü
2010· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Fully Invariant Relations
Mario Petrich, Norman R. Reilly
2024· book-chapter· en· Synthesis lectures on mathematics and statistics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Torsors and Tilings from Toric Toggling
Colin Defant, Michael Joseph, Matthew Macauley, Alex McDonough
2025· article· en· Algebraic Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Recursive Partitioning
Hugh Chipman
2025· book-chapter· en· International Encyclopedia of Statistical Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
On the generalized Berge sorting conjecture
Antoine Deza, Feng Xie
2009· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
The Algebraic Theory of Parikh Automata
Michaël Cadilhac, Andreas Krebs, Pierre McKenzie
2017· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Reference Mysteries, Part One
2004· dataset· en· Borealis· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Most Complex Regular Right-Ideal Languages
Janusz Brzozowski, Gareth Davies
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A relation by palindromic subwords
Mark Daley, Kalpana Mahalingam
2010· article· en· Natural Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Visit-Bounded Stack Automata
Jozef Jirásek, Ian McQuillan
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About