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

affno abstractunlabeled
Minimum opaque manifolds
Daniel Asimov, Joseph L. Gerver
2008· article· ceb· Geometriae Dedicata· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
7
citations
affno abstractunlabeled
Constructions from empty polygons
Tibor Bisztriczky, Kiyoshi Hosono, Gyula K�rolyi, Masatsugu Urabe
2004· article· en· Periodica Mathematica Hungarica· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
A vertex-face assignment for plane graphs
Diane L. Souvaine, Csaba D. Tóth
2008· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Crossings in Grid Drawings
Vida Dujmović, Pat Morin, Adam Sheffer
2014· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2010· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Morphing Schnyder Drawings of Planar Triangulations
Fidel Barrera-Cruz, Penny Haxell, Anna Lubiw
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations
affunlabeled
Multi-pass geometric algorithms
Timothy M. Chan, Eric Chen
2005· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel Smid
2019· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
7
citations
affno abstractunlabeled
Matrix identities and the pigeonhole principle
Michael Soltys, Alasdair Urquhart
2004· article· en· Archive for Mathematical Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Morphing Planar Graph Drawings with Bent Edges
Anna Lubiw, Mark Petrick
2008· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
DHFSlicer
Jinfan Yang, Chrystiano Araújo, Nicholas Vining, Zachary Ferguson, Enrique Rosales, Daniele Panozzo +3 more
2020· article· en· ACM Transactions on Graphics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Convex partitions with 2-edge connected dual graphs
Marwan Al-Jubeh, Michael M. Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
2010· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Algorithms for computing diffuse reflection paths in polygons
Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2012· article· en· The Visual Computer· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Incidence Theorems for Pseudoflats
Izabella Łaba, József Solymosi
2007· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
venueno affunlabeled
On \({k}\)-Dyck Paths with a Negative Boundary
Helmut Prodinger
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Relaxed gabriel graphs
Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian +1 more
2009· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
A New Paradigm for Woodworking with NC Machines
Craig S. Kaplan, Sanjeev Bedi, Stephen Mann, Gilad Israeli, Gilbert Poon
2004· article· en· Computer-Aided Design and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Three problems about simple polygons
Timothy M. Chan
2006· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
A note on the perimeter of fat objects
Prosenjit Bose, Otfried Cheong, Vida Dujmović
2010· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
← previousnext →

How this was built: Screen · Findings · About