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 32 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
Edge domination in grids
William F. Klostermeyer, Anders Yeo
2015· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
A conjecture of Welsh revisited
Sean McGuinness
2010· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Generalized domination structure in cubic graphs
Misa Nakanishi
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Universal Graphs for Two Graph Properties.
Izak Broere, Tomáš Vetrík
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Starred Italian domination in graphs
Abel Cabrera Martínez
2021· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Separable and equatable hypergraphs
Daniel Deza, Shmuel Onn
2023· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On the restricted Hanoi graphs
El-Mehdi Mehiri
2024· article· en· The Art of Discrete and Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
New Families of Sequential Graphs.
Shung-Liang Wu
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Introducing 3-Path Domination in Graphs
Rayan Ibrahim, Rebecca Jackson, Erika L. C. King
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Pairs of disjoint matchings and related classes of graphs
Huizheng Guo, Kieran Kaempen, Zhengda Mo, Sam Qunell, Joe Rogge, Chao Song +2 more
2023· article· en· Involve a Journal of Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Open graphs and Tukey order
Stevo Todorčević
2025· article· lv· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
On the multipacking number of grid graphs
Laurent Beaudou, Richard C. Brewster
2019· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Disjoint cycles in directed graphs.
Jin Yan
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affvenueunlabeled
Confining the robber on cographs
Masood Masjoody
2023· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Average distance in k-connected tournaments.
Peter Dankelmann, Lutz Volkmann
2005· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Generating Weakly Chordal Graphs from Arbitrary Graphs
Sudiksha Khanduja, Aayushi Srivastava, Md. Zamilur Rahman, Asish Mukhopadhyay
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Graphs with Induced-Saturation Number Zero
Sarah Behrens, Catherine Erbes, Michael Santana, Derrek Yager, Elyse Yeager
2016· preprint· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Rayleigh Matroids
YoungBin Choe, David G. Wagner
2003· article· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Irredundance trees of diameter 3
Christina M. Mynhardt, Adriana Roux
2022· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Fractional edge and total colouring
W. Sean Kennedy
2012· dissertation· en· eScholarship@McGill (McGill)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Grid Minors and Products
Vida Dujmović, Pat Morin, David R. Wood, David Worley
2025· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Perfect coalition in graphs
Doost Ali Mojdeh, Mohammad Reza Samadzadeh
2025· article· en· Electronic Journal of Graph Theory and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About