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

affno abstractunlabeled
Erdős–Ko–Rado for perfect matchings
Nathan Lindzey
2017· article· hu· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Immersing complete digraphs
Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide
2012· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Hypergroupoids determined by lattices
Violeta Leoreanu-Fotea, Ivo G. Rosenberg
2009· article· en· European Journal of Combinatorics· Decision Sciences
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
A bijection between words and multisets of necklaces
Ira M. Gessel, Antonio Restivo, Christophe Reutenauer
2012· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Enumerations relating braid and commutation classes
Susanna Fishel, Elizabeth Milićević, Rebecca Patrias, Bridget Eileen Tenner
2018· article· en· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
Tableau sequences, open diagrams, and Baxter families
Sophie Burrill, Julien Courtiel, Éric Fusy, Stephen Melczer, Marni Mishna
2016· article· en· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Coloring face hypergraphs on surfaces
Zdenĕk Dvořák, Daniel Král͏̌, Riste Škrekovski
2004· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
Medial layer graphs of equivelar 4-polytopes
Barry Monson, Asia Ivić Weiss
2005· article· en· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Roth-type theorems in finite groups
József Solymosi
2013· article· en· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Symmetric matroid polytopes and their generation
Jürgen Bokowski, David Avis, Gábor Gévay
2009· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Age and weak indivisibility
N. Sauer
2013· article· en· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Note Concerning an Odd Langford Sequence
Václav Linek
2001· article· en· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Boxicity and cubicity of product graphs
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad
2015· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Homomorphism bounded classes of graphs
Timothy Marshall, Reza Nasraser, Jaroslav Nešetřil
2005· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Cyclic colorings of plane graphs with independent faces
Jernej Azarija, Rok Erman, Daniel Král͏̌, Matjaž Krnc, Ladislav Stacho
2011· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Counting unrooted loopless planar maps
Valery A. Liskovets, Timothy R. Walsh
2004· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Distance-two colourings of Barnette graphs
Tomás Feder, Pavol Hell, Carlos Subi
2020· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Unary functions
Miodrag Sokić
2015· article· en· European Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
← previousnext →

How this was built: Screen · Findings · About