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
Journal of Computational Geometry (Carleton University)
Topic
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.

106 results · 1 filter active ·
Results by year
20102025
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.
106 works in the cohort · of 4,299,418page 1 of 3

Labels cover 0 of 106 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 106 of 106 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

venueno affunlabeled
Approximability of the discrete Fréchet distance
Karl Bringmann, Wolfgang Mulzer
2015· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
36
citations
venueno affunlabeled
Consistent labeling of rotating maps
Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2014· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
afffundvenueunlabeled
On characterizing terrain visibility graphs
William Evans, Noushin Saeedi
2013· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
venueno affunlabeled
Shortest path in a polygon using sublinear space
Sariel Har-Peled
2015· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
14
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
venueno affunlabeled
Minimum cycle and homology bases of surface-embedded graphs
Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri
2017· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
venueno affunlabeled
Central Trajectories
Marc van Kreveld, Maarten Löffler, Frank Staals
2015· preprint· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations
venueno affunlabeled
Degree four plane spanners: Simpler and better
Iyad Kanj, Ljubomir Perković, Duru Türkoğlu
2017· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
Drawing planar graphs with prescribed face areas
Linda Kleist
2017· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
Interesting paths in the mapper complex
Ananth Kalyanaraman, Methun Kamruzzaman, Bala Krishnamoorthy
2018· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
Orthogonal Terrain Guarding is NP-complete
Édouard Bonnet, Panos Giannopoulos
2019· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
Connected rectilinear graphs on point sets
Maarten Löffler, Elena Mumford
2010· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
On the Geodesic Centers of Polygonal Domains
Haitao Wang
2016· preprint· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
Planar and Poly-Arc Lombardi Drawings
Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen Kobourov, Maarten Löffler
2011· preprint· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affvenueunlabeled
Network farthest-point diagrams
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari +2 more
2013· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affunlabeled
Rigid foldability is NP-hard
Hugo A. Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi
2018· article· en· Journal of Computational Geometry (Carleton University)· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affunlabeled
The Lebesgue universal covering problem
John C. Baez, Karine Bagdasaryan, Philip Gibbs
2015· article· en· Journal of Computational Geometry (Carleton University)· Mathematics
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affunlabeled
Simplicial flat norm with scale
Sharif Ibrahim, Bala Krishnamoorthy, Kevin R. Vixie
2012· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affvenueunlabeled
Towards plane spanners of degree 3
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid
2016· article· en· Journal of Computational Geometry (Carleton University)· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affunlabeled
On the planar edge-length ratio of planar graphs
Manuel Borrazzo, Fabrizio Frati
2019· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affvenueunlabeled
Good quality virtual realization of unit disk graphs
Sriram V. Pemmaraju, Imran A. Pirwani
2010· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Colouring the triangles determined by a point set
Ruy Fabila‐Monroy, David R. Wood
2011· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundvenueno affunlabeled
Recognizing shrinkable complexes is NP-complete
Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard
2016· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About