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 11 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
Fast Algorithms for Approximating Distances
Sergei Bespamyatnikh, Michael Segal
2002· article· en· Algorithmica· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Windrose Planarity
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote +1 more
2018· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Partitioning Orthogonal Histograms into Rectangular Boxes
Thérèse Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte
2018· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
fundvenueno affunlabeled
Smoothed complexity of convex hulls by witnesses and collectors
Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse
2016· preprint· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
venueno affunlabeled
Steinitz theorems for simple orthogonal polyhedra
David Eppstein, Elena Mumford
2013· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Improved Algorithms for Partial Curve Matching
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affunlabeled
Guarding Orthogonal Terrains.
Stéphane Durocher, Pak Ching Li, Saeed Mehrabi
2015· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM
Mustaq Ahmed, Anna Lubiw
2011· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
afffundunlabeled
The half plane UIPT is recurrent
Omer Angel, Gourab Ray
2017· article· en· Probability Theory and Related Fields· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Coloring and Guarding Arrangements
Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferrán Hurtado, Matias Korman, Stefan Langerman +1 more
2013· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
8
citations
afffundno abstractunlabeled
Thickness and colorability of geometric graphs
Stéphane Durocher, Ellen Gethner, Debajyoti Mondal
2016· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
On polyhedra induced by point sets in space
Pankaj K. Agarwal, Ferrán Hurtado, Godfried T. Toussaint, Joan Trias
2007· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Reconstructing Odd Necklaces
Luke Pebody
2007· article· en· Combinatorics Probability Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
Light Euclidean Spanners with Steiner Points
Hung Le, Shay Solomon
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
afffundno abstractunlabeled
Flip distance to some plane configurations
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2019· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
8
citations
aboutno affunlabeled
Paths with No Small Angles
Imre Bárány, Attila Pór, Pável Valtr
2009· article· en· SIAM Journal on Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Incidence Theorems for Pseudoflats
Izabella Łaba, József Solymosi
2007· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
A central set of dimension $2$
Christopher J. Bishop, Hrant Hakobyan
2008· article· en· Proceedings of the American Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Crossings in Grid Drawings
Vida Dujmović, Pat Morin, Adam Sheffer
2014· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Matrix identities and the pigeonhole principle
Michael Soltys, Alasdair Urquhart
2004· article· en· Archive for Mathematical Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2010· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About