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
Algebraic structures and combinatorial models
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,531 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,531 works in the cohort · of 4,299,418page 10 of 31

Labels cover 1 of 1,531 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,531 of 1,531 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.

venueno affunlabeled
On categorical crossed modules
P. Carrasco, A.R. Garzón, E. M. Vitale
2006· article· en· Theory and applications of categories· Mathematics
machine prediction:candidate · noneconsensus · none
12
citations
afffundgemma · no categorygpt · no categorymodels agree
Fermionic characters for graded parafermions
2003· article· en· CERN Document Server (European Organization for Nuclear Research)· Mathematics
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Liberation of orthogonal Lie groups
Teodor Banica, Roland Speicher
2008· preprint· en· arXiv (Cornell University)· Mathematics
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Mackey functors and bisets
Ian Hambleton, Laurence R. Taylor, E. Bruce Williams
2010· article· en· Geometriae Dedicata· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Characterization of simple smooth modules
Yao Ma, Khoa Nguyen, Santanu Tantubay, Kaiming Zhao
2023· article· en· Journal of Algebra· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Generating-function method for fusion rules
Luc Bégin, Chris Cummins, Pierre Mathieu
2000· article· en· Journal of Mathematical Physics· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
afffundvenueunlabeled
Polycharacters of Cocommutative Hopf Algebras
Yuri Bahturin, Mikhail Kochetov, Susan Montgomery
2002· article· en· Canadian Mathematical Bulletin· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Hilbert Functions and Jordan Type of Perazzo Artinian Algebras
Nancy Abdallah, Nasrin Altafi, Pietro De Poi, Luca Fiorindo, Anthony Iarrobino, Pedro Macías Marques +3 more
2024· book-chapter· en· Springer INdAM series· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
BPS Algebras in 2D String Theory
Sarah M. Harrison, Natalie M. Paquette, Daniel Persson, Roberto Volpato
2022· article· lv· Annales Henri Poincaré· Mathematics
machine prediction:candidate · noneconsensus · none
10
citations

How this was built: Screen · Findings · About