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

affno abstractunlabeled
Maximizing edge-ratio is NP-complete
Steven D. Noble, Pierre Hansen, Nenad Mladenović
2011· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Path Extendability and Degree Sum in Graphs.
Jianglu Wang, You Hai-yan
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Branch width and well-quasi-ordering in matroids and graphs
Jim Geelen, A.M.H. Gerards, Geoff Whittle
2000· article· en· Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On the Density of C7-Critical Graphs
Luke Postle, Evelyne Smith‐Roberge
2022· preprint· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Maximum Flows on Disjoint Paths
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Constructing Geometric Graphs of Cop Number Three
Seyyed Aliasghar Hosseini, Masood Masjoody, Ladislav Stacho
2018· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Efficient Domination in Grid Graphs
Kevin R. Hutson, Stephen T. Hedetniemi
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Neighbourly regular strength of a graph.
Selvam Avadayappan, M. Muthuchelvam
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affno abstractunlabeled
Planar k-NodeTrix Graphs: A New Family of Beyond Planar Graphs
Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini
2017· article· en· Graph Drawing E-print Archive (Die Universität zu Köln)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Graph Search Techniques
Boting Yang
2011· other· en· Wiley Encyclopedia of Operations Research and Management Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Extremal Size In Graphs With Bounded Degree.
Krystyna T. Balińska, Louis V. Quintas, Krzysztof T. Zwierzyński
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
THE UPPER OPEN GEODETIC NUMBER OF A GRAPH
A. P. Santhakumaran
2012· article· sr· Зборник радова Економског факултета у Источном Сарајеву· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Stable Well-Covered Graphs.
Erika L. C. King
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
The equitable non-split domination number of graphs
Samuel Jebisha Esther, Valiyaveettil Abdul Naseema, J. Veninstine Vivik
2024· article· en· Mathematics in Applied Sciences and Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Matroids denser than a clique
Jim Geelen, Peter Nelson
2015· preprint· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Almost all 5-regular graphs have a 3-flow
Paweł Prałat, Nick Wormald
2015· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Domination In The Cross Product Of Digraphs.
Ľudovít Niepel, Martin Knor
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
The one-visibility localization game
Anthony Bonato, Trent G. Marbach, Michael Molnar, JD Nir
2023· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Two-Dimensional Bandwidth of Graphs.
Jianxiu Hao
2005· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Continuous Yao Graphs
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen +2 more
2014· article· en· University of Southern Denmark Research Portal (University of Southern Denmark)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About