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 44 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 affunlabeled
Domination Value in Graphs
Eunjeong Yi
2012· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
A note on plane trees with decreasing labels
Luc Devroye, Marcel K. Goh
2025· article· en· Online Journal of Analytic Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Proximity graphs inside large weighted graphs
Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández‐Merchant, David Flores Peñaloza, Henk Meijer, Vera Sacristán Adinolfi +1 more
2012· article· en· Networks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundvenueunlabeled
Permutations avoiding connected graphs
Norbert Sauer, Imed Zaguia
2017· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Connected domination dot-critical graphs
Mustapha Chellali, Frédéric Maffray, Kamel Tablennehas
2010· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
The Bondage Number of Random Graphs
Dieter Mitsche, Xavier Pérez‐Giménez, Paweł Prałat
2016· preprint· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On Density-Critical Matroids
2020· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Carathéodory Number of P 3 -Convexity of Claw-Free Graphs
Athulyakrishna Kuruppankandy, T. V. Ramakrishnan, Manoj Changat
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundvenueno affunlabeled
Eternal distance-2 domination in trees
Alexander Clow, Christopher van Bommel
2025· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affvenueunlabeled
The 2 -burning Number of a Graph
Catherine Jacobs, Margaret-Ellen Messinger, Ann N. Trenk
2024· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
An Addendum to Trees
George Tourlakis
2024· book-chapter· en· Synthesis lectures on mathematics and statistics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Edges and Cycles
Sebastian M. Cioabă, M. Ram Murty
2022· book-chapter· en· Texts and readings in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Finding Optimal Solutions with Neighborly Help
Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner
2024· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
New BSP/CGM algorithms for spanning trees
Jucele Vasconcellos, Edson N. Cáceres, Henrique Mongelli, Siang Wun Song, Frank Dehne, Jayme L. Szwarcfiter
2018· article· en· The International Journal of High Performance Computing Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Fold‐2‐covering triangular embeddings
Dominique Bénard, A. Bouchet, R. Bruce Richter
2003· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
A cop-winning strategy on strongly cop-win graphs
Josée Desharnais, François Laviolette, Héli Marcoux, Norbert Polat
2023· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Leaf Stripping on Uniform Attachment Trees
Louigi Addario‐Berry, Anna Brandenberger, Simon Briend, Nicolas Broutin, Gábor Lugosi
2025· article· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Hamiltonicity of covering graphs of trees
Peter Bradshaw, Zhilin Ge, Ladislav Stacho
2024· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Time-Varying Graphs
Reda Alhajj, Jon Rokne
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Induced forests in some distance-regular graphs
Karen Gunderson, Karen Meagher, Joy Morris, Venkata Raghu Tej Pantangi
2023· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Sparsity of 3-flow-critical graphs
Zdenĕk Dvořák, Sergey Norin
2025· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About