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

affunlabeled
Inverse domination number of a graph: a survey
S. R. Jayaram, M. A. Sriraj, P. Siva Kota Reddy
2025· article· Boletim da Sociedade Paranaense de Matemática· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Domination by Union of Complete Graphs.
Vladimir Samodivkin
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Veto Interval Graphs and Variations
Breeann Flesch, Jessica Kawana, Joshua D. Laison, Dana Lapides, Stephanie Partlow, Gregory J. Puleo
2025· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Two Tallest Trees
Francis Blessington
2017· article· en· Dalhousie review· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Stable 2-pairs and (X,Y)-intersection graphs
Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski
2001· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Colourful transversal theorems
Déborah Oliveros, Luis Montejano
2008· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On 3-Coloring of $$(2P_4,C_5)$$-Free Graphs
Vít Jelínek, Tereza Klimošová, Tomáš Masařík, Jana Novotná, Aneta Pokorná
2021· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Minimum Consistent Subset in Trees and Interval Graphs
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K M +3 more
2024· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On the nullity number of graphs
Mustapha Aouchiche, Pierre Hansen
2016· article· fr· DOAJ (DOAJ: Directory of Open Access Journals)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On the Complexity of Embedding in Graph Products
Thérèse Biedl, David Eppstein, Torsten Ueckerdt
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On Weak Flexibility in Planar Graphs
Bernard Lidický, Tomáš Masařík, Kyle Murphy, Shira Zerbib
2022· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Algorithms in the W-Hierarchy
Jonathan F. Buss, Tarique Islam
2007· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About