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

afffundunlabeled
Graph properties, graph limits, and entropy
Hamed Hatami, Svante Janson, Balázs Szegedy
2017· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Rainbow Arborescence in Random Digraphs
Deepak Bal, Patrick Bennett, Colin Cooper, Alan Frieze, Paweł Prałat
2015· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Circular choosability
Frédéric Havet, Ross J. Kang, Tobias Müller, Jean‐Sébastien Sereni
2009· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
The chromatic Ramsey number of odd wheels
Nathalie Paul, Claude Tardif
2011· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
On the cop number of graphs of high girth
Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho
2022· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
6
citations
affunlabeled
Bounded transversals in multipartite graphs
Robert Berke, Penny Haxell, Tibor Szabó
2011· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
On the chromatic number of a random 5‐regular graph
Josep Dı́az, Alexis C. Kaporis, Graeme Kemkes, Lefteris M. Kirousis, N. C. Wormald
2009· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Edge clique covers in graphs with independence number two
Pierre Charbit, Geňa Hahn, Marcin Kamiński, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr +2 more
2021· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Packing paths in digraphs
Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Roméo Rizzi, Anders Yeo
2003· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Crossing Numbers of Periodic Graphs
Zdenĕk Dvořák, Bojan Mohar
2015· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
The Game Saturation Number of a Graph
James M. Carraher, William B. Kinnersley, Benjamin Reiniger, Douglas B. West
2016· preprint· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Grünbaum colorings of even triangulations on surfaces
Michal Kotrbčı́k, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki +1 more
2017· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Complete graph immersions and minimum degree
Zdenĕk Dvořák, Liana Yepremyan
2017· preprint· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Fractal graphs
Pierre Ille, Robert Woodrow
2018· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Overlap number of graphs
Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher Stocker, Jennifer Vandenbussche +1 more
2011· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Disjoint clique cutsets in graphs without long holes
Elaine M. Eschen, Chı́nh T. Hoàng, Mark Petrick, R. Sritharan
2005· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Automorphism group and diameter of a graph
Peter Dankelmann, David Erwin, Simon Mukwembi, B. G. Rodrigues, E. Mwambene, Gert Sabidussi
2011· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Forbidden Induced Subgraphs for Toughness
Katsuhiro Ota, Gabriel Sueiro
2012· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
On ‐connected graphs
Olivier Durand de Gevigney, Zoltán Szigeti
2018· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
The list linear arboricity of graphs
Ringi Kim, Luke Postle
2021· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About