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
The Electronic 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.

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

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

fundno affunlabeled
Pólya's Permanent Problem
William McCuaig
2004· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
137
citations
affunlabeled
Short Cycles in Random Regular Graphs
Brendan D. McKay, Nicholas Wormald, Beata Wysocka
2004· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
112
citations
fundno affunlabeled
On the Quantum Chromatic Number of a Graph
Peter J‎. Cameron, Ashley Montanaro, Michael Newman, Simone Severini, Andreas Winter
2007· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
100
citations
afffundunlabeled
The Number of Labeled 2-Connected Planar Graphs
Edward A. Bender, Zhicheng Gao, Nicholas Wormald
2002· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
89
citations
affunlabeled
Periodic Graphs
Chris Godsil
2011· article· en· The Electronic Journal of Combinatorics· Chemistry
distilled prediction:candidate · noneconsensus · none
56
citations
affunlabeled
Counting Abelian Squares
L. Bruce Richmond, Jeffrey Shallit
2009· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
56
citations
afffundunlabeled
Encores on Cores
J Cain, Nicholas Wormald
2006· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
55
citations
affunlabeled
Large Bounded Degree Trees in Expanding Graphs
József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij
2010· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
46
citations
afffundunlabeled
The Map Asymptotics Constant $t_g$
Edward A. Bender, Zhicheng Gao, L. Bruce Richmond
2008· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
44
citations
affunlabeled
Binary Gray Codes with Long Bit Runs
Luis Goddyn, Pavol Gvozdjak
2003· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
41
citations
afffundunlabeled
Metric Dimension for Random Graphs
Béla Bollobás, Dieter Mitsche, Paweł Prałat
2013· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
39
citations
afffundunlabeled
Properties of the Steiner Triple Systems of Order 19
Charles J. Colbourn, Anthony D. Forbes, M. J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård +2 more
2010· article· en· The Electronic Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
38
citations
afffundunlabeled
Colouring Planar Mixed Hypergraphs
André Kündgen, Eric Mendelsohn, Vitaly Voloshin
2000· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
31
citations
fundno affunlabeled
Random Even Graphs
Geoffrey Grimmett, Svante Janson
2009· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
31
citations
affunlabeled
On a Problem of Marco Buratti
Peter Horák, Alexander Rosa
2009· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
30
citations
afffundunlabeled
On the Genus Distribution of $(p,q,n)$-Dipoles
Terry I. Visentin, Susana Wieler
2007· article· en· The Electronic Journal of Combinatorics· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
29
citations
afffundunlabeled
Small Forbidden Configurations II
R.P. Anstee, Ron Ferguson, Attila Sali
2000· article· en· The Electronic Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
29
citations
affunlabeled
Relaxed Graceful Labellings of Trees
Frank Van Bussel
2002· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Christoffel Words and the Calkin-Wilf Tree
Alessandro De Luca, Christophe Reutenauer
2011· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
28
citations
affunlabeled
A Note on Graphs Without Short Even Cycles
Thomas Lam, Jacques Verstraëte
2005· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
27
citations
afffundunlabeled
The Game of End-Nim
Michael Albert, Richard J. Nowakowski
2001· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
affunlabeled
On Directed Triangles in Digraphs
Peter Hamburger, Penny Haxell, Alexandr Kostochka
2007· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Trees and Meta-Fibonacci Sequences
Abraham Isgur, David Reiss, Stephen M. Tanny
2009· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
24
citations
next →

How this was built: Screen · Findings · About