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
Advanced Algebra and Logic
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.

680 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.
680 works in the cohort · of 4,299,418page 1 of 14

Labels cover 0 of 680 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 680 of 680 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
Lattice Theory: Foundation
George Grätzer
2011· book· en· Computer Science
machine prediction:candidate · noneconsensus · none
698
citations
affno abstractunlabeled
Basic Many-Valued Logic
Alasdair Urquhart
2001· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
154
citations
affno abstractunlabeled
Boolean Functions and Computation Models
Peter Clote, Evangelos Kranakis
2002· book· en· Texts in theoretical computer science· Computer Science
machine prediction:candidate · noneconsensus · none
110
citations
affno abstractunlabeled
The Category of S-Posets
Sydney Bulman‐Fleming, Mojgan Mahmoudi
2005· article· en· Semigroup Forum· Computer Science
machine prediction:candidate · noneconsensus · none
83
citations
affno abstractunlabeled
Characterizations of several Maltsev conditions
Marcin Kozik, Andrei Krokhin, Matthew Valeriote, Ross Willard
2015· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
First-order Gödel logics
Matthias Baaz, Norbert Preining, Richard Zach
2007· article· en· Annals of Pure and Applied Logic· Computer Science
machine prediction:candidate · noneconsensus · none
64
citations
affno abstractunlabeled
On the quantisation of spaces
Christopher J. Mulvey, Joan Wick Pelletier
2002· article· en· Journal of Pure and Applied Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
affunlabeled
ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
Ralph Freese, Matthew Valeriote
2009· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
affno abstractunlabeled
Distributive laws and factorization
Robert Rosebrugh, Richard J. Wood
2002· article· en· Journal of Pure and Applied Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affunlabeled
Lectures on Algebraic Model Theory
Bradd Hart, Matthew Valeriote
2001· book· en· American Mathematical Society eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
A Compendium of Continuous Lattices in MIZAR
Grzegorz Bancerek, Piotr Rudnicki
2002· article· en· Journal of Automated Reasoning· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affunlabeled
Consistent Rationalizability
Walter Bossert, Yves Sprumont, Kotaro Suzumura
2005· article· en· Economica· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Ordered topological structures
Walter Tholen
2009· article· en· Topology and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
afffundunlabeled
Proximal relator spaces
J. F. Peters
2016· article· it· Filomat· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Free μ-lattices
Luigi Santocanale
2002· article· en· Journal of Pure and Applied Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
afffundunlabeled
Two more fermionic minimal models
2021· article· en· Journal of High Energy Physics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Combinatorial Set Theory of C*-Algebras
Ilijas Farah
2019· book· en· Springer monographs in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Canonical Partitions Of Universal Structures
C. Laflamme, N. Sauer, Vojkan Vuksanovic
2006· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
On Tate's trace
Martín Argerami, Fernando Szechtman, Ryan M. Tifenbach
2007· article· en· Linear and Multilinear Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
MV-semirings and their Sheaf Representations
L. P. Belluce, Antonio Di Nola, Anna Rita Ferraioli
2011· article· en· Order· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
fundno affno abstractunlabeled
On generalized constraints and certificates
Lisa Hellerstein
2001· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
afffundno abstractunlabeled
A basic distributive law
F. Marmolejo, Robert Rosebrugh, Richard J. Wood
2002· article· en· Journal of Pure and Applied Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Representations of monadic MV -algebras
L. P. Belluce, Revaz Grigolia, Ada Lettieri
2005· article· en· Studia Logica· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
venueno affunlabeled
On extensions of lax monads
Maria Manuel Clementino, Dirk Hofmann
2004· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
A decomposition of fuzzy relations
Witold Pedrycz, Kaoru Hirota, Salvatore Sessa
2001· article· en· IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Canonical Vertex Partitions
N. Sauer
2003· article· en· Combinatorics Probability Computing· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Ghosts in modular representation theory
Sunil K. Chebolu, J. Daniel Christensen, Ján Mináč
2007· article· en· Advances in Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Tilings, 𝐶*-algebras, and 𝐾-theory
Michael Baake, Robert V. Moody
2000· book-chapter· en· CRM monograph series· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Hazard Algebras
Janusz Brzozowski, Zoltán Ésik
2003· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
A note on planar semimodular lattices
George Grätzer, Edward Knapp
2008· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
next →

How this was built: Screen · Findings · About