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

afffundno abstractunlabeled
Computing Cartograms with Optimal Complexity
2013· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
56
citations
afffundno abstractunlabeled
Recognizing and drawing IC-planar graphs
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
55
citations
fundno affno abstractunlabeled
Multi-Pass Geometric Algorithms
2006· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
55
citations
affno abstractunlabeled
On Dominance Reporting in 3D
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
54
citations
fundno affunlabeled
Track Layouts of Graphs
2004· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
52
citations
affno abstractunlabeled
Compatible geometric matchings
2009· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
51
citations
affno abstractunlabeled
Separating an object from its cast
2002· article· en· Computer-Aided Design· Computer Science
distilled prediction:candidate · noneconsensus · none
51
citations
affunlabeled
Delaunay mesh construction
2007· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
51
citations
afffundunlabeled
PATHWIDTH AND LAYERED DRAWINGS OF TREES
2004· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
50
citations
affunlabeled
<i>LoopyCuts</i>
2020· article· en· ACM Transactions on Graphics· Computer Science
distilled prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
Folding and Cutting Paper
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
49
citations
affunlabeled
ON THE DISCRETE UNIT DISK COVER PROBLEM
2012· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
49
citations
affunlabeled
Symmetric moving frames
2019· article· en· ACM Transactions on Graphics· Computer Science
distilled prediction:candidate · noneconsensus · none
47
citations
affno abstractunlabeled
Immobilizing a polytope
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
46
citations
affno abstractunlabeled
Matroid Enumeration for Incidence Geometry
2011· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
45
citations
affno abstractunlabeled
Extremal problems for convex polygons
2006· article· en· Journal of Global Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
On simplifying dot maps
2003· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Shattering News
2002· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Rectangular drawings of planar graphs
2003· article· en· Journal of Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Graph drawings with few slopes
2006· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
41
citations
← previousnext →

How this was built: Screen · Findings · About