MétaCan
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.

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 2 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
Circular chromatic index of graphs of maximum degree 3
Peyman Afshani, Ghandehari Mahsa, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu
2005· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affunlabeled
On the Polarity and Monopolarity of Graphs
Ross Churchley, Jing Huang
2013· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Roots of cube polynomials of median graphs
Boštjan Brešar, Sandi Klavžar, Riste Škrekovski
2006· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
A Characterization of the degree sequences of 2‐trees
Prosenjit Bose, Vida Dujmović, Danny Kriz̧anc, Stefan Langerman, Pat Morin, David R. Wood +1 more
2008· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Average distance and maximum induced forest
Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl
2008· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Disjoint quasi‐kernels in digraphs
Scott Heard, Jing Huang
2008· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
afffundRetraction · OpenAlex missed itunlabeled
Quasi‐graphic matroids*
Jim Geelen, Bert Gerards, Geoff Whittle
2017· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Tough spiders
Tomáš Kaiser, Daniel Král͏̌, Ladislav Stacho
2007· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Average Degree in Graph Powers
Matt DeVos, Jessica McDonald, Diego Scheide
2012· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
Transversals in Trees
Víctor Campos, Vašek Chvátal, Luc Devroye, Perouz Taslakian
2012· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Acyclic dominating partitions
Louigi Addario‐Berry, Ross J. Kang, Tobias Müller
2009· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Unavoidable cycle lengths in graphs
Jacques Verstraëte
2005· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
A Ramsey‐type problem and the Turán numbers*
Noga Alon, P. Erdös, David S. Gunderson, Michael Molloy
2002· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Dominating induced matchings in graphs containing no long claw
Alain Hertz, Vadim Lozin, Bernard Ries, Viktor Zamaraev, D. de Werra
2017· preprint· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · none
8
citations
afffundunlabeled
On highly ramsey infinite graphs
Mark Siggers
2008· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
Strongly Even‐Cycle Decomposable Graphs
Tony Huynh, Andrew D. King, Sang‐il Oum, Maryam Verdian-Rizi
2016· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Counting 5‐connected planar triangulations
Zhicheng J. Gao, Ian M. Wanless, Nicholas Wormald
2001· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
The genus of Petersen powers
Bojan Mohar, Andrej Vodopivec
2010· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
7
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

How this was built: Screen · Findings · About