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 23 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Brian Alspach and his work
Joy Morris, Mateja Šajna
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
On the Structure of (Even Hole, Kite)-Free Graphs
Dallas J. Fraser, Angèle M. Hamel, Chı́nh T. Hoàng
2018· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
The firebreak problem
2020· article· en· Networks· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Dualities and Dual Pairs in Heyting Algebras
Jan Foniok, Jaroslav Nešetřil, Aleš Pultr, Claude Tardif
2010· article· en· Order· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
A note on the connected game coloring number
Peter Bradshaw
2023· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
venueno affno abstractunlabeled
Toughness of Generalized Petersen Graphs.
Kevin K. Ferland
2003· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Subdivision and graph eigenvalues
Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada, Hanmeng Zhan
2025· article· en· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Small Chvátal Rank
Tristram Bogart, Annie Raymond, Rekha R. Thomas
2010· article· en· Mathematical Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Interleaved adjoints of directed graphs
Jan Foniok, Jaroslav Nešetřil, Claude Tardif
2011· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
The projective plane is a stabilizer
Jim Geelen, Geoff Whittle
2009· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Total $k$-distance domination critical graphs
Doost Ali Mojdeh, A. Sayed-Khalkhali, H. Abdollahzadeh Ahangar, Yancai Zhao
2016· article· en· DOAJ (DOAJ: Directory of Open Access Journals)· Computer Science
distilled prediction:candidate · scholarly_communication+open_science+insufficient_payloadconsensus · none
3
citations
afffundno abstractunlabeled
2-limited broadcast domination on grid graphs
Aaron Slobodin, Gary MacGillivray, Wendy Myrvold
2023· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
fundno affunlabeled
On the Book Thickness of k-Trees
Vida Dujmović, David R. Wood
2011· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
3
citations
venueno affunlabeled
The number of total dominating sets in binary trees
Opeyemi Oyewumi, Adriana Roux, Stephan Wagner
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Positive Zero Forcing and Edge Clique Coverings
Shaun Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About