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 5 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
Distributive Lattices
George Grätzer
2011· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Incompleteness in a General Setting
John Bell
2007· article· en· Bulletin of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Timed Contact Algebras
Ivo Düntsch, Michael Winter
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Priestley configurations and Heyting varieties
Richard N. Ball, Aleš Pultr, J. Sichler
2008· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Jónsson posets
Roland Assous, Maurice Pouzet
2018· article· gl· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Maximal and Minimal Partial Clones
Lucien Haddad, Hajime Machida, Ivo G. Rosenberg
2002· article· en· Justus-Liebig-Universität Gießen· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Cardinality in Allegories
Yasuo Kawahara, Michael Winter
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
An implication basis for linear forms
R. Padmanabhan, Patrick Penner
2006· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Independence posets
Hugh Thomas, Nathan Williams
2019· article· en· Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
A permutation group determined by an ordered set
Anders Claesson, Chris Godsil, David G. Wagner
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Cardinality functions in allegories
Yasuo Kawahara, Michael Winter
2010· article· en· The Journal of Logic and Algebraic Programming· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Finite dimensional scattered posets
Maurice Pouzet, Hamza Si Kaddour, Nejib Zaguia
2013· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Isotone Maps as Maps of Congruences. II. Concrete Maps
George Grätzer, H. Lakser, E. T. Schmidt
2001· article· en· Acta Mathematica Academiae Scientiarum Hungaricae· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
A Mereology for Connected Structures
Michael Grüninger, Carmen Chui, Yi Ru, Jona Thai
2020· book-chapter· en· Frontiers in artificial intelligence and applications· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
EXISTENTIAL-IMPORT MATHEMATICS
John Corcoran, Hassan Masoud
2015· article· en· Bulletin of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
The Coproduct of Unital Quantales
Shaohui Liang
2011· article· en· Progress in applied mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Oxtoby's pseudocompleteness revisited
Melvin Henriksen, Ralph Kopperman, Marlon C. Rayburn, Aaron R. Todd
2000· article· en· Topology and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On Right Derivations Of Weak BCC-Algebras.
Nurcan Alp, Alev Firat
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
A Characterization of P-Compatible Varieties
Ivan Chajda, Klaus Denecke, Shelly L. Wismath
2007· article· en· Algebra Colloquium· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Rings and Gödel algebras
L. P. Belluce, Antonio Di Nola, Enrico Marchioni
2010· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Coaxer Lattices
M. Sambasiva Rao
2016· article· en· Canadian Mathematical Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Semirigid Equivalence Relations on a Finite Set.
Masahiro Miyakawa, Maurice Pouzet, Ivo G. Rosenberg, Hisayuki Tatsumi
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Free mu-lattices
Luigi Santocanale
2000· article· en· BRICS Report Series· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Generalized Index of Boolean Matrices.
Bo Liu, Bo Zhou, Qiaoliang Li, Jian Shen
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About