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 27 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
On k-planar Graphs without Short Cycles
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmović, Michael M. Hoffmann, Michael Kaufmann +3 more
2025· article· en· Journal of Graph Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Dense Graphs Have Rigid Parts
Orit E. Raz, József Solymosi
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Spatial Access Methods
Ling Liu, M. TAMER ÖZSU
2009· book-chapter· en· Encyclopedia of Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Plane and planarity thresholds for random geometric graphs
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel Smid
2019· preprint· en· Discrete Mathematics Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On Interference Among Moving Sensors and Related Problems
Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
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
2013· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
The Price of Upwardness
Patrizio Angelini, Thérèse Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong +5 more
2025· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Dynamic ham-sandwich cuts in the plane
Timothy G. Abbott, Michael Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg +6 more
2009· book-chapter· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Dual Circumference and Collinear Sets
Vida Dujmović, Pat Morin
2022· preprint· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affaboutunlabeled
Open Problems from CCCG 2014.
Sue Whitesides
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
COMPUTATIONAL GEOMETRY COLUMN 37
Erik D. Demaine, Joseph O’Rourke
2000· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Self-approaching paths in simple polygons
Prosenjit Bose, Irina Kostitsyna, Stefan Langerman
2019· preprint· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On k-Planar Graphs Without Short Cycles
2024· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Distant Representatives for Rectangles in the Plane
Thérèse Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud
2021· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Ray shooting from convex ranges
Evangelos Kranakis, Danny Kriz̧anc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
2001· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Extremal Problems for Convex Polygons
Charles Audet, Pierre Hansen, Frédéric Messine
2005· article· fr· PolyPublie (École Polytechnique de Montréal)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Configurations graphs of neighbourhood geometries
M. Abreu, Martin Funk, D. Labbate, Vito Napolitano
2008· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Intersecting Hexagons in 3-Space
József Solymosi, Ching Wong
2022· preprint· en· Studia Scientiarum Mathematicarum Hungarica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
GHOST CHIMNEYS
DAVID CHARLTON, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Pat Morin, Ryuhei Uehara
2012· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Contiguous Boundary Guarding
Ahmad Biniaz, Anil Maheshwari, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Thomas C. Shermer
2024· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Packing Trees into 1-Planar Graphs
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen Kobourov, William Lenhart, Giuseppe Liotta +3 more
2020· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A SUCCINCT 3D VISIBILITY SKELETON
Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang
2010· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Defective acyclic colorings of planar graphs
On‐Hei Solomon Lo, Ben Seamone, Xuding Zhu
2024· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS
Stéphane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala
2013· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Spread complexity for the planar limit of holography
Rathindra Nath Das, Saskia Demulder, Johanna Erdmenger, Christian Northe
2024· preprint· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About