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 38 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 affno abstractunlabeled
On heroes in digraphs with forbidden induced forests
Alvaro Carbonero, Hidde Koerts, Benjamin Moore, Sophie Spirkl
2024· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Group Connectivity in 3-Edge-Connected Signed Graphs
Alejandra Brewer Castano, Jessica McDonald, Kathryn Nurse
2025· article· en· SIAM Journal on Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Distance-Restricted Firefighting on Finite Graphs
A. E. Burgess, John Hawkin, Alexander Howse, John Marcoux, David A. Pike
2024· preprint· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Corrigendum: Orthogonal Tree-Decompositions of Graphs
Vida Dujmović, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
2024· erratum· en· SIAM Journal on Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affaboutunlabeled
Those Ubiquitous Cut Polyhedra
David Avis
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
List Partitions
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
A note on inverting the dijoin of oriented graphs
Natalie Behague, Tom Johnston, Natasha Morrison, Shannon N. Ogden
2024· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Complete bipartite free graphs.
M. Cera, A. Diánez, P. García‐Vázquez, J.C. Valenzuela
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Signed cycle domination numbers of digraphs.
Meng Wei, Shengjia Li, Qiaoping Guo, Yubao Guo
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Small Chvatal rank
Tristram Bogart, Annie Raymond, Rekha R. Thomas
2007· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Signed edge k-subdomination numbers in graphs.
Abdollah Khodkar, Reza Saei, Seyed Mahmoud Sheikholeslami
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The monophonie detour hull number of a graph
A. P. Santhakumaran, T. Jebaraj, S.V.U.c Chandran
2013· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Mixed k-rainbow domination numbers in graphs
Jafar Amjadi, Lutz Volkmann, Nasrin Dehgardi, A. Parnian, Seyed Mahmoud Sheikholeslami
2018· article· en· Utilitas Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Net Tape Graphs
M. El-Ghoul, H. El-Zohny, Muayyad Mahmood Khalil
2011· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Eternal k-domination on graphs.
Danielle Cox, Erin Meger, Margaret-Ellen Messinger
2021· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Throttling for the game of Cops and Robbers on graphs
Jane Breen, Boris Brimkov, Joshua Carlson, Leslie Hogben, K. E. Perry, Carolyn Reinhart
2018· preprint· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Total E¢ cient Dominating Sets in Cayley Graphs
Joe DeMaio
2014· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Graph Colouring and Decomposition
Mehrnoosh Javarsineh
2023· dissertation· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
QCSP on Reflexive Tournaments
Benoît Larose, Petar Marković, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Živný
2021· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About