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 9 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
On the Proof of a Theorem of Pálfy
Edward Dobson
2006· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Product Dimension of Forests and Bounded Treewidth Graphs
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma
2013· preprint· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Degree-Similar Graphs
Chris Godsil, Wanting Sun
2025· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Lexicographically Least Square-Free Word with a Given Prefix
Siddharth Berera, Andrés Gómez-Colunga, Joey Lakerdas-Gayle, John F. López, Mauditra Matin, Daniel Roebuck +3 more
2023· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Clairvoyant Maître d'
Reed Acton, T. Kyle Petersen, Blake Shirman, Bridget Eileen Tenner
2025· article· en· The Electronic Journal of Combinatorics· Arts and Humanities
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Density Maximizers of Layered Permutations
Adam Kabela, Daniel Král͏̌, Jonathan A. Noel, Théo Pierron
2022· preprint· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · research_integrityconsensus · none
0
citations
afffundunlabeled
Simplicial Complexes and Matroids with Vanishing $T^2$
Alexandru Constantinescu, Patricia Klein, Thái Thành Nguyên, Anurag Singh, Lorenzo Venturello
2025· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
3-Cluster-Free Families of Subspaces
Gabriel Currier, Shahriar Shahriari
2025· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
A $q$-Analog of Foulkes' Conjecture
François Bergeron
2017· preprint· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
0
citations
afffundunlabeled
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words
Lucas Mol, Narad Rampersad, Jeffrey Shallit
2020· preprint· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · none
0
citations
afffundunlabeled
The Total Acquisition Number of Random Graphs
Deepak Bal, Patrick Bennett, Andrzej Dudek, Paweł Prałat
2016· preprint· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Words with many Palindrome Pair Factors
Adam Borchert, Narad Rampersad
2015· preprint· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · research_integrityconsensus · none
0
citations
affunlabeled
Clustered Colouring of Graph Products
Rutger Campbell, J. Pascal Gollin, Kevin Hendrey, Thomas Lesgourgues, Bojan Mohar, Youri Tamitegama +2 more
2025· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Slide Multiplicity Free Key Polynomials
Soojin Cho, Stephanie van Willigenburg
2022· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Sparse Distance Sets in the Triangular Lattice
Tanbir Ahmed, Hunter S. Snevily
2013· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The CI Problem for Infinite Groups
Joy Morris
2016· preprint· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · research_integrityconsensus · none
0
citations
afffundunlabeled
The Bondage Number of Random Graphs
Dieter Mitsche, Xavier Pérez‐Giménez, Paweł Prałat
2016· preprint· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · open_science+research_integrityconsensus · none
0
citations
afffundunlabeled
On Density-Critical Matroids
2020· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Necessary Conditions for Schur-Maximality
Foster Tom, Stephanie van Willigenburg
2018· preprint· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
0
citations
affunlabeled
Symmetric Graphs with Respect to Graph Entropy
Seyed Saeed Changiz Rezaei, Ehsan Chiniforooshan
2017· preprint· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
0
citations
affunlabeled
Extremal Number of Arborescences
2025· article· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About