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 37 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
Error-Correcting Graph Codes
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Cops and robbers pebbling in graphs
Joshua Forkin, Glenn Hurlbert
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Pebbles and Branching Programs for Tree Evaluation
Stephen Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam
2010· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Chapter 10: Normal Cones
Heinz H. Bauschke, Walaa M. Moursi
2023· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Distance queries over dynamic interval graphs
Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, D. Zhang
2024· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Mutualism, Parasitism and Bipartite Graphs
Mark R. T. Dale
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Trend 1961 - 2013. Statistics Canada. CANSIM: Construction - Nonresidential Building Construction | Country: Canada | Table: Flows and stocks of fixed non-residential capital, by sector of North American Industry Classification System (NAICS) and asset | Variable: Geometric (infinite) end-year net stock, Telecommunication equipment (x 1,000,000), Administrative and support, waste management and remediation services, Current prices | Units: $CAD, 1961-2013. Data-Planet™ Statistical Ready Reference by Conquest Systems, Inc. Dataset-ID: 075-001-035.
2015· other· en· Data Planet· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Polychromatic Coloring of Tuples in Hypergraphs
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, Shakhar Smorodinsky, Miloš Stojaković
2025· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Reprint of: Theta-3 is connected
Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen +2 more
2015· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Planar Graphs in Blowups of Fans
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2025· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On 1-Planar Graphs with Bounded Cop-Number
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali
2024· preprint· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Defective acyclic colorings of planar graphs
On‐Hei Solomon Lo, Ben Seamone, Xuding Zhu
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Minimum Size of Matching-Saturated Graphs
Xuechun Zhang, Hong-Liang Lü, Qinglin Yu
2023· preprint· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Disjoint paths in arborescences
Livio Colussi, Michele Conforti, Giacomo Zambelli
2005· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Bond or edge percolation
E J Janse van Rensburg
2000· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Recoloring some hereditary graph classes
Manoj Belavadi, Kathie Cameron
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Cat Herding Game Played on Infinite Trees
2025· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/b978-044488002-4/50007-5
2000· book-chapter· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Matching Theory
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
Convex functions
E J Janse van Rensburg
2000· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About