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
Computational Geometry
Topic
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.

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

Labels cover 1 of 236 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 236 of 236 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.

afffundno abstractunlabeled
Computing contour trees in all dimensions
Hamish Carr, Jack Snoeyink, Ulrike Axen
2002· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
460
citations
afffundno abstractunlabeled
Planar minimally rigid graphs and pseudo-triangulations
Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius +3 more
2004· article· en· Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
94
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
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
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
afffundno abstractunlabeled
Curve-constrained drawings of planar graphs
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen Wismath
2004· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
affno abstractunlabeled
Compatible geometric matchings
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo Garcı́a, Clemens Huemer, Ferrán Hurtado +7 more
2009· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affno abstractunlabeled
Computing homotopic shortest paths efficiently
Alon Efrat, Stephen Kobourov, Anna Lubiw
2006· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
affno abstractunlabeled
The one-round Voronoi game replayed
Sándor P. Fekete, Henk Meijer
2004· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affno abstractunlabeled
Expected time analysis for Delaunay point location
Luc Devroye, Christophe Lemaire, Jean-Michel Moreau
2004· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Weighted straight skeletons in the plane
Thérèse Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader
2014· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
On simplifying dot maps
Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin
2003· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Graph drawings with few slopes
Vida Dujmović, Matthew Suderman, David R. Wood
2006· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
afffundno abstractunlabeled
Linear reconfiguration of cube-style modular robots
Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatland, Stefan Langerman +4 more
2008· article· en· Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
39
citations
afffundno abstractunlabeled
Fréchet distance with speed limits
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2010· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Graphs that admit right angle crossing drawings
Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Morić, Csaba D. Tóth
2011· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Space-efficient geometric divide-and-conquer algorithms
Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel Smid, Jan Vahrenhold
2006· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Encompassing colored planar straight line graphs
Ferrán Hurtado, Mikio Kanō, David Rappaport, Csaba D. Tóth
2007· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
The projection median of a set of points
Stéphane Durocher, David Kirkpatrick
2008· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Tight degree bounds for pseudo-triangulations of points
Lutz Kettner, David Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
2003· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Polygons cuttable by a circular saw
Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
2001· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
next →

How this was built: Screen · Findings · About