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 4 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
On full Steiner trees in unit disk graphs
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2015· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Continuous Yao graphs
Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg +4 more
2017· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
α -Visibility
Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri-Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
2013· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Orthogonal layout with optimal face complexity
Md. Jawaherul Alam, Stephen Kobourov, Debajyoti Mondal
2017· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Closest-pair queries in fat rectangles
Sang Won Bae, Michiel Smid
2019· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Minimum rectilinear polygons for given angle sequences
William Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2021· preprint· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Approximate proximity drawings
William Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2013· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Progress on maximum weight triangulation
Jianbo Qian, Cao An Wang
2006· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Bounds for point recolouring in geometric graphs
Henk Meijer, Yurai Núñez-Rodríguez, David Rappaport
2009· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Reprint of: Face-guarding polyhedra
Giovanni Viglietta
2015· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Reprint of: Refold rigidity of convex polyhedra
Erik D. Demaine, Martin L. Demaine, Jin‐ichi Itoh, Anna Lubiw, Chiê Nara, Joseph O’Rourke
2013· article· en· Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Connecting a set of circles with minimum sum of radii
Erin Wolf Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan +2 more
2017· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Refold rigidity of convex polyhedra
Erik D. Demaine, Martin L. Demaine, Jin‐ichi Itoh, Anna Lubiw, Chiê Nara, Joseph O’Rourke
2013· article· en· Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Edge guards for polyhedra in three-space
Javier Cano, Csaba D. Tóth, Jorge Urrutia
2022· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Colouring bottomless rectangles and arborescences
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
2023· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Online class cover problem
Minati De, Anil Maheshwari, Ratnadip Mandal
2024· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Strong matching of points with geometric shapes
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2017· preprint· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Triangulating and guarding realistic polygons
Greg Aloupis, Prosenjit Bose, Vida Dujmović, Chris Gray, Stefan Langerman, Bettina Speckmann
2013· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Guest Editorʼs Introduction
Pat Morin
2013· article· en· Computational Geometry· Social Sciences
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Long proteins with unique optimal foldings in the H-P model
Oswin Aichholzer, David Avis, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael Soss
2003· article· en· Computational Geometry· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
A note on interference in random networks
Luc Devroye, Pat Morin
2017· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Rotationally monotone polygons
Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer
2007· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
The ordinary line problem revisited
Atri Mukhopadhyay, Eugene Greene
2011· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Folding polyominoes with holes into a cube
Oswin Aichholzer, Hugo A. Akitaya, Kenneth Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete +6 more
2020· preprint· en· Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
On path-greedy geometric spanners
William Evans, Lucca Morais de Arruda Siaudzionis
2022· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Matched drawability of graph pairs and of graph triples
Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2010· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Bounds on the edge-length ratio of 2-outerplanar graphs
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen Wismath
2025· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affno abstractunlabeled
On the existence of ordinary triangles
Radoslav Fulek, Hossein Nassajian Mojarrad, Márton Naszódi, József Solymosi, Sebastian U. Stich, May Szedlák
2017· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Bounded-degree polyhedronization of point sets
Gill Barequet, Nadia M. Benbernou, D. G. Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque +5 more
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About