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

venueno affunlabeled
Recursively-Regular Subdivisions and Applications
Rafel Jaume, Günter Rote
2013· preprint· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Computing a planar widest empty -siphon in o(n 3 ) time
Boaz Ben‐Moshe, Binay Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi
2007· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
On the Reliability of Triangle Intersection in 3D
Steven Robbins, Sue Whitesides
2003· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Improved Routing on the Delaunay Triangulation
Michael D. Dennis, Ljubomir Perković, Duru Türkoğlu
2017· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Flips in Edge-Labelled Pseudo-Triangulations
Prosenjit Bose, Sander Verdonschot
2015· article· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Faster Algorithms for some Optimization Problems on Collinear Points
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel Smid
2018· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
venueno affunlabeled
Triangle-Free Polyconvex Graphs
Daniel C. Isaksen, Beth Robinson
2002· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Boundary Labeling for Rectangular Diagrams
Prosenjit Bose, Paz Carmi, Julian Keil, Saeed Mehrabi, Debajyoti Mondal
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
On stars and Steiner stars: II
Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu
2009· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The strong product of graphs and crossing numbers
Huang Yuan-qiu, Jing Wang, Zhangdong Ouyang
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The Erdős-Sós Conjecture for Geometric Graphs
Luis Barba, Ruy Fabila‐Monroy, Dolores Lara, Jesús Leaños, Cynthia Rodríguez, Gelasio Salazar +1 more
2012· preprint· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Realizing Site Permutations.
Stéphane Durocher, Saeed Mehrabi, Debajyoti Mondal, Matthew Skala
2011· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Distant Representatives for Rectangles in the Plane
Thérèse Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud
2021· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Matched drawability of graph pairs and of graph triples
Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2010· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Rotationally monotone polygons
Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer
2007· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Dual Circumference and Collinear Sets
Vida Dujmović, Pat Morin
2018· article· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
feelpp/feelpp: v0.103.2
2017· other· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affunlabeled
Super point graph and point completion number
Deepak Pathave, S. A. Tapadia, B. N. Waphare
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Time-Space Trade-offs for Triangulating a Simple Polygon
Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen
2015· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Reprint of: Weighted straight skeletons in the plane
Thérèse Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader
2015· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
An Improved Bound for Plane Covering Paths
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
0
citations
affunlabeled
Cuttings in 2D Revisited.
Timothy M. Chan
2014· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
The basis number of 1-planar graphs
Saman Bazargani, Thérèse Biedl, Prosenjit Bose, Anil Maheshwari, Babak Miraftab
2024· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Graph embedding algorithms
2003· dissertation· en· Mspace (University of Manitoba)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About