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 28 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. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Plane Bichromatic Trees of Low Degree
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel Smid
2015· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Polygon Burning Problem
William Evans, Rebecca Lin
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundvenueunlabeled
Visibility-monotonic polygon deflation
Prosenjit Bose, Vida Dujmović, Nima Hoda, Pat Morin
2015· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Sparse Distance Sets in the Triangular Lattice
Tanbir Ahmed, Hunter S. Snevily
2013· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Weighted Straight Skeletons In The Plane.
Thérèse Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On Finite-Dimensional Maps II
H. Murat Tuncali, Vesko Valov
2002· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Compatible 4-Holes in Point Sets
Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid
2017· article· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Kinetic k-Semi-Yao graph and its applications
Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides
2015· preprint· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Routing on heavy path WSPD spanners
Prosenjit Bose, Tyler Tuttle
2024· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Boundary-Optimal Triangulation Flooding
Richard J. Nowakowski, Norbert Zeh
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Visibility-monotonic polygon deflation
Prosenjit Bose, Vida Dujmović, Nima Hoda, Pat Morin
2012· article· en· University of Calgary· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Graph Drawing via Layered Partitions.
Vida Dujmović
2019· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
The Geodesic Edge Center of a Simple Polygon
Anna Lubiw, Anurag Murty Naredla
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Cutting a polygon with a line
Ervin Ruci
2008· dissertation· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Multi-guard covers for polygonal regions
Zohreh Jabbari, William Evans, David Kirkpatrick
2010· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Drawings of complete graphs in the projective plane
Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar, Matthew Sullivan
2021· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Path Query Data Structures in Practice
Meng He, Serikzhan Kazi
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/0967-0653(96)84908-8
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Point-Set Embedding in Three Dimensions
Henk Meijer, Stephen Wismath
2015· article· en· Journal of Graph Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About