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
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 15 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.

affunlabeled
Crossing Numbers of Periodic Graphs
Zdenĕk Dvořák, Bojan Mohar
2015· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
When can a graph form an orthogonal polyhedron
Thérèse Biedl, Burkay Genç
2004· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
The θ 5-Graph is a Spanner
Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
5
citations
affno abstractunlabeled
Spanners of additively weighted point sets
Prosenjit Bose, Paz Carmi, Mathieu Couture
2011· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Optimizing a constrained convex polygonal annulus
Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich
2004· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Queries with segments in Voronoi diagrams
Sergei Bespamyatnikh, Jack Snoeyink
2000· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Matchings in higher-order Gabriel graphs
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Drawing K n in Three Dimensions with One Bend Per Edge
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen Wismath
2006· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affunlabeled
Really Straight Graph Drawings
Vida Dujmović, Matthew Suderman, David R. Wood
2004· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affno abstractunlabeled
Algorithmic enumeration of surrounding polygons
Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
2020· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Weighted Region Problem in Arrangement of Lines
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2013· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Some properties of higher order delaunay and gabriel graphs
Prosenjit Bose, Sébastien Collette, Ferrán Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán +1 more
2010· article· en· RECERCAT (Consorci de Serveis Universitaris de Catalunya)· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Improved Spanning Ratio for Low Degree Plane Spanners
Prosenjit Bose, Darryl Hill, Michiel Smid
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affno abstractunlabeled
Applying Cell-DEVS in 3D Free-Form Shape Modeling
Pengfei Wu, Xiuping Wu, Gabriel Wainer
2004· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affunlabeled
THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
Thérèse Biedl, Martin Vatshelle
2013· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
The Inverse Voronoi Problem in Graphs I: Hardness
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez‐Rosés
2020· article· en· Algorithmica· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Meshes Preserving Minimum Feature Size
Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, John Iacono
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
afffundno abstractunlabeled
Star Unfolding from a Geodesic Curve
Stephen Kiazyk, Anna Lubiw
2016· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Dynamic well-spaced point sets
Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoğlu
2012· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
4
citations
affunlabeled
Morphing Planar Graph Drawings.
Anna Lubiw
2007· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
afffundunlabeled
Distinct distances in the complex plane
Adam Sheffer, Joshua Zahl
2021· preprint· en· Transactions of the American Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Sigma-local graphs
Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel Smid
2008· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
How to Walk Your Dog in the Mountains with No Magic Leash
Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
2015· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Minimum Ply Covering of Points with Unit Squares
Stéphane Durocher, J. Mark Keil, Debajyoti Mondal
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affno abstractunlabeled
Minimum Convex Partitions and Maximum Empty Polytopes
Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affno abstractunlabeled
On Rectilinear Partitions with Minimum Stabbing Number
Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
fundno affunlabeled
Packing Plane Perfect Matchings into a Point Set
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel Smid
2015· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
4
citations
affno abstractunlabeled
Minimum Rectilinear Polygons for Given Angle Sequences
William Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
fundno affunlabeled
Centerpoint theorems for wedges
Jeff Erickson, Ferrán Hurtado, Pat Morin
2009· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About