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

afffundno abstractunlabeled
Graph layouts via layered separators
Vida Dujmović
2014· preprint· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Sorting under partial (interval order) information
Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann
2022· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Diffuse Reflections in Simple Polygons
Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth +1 more
2013· article· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Acute Tours in the Plane
Ahmad Biniaz
2023· preprint· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On the perimeter of fat objects.
Prosenjit Bose, Otfried Cheong, Vida Dujmovi
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
k-star-shaped polygons.
Jeff Sember, William Evans
2010· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
The structure of $Δ(1, 2, 2)$-free tournaments
Seokbeom Kim, Taite LaGrange, Mathieu Rundström, Arpan Sadhukhan, Sophie Spirkl
2025· preprint· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affaboutunlabeled
GUEST EDITORS' FOREWORD
Henk Meijer, DAVID RAPPAPORT
2005· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
The Inverse Voronoi Problem in Graphs I: Hardness
Édouard Bonnet, Sergio Cabello, Bojan Mohar
2020· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Convexity-Increasing Morphs of Planar Graphs
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
2018· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Price of Order
Prosenjit Bose, Pat Morin, André van Renssen
2016· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$
David Avis, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze +3 more
2018· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
BTS 097
2014· other· en· Bulletin of Miscellaneous Information (Royal Gardens Kew)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Polygons Cuttable by a Circular Saw.
Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
2000· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Small Octagons of Maximal Width
Charles Audet, Pierre Hansen, Frédéric Messine, Jordan Ninin
2012· article· en· PolyPublie (École Polytechnique de Montréal)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Geometric algorithms for layered manufacturing
Ravi Janardan, Michiel Smid
2005· book-chapter· en· DIMACS series in discrete mathematics and theoretical computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Fano Quads in Projective Planes.
R. G. Stanton, William L. Kocay
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Section 13. Semi-regular Lattice Polygons
Ross Honsberger
2003· book-chapter· en· American Mathematical Society eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
[Email correspondence between Al Daniels and members]
2009· article· en· The Portal to Texas History (University of North Texas)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Line and Plane Cover Numbers Revisited
Thérèse Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff
2019· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Angle Covers: Algorithms and Complexity
2020· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About