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

afffundunlabeled
Robust Connectivity of Graphs on Surfaces
Peter Bradshaw, Tomáš Masařík, Jana Novotná, Ladislav Stacho
2022· article· en· SIAM Journal on Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Between ends and fibers
C. Paul Bonnington, R. Bruce Richter, Mark E. Watkins
2006· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Cycle and cocycle coverings of graphs
Sean McGuinness
2010· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Dynamic Graph Coloring
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen +1 more
2017· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Maximum Number of Colourings: 5-Chromatic Case
Fiachra Knox, Bojan Mohar
2019· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Chordal Graphs
Broderick Arneson, Piotr Rudnicki
2006· article· en· Formalized Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Long Cycles in 2-Connected Triangle-Free Graphs.
Douglas C. Bauer, Nathan Kahl, Linda E. McGuire, E. F. Schmeichel
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Zero-forcing in random regular graphs
Deepak Bal, Patrick Bennett, Sean English, Calum MacRury, Paweł Prałat
2021· article· en· Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Irredundance graphs
Christina M. Mynhardt, Adriana Roux
2022· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The plane-width of graphs
2011· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Minus Edge Domination in Graphs.
Min Zhao, Erfang Shan
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
On Infinite-finite Duality Pairs of Directed Graphs
Péter L. Erdős, Gábor Tardos
2013· article· en· Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Tuza's Conjecture for Threshold Graphs
Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná +1 more
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Computing the One-Visibility Copnumber of Trees
Boting Yang, Tanzina Akter
2020· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Complements of nearly perfect graphs
2013· article· en· Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
On the rainbow connection number of graphs.
Gideon Dror, Arieh Lev, Y. Roditty, Romina Zigdon
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Logics with Counting
Leonid Libkin
2004· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Strong Geodetic Number in Some Networks
Huifen Ge, Zhao Wang, Jinyu Zou
2019· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Semilattice polymorphisms and chordal graphs
Pavol Hell, Mark Siggers
2013· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Vertex partitioning and p-energy of graphs
Saieed Akbari, Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada
2025· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
A Note on $$\Delta $$-Critical Graphs
Penny Haxell, Reza Naserasr
2023· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Cops and Robbers on 1-Planar Graphs
Stéphane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller +3 more
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About