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
European Journal of Combinatorics
Topic
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.

219 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.
219 works in the cohort · of 4,299,418page 5 of 5

Labels cover 0 of 219 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 219 of 219 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
A perfect expansion property
Micheal Pawliuk
2025· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Splitter theorems for graph immersions
Matt DeVos, Mahdieh Malekian
2025· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Interval hypergraphic lattices
Nantel Bergeron, Vincent Pilaud
2025· article· en· European Journal of Combinatorics· Decision Sciences
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
On the roots of the subtree polynomial
Jason I. Brown, Lucas Mol
2020· preprint· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Periodic P-partitions
Brian T. Chan
2022· preprint· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
0
citations
affno abstractunlabeled
Deforming Meyer sets
Jeong-Yup Lee, Robert V. Moody
2008· article· en· European Journal of Combinatorics· Materials Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Primitive elements of the Hopf algebras of tableaux
Claudia Malvenuto, Christophe Reutenauer
2021· preprint· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affno abstractunlabeled
On heroes in digraphs with forbidden induced forests
Alvaro Carbonero, Hidde Koerts, Benjamin Moore, Sophie Spirkl
2024· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Noncrossing partitions and Bruhat order
Thomas Gobet, Nathan Williams
2015· preprint· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations

How this was built: Screen · Findings · About