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 45 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
A note on critical sets
J. A. Bate, Glynda Rees, Manitoba Canada R
2002· article· es· Australas. J Comb.· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The interval constrained 3-coloring problem
Jarosław Byrka, Andreas Karrenbauer, Laura Sanità
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Stratified Graphs and Distance Graphs.
Sarah Spence Adams
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The signed cycle domatic number of a graph
Ruixia Wang, Meng Wei
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On edge contractible graphs.
Hong Lin, Lin Yu
2017· article· ceb· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Subgraphs And Similarity Of Vertices.
Saravanabalagi Ramachandran, P. Bhanumathy
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On Cops and Robbers on G Ξ and cop-edge critical graphs
Domingos M. Cardoso, Charles Dominic, Łukasz Witkowski, Marcin Witkowski
2017· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Subgraphs of 4-Regular Planar Graphs
Chris Dowden, Louigi Addario‐Berry
2010· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Note of k-Rotation Graphs.
Erich Prisner
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Słupecki digraphs
Ádám Kunos, Benoît Larose, David Emmanuel Pazmiño Pullas
2025· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Finding a Sun in Building-Free Graphs
Elaine M. Eschen, Chı́nh T. Hoàng, Jeremy Spinrad, R. Sritharan
2011· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
On the 3-tree core of plane graphs
Debajyoti Mondal, Md. Saidur Rahman
2025· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Illuminating a Graph
Wayne Goddard, Deirdre LaVey
2024· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On i-minus-Edge-Removal-critical graphs
E. J. Cockayne, Odile Favaron, Christina M. Mynhardt
2000· article· en· Electronic Notes in Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Eternally surrounding a robber
Nancy E. Clarke, Danny Dyer, William Kellough
2025· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About