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

fundvenueno affunlabeled
Generalized CPR-graphs and applications
Daniel Pellicer, Asia Ivić Weiss
2010· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Notes on Growing a Tree in a Graph
Luc Devroye, Vida Dujmović, Alan Frieze, Abbas Mehrabian, Pat Morin, Bruce Reed
2017· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
The polychromatic domination number
B. Claiborne, N.E. Clarke, Ruth Haas, Steve Hanson, M. Harris, K. Martinz +2 more
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Degree-Similar Graphs
Chris Godsil, Wanting Sun
2025· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Density of 3‐critical signed graphs
Laurent Beaudou, Penny Haxell, Kathryn Nurse, Sagnik Sen, Zhouningxin Wang
2024· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Bounded diameter arboricity
Martin Merker, Luke Postle
2018· preprint· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Stability for UMAP
John F. Jardine
2020· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
The {2}-domination in rooted product graphs
K.S. Kim
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Planar Lattice Subsets with Minimal Vertex Boundary
Radhika Gupta, Ivan Levcovitz, Alexander Margolis, Emily Stark
2021· preprint· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Tree Covers of Graphs and their Linear Preservers
LeRoy B. Beasley
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Backward edge-preserving maps between graphs
Yur-Liubomysl Dekhtiar, Sergiy Kozerenko
2025· article· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
A Study of $k$-dipath Colourings of Oriented Graphs
Christopher Duffy, Gary MacGillivray, Éric Sopena
2018· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Colourfully panconnected subgraphs II.
Douglas R. Woodall
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundvenueunlabeled
Bounds for the m -Eternal Domination Number of a Graph
Michael A. Henning, William F. Klostermeyer, Gary MacGillivray
2017· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Clustered Colouring of Graph Products
Rutger Campbell, J. Pascal Gollin, Kevin Hendrey, Thomas Lesgourgues, Bojan Mohar, Youri Tamitegama +2 more
2025· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
The Total Acquisition Number of Random Graphs
Deepak Bal, Patrick Bennett, Andrzej Dudek, Paweł Prałat
2016· preprint· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Two families of graphs that are not CCE-orientable
David Fisher, Suh-Ryung Kim, Chang-Hoon Park, Yunsun Nam
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Price of Order
Prosenjit Bose, Pat Morin, André van Renssen
2016· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Equality Perfect Graphs and Digraphs
Stephan Dominique Andres
2020· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Homomorphically Full Oriented Graphs
Thomas Bellitto, Christopher Duffy, Gary MacGillivray
2023· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Disjoint dominating sets with a perfect matching
William F. Klostermeyer, Margaret-Ellen Messinger, Alejandro Angeli Ayello
2017· preprint· en· Discrete Mathematics Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
EPG-representations with Small Grid-Size
Thérèse Biedl, Martin Derka, Vida Dujmović, Pat Morin
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Sidorenko‐Type Inequalities for Pairs of Trees
Natalie Behague, Gabriel Crudele, Jonathan A. Noel, Lina M. Simbaqueba
2025· article· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About