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 18 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
Angle-monotone Paths in Non-obtuse Triangulations
Anna Lubiw, Joseph O’Rourke
2017· article· en· Smith ScholarWorks (Smith College)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
3
citations
afffundno abstractunlabeled
Graph Algorithms with Small Communication Costs
Jieliang Zhou, Patrick Dymond, Xiaotie Deng
2000· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Implicit Convex Polygons
Francisco Gómez, Ferrán Hurtado, Suneeta Ramaswami, Vera Sacristán, Godfried Toussaint
2002· article· en· Journal of Mathematical Modelling and Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Time-Space Trade-offs for Triangulating a Simple Polygon
Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Additive models in high dimensions
Markus Hegland, Vladimir Pestov
2005· article· en· ANZIAM Journal· Computer Science
distilled 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
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affno abstractunlabeled
Packing two disks into a polygonal environment
Prosenjit Bose, Pat Morin, Antoine Vigneron
2004· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Trade-Offs in Planar Polyline Drawings
Stéphane Durocher, Debajyoti Mondal
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Minimum-Layer Drawings of Trees - (Extended Abstract).
Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman
2011· article· en· Workshop on Algorithms and Computation· Computer Science
distilled 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
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
MEDIAL AXIS APPROXIMATION AND UNSTABLE FLOW COMPLEX
Joachim Giesen, Edgar A. Ramos, Bardia Sadri
2008· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled 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
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affunlabeled
Approximating Majority Depth
Dan Chen, Pat Morin
2012· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
venueno affno abstractunlabeled
Obstruction Sets for Outer-Bananas-Surface Graphs.
L. Boza, Eugenio M. Fedriani, Juan Núñez Valdés
2004· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
On Dispersable Book Embeddings
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2018· preprint· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
3
citations
affno abstractunlabeled
Plane 3-trees: Embeddability and Approximation
Stéphane Durocher, Debajyoti Mondal
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
afffundno abstractunlabeled
Improved Bounds for Guarding Plane Graphs with Edges
Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot
2019· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Spanners of Complete k-Partite Geometric Graphs
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel Smid
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations

How this was built: Screen · Findings · About