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
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 2 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
The $t$-Stability Number of a Random Graph
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
2010· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
22
citations
affunlabeled
Chromatic Bases for Symmetric Functions
Soojin Cho, Stephanie van Willigenburg
2016· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
List Coloring Hypergraphs
Penny Haxell, Jacques Verstraëte
2010· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
Non-Repetitive Tilings
James D. Currie, Jamie Simpson
2002· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
The Rectilinear Crossing Number of $K_{10}$ is $62$
Alex Brodsky, Stéphane Durocher, Ellen Gethner
2001· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
A De Bruijn–Erdős Theorem for Chordal Graphs
Laurent Beaudou, Adrian Bondy, Ehsan Chiniforooshan, Maria Chudnovsky, Vašek Chvátal, Nicolás Fraiman +1 more
2015· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
A Note on the Edge-Connectivity of Cages
Ping Wang, Baoguang Xu, Jianfang Wang
2003· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
On Ryser's conjecture
Penny Haxell, Alex Scott
2012· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
19
citations
afffundunlabeled
A Note on Forbidding Clique Immersions
Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide
2013· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
afffundunlabeled
Digraphs are $2$-Weight Choosable
Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens
2011· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affunlabeled
On Walks Avoiding a Quadrant
Kilian Raschel, Amélie Trotignon
2019· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
19
citations
afffundunlabeled
On Subsequence Sums of a Zero-sum Free Sequence II
Weidong Gao, Yuanlin Li, Jiangtao Peng, Fang Sun
2008· article· en· The Electronic Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
Regularity and $h$-Polynomials of Edge Ideals
Takayuki Hibi, Kazunori Matsuda, Adam Van Tuyl
2019· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
A Schur-Like Basis of NSym Defined by a Pieri Rule
John M. Campbell, Karen S. Feldman, Jennifer Light, Pavel Shuldiner, Yan Xu
2014· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
17
citations
afffundunlabeled
Rank–Three Matroids are Rayleigh
David G. Wagner
2005· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
16
citations
affunlabeled
The Circular Chromatic Index of Flower Snarks
M. Ghebleh, Daniel Král͏̌, Serguei Norine, Robin Thomas
2006· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
afffundunlabeled
A Traceability Conjecture for Oriented Graphs
Marietjie Frick, Susan A. van Aardt, Jean E. Dunbar, Morten H. Nielsen, Ortrud R. Oellermann
2008· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affunlabeled
A Sperner-Type Theorem for Set-Partition Systems
Karen Meagher, Lucia Moura, Brett Stevens
2005· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
15
citations
afffundunlabeled
Distinct Distances in Graph Drawings
Paz Carmi, Vida Dujmović, Pat Morin, David R. Wood
2008· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations

How this was built: Screen · Findings · About