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 5 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. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Sewing Ribbons on Graphs in Space
Dan Archdeacon, C. Paul Bonnington, R. Bruce Richter, Jozef Širáň
2002· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Matroids denser than a clique
Jim Geelen, Peter Nelson
2015· preprint· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Spectral arbitrariness for trees fails spectacularly
Shaun Fallat, H. Tracy Hall, Rupert H. Levene, Seth A. Meyer, Shahla Nasserasr, Polona Oblak +1 more
2024· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Bounds for mean colour numbers of graphs
Fengming Dong
2003· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On 2-cycles of graphs
Sergey Norin, Robin Thomas, Hein van der Holst
2023· article· en· Journal of Combinatorial Theory Series B· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Graph layouts via layered separators
Vida Dujmović
2014· preprint· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Peripheral circuits in infinite binary matroids
Nathan Bowler, Robin Christian, R. Bruce Richter
2018· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Small cores in 3-uniform hypergraphs
David Solymosi, József Solymosi
2016· preprint· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Professor W.T. Tutte
U. S. R. Murty
2004· article· en· Journal of Combinatorial Theory Series B· Chemistry
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
A new proof of Seymour's 6-flow theorem
Matt DeVos, Edita Rollová, Robert Šámal
2016· preprint· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Removable paths and cycles with parity constraints
Ken‐ichi Kawarabayashi, Orlando Lee, Bruce Reed
2014· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Hyperbolicity theorems for correspondence colouring
Luke Postle, Evelyne Smith‐Roberge
2025· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Local Hadwiger's Conjecture
Benjamin Moore, Luke Postle, Lise Turner
2023· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About