MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 34 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
On the (r, s) domination number of a graph.
Alewyn P. Burger, Jan H. van Vuuren
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Tree Independence Number IV. Even-hole-free graphs
Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl
2025· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Locating any two vertices on Hamiltonian cycles
Hao Li, Weihua He, Qiang Sun
2018· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Acyclic Chromatic Index of 1-Planar Graphs
Wanshun Yang, Yiqiao Wang, Weifan Wang, Juan Liu, Stephen Finbow, Ping Wang
2022· article· en· Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
A Fast Minimum Degree Algorithm and Matching Lower Bound
Robert Cummings, Matthew Fahrbach, Animesh Fatehpuria
2021· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On r-(k)-pancyclic Graphs.
Shaoqiang Liu
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Corrigendum: Orthogonal Tree Decompositions of Graphs
Vida Dujmović, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood
2018· erratum· en· SIAM Journal on Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Defensive alliances in regular graphs.
Gabriela Araujo‐Pardo, Lali Barrière
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Well paired-dominated graphs
Shannon L. Fitzpatrick, Bert L. Hartnell
2008· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
The cyclical scheduling problem
Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti
2014· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
On domination polynomials of some graphs
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Broadcasting in Stars of Cliques
Akash Ambashankar, Hovhannes A. Harutyunyan
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Pure Pairs. VIII. Excluding a Sparse Graph
Alex Scott, Paul Seymour, Sophie Spirkl
2024· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Even time constraints on the watchman's walk.
Iain Beaton, Rory Begin, Stephen Finbow, Christopher M. van Bommel
2013· article· en· Australas. J Comb.· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
A Genus Inequality Of The Union Graphs.
Jianchu Zeng, Yanpei Liu
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
aboutno affno abstractunlabeled
A NOTE ON QUARTER-SYMMETRIC METRIC CONNECTIONS
Shantanu Rastogi
2015· article· en· DOAJ (DOAJ: Directory of Open Access Journals)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
A Note on Dominating Cycles in Tough Graphs.
Akira Saito, Tomoki Yamashita
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Dynamic vs Oblivious Routing in Network Design
Navin Goyal, Neil Olver, F. Bruce Shepherd
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Edge-colouring graphs with local list sizes
Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle
2020· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Doubly Exponentially Many Ingleton Matroids
Peter Nelson, Jorn van der Pol
2018· preprint· en· SIAM Journal on Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The Modified Negative Decision Number in Graphs
Changping Wang
2011· article· en· International Journal of Mathematics and Mathematical Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Hamiltonicity of $k$-Traceable Graphs
Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan Van Aardt
2011· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
γ-Graphs of Trees
2019· article· en· Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Size, Order, and Connected Domination
Simon Mukwembi
2013· article· en· Canadian Mathematical Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About