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 8 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
Clustered colouring in minor-closed classes
David R. Wood
2019· article· en· Oxford University Research Archive (ORA) (University of Oxford)· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Embeddings of Small Graphs on the Torus
Andrei Gagarin, William L. Kocay, Daniel Neilson
2003· article· en· CUBO, A Mathematical Journal· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
The obstructions for toroidal graphs with no <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si14.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>’s
Andrei Gagarin, Wendy Myrvold, John L. C. Chambers
2008· article· lv· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Practical and Efficient Circle Graph Recognition
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
2013· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Sparse universal graphs for planarity
Louis Esperet, Gwenaël Joret, Pat Morin
2023· article· en· Journal of the London Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
On probe permutation graphs
David B. Chandler, Maw‐Shang Chang, Ton Kloks, Jiping Liu, Sheng‐Lung Peng
2009· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Embeddings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si88.gif" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-connected graphs of pathwidth <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si89.gif" overflow="scroll"><mml:mi>k</mml:mi></mml:math>
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
2004· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Diagonal Flips in Labelled Planar Triangulations
Zhicheng Gao, Jorge Urrutia, Jianyu Wang
2001· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
afffundunlabeled
A Note on Forbidding Clique Immersions
Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide
2013· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Finding clubs in graph classes
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
2014· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Diversities and the Geometry of Hypergraphs
David Bryant, Paul Tupper
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
A weaker version of Lovász' path removal conjecture
Ken‐ichi Kawarabayashi, Orlando Lee, Bruce Reed, Paul Wollan
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
On the domination polynomials of friendship graphs
‎Saeid Alikhani, Jason I. Brown, Somayeh Jahari
2016· article· en· Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
venueno affunlabeled
Total Perfect Codes in Tensor Products of Graphs.
Ghidewon Abay‐Asmerom, Richard H. Hammack, Dewey Taylor
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
fundno affunlabeled
Graph Modification Problems (Dagstuhl Seminar 14071)
Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov
2014· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
afffundno abstractunlabeled
Local Steiner convexity
Michael A. Henning, Morten H. Nielsen, Ortrud R. Oellermann
2008· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
Almost all matroids are nonrepresentable
2018· article· en· Bulletin of the London Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
High Degree Graphs Contain Large-Star Factors
Noga Alon, Nicholas Wormald
2010· book-chapter· en· Bolyai Society mathematical studies· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
A Tabu search algorithm for the network pricing problem
Luce Brotcorne, Fabien Cirinei, Patrice Marcotte, Gilles Savard
2012· article· en· Computers & Operations Research· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Minimal trees and monophonic convexity
José Cáceres, Ortrud R. Oellermann, María Luz Puertas
2012· article· en· Discussiones Mathematicae Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundno abstractunlabeled
Vertex covers and eternal dominating sets
William F. Klostermeyer, Christina M. Mynhardt
2011· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
← previousnext →

How this was built: Screen · Findings · About