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

venueno affno abstractunlabeled
The cordiality of the complement of a graph.
Liping Xu, Zhishan Liu, Li Zhi
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Eccentric Coloring of a Graph
Medha Itagi Huilgol, S. Syed Asif Ulla
2015· article· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Tree Independence Number IV. Even-hole-free Graphs
Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl
2024· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Game Brush Number
William B. Kinnersley, Paweł Prałat
2014· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
A study on roman domination lower deg-centric graphs
Timmy Tomy Thalavayalil
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Colourings of $(m, n)$-coloured mixed graphs
Gary MacGillivray, Shahla Nasserasr, Feiran Yang
2025· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On the connected coalition number of graphs
Xiaxia Guan, Maoqun Wang
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Star chromatic number of some graphs
Saieed Akbari, M. Chavooshi, M. Ghanbari, S. Taghian
2021· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
The domatic number game played on graphs
Bert L. Hartnell, Douglas F. Rall
2025· article· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Semisymmetric Graphs from Polytopes
Barry Monson, Tomaž Pisanski, Egon Schulte, Asia Ivić Weiss
2006· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
3-Trees with Diameter 2
Allan Bickle
2024· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Realizing the Asymmetric Index of a Graph
Emma Farnsworth, Natalie Gomez, Herlandt Lino, Rigoberto Flórez, Brendan Rooney, Darren A. Narayan
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Colouring stability two unit disk graphs
Henning Bruhn
2014· article· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
An Extremal Problem Resulting in Many Paths.
R. H. Schelp, Kiyoshi Yoshimoto
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Weakening arcs in tournaments
Denis Hanson, J. W. Moon
2003· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Restrained Roman Edge Domination in Graphs
G. Srinivasa, Anil R. Sedamkar, Jayant Giri, Abdullah Alqammaz, Rajkumar Chadge
2025· book-chapter· en· Studies in systems, decision and control· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Upper signed k-domination number in graphs.
Zhou Ligang, Erfang Shan, Yancai Zhao
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About