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 2 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
Shortest paths between shortest paths
Marcin Kamiński, Paul Medvedev, Martin Milanič
2011· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
76
citations
affno abstractunlabeled
On the odd-minor variant of Hadwiger's conjecture
Jim Geelen, Bert Gerards, Bruce Reed, Paul Seymour, Adrian Vetta
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
75
citations
affunlabeled
Some remarks on domination
Dan Archdeacon, Joanna A. Ellis-Monaghan, David Fisher, Dalibor Fronček, Phat Lam, Suzanne M. Seager +2 more
2004· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
71
citations
affno abstractunlabeled
Refined Search Tree Technique for Dominating Set on Planar Graphs
Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances Rosamond +1 more
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
69
citations
afffundunlabeled
Graphon Mean Field Games and Their Equations
Peter E. Caines, Minyi Huang
2021· article· en· SIAM Journal on Control and Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
afffundno abstractunlabeled
Cops and robbers in a random graph
Béla Bollobás, Gábor Kun, Imre Leader
2012· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
fundno affunlabeled
The Chromatic Number of Graph Powers
Noga Alon, Bojan Mohar
2002· article· en· Combinatorics Probability Computing· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
afffundunlabeled
Triangle-intersecting families of graphs
David Ellis, Ehud Friedgut
2012· article· en· Journal of the European Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
Bisimplicial vertices in even-hole-free graphs
Louigi Addario‐Berry, Maria Chudnovsky, Frédéric Havet, Bruce Reed, Paul Seymour
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
A refined search tree technique for Dominating Set on planar graphs
Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances Rosamond +1 more
2004· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affno abstractunlabeled
Nonrepetitive colouring via entropy compression
Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
2015· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
affno abstractunlabeled
On sum coloring of graphs
Mohammad R. Salavatipour
2003· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
fundno affno abstractunlabeled
Exponentially many perfect matchings in cubic graphs
Louis Esperet, František Kardoš, Andrew D. King, Daniel Král͏̌, Serguei Norine
2011· article· en· Advances in Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
afffundno abstractunlabeled
A dichotomy for minimum cost graph homomorphisms
Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
2008· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
The firefighter problem for cubic graphs
Andrew D. King, Gary MacGillivray
2009· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
Hedetniemi's conjecture — a survey
Norbert Sauer
2001· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
Independent packings in structured graphs
Kathie Cameron, Pavol Hell
2005· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affno abstractunlabeled
On the k-path partition of graphs
George Steiner
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
afffundno abstractunlabeled
On the packing chromatic number of some lattices
Arthur S. Finbow, Douglas F. Rall
2009· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
affno abstractunlabeled
List matrix partitions of chordal graphs
Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
← previousnext →

How this was built: Screen · Findings · About