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
Computational Geometry and Mesh Generation
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.

1,616 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.
1,616 works in the cohort · of 4,299,418page 1 of 33

Labels cover 0 of 1,616 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 1,616 of 1,616 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
Geometric Spanner Networks
Giri Narasimhan, Michiel Smid
2007· book· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
520
citations
afffundunlabeled
Tetrahedral meshing in the wild
Yixin Hu, Qingnan Zhou, Xifeng Gao, Alec Jacobson, Denis Zorin, Daniele Panozzo
2018· article· en· ACM Transactions on Graphics· Computer Science
machine prediction:candidate · noneconsensus · none
251
citations
affunlabeled
Spectral Mesh Processing
Hao Zhang, Oliver van Kaick, Ramsay Dyer
2010· article· en· Computer Graphics Forum· Computer Science
machine prediction:candidate · noneconsensus · none
211
citations
affno abstractunlabeled
An Incidence Theorem in Higher Dimensions
József Solymosi, Terence Tao
2012· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
120
citations
affno abstractunlabeled
Generalized cover-free families
D. R. Stinson, R. Wei
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
99
citations
affno abstractunlabeled
Flips in planar graphs
Prosenjit Bose, Ferrán Hurtado
2008· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
91
citations
affno abstractunlabeled
Polygon Decomposition
Julian Keil
2000· book-chapter· en· Elsevier eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
82
citations
affno abstractunlabeled
Efficient visibility queries in simple polygons
Prosenjit Bose, Anna Lubiw, J. Ian Munro
2002· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
81
citations
affunlabeled
Computing layouts with deformable templates
Chi‐Han Peng, Yong‐Liang Yang, Peter Wonka
2014· article· en· ACM Transactions on Graphics· Computer Science
machine prediction:candidate · noneconsensus · none
80
citations
affno abstractunlabeled
On the Spanning Ratio of Gabriel Graphs and β-skeletons
Prosenjit Bose, Luc Devroye, William Evans, David Kirkpatrick
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
77
citations
afffundno abstractunlabeled
A survey of geodesic paths on 3D surfaces
Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer
2011· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
76
citations
affno abstractunlabeled
Ununfoldable polyhedra with convex faces
Marshall Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
2002· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
affno abstractunlabeled
Efficient Algorithms for Petersen's Matching Theorem
Thérèse Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
2001· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
affno abstractunlabeled
On the Parameterized Complexity of Layered Graph Drawing
Vida Dujmović, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura +4 more
2007· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
64
citations
next →

How this was built: Screen · Findings · About