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 4 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
Tangles, tree-decompositions and grids in matroids
Jim Geelen, Bert Gerards, Geoff Whittle
2009· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
On the girth of digraphs
Jian Shen
2000· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Computing symmetry groups of polyhedra
David Avis, Mathieu Dutour Sikirić, Dmitrii V. Ṗasechnik, Thomas Rehn
2014· article· en· LMS Journal of Computation and Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
afffundunlabeled
Network reliability: Heading out on the highway
Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol
2020· article· en· Networks· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
afffundunlabeled
Complexity results on graphs with few cliques
Bill Rosgen, Lorna Stewart
2007· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Bipartite roots of graphs
Lap Chi Lau
2006· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Interval completion with few edges
Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Frequency Channel Assignment on Planar Networks
Michael Molloy, Mohammad R. Salavatipour
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Limited packings in graphs
Robert Gallant, Georg Günther, Bert L. Hartnell, Douglas F. Rall
2009· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Solving #SAT using vertex covers
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
2007· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affunlabeled
Planar Graphs have Bounded Queue-Number
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
afffundno abstractunlabeled
Graph partitions with prescribed patterns
Pavol Hell
2013· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
afffundno abstractunlabeled
Efficient domination in circulant graphs
K. Reji Kumar, Gary MacGillivray
2013· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
A Simple Linear Time LexBFS Cograph Recognition Algorithm
Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
P-matrix completions under weak symmetry assumptions
Shaun Fallat, Charles R. Johnson, Juan R. Torregrosa, Ana M. Urbano
2000· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
afffundno abstractunlabeled
Well-covered circulant graphs
Jason I. Brown, Richard Hoshino
2010· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
venueno affno abstractunlabeled
Braodcast Chromatic Numbers of Graphs.
Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
Safe set problem on graphs
Shinya Fujita, Gary MacGillivray, Tadashi Sakuma
2016· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
fundno affno abstractunlabeled
Rooted directed path graphs are leaf powers
Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter J. Papadakos
2009· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
Improved algorithms for weakly chordal graphs
Ryan Hayward, Jeremy Spinrad, R. Sritharan
2007· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
A Proof of a Conjecture of Ohba
Jonathan A. Noel, Bruce A. Reed, Hehui Wu
2014· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
afffundno abstractunlabeled
TSP on Cubic and Subcubic Graphs
Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Cliques in dense GF(q)-representable matroids
James F. Geelen, Geoff Whittle
2003· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
The linear delta-matroid parity problem
James F. Geelen, Satoru Iwata, Kazuo Murota
2003· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
venueno affunlabeled
Semitotal domination in graphs
Wayne Goddard, Michael A. Henning, Charles A. McPillan
2014· article· en· Utilitas Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Sweeping Graphs with Large Clique Number
Boting Yang, Danny Dyer, Brian Alspach
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Packing directed circuits exactly
Bertrand Guenin, Robin Thomas
2011· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
34
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

How this was built: Screen · Findings · About