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 13 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
The ellipsoid method and its predecessors
Jean‐Louis Goffin
2005· book-chapter· en· Lecture notes in control and information sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
On the dilation spectrum of paths, cycles, and trees
Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel Smid
2009· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
A generalized Winternitz Theorem
Prosenjit Bose, Paz Carmi, Ferrán Hurtado, Pat Morin
2011· article· en· Journal of Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Recurrence of multiply-ended planar triangulations
Ori Gurel-Gurevich, Asaf Nachmias, Juan Souto
2017· article· en· Electronic Communications in Probability· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Bi-Chromatic Minimum Spanning Trees
Magdalene Grantson, Henk Meijer, David Rappaport
2005· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Preface
Ilias Kotsireas, Bernard Mourrain, Victor Y. Pan
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Morphing orthogonal planar graph drawings
Anna Lubiw, Mark Petrick, Michael J. Spriggs
2006· article· en· Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affno abstractunlabeled
A simple, faster method for kinetic proximity problems
Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides, Alireza Zarei
2014· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Dynamic Connectivity for Axis-Parallel Rectangles
Peyman Afshani, Timothy M. Chan
2006· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
afffundunlabeled
A Multi‐layer Solver for XPBD
Alexandre Mercier-Aubin, Paul G. Kry
2024· article· en· Computer Graphics Forum· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
On the visibility graph of convex translates
Kiyoshi Hosono, Henk Meijer, David Rappaport
2001· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Drawing HV-Restricted Planar Graphs
Stéphane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affunlabeled
COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
Peter Braß, Laura Heinrich-Litan, Pat Morin
2003· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Algorithms for Designing Pop-Up Cards
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz +3 more
2013· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affunlabeled
Separating point sets in polygonal environments
Erik D. Demaine, Jeff Erickson, Ferrán Hurtado, John Iacono, Stefan Langerman, Henk Meijer +2 more
2004· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Minimum Weight Convex Steiner Partitions
Adrian Dumitrescu, Csaba D. Tóth
2009· article· en· Algorithmica· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On the red/blue spanning tree problem
Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
Degree four plane spanners: Simpler and better
Iyad Kanj, Ljubomir Perković, Duru Türkoğlu
2017· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
Drawing planar graphs with prescribed face areas
Linda Kleist
2017· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Voronoi Diagrams and Their Uses
Mark L. Burkey, Joyendu Bhadury, H. A. Eiselt
2011· book-chapter· en· International series in management science/operations research/International series in operations research & management science· Computer Science
distilled prediction:candidate · metaepi_narrow+bibliometrics+sts+scholarly_communication+open_science+insufficient_payloadconsensus · sts+open_science
6
citations
← previousnext →

How this was built: Screen · Findings · About