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

fundaboutno affunlabeled
Decycling and dominating cubes and grids
Yubo Zou
2006· dissertation· en· Memorial University Research Repository (Memorial University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Relations: Especially on (Integer) Sequences
Tom Jenkyns, Ben Stephenson
2012· book-chapter· en· Undergraduate topics in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Inequalities
Andy Liu
2017· book-chapter· en· Springer texts in education· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Largest Small Octagon
Charles Audet, Pierre Hansen, Frédéric Messine, Junjie Xiong
2001· article· fr· PolyPublie (École Polytechnique de Montréal)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Note On odd path extendable graphs.
Hong Lin
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Sorting Networks On Restricted Topologies
Avah Banerjee, Dana Richards, Igor Shinkar
2016· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Packing Steiner Trees
Matt DeVos, Jessica McDonald, Irene Pivotto
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/b978-044488002-4/50011-7
2000· book-chapter· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
afffundno abstractunlabeled
A new proof of Seymour's 6-flow theorem
Matt DeVos, Edita Rollová, Robert Šámal
2016· preprint· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Hats of Wheel Are Sequential Graph
Xiaoquan Ding
2000· article· en· Journal of Huaibei Industry Teachers College· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Reconfiguration of Dominating Sets
Akira Suzuki, Amer E. Mouawad, Naomi Nishimura
2014· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Peripheral circuits in infinite binary matroids
Nathan Bowler, Robin Christian, R. Bruce Richter
2018· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Enumerations of Unlabelled Multigraphs.
Huaien Li, David C. Torney
2005· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On Strong Biclique Covering.
Shahzad Basiri
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Walk Regular Digraphs.
Wen Liu, Jing Lin
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Uniquely colorable graphs on surfaces
Naoki Matsumoto, Kenta Noguchi
2014· article· fr· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Dominating circuits in regular matroids
Sean McGuinness
2013· article· en· Advances in Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Lexicographic Orientation Algorithms
Jing Huang
2018· book-chapter· en· Springer monographs in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Nim On The Complete Graph.
Lindsay Merchant
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Graph products and classes
Anthony Bonato, Richard J. Nowakowski
2011· book-chapter· en· Student mathematical library· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the {4, -k}-hypomorphy for digraphs.
Jamel Dammak
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On the Zombie Number of Various Graph Classes
Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Paths in the Square Unit Lattice.
Jack Abad, Paul Abad, Victor Abad, W. O. J. Moser
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Ordered interval routing schemes
Mustaq Ahmed
2009· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Graph covers using t-colourable vertex sets
Sylvain Gravier, Jeannette Janssen, K. Kilakos, Sulamita Klein
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On fractional (g, f, n)-critical graphs.
Hongxia Liu, Guizhen Liu
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Eternal domination on prisms of graphs
Aaron Krim-Yee, Ben Seamone, Virgélot Virgile
2020· preprint· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
A survey on flows in graphs and matroids
Bertrand Guenin
2015· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Homomorphisms of random paths
Gábor Kun, Claude Tardif
2009· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About