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

fundno affunlabeled
On Weak Flexibility in Planar Graphs
Bernard Lidický, Tomáš Masařík, Kyle Murphy, Shira Zerbib
2020· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Beyond Ohba’s Conjecture: A bound on the choice number of<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>-chromatic graphs with<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math>vertices
Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu
2014· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Counting Homomorphisms Modulo a Prime Number
Amirhossein Kazeminia, Andreǐ A. Bulatov
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
A Note on the Invertibility of Oriented Graphs
Natalie Behague, Tom Johnston, Natasha Morrison, Shannon N. Ogden
2025· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On the Tree Inclusion Problem
Yangjun Chen, Yibin Chen
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
The game of Cops and Eternal Robbers
Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, Fionn Mc Inerney
2021· preprint· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Infinite graphs
Anthony Bonato, Richard J. Nowakowski
2011· book-chapter· en· Student mathematical library· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Further results on Hendry's Conjecture
Manuel Lafond, Ben Seamone, Rezvan Sherkati
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On k-connected restrained domination in graphs.
Hongyu Chen, Xue-gang Chen, Xiang Tan
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Toward a Dichotomy for Approximation of $H$-coloring
Akbar Rafiey, Arash Rafiey, Thiago Santos
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Properties of Transformation Digraphs D xyz .
Xiujuan Zhang, Juan Liu, Long Yan, Jixiang Meng
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On wy-Perfect Graphs.
Gabriela Araujo‐Pardo, Christian Rubio-Montiel
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
The Intersection of Two Vertex Coloring Problems
Angèle M. Foley, Dallas J. Fraser, Chı́nh T. Hoàng, Kevin J. Holmes, Tom P. LaMantia
2019· preprint· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Critical Hamiltonian Connected Graphs.
Maliheh Modalleliyan, Behnaz Omoomi
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Domination in Kn\"odel Graphs
Jesse Racicot, Giovanni Rosso
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Eternal domination and clique covering
Gary MacGillivray, C. M. Mynhardt, Virgélot Virgile
2022· article· en· Electronic Journal of Graph Theory and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On The Average Crosscap Number Of A Graph.
Yunsheng Zhang, Yichao Chen, Yanpei Liu
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
On Separating Path and Tree Systems in Graphs
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak +3 more
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
K 3,3 Minors and the Maximum-Flow Problem
Donald K. Wagner
2008· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
The grid-minor theorem revisited
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gweanël Joret, Hoang La, Piotr Micek +3 more
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A note on highly connected K2,-minor free graphs
Nicolás Bousquet, Théo Pierron, Alexandra Wesolek
2024· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On 1-planar graphs with bounded cop-number
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali
2025· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About