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
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 18 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Simple, Linear-Time Modular Decomposition
Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
2007· article· en· arXiv (Cornell University)· 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
venueno affno abstractunlabeled
Connected resolving sets in graphs
Varaporn Saenpholphat, Ping Zhang
2003· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
The master equality polyhedron with multiple rows
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
2010· article· en· Mathematical Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Genus, Treewidth, and Local Crossing Number
Vida Dujmović, David Eppstein, David R. Wood
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
6
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
affno abstractunlabeled
Claw-free graphs are not universal fixers
E. J. Cockayne, Richard G. Gibson, Christina M. Mynhardt
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On upper domination Ramsey numbers for graphs
Michael A. Henning, Ortrud R. Oellermann
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
On the connectivity of generalized p-cycles.
Ignacio M. Pelayo, C. Balbuena, J. Gómez
2001· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Strict chordal and strict split digraphs
Pavol Hell, César Hernández‐Cruz
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Diameter of paired domination edge-critical graphs
Michelle Edwards, Richard G. Gibson, Michael A. Henning, Christina M. Mynhardt
2008· article· en· Australas. J Comb.· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Graphical Representations of Graphic Frame Matroids
Rong Chen, Matthew DeVos, Daryl Funk, Irene Pivotto
2015· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On Well-Covered Cartesian Products
Bert L. Hartnell, Douglas F. Rall, Kirsti Wash
2018· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Balanced allocations: balls-into-bins revisited and chains-into-bins
Tuğkan Batu, Petra Berenbrink, Colin Cooper
2007· article· en· London School of Economics and Political Science Research Online (London School of Economics and Political Science)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
6
citations
affno abstractunlabeled
Homomorphisms of triangle-free graphs without a <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-minor
Reza Naserasr, Yared Nigussie, Riste Škrekovski
2009· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · insufficient_payload
6
citations
affunlabeled
The robber strikes back
Anthony Bonato, Stephen Finbow, Przemysław Gordinowicz, Haidar Ali, William B. Kinnersley, Dieter Mitsche +2 more
2013· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
6
citations
affno abstractunlabeled
On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si20.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-transversals of chordal graphs
Juraj Stacho
2007· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · insufficient_payload
6
citations
venueno affunlabeled
On (k, t)-choosability of graphs.
Wongsakorn Charoenpanitseri, Narong Punnim, Chariya Uiyyasathian
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
The game of Cops and Robber on circulant graphs
Shannon L. Fitzpatrick, John Paul Larkin
2017· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Extending precolourings of circular cliques
Richard C. Brewster, Jonathan A. Noel
2011· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affno abstractunlabeled
On the domination number of digraphs.
Guoliang Hao
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
On the Stability of Independence Polynomials
Jason I. Brown, Ben Cameron
2018· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
The structure of claw-free binary matroids
Peter Nelson, Kazuhiro Nomoto
2018· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · open_scienceconsensus · open_science
5
citations
afffundunlabeled
Homomorphisms of signed graphs: An update
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
5
citations

How this was built: Screen · Findings · About