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 31 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
Average Stretch Factor: How Low Does It Go?
Vida Dujmović, Pat Morin, Michiel Smid
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1145/3757374.3795008
AI Generated
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Planar Geometric Spanners
Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Compass Routing Suppose that
2008· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Orientation preserving maps of the n × n grid
Imre Bárány, Attila Pór, Pável Valtr
2022· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The 2x2 simple packing problem
AM André van Renssen, Bettina Speckmann
2011· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Minimum Enclosing Circle Problem with Base Point.
Binay Bhattacharya, Lily Li
2017· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Affine invariant triangulations
Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira
2021· article· en· Computer Aided Geometric Design· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
The Geodesic Edge Center of a Simple Polygon
Anna Lubiw, Anurag Murty Naredla
2025· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Ball-Polyhedra
Károly Bezdek, Zsolt Lángi, Márton Naszódi, Peter Papez
2011· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Ballot Number Formulary.
Heywood Gould, Jocelyn Quaintance
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Vertex classification of planar C-polygons
Illya Ivanov, Cameron Strachan
2024· article· en· Journal of Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
An Improved Bound for Plane Covering Paths
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About