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

afffundunlabeled
Solid Geometry Processing on Deconstructed Domains
Silvia Sellán, Herng Yi Cheng, Yuming Ma, Mitchell Dembowski, Alec Jacobson
2018· preprint· en· Computer Graphics Forum· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Small polygons with large area
Christian Bingane, Michael J. Mossinghoff
2023· article· en· Journal of Global Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
STATION LAYOUTS IN THE PRESENCE OF LOCATION CONSTRAINTS
Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Kriz̧anc, David Peleg
2002· article· en· Journal of Interconnection Networks· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Spanners of Complete $k$-Partite Geometric Graphs
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel Smid
2007· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Polygons Flip Finitely: Flaws and a Fix
Erik D. Demaine, Blaise Gassend, Godfried T. Toussaint
2006· article· en· Smith ScholarWorks (Smith College)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundunlabeled
Partial Enclosure Range Searching
Gregory Bint, Anil Maheshwari, Michiel Smid, Subhas C. Nandy
2019· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Approximating Radio Maps.
Iris Ashkenazi, Boaz Ben‐Moshe, Jihad El‐Sana
2005· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
1
citations
affunlabeled
Collinearities in Kinetic Point Sets
Benjamin Lund, George Purdy, Justin W. Smith, Csaba D. Tóth
2011· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On the Plane-Width of Graphs
Marcin Kamiński, Paul Medvedev, Martin Milanič
2009· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Truly Optimal Euclidean Spanners
Hung Le, Shay Solomon
2019· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
The Two-Guard Polygon Walk Problem
John Z. Zhang
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affno abstractunlabeled
Covering Things with Things
Stefan Langerman, Pat Morin
2002· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundno abstractunlabeled
Combinatorics of Intervals in the Plane I: Trapezoids
Daniel Di Benedetto, József Solymosi, Ethan Patrick White
2022· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On the Minimum Consistent Subset Problem
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi +1 more
2019· preprint· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affunlabeled
Erd\H{o}s-Szekeres without induction
Sergey Norin, Yelena Yuditsky
2015· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundno abstractunlabeled
Strong matching of points with geometric shapes
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2017· preprint· en· Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
The nearest neighbor distance
Gérard Biau, Luc Devroye
2015· book-chapter· en· Springer series in the data sciences· Computer Science
distilled prediction:candidate · scholarly_communication+open_scienceconsensus · none
1
citations
affno abstractunlabeled
Circular Separability of Polygons
Jean‐Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
2001· preprint· en· Algorithmica· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Incidence theorems for pseudoflats
Izabella Łaba, József Solymosi
2005· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Turning Orthogonally Convex Polyhedra into Orthoballs
Fidel Barrera-Cruz, Thérèse Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour
2014· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
venueno affunlabeled
Density of Range Capturing Hypergraphs
Maria Axenovich, Torsten Ueckerdt
2014· preprint· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Advancing Layer Surface Mesh Generation
Jasmeet Singh, Carl Ollivier‐Gooch
2020· article· en· AIAA Scitech 2020 Forum· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About