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
Journal of Combinatorial Theory Series B
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.

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

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

affno abstractunlabeled
Cycle Decompositions of K and K−I
Brian Alspach, Heather Gavlas
2001· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
261
citations
affno abstractunlabeled
The disjoint paths problem in quadratic time
Ken‐ichi Kawarabayashi, Yusuke Kobayashi, Bruce Reed
2011· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
203
citations
affno abstractunlabeled
Limits of permutation sequences
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo Moreira, Balázs Ráth, Rudini Sampaio
2012· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
115
citations
affno abstractunlabeled
Matchings in regular graphs from eigenvalues
Sebastian M. Cioabă, David A. Gregory, Willem H. Haemers
2008· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
112
citations
affno abstractunlabeled
Excluding any graph as a minor allows a low tree-width 2-coloring
Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce Reed, Paul Seymour +1 more
2004· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
111
citations
affno abstractunlabeled
Vertex colouring edge partitions
Louigi Addario‐Berry, R. E. L. Aldred, Ketan Dalal, Bruce A. Reed
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
109
citations
affno abstractunlabeled
Counting connected graphs inside-out
Boris Pittel, Nicholas Wormald
2004· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
108
citations
affno abstractunlabeled
The Excluded Minors for GF(4)-Representable Matroids
Jim Geelen, A.M.H. Gerards, Ajai Kapoor
2000· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
105
citations
affno abstractunlabeled
Eigenvalue bounds for independent sets
Chris Godsil, Michael Newman
2008· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
78
citations
affno abstractunlabeled
Cayley maps
R. Bruce Richter, Jozef Širáň, Robert Jajcay, Thomas W. Tucker, Mark E. Watkins
2005· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
77
citations
affno abstractunlabeled
On the odd-minor variant of Hadwiger's conjecture
Jim Geelen, Bert Gerards, Bruce Reed, Paul Seymour, Adrian Vetta
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
75
citations
affno abstractunlabeled
Quantum homomorphisms
Laura Mančinska, David E. Roberson
2016· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
74
citations
afffundno abstractunlabeled
Symmetric squares of graphs
Koenraad M. R. Audenaert, Chris Godsil, Gordon Royle, Terry Rudolph
2006· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
69
citations
afffundno abstractunlabeled
Cops and robbers in a random graph
Béla Bollobás, Gábor Kun, Imre Leader
2012· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
67
citations
affno abstractunlabeled
Bisimplicial vertices in even-hole-free graphs
Louigi Addario‐Berry, Maria Chudnovsky, Frédéric Havet, Bruce Reed, Paul Seymour
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
Finitely forcible graphons
László Lovász, Balázs Szegedy
2011· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
54
citations
affno abstractunlabeled
A Characterization of Weakly Bipartite Graphs
Bertrand Guenin
2001· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
53
citations
afffundno abstractunlabeled
Covering arrays on graphs
Karen Meagher, Brett Stevens
2005· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
Extreme eigenvalues of nonregular graphs
Sebastian M. Cioabă, David A. Gregory, Vladimir Nikiforov
2006· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Obstructions to branch-decomposition of matroids
Jim Geelen, Bert Gerards, Neil Robertson, Geoff Whittle
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Dimers, tilings and trees
Richard Kenyon, Scott Sheffield⋆
2004· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
47
citations
affno abstractunlabeled
On a Conjecture of Lovász Concerning Bricks
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty
2002· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Growth rates of minor-closed classes of matroids
Jim Geelen, Joseph P. S. Kung, Geoff Whittle
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Excluding a planar graph from<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="normal">GF</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-representable matroids
Jim Geelen, Bert Gerards, Geoff Whittle
2007· article· lv· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity+insufficient_payload
45
citations
affno abstractunlabeled
The edge-density for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math> minors
Maria Chudnovsky, Bruce Reed, Paul Seymour
2010· article· lv· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · sts+research_integrity+insufficient_payload
44
citations
afffundno abstractunlabeled
Generic global rigidity of body–bar frameworks
Robert Connelly, Tibor Jordán, Walter Whiteley
2013· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Locally planar graphs are 5-choosable
Matt DeVos, Ken‐ichi Kawarabayashi, Bojan Mohar
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Tangles, tree-decompositions and grids in matroids
Jim Geelen, Bert Gerards, Geoff Whittle
2009· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Cayley sum graphs and eigenvalues of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mo stretchy="false">(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math>-fullerenes
Matt DeVos, Luis Goddyn, Bojan Mohar, Robert Šámal
2008· article· lv· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity
38
citations
afffundno abstractunlabeled
The inducibility of blow-up graphs
Hamed Hatami, James Hirst, Serguei Norine
2014· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
On the extreme eigenvalues of regular graphs
Sebastian M. Cioabă
2005· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Average independence polynomials
Jason I. Brown, Richard J. Nowakowski
2004· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
35
citations
affno abstractunlabeled
Chromatic Number and the 2-Rank of a Graph
Chris Godsil, Gordon Royle
2001· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
35
citations
next →

How this was built: Screen · Findings · About