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

afffundunlabeled
Improved Draws for Highland Dance
Tim B. Swartz
2007· article· en· Journal of Quantitative Analysis in Sports· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
GRID VERTEX-UNFOLDING ORTHOSTACKS
Erik D. Demaine, John Iacono, Stefan Langerman
2010· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Point-Set Topology with Topics
Robert André
2023· book· en· WORLD SCIENTIFIC eBooks· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The ordinary line problem revisited
Atri Mukhopadhyay, Eugene Greene
2011· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Min-k-planar Drawings of Graphs
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmović, Seok-Hee Hong +4 more
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundno abstractunlabeled
Drawing Graphs as Spanners
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin +1 more
2022· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Rotationally Monotone Polygons.
Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer
2006· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
The geometry of carpentry and joinery
Pat Morin, Jason Morrison
2004· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Triangulating and guarding realistic polygons
Greg Aloupis, Prosenjit Bose, Vida Dujmović, Chris Gray, Stefan Langerman, Bettina Speckmann
2013· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
The Visible Perimeter of an Arrangement of Disks
Gabriel Nivasch, János Pach, Gábor Tardos
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Space-efficient algorithm for computing a centerpoint of a set of points in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>
Binay Bhattacharya, Subhas C. Nandy, Sasanka Roy
2015· article· lv· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+insufficient_payloadconsensus · none
1
citations
affunlabeled
Min-$k$-planar Drawings of Graphs
Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmović, Seok-Hee Hong +4 more
2024· article· en· Journal of Graph Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Weighted minimum backward Fréchet distance
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations
affunlabeled
On path-greedy geometric spanners
Lucca Morais de Arruda Siaudzionis
2021· article· en· Open Collections· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
1
citations
affno abstractunlabeled
Morphing Planar Graph Drawings Through 3D
Kevin Buchin, Will Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders +1 more
2022· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundno abstractunlabeled
On path-greedy geometric spanners
William Evans, Lucca Morais de Arruda Siaudzionis
2022· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Tight lower bounds for the size of epsilon-nets
János Pach, Gábor Tardos
2010· preprint· en· Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
1
citations
venueno affunlabeled
Points with large quadrant depth
Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt +1 more
2011· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
A Bipartite Strengthening of the Crossing Lemma
Jacob Fox, János Pach, Csaba D. Tóth
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec
2000· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
References
Atsuyuki Okabe, Barry Boots, Kōkichi Sugihara, Sung Nok Chiu, David G. Kendall
2008· book-chapter· en· Wiley series in probability and statistics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Computing Covers of Plane Forests
Luis Barba, Prosenjit Bose, Michiel Smid
2013· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE
Tsunehiko Kameda, John Z. Zhang
2010· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Enumerating Triangulations of Convex Polytopes
Sergei Bespamyatnikh
2001· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Crossing Number of K 2, 4, n .
Pak Tung Ho
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Negative Instance for the Edge Patrolling Beacon Problem
Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman +2 more
2021· preprint· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About