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
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 33 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
Circular flows in mono-directed signed graphs
Jiaao Li, Reza Naserasr, Zhouningxin Wang, Xuding Zhu
2022· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Treewidth, Circle Graphs and Circular Drawings
Robert Hickingbotham, Freddie Illingworth, Bojan Mohar, David R. Wood
2024· book-chapter· en· MATRIX book series· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Guarding isometric subgraphs and Lazy Cops and Robbers
Sebastián González Hermosillo de la Maza, Bojan Mohar
2019· article· en· Acta Mathematica Universitatis Comenianae· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
On heroes in digraphs with forbidden induced forests
Alvaro Carbonero, Hidde Koerts, Benjamin Moore, Sophie Spirkl
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Vertex-Critical $$(P_5,W_4)$$-Free Graphs
Xia Wen, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Trees
Sebastian M. Cioabă, M. Ram Murty
2022· book-chapter· en· Texts and readings in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Bounds on the edge-length ratio of 2-outerplanar graphs
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen Wismath
2025· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Distance-Two Coloring of Barnette Graphs.
Tomás Feder, Pavol Hell, Carlos Subi
2018· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Fractional vertex-arboricity of planar graphs
Marthe Bonamy, František Kardoš, Tom Kelly, Luke Postle
2020· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
A Superlocal Version of Reed's Conjecture
Katherine Edwards, Andrew D. King
2014· preprint· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Extending matchings in planar odd graphs.
Shaohui Zhai, Xiaofeng Guo
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Time-delayed Cops and Robbers
Nancy E. Clarke, Danielle Cox, Melissa A. Huggan, Svenja Huntemann, Trent G. Marbach
2024· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Graphs and Trees
Tom Jenkyns, Ben Stephenson
2012· book-chapter· en· Undergraduate topics in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On triangulating k-outerplanar graphs
Thérèse Biedl
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
EULERIAN AND BIPARTITE ORIENTABLE MATROIDS
Laura E. Chávez Lomelí, Luis Goddyn
2007· book-chapter· en· Oxford University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Hamiltonicity of transformation graph G
Lingyan Zhen, Baoyindureng Wu
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
The Complexity of Two Colouring Games
Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
2022· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About