MétaCan
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.

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 2 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
Moving coins
Manuel Abellanas, Sergey Bereg, Ferrán Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
2005· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Computing a visibility polygon using few variables
Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira
2014· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Editorial
2001· editorial· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Watchman tours for polygons with holes
Adrian Dumitrescu, Csaba D. Tóth
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
fundno affno abstractunlabeled
Geometric permutations of disjoint unit spheres
Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na
2004· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Point-set embeddings of trees with given partial drawings
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2009· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Drawing planar 3-trees with given face areas
Thérèse Biedl, Lesvia Elena Ruiz Velázquez
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Reconfiguring convex polygons
Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferrán Hurtado, Mark Overmars, Michael Soss +1 more
2001· article· en· Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Bichromatic compatible matchings
Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine
2014· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
The distance geometry of music
Erik D. Demaine, Francisco Gómez, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint +2 more
2008· book-chapter· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
On point-sets that support planar graphs
Vida Dujmović, William Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport +1 more
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
afffundno abstractunlabeled
Fast and compact planar embeddings
Leo Ferres, José Fuentes‐Sepúlveda, Travis Gagie, Meng He, Gonzalo Navarro
2020· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Data structures for range-aggregate extent queries
Prosenjit Gupta, Ravi Janardan, Yokesh Kumar, Michiel Smid
2013· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Approximate range searching in higher dimension
Bernard Chazelle, Ding Liu, Avner Magen
2007· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Similarity of polygonal curves in the presence of outliers
Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2014· article· en· Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Efficient reconfiguration of lattice-based modular robots
Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Flatland, John Iacono +1 more
2013· article· en· Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
When can a net fold to a polyhedron?
Thérèse Biedl, Anna Lubiw, Julie Sun
2005· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Grid drawings of k-colourable graphs
David R. Wood
2004· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Some properties of k-Delaunay and k-Gabriel graphs
Prosenjit Bose, Sébastien Collette, Ferrán Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán +1 more
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Equitable subdivisions within polygonal regions
Sergey Bereg, Prosenjit Bose, David Kirkpatrick
2005· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Translating a regular grid over a point set
Prosenjit Bose, Marc van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison
2003· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
Theta-3 is connected
2014· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Small weak epsilon-nets
Boris Aronov, Franz Aurenhammer, Ferrán Hurtado, Stefan Langerman, David Rappaport, Carlos Seara +1 more
2009· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Distance k-sectors exist
Keiko Imai, Akitoshi Kawamura, Jiřı́ Matoušek, Daniel Reem, Takeshi Tokuyama
2010· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Making triangulations 4-connected using flips
Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Geometric spanners with small chromatic number
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel Smid, Norbert Zeh
2008· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Stable Roommates Spanner
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations

How this was built: Screen · Findings · About