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 6 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.

affunlabeled
The Demand-Matching Problem
F. Bruce Shepherd, Adrian Vetta
2007· article· en· Mathematics of Operations Research· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Isomorphism of graph classes related to the circular-ones property
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy Spinrad +1 more
2013· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Graph product structure for non-minor-closed classes
Vida Dujmović, Pat Morin, David R. Wood
2023· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
On the Monotonicity of (k;g,h)-graphs
Baoguang Xu, Ping Wang, Jianfang Wang
2002· article· en· Acta Mathematicae Applicatae Sinica English Series· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Reduced clique graphs of chordal graphs
Michel Habib, Juraj Stacho
2011· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Projective geometries in dense matroids
Jim Geelen, Kasper Kabell
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
A Note on Graphs Without Short Even Cycles
Thomas Lam, Jacques Verstraëte
2005· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Absorbing sets in arc-coloured tournaments
Geňa Hahn, Pierre Ille, Robert Woodrow
2004· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
On the graph complement conjecture for minimum rank
Francesco Barioli, Wayne Barrett, Shaun Fallat, H. Tracy Hall, Leslie Hogben, Hein van der Holst
2011· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
The perfect matching polytope and solid bricks
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty
2004· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
fundno affunlabeled
Star chromatic index of subcubic multigraphs
Hui Lei, Yongtang Shi, Zi‐Xia Song
2017· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Reconfiguration of dominating sets
Akira Suzuki, Amer E. Mouawad, Naomi Nishimura
2015· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Secure domination critical graphs
P.J.P. Grobler, Christina M. Mynhardt
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Bounded vertex coloring of trees
Mark Jarvis, Bing Zhou
2001· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
[no title]
Josep Dı́az, Guillem Perarnau, Xavier Pérez‐Giménez
2016· article· en· RECERCAT (Consorci de Serveis Universitaris de Catalunya)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
25
citations
affno abstractunlabeled
Flow-cut gaps for integer and fractional multiflows
Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
2012· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Finding a maximum-weight induced <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-partite subgraph of an <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>i</mml:mi></mml:math>-triangulated graph
Louigi Addario‐Berry, W. Sean Kennedy, Andrew D. King, Zhentao Li, Bruce Reed
2008· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Highly parity linked graphs
Ken‐ichi Kawarabayashi, Bruce Reed
2009· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
A note on equimatchable graphs
Allan Frendrup, Bert L. Hartnell, Preben Dahl Vestergaard
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Finding paths with minimum shared edges
Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
2012· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Tough graphs and hamiltonian circuits
Vašek Chvátal
2006· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Graphs with independent perfect matchings
Marcelo H. de Carvalho, Cl�udio L. Lucchesi, U. S. R. Murty
2004· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
fundno affunlabeled
Algorithmic Problems in Groups and Semigroups
Jean-Camille Birget, Stuart Margolis, John Meakin, Mark Sapir
2000· book· en· Birkhäuser Boston eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
← previousnext →

How this was built: Screen · Findings · About