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 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 16 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
Puzzles, Tableaux and Mosaics
Kevin Purbhoo
2007· preprint· en· arXiv (Cornell University)· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Affine and toric arrangements
Richard Ehrenborg, Margaret Readdy, Michael Slone
2008· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Quaternary Legendre pairs II
Ilias Kotsireas, Christoph Koutschan, Arne Winterhof
2025· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Orthosymplectic Cauchy Identities
Aalekh Patel, Harsh Patel, Anna Stokke
2022· preprint· en· Annals of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Lattice paths in corridors and cyclic corridors
Rigoberto Flórez, J. González, Mateo Matijasevick, Cristhian Pardo, Jósé L. Ramírez, Lina M. Simbaqueba +1 more
2024· article· en· Contributions to Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Counting mobiles by integrable systems
M. C. Bergère, Bertrand Eynard, Emmanuel Guitter, Soufiane Oukassi
2023· preprint· en· arXiv (Cornell University)· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Lorentzian polynomials on cones
Petter Brändén, Jonathan R. Leake
2023· preprint· en· arXiv (Cornell University)· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Hall sets, Lazard sets and comma-free codes
Dominique Perrin, Christophe Reutenauer
2017· preprint· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About