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
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 2 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
The linear delta-matroid parity problem
James F. Geelen, Satoru Iwata, Kazuo Murota
2003· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Cliques in dense GF(q)-representable matroids
James F. Geelen, Geoff Whittle
2003· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Colouring Eulerian Triangulations
Joan Hutchinson, R. Bruce Richter, Paul Seymour
2002· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Rainbow triangles in three-colored graphs
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young
2017· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
32
citations
afffundno abstractunlabeled
Packing Odd Circuits in Eulerian Graphs
James F. Geelen, Bertrand Guenin
2002· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Totally Free Expansions of Matroids
James F. Geelen, James Oxley, Dirk Vertigan, Geoff Whittle
2002· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
30
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· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
30
citations
affno abstractunlabeled
Branch-Width and Rota's Conjecture
James F. Geelen, Geoff Whittle
2002· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Graph product structure for non-minor-closed classes
Vida Dujmović, Pat Morin, David R. Wood
2023· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Inertia and biclique decompositions of joins of graphs
David A. Gregory, Brenda Heyink, Kevin N. Vander Meulen
2003· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
The perfect matching polytope and solid bricks
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty
2004· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Projective geometries in dense matroids
Jim Geelen, Kasper Kabell
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Flow-cut gaps for integer and fractional multiflows
Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
2012· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Paths with two blocks in n-chromatic digraphs
Louigi Addario‐Berry, Frédéric Havet, Stéphan Thomassé
2006· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
afffundno abstractunlabeled
On the crossing number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math>
Dan McQuillan, Shengjun Pan, R. Bruce Richter
2015· article· lv· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+insufficient_payloadconsensus · none
22
citations
affno abstractunlabeled
The independence fractal of a graph
Jason I. Brown, C.A. Hickman, Richard J. Nowakowski
2003· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Spectral estimates for Abelian Cayley graphs
Joel Friedman, Ram Murty, Jean–Pierre Tillich
2005· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Packing of rigid spanning subgraphs and spanning trees
Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti
2013· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
A weaker version of Lovász' path removal conjecture
Ken‐ichi Kawarabayashi, Orlando Lee, Bruce Reed, Paul Wollan
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Zarankiewiczʼs Conjecture is finite for each fixed m
Robin Christian, R. Bruce Richter, Gelasio Salazar
2012· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
afffundno abstractunlabeled
Asymptotically optimal frugal colouring
Michael Molloy, Bruce Reed
2009· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Disjoint cocircuits in matroids with large rank
James F. Geelen, A.M.H. Gerards, Geoff Whittle
2003· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Packing Steiner trees
Matt DeVos, Jessica McDonald, Irene Pivotto
2016· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Excluding a group-labelled graph
Jim Geelen, Bert Gerards
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Twins of rayless graphs
Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
2010· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
fundno affno abstractunlabeled
A proof of the Barát–Thomassen conjecture
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé
2017· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
15
citations

How this was built: Screen · Findings · About