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
Topic
Advanced Graph Theory Research
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.

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

Labels cover 3 of 2,515 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 2,515 of 2,515 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
Kernels in planar digraphs
Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo
2005· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
On computing graph minor obstruction sets
Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
2000· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Matrix partitions of perfect graphs
Tomás Feder, Pavol Hell
2006· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
fundno affunlabeled
FACES OF MATCHING POLYHEDRA
2016· dissertation· en· UWSpace (University of Waterloo)· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
venueno affno abstractunlabeled
The Inverse Domination Number of a Graph.
Gayla S. Domke, Jean E. Dunbar, Lisa R. Markus
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
afffundunlabeled
A rainbow version of Mantel's Theorem
Robert Šámal, Amanda Montejano, Sebastián González Hermosillo de la Maza, Matt DeVos, Ron Aharoni
2020· article· en· Advances in Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Gallai's Theorem for List Coloring of Digraphs
Ararat Harutyunyan, Bojan Mohar
2011· article· en· SIAM Journal on Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Planar graph bipartization in linear time
Samuel Fiorini, Nadia Hardy, Bruce Reed, Adrian Vetta
2007· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Polarity of chordal graphs
Tınaz Ekim, Pavol Hell, Juraj Stacho, D. de Werra
2008· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
venueno affunlabeled
Twin Domination in Digraphs.
Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
afffundunlabeled
Colouring Planar Mixed Hypergraphs
André Kündgen, Eric Mendelsohn, Vitaly Voloshin
2000· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
The complexity of weighted Boolean #CSP with mixed signs
Andreǐ A. Bulatov, Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
fundno affno abstractunlabeled
DP-3-coloring of some planar graphs
Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu
2018· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
31
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
machine prediction:candidate · noneconsensus · none
31
citations
affunlabeled
Odd cycle packing
Ken‐ichi Kawarabayashi, Bruce Reed
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
On Rooted Node-Connectivity Problems
Joseph Cheriyan, Tibor Jordán, Zeev Nutov
2001· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
31
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
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Graph Searching and Related Problems
Anthony Bonato, Boting Yang
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
afffundno abstractunlabeled
Polynomial-time algorithms for minimum weighted colorings of (<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mo accent="true">¯</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs and similar graph classes
Chı́nh T. Hoàng, D. Adam Lazzarato
2015· article· lv· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
30
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
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Enumerating homomorphisms
Andreǐ A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2011· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
afffundunlabeled
Circle graph obstructions under pivoting
Jim Geelen, Sang‐il Oum
2009· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affunlabeled
The list partition problem for graphs
Kathie Cameron, Elaine M. Eschen, Chı́nh T. Hoàng, R. Sritharan
2004· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
A note on the Consecutive Ones Submatrix problem
Mohammad Taghi Hajiaghayi, Yashar Ganjali
2002· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
← previousnext →

How this was built: Screen · Findings · About