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 49 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
Heterogeneous Graph
Reda Alhajj, Jon Rokne
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
List homomorphisms to separable signed graphs
Jan Bok, R.L. Brewster, Pavol Hell, Nikola Jedličková
2024· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Efficiently Enumerating Spanning Trees of <i>k</i> -Trees
Muhammad Nur Yanhaona, Rahnuma Islam Nishat, Md. Saidur Rahman
2025· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Idealness of k-wise Intersecting Families
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
2020· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
simplicity index of tournaments
Abderrahim Boussaïri, Soufiane Lakhlifi, Imane Talbaoui
2022· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Asteroids in rooted and directed path graphs
Kathie Cameron, Chı́nh T. Hoàng, Benjamin Lévêque
2008· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundvenueunlabeled
The search for N-e.c. graphs
Anthony Bonato
2009· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Dominating cycles in triangle-free graphs.
Kenta Ozeki, Tomoki Yamashita
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Monochromatic Connectivity in Monochromatic-Star-Free Graphs
Colton Magnant, Pouria Salehi Nowbandegani
2016· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Inapproximability of treewidth and related problems
Yu Wu, Per Austrin, Toniann Pitassi, David Liu
2015· article· en· International Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Frozen Colourings in $2K_2$-free graphs
Manoj Belavadi, Kathie Cameron, Elias Hildred
2025· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Minimum Cost Homomorphisms with Constrained Costs
Pavol Hell, Mayssam Mohammadi Nevisi
2016· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On (l, m)-Walk-regular Digraphs.
Wen Liu
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About