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 Combinatorial Mathematics
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,087 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,087 works in the cohort · of 4,299,418page 11 of 22

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

affunlabeled
Squishing Dimers on the Hexagon Lattice
Ben Young
2009· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Auspicious Tatami Mat Arrangements
Alejandro Erickson, Frank Ruskey, Mark Schurch, Jennifer Woodcock
2010· book-chapter· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
On chromatic and flow polynomial unique graphs
Yinghua Duan, Haidong Wu, Qinglin Yu
2008· article· en· Discrete Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
M-vector analogue for the cd-index
Kalle Karu
2015· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
Chapoton triangles for nonkissing complexes
Alexander Garver, Thomas McConville
2020· article· en· Algebraic Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Sterling stirling play
Michael J. Fisher, Richard J. Nowakowski, Carlos P. Santos
2017· article· en· International Journal of Game Theory· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
The Worpitzky Numbers Revisited
Sam Vandervelde
2018· article· en· American Mathematical Monthly· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Cusps, congruence groups and Monstrous dessins
Valdo Tatitscheff, Yang‐Hui He, John McKay
2020· article· en· Indagationes Mathematicae· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Stable Grothendieck polynomials and K-theoretic factor sequences
Anders Skovsted Buch, Andrew Kresch, Mark Shimozono, Harry Tamvakis, Alexander Yong
2006· preprint· en· Zurich Open Repository and Archive (University of Zurich)· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
D-finiteness, rationality, and height
Jason P. Bell, Khoa D. Nguyen, Umberto Zannier
2019· preprint· en· Transactions of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Combinatorics of the zeta map on rational Dyck paths
Cesar Ceballos, Tom Denton, Christopher R. H. Hanusa
2016· preprint· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Sum of the <i>m</i> -th powers of <i>n</i> successive terms of an arithmetic sequence: <i> b <sup>m</sup> </i>  + ( <i>a</i>  +  <i>b</i> ) <i> <sup>m</sup> </i>  + (2 <i>a</i>  +  <i>b</i> ) <i> <sup>m</sup> </i>  + … + (( <i>n</i>  − 1) <i>a</i>  +  <i>b</i> ) <i> <sup>m</sup> </i>
Nadji Gauthier
2006· article· he· International Journal of Mathematical Education in Science and Technology· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
The Incidence Hopf Algebra of Graphs
Brandon Humpert, Jeremy L. Martin
2011· preprint· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About