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
Journal of Graph Theory
Topic
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.

240 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.
240 works in the cohort · of 4,299,418page 1 of 5

Labels cover 0 of 240 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 240 of 240 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

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
distilled prediction:candidate · noneconsensus · none
136
citations
affunlabeled
Interval bigraphs and circular arc graphs
Pavol Hell, Jing Huang
2004· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
78
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
distilled prediction:candidate · noneconsensus · none
71
citations
affunlabeled
Star Chromatic Index
Zdenĕk Dvořák, Bojan Mohar, Robert Šámal
2012· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
45
citations
affunlabeled
Tree embeddings
Penny Haxell
2001· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
44
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
distilled prediction:candidate · noneconsensus · none
34
citations
afffundunlabeled
Circle graph obstructions under pivoting
Jim Geelen, Sang‐il Oum
2009· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
30
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
distilled prediction:candidate · noneconsensus · none
27
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
distilled prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Cycles and paths in edge‐colored graphs with given degrees
A. Abouelaoualim, Kinkar Chandra Das, W. Fernandez de la Véga, Marek Karpiński, Yannis Manoussakis, Carlos A. Martinhon +1 more
2009· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
24
citations
afffundunlabeled
A Characterization of b‐Perfect Graphs
Chı́nh T. Hoàng, Frédéric Maffray, Meriem Mechebbek
2011· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
22
citations
affunlabeled
On the minimum degree of minimal Ramsey graphs
Tibor Szabó, Philipp Zumstein, Stefanie Zürcher
2009· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
A characterization of (γ, <i>i</i> )‐trees
E. J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech
2000· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
The <i>k</i>‐piece packing problem
David Hartvigsen, Pavol Hell, Jácint Szabó
2006· article· en· Journal of Graph Theory· Engineering
distilled prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
Simultaneous diagonal flips in plane triangulations
Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
2006· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Cycle spaces in topological spaces
Antoine Vella, R. Bruce Richter
2008· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
next →

How this was built: Screen · Findings · About