MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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

fundno affno abstractunlabeled
Geometric permutations of disjoint unit spheres
Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na
2004· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Optimal Halfspace Range Reporting in Three Dimensions
Peyman Afshani, Timothy M. Chan
2009· article· en· Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
afffundno abstractunlabeled
Lines, Betweenness and Metric Spaces
Pierre Aboulker, Guangda Huzhang, Rohan Kapadia, Cathryn Supko
2016· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
The Crossing Number of P(N, 3)
R. Bruce Richter, Gelasio Salazar
2002· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Checkerboard patterns with black rectangles
Chi‐Han Peng, Caigui Jiang, Peter Wonka, Helmut Pottmann
2019· article· en· ACM Transactions on Graphics· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Point-set embeddings of trees with given partial drawings
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2009· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
The Complexity of Hyperplane Depth in the Plane
Stefan Langerman, William Steiger
2003· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω
Prosenjit Bose, Vida Dujmović, Ferrán Hurtado, John Iacono, Stefan Langerman, Henk Meijer +3 more
2012· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Fast Pruning of Geometric Spanners
Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
MAXIMIZING A VORONOI REGION: THE CONVEX CASE
Frank Dehne, Rolf Klein, Raimund Seidel
2005· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
fundno affno abstractunlabeled
The Size of Spanning Disks for Polygonal Curves
Joel Hass, Jack Snoeyink, William P. Thurston
2002· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
On bounded degree plane strong geometric spanners
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi
2012· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affunlabeled
PROPERTIES OF ARRANGEMENT GRAPHS
Prosenjit Bose, Hazel Everett, STEPHEN WISMATH
2003· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
On Representing Graphs by Touching Cuboids
David Avis, William Evans, Fabrizio Frati, Laurie J. Heyer, Stephen Kobourov, William Lenhart +3 more
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
The Odd-Distance Plane Graph
Hayri Ardal, Ján Maňuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho
2009· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
THE LARGEST EMPTY ANNULUS PROBLEM
José Miguel Díaz-Báñez, F. Hurtado, Henk Meijer, David Rappaport, J. Antoni Sellarès
2003· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Orthogonal Cartograms with Few Corners Per Face
Thérèse Biedl, Lesvia Elena Ruiz Velázquez
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Drawing planar 3-trees with given face areas
Thérèse Biedl, Lesvia Elena Ruiz Velázquez
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Traversing a Set of Points with a Minimum Number of Turns
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferrán Hurtado, Pável Valtr
2008· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
A De Bruijn–Erdős Theorem for Chordal Graphs
Laurent Beaudou, Adrian Bondy, Ehsan Chiniforooshan, Maria Chudnovsky, Vašek Chvátal, Nicolás Fraiman +1 more
2015· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Bichromatic compatible matchings
Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine
2014· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
Erik D. Demaine, Jeff Erickson, Ferrán Hurtado, John Iacono, Stefan Langerman, Henk Meijer +2 more
2005· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
fundno affunlabeled
A de Bruijn - Erdos theorem and metric spaces
Ehsan Chiniforooshan, Vašek Chvátal
2011· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
The Rectilinear Crossing Number of $K_{10}$ is $62$
Alex Brodsky, Stéphane Durocher, Ellen Gethner
2001· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
← previousnext →

How this was built: Screen · Findings · About