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 1 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
Roman domination in graphs
E. J. Cockayne, Paul Dreyer, Sandra M. Hedetniemi, Stephen T. Hedetniemi
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
556
citations
affunlabeled
The Game of Cops and Robbers on Graphs
Anthony Bonato, Richard J. Nowakowski
2011· book· en· Student mathematical library· Computer Science
machine prediction:candidate · noneconsensus · none
332
citations
affno abstractunlabeled
Algorithmic Aspects of Tree Width
Bruce A. Reed
2003· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
283
citations
affno abstractunlabeled
On the complexity of reconfiguration problems
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara +1 more
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
258
citations
affunlabeled
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
Martin Charles Golumbic, Udi Rotics
2000· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
231
citations
affno abstractunlabeled
Szemerédi’s Lemma for the Analyst
László Lovász, Balázs Szegedy
2007· article· hu· Geometric and Functional Analysis· Computer Science
machine prediction:candidate · noneconsensus · none
229
citations
affno abstractunlabeled
The disjoint paths problem in quadratic time
Ken‐ichi Kawarabayashi, Yusuke Kobayashi, Bruce Reed
2011· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
203
citations
affno abstractunlabeled
The complexity of partition functions
Andreĭ A. Bulatov, Martin Grohe
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
188
citations
afffundunlabeled
Introduction to Reconfiguration
Naomi Nishimura
2018· article· en· Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
181
citations
affunlabeled
Vizing's conjecture: a survey and recent results
Boštjan Brešar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavžar
2011· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
136
citations
afffundunlabeled
Varieties with few subalgebras of powers
Joel Berman, Paweł Idziak, Petar Marković, Ralph McKenzie, Matthew Valeriote, Ross Willard
2009· article· lv· Transactions of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
128
citations
affunlabeled
A Note on Vertex List Colouring
Penny Haxell
2001· article· en· Combinatorics Probability Computing· Computer Science
machine prediction:candidate · noneconsensus · none
115
citations
affno abstractunlabeled
Excluding any graph as a minor allows a low tree-width 2-coloring
Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce Reed, Paul Seymour +1 more
2004· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
111
citations
afffundno abstractunlabeled
On Graph Powers for Leaf-Labeled Trees
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2002· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
111
citations
affno abstractunlabeled
The Excluded Minors for GF(4)-Representable Matroids
Jim Geelen, A.M.H. Gerards, Ajai Kapoor
2000· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
105
citations
affno abstractunlabeled
Bounded width problems and algebras
Benoît Larose, László Zádori
2007· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
99
citations
affno abstractunlabeled
On the asymptotic proportion of connected matroids
Dillon Mayhew, Mike Newman, Dominic Welsh, Geoff Whittle
2011· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
94
citations
affno abstractunlabeled
Diameter determination on restricted graph families
Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
2001· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
85
citations
venueno affno abstractunlabeled
On proper-path colorings in graphs
Eric Andrews, Chira Lumduanhom, Elliot Laforge, Ping Zhang
2016· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
84
citations
affno abstractunlabeled
Tight bounds on maximal and maximum matchings
Thérèse Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen Kobourov
2004· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
84
citations
affno abstractunlabeled
Induced matchings in intersection graphs
Kathie Cameron
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
83
citations
affno abstractunlabeled
H-Coloring dichotomy revisited
Andreĭ A. Bulatov
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
82
citations
affno abstractunlabeled
Improved complexity results on <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-coloring <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si5.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs
Shenwei Huang
2015· article· lv· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
79
citations
next →

How this was built: Screen · Findings · About