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 23 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
Every collinear set in a planar graph is free
Vida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote
2019· article· en· Symposium on Discrete Algorithms· Computer Science
distilled 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
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The Gaussian Centre of a Set of Mobile Points
Stéphane Durocher, David Kirkpatrick
2003· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Finding equal-diameter triangulations in polygons
András Bezdek, Ted Bisztriczky
2014· article· de· Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry· Computer Science
distilled prediction:candidate · metaresearch+metaepi_narrow+bibliometrics+sts+scholarly_communication+insufficient_payloadconsensus · none
1
citations
fundno affunlabeled
Routing on the Visibility Graph
Prosenjit Bose, Matias Korman, Sander Verdonschot, André van Renssen
2017· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
1
citations
affunlabeled
Spanners of Additively Weighted Point Sets
Prosenjit Bose, Paz Carmi, Mathieu Couture
2008· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Closest-Point Queries for Complex Objects
Eugene Greene, Asish Mukhopadhyay
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundvenueunlabeled
$1$-string $B_2$-VPG representation of planar graphs
Thérèse Biedl, Martin Derka
2016· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
M. Closson, S. Gartshore, J. Johansen, Stephen Wismath
2004· book-chapter· en· WORLD SCIENTIFIC eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Algorithms and Discrete Applied Mathematics
N. S. Narayanaswamy, Daya Ram Gaur
2017· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affunlabeled
Figures of Constant Width on a Chessboard
Janko Hernández Cortés, Leonel Robert
2005· article· en· American Mathematical Monthly· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Strict Confluent Drawing
David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek
2013· preprint· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundunlabeled
1-String B_2-VPG Representation of Planar Graphs
Thérèse Biedl, Martin Derka
2015· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
The Maximum Distance Problem and Minimum Spanning Trees
Enrique Alvarado, Bala Krishnamoorthy, Kevin R. Vixie
2021· article· en· International Journal of Analysis and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Weighted Minimum Backward Frechet Distance.
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
1
citations
affno abstractunlabeled
Crossing Angles of Geometric Graphs
Karin Arikushi, Csaba D. Tóth
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Improved Spanning on Theta-5
Prosenjit Bose, Darryl Hill, Aurélien Ooms
2021· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Grid-based Decorative Corners
Craig S. Kaplan
2013· article· en· Proceedings of Bridges 2013: Mathematics, Music, Art, Architecture, Culture· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundunlabeled
Layered Fan-Planar Graph Drawings
Thérèse Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affno abstractunlabeled
Packing Two Disks into a Polygonal Environment
Prosenjit Bose, Pat Morin, Antoine Vigneron
2001· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations

How this was built: Screen · Findings · About