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

afffundunlabeled
CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM
Janusz Brzozowski, Elyot Grant, JEFFREY SHALLIT
2011· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT
Benoît Larose, Matthew Valeriote, László Zádori
2009· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Boolean and classical restriction categories
Robin Cockett, Ernie Manes
2009· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
fundvenueno affunlabeled
Injective hulls of partially ordered monoids
R. Raphael
2012· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Perfect MV-algebras and their Logic
L. P. Belluce, Antonio Di Nola, Brunella Gerla
2007· article· en· Applied Categorical Structures· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Kleisli compositions for topological spaces
Dirk Hofmann, Walter Tholen
2006· article· en· Topology and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Finite lattices and congruences. A survey
G. Gr�tzer, E. T. Schmidt
2005· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Absorption and directed Jónsson terms
Alexandr Kazda, Marcin Kozik, Ralph McKenzie, Matthew Moore
2018· book-chapter· en· Outstanding contributions to logic· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Full does not imply strong, does it?
Brian Davey, Miroslav Haviar, Ross Willard
2005· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
The saga of the High School Identities
Stanley Burris, Karen Yeats
2005· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
fundvenueno affunlabeled
Coherence for pseudodistributive laws revisited
F. Marmolejo, R.J. Wood
2008· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
A CHARACTERIZATION OF de MORGAN ALGEBRAS
Janusz Brzozowski
2001· article· en· International Journal of Algebra and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Lattice tolerances and congruences
Gábor Czédli, George Grätzer
2011· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Distributive contact lattices: Topological representations
Ivo Düntsch, Wendy MacCaull, Dimiter Vakarelov, Michael Winter
2007· article· en· The Journal of Logic and Algebraic Programming· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Ordered Sets via Adjunction
R.J. Wood
2003· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
On the Concept of Category-Specificity
Martin L. Lalumière
2017· letter· en· Archives of Sexual Behavior· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
All clones are centralizer clones
Věra Trnková, J. Sichler
2009· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations

How this was built: Screen · Findings · About