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 47 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
Linear time algorithms on mirror trees
Alain Quilliot, Djamal Rebaïne
2022· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On Colouring Oriented Graphs of Large Girth
P. Mark Kayll, Michael B. Morris
2023· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Simplex Adjacency Graphs in Linear Optimization
Gerard Sierksma, Gert A. Tijssen
2006· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Programming and Testing a Two-Tree Algorithm
Tzvetalin S. Vassilev, Joanna Ammerlaan
2013· article· en· Serdica Journal of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Eternal Distance-k Domination on Graphs
Danielle Cox, Erin Meger, Margaret-Ellen Messinger
2023· article· en· La Matematica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Metric Cutpoint Partition Problem
Alain Hertz, Sacha Varone
2006· article· fr· PolyPublie (École Polytechnique de Montréal)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Improved Outerplanarity Bounds for Planar Graphs
Thérèse Biedl, Debajyoti Mondal
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Signed graphs with the same even cycles
Bertrand Guenin, Cheolwon Heo, Irene Pivotto
2025· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Another proof of Seymour's 6‐flow theorem
Matt DeVos, Jessica McDonald, Kathryn Nurse
2024· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Points and Lines, Graphs and Networks
2025· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
The Grid-Minor Theorem Revisited
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek +3 more
2025· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Broadcasting and Three List Subtraction
Hovhannes A. Harutyunyan, Narek Hovhannisyan
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Existential Closure in Line Graphs
Andrea C. Burgess, Robert D. Luther, David A. Pike
2024· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Transversal polynomial of r-fold covers
Chris Godsil, Krystal Guo, Gordon Royle
2019· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
On some classes of quasi-triangulated graphs
Elaine M. Eschen, Chı́nh T. Hoàng, R. Sritharan
2024· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Local Hadwiger's Conjecture
Benjamin Moore, Luke Postle, Lise Turner
2023· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
NDC Pebbling Number for Some Class of Graphs
A. Lourdusamy, I. Dhivviyanandam, Lian Mathew
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Generating near‐bipartite bricks
Nishad Kothari
2018· preprint· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Local Certification of Geometric Graph Classes
Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean‐Florent Raymond
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Which Graphs Occur as $$\gamma $$-Graphs?
Matt DeVos, Adam Dyck, Jonathan Jedwab, Samuel Simon
2020· preprint· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Bounding Clique-Width via Perfect Graphs
Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2015· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About