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 3 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
Rebuilding convex sets in graphs
José Cáceres, Alberto Márquez, Ortrud R. Oellermann, María Luz Puertas
2005· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
afffundno abstractunlabeled
Cops and Robbers from a distance
Anthony Bonato, Ehsan Chiniforooshan, Paweł Prałat
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
Profinite Graphs and Groups
Luis Ribes
2017· book· de· Ergebnisse der Mathematik und ihrer Grenzgebiete· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
afffundno abstractunlabeled
Perfect Roman domination in trees
Michael A. Henning, William F. Klostermeyer, Gary MacGillivray
2017· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Obstructions to branch-decomposition of matroids
Jim Geelen, Bert Gerards, Neil Robertson, Geoff Whittle
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Eigenvalues and colorings of digraphs
Bojan Mohar
2009· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
affno abstractunlabeled
Matching, matroids, and extensions
William H. Cunningham
2002· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Protecting a graph with mobile guards
William F. Klostermeyer, Christina M. Mynhardt
2016· article· en· Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)· Computer Science
machine prediction:candidate · noneconsensus · none
46
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· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Growth rates of minor-closed classes of matroids
Jim Geelen, Joseph P. S. Kung, Geoff Whittle
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affunlabeled
Elimination graphs
Yuli Ye, Allan Borodin
2012· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
afffundno abstractunlabeled
Sweeping graphs with large clique number
Boting Yang, Danny Dyer, Brian Alspach
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Strategies for Hotlink Assignments
Prosenjit Bose, Jurek Czyzowicz, Leszek Gąsieniec, Evangelos Kranakis, Danny Kriz̧anc, Andrzej Pelc +1 more
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
venueno affno abstractunlabeled
Hyperbolicity and parameters of graphs.
Junior Michel, José M. Rodrı́guez, José M. Sigarreta, María Villeta
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
On bags and bugs
Pierre Hansen, Dragan Stevanović
2007· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Book Embeddability of Series–Parallel Digraphs
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen Wismath
2006· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affunlabeled
Star Chromatic Index
Zdenĕk Dvořák, Bojan Mohar, Robert Šámal
2012· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
How to build a brick
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty
2006· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Balanced vertex-orderings of graphs
Thérèse Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood
2005· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
afffundno abstractunlabeled
The complexity of dominating set reconfiguration
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki +1 more
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affunlabeled
Tree embeddings
Penny Haxell
2001· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
On the divisibility of graphs
Chı́nh T. Hoàng, Colin McDiarmid
2002· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
On the Roots of Domination Polynomials
Jason I. Brown, Julia Tufts
2013· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
The Largest Small Octagon
Charles Audet, Pierre Hansen, Frédéric Messine, Junjie Xiong
2002· article· en· Journal of Combinatorial Theory Series A· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Vertex domination of generalized Petersen graphs
B. Javad Ebrahimi, Nafiseh Jahanbakht, E. S. Mahmoodian
2009· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Locally planar graphs are 5-choosable
Matt DeVos, Ken‐ichi Kawarabayashi, Bojan Mohar
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Weakly chordal graph algorithms via handles
Ryan Hayward, Jeremy Spinrad, R. Sritharan
2000· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Polynomial-time recognition of clique-width ≤3 graphs
Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce Reed, Udi Rotics
2011· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
On the complexity of crossings in permutations
Thérèse Biedl, Franz J. Brandenburg, Xiaotie Deng
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations

How this was built: Screen · Findings · About