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 3 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
Generating weakly 4-connected matroids
Jim Geelen, Xiangqian Zhou
2007· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Treewidth of graphs with balanced separations
Zdenĕk Dvořák, Sergey Norin
2018· preprint· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
14
citations
affno abstractunlabeled
A density Hales–Jewett theorem for matroids
Jim Geelen, Peter Nelson
2014· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
A new characterization of graphic matroids
John Mighton
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
fundno affno abstractunlabeled
Three-edge-colouring doublecross cubic graphs
Katherine Edwards, Daniel P. Sanders, Paul Seymour, Robin Thomas
2016· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
The burning number conjecture holds asymptotically
Sergey Norin, Jérémie Turcotte
2024· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Disjoint isomorphic balanced clique subdivisions
Irene Gil Fernández, Joseph Hyde, Hong Liu, Oleg Pikhurko, Zhuo Wu
2023· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
12
citations
fundno affno abstractunlabeled
Edge-colouring eight-regular planar graphs
Maria Chudnovsky, Katherine Edwards, Paul Seymour
2015· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Sparse halves in dense triangle-free graphs
Sergey Norin, Liana Yepremyan
2015· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mo stretchy="false">(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>-</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-critical graphs
Babak Farzad, Michael Molloy, Bruce Reed
2004· article· lv· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
10
citations
fundno affno abstractunlabeled
Domination in tournaments
Maria Chudnovsky, Ringi Kim, Chun‐Hung Liu, Paul Seymour, Stéphan Thomassé
2017· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
fundno affno abstractunlabeled
Disjoint dijoins
Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul Seymour
2016· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On the Excluded Minors for Quaternary Matroids
Jim Geelen, James Oxley, Dirk Vertigan, Geoff Whittle
2000· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Trees, ladders and graphs
Dániel T. Soukup
2015· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Augmenting chains in graphs without a skew star
Michael U. Gerber, Alain Hertz, Vadim Lozin
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Oriented star packings
Richard C. Brewster, Pavol Hell, Roméo Rizzi
2007· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Linear embeddings of graphs and graph limits
Huda Chuangpishit, Mahya Ghandehari, Matthew Hurshman, Jeannette Janssen, Nauzer Kalyaniwalla
2015· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Every graph is eventually Turán-good
Natasha Morrison, JD Nir, Sergey Norin, Paweł Rzążewski, Alexandra Wesolek
2023· article· en· Journal of Combinatorial Theory Series B· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Unexpected behaviour of crossing sequences
Matt DeVos, Bojan Mohar, Robert Šámal
2011· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
The genus of complete 3-uniform hypergraphs
Yifan Jing, Bojan Mohar
2019· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Lehman matrices
Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2008· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Stabilizer theorems for even cycle matroids
Bertrand Guenin, Irene Pivotto, Paul Wollan
2016· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
fundno affno abstractunlabeled
Deltas, extended odd holes and their blockers
Ahmad Abdi, Dabeen Lee
2018· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
A short proof of non-GF(5)-representability of matroids
Jim Geelen, James Oxley, Dirk Vertigan, Geoff Whittle
2004· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
fundno affno abstractunlabeled
Edge-colouring seven-regular planar graphs
Maria Chudnovsky, Katherine Edwards, Ken‐ichi Kawarabayashi, Paul Seymour
2015· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Edge-colouring graphs with local list sizes
Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle
2023· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Deeply asymmetric planar graphs
V. A. Aksionov, O. V. Borodin, Leonid S. Mel’nikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Matroid 3-connectivity and branch width
Jim Geelen, Stefan H. M. van Zwam
2015· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
← previousnext →

How this was built: Screen · Findings · About