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 4 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
A Hyperbase for Binary Lattice Hyperidentities
R. Padmanabhan, Patrick Penner
2000· article· en· Journal of Automated Reasoning· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On n-distributive modular ortholattices
Christian Herrmann, Florence Micol, Michael Roddy
2005· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
A New Perspective on the Mereotopology of RCC8
Michael Grüninger, Bahar Aameri
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Sets and Classes as Many
John Bell
2000· article· en· Journal of Philosophical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Join Spaces Determined by Lattices.
Violeta Leoreanu Fotea, Ivo G. Rosenberg
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
The shrinking principle and the axiom of choice
Bernhard Banaschewski, Peter Schuster
2007· article· de· Monatshefte für Mathematik· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
The structure of finite algebras
Bradd Hart, Matthew Valeriote
2001· book-chapter· en· American Mathematical Society eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Almost ff-universality Implies Q-universality
Vácłav Koubek, J. Sichler
2008· article· en· Applied Categorical Structures· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Boundedness and Complete Distributivity
Robert Rosebrugh, R.J. Wood
2001· article· en· Applied Categorical Structures· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Lax algebras
Dirk Hofmann, Gavin J. Seal, Walter Tholen
2014· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
HOW FINITE IS A THREE-ELEMENT UNARY ALGEBRA?
Jennifer Hyndman, Jane G. Pitkethly
2005· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Notes on sectionally complemented lattices. I
George Grätzer, H. Lakser
2005· article· en· Acta Mathematica Academiae Scientiarum Hungaricae· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Minimum sized fibres in distributive lattices
Dwight Duffus, Bill Sands
2001· article· en· Journal of the Australian Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Syntactic versus semantic control
Susi Wurmbrand
2002· article· de· Linguistik aktuell· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
Harmonious Colorings of Digraphs.
S. M. Hegde, Lolita Priya Castelino
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Properly stratified endomorphism algebras
Xueqing Chen, Vlastimil Dlab
2004· article· en· Journal of Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Mixed algebras and their logics
Ivo Düntsch, Ewa Orłowska, Tinko Tinchev
2017· article· en· Journal of Applied Non-Classical Logics· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Connexive Gentzen
Storrs McCall
2014· article· fr· Logic Journal of IGPL· Computer Science
machine prediction:candidate · noneconsensus · none
5
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
Incompleteness in a General Setting
John Bell
2007· article· en· Bulletin of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
← previousnext →

How this was built: Screen · Findings · About