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 3 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
On Levels in Arrangements of Curves
Timothy M. Chan
2003· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affunlabeled
Bijective and coarse high-order tetrahedral meshes
Zhongshi Jiang, Ziyi Zhang, Yixin Hu, Teseo Schneider, Denis Zorin, Daniele Panozzo
2021· article· en· ACM Transactions on Graphics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stéphane Durocher, Robert Fraser, Alejandro López-Ortíz +2 more
2010· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Structural Lines, TINs, and DEMs
James J. Little, P. Shi
2001· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
afffundno abstractunlabeled
Fréchet distance with speed limits
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2010· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Computing the Greedy Spanner in Near-Quadratic Time
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel Smid
2009· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Graphs that admit right angle crossing drawings
Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Morić, Csaba D. Tóth
2011· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
afffundno abstractunlabeled
Locked and Unlocked Polygonal Chains in Three Dimensions
Thérèse Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O’Rourke +5 more
2001· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
venueno affunlabeled
Approximability of the discrete Fréchet distance
Karl Bringmann, Wolfgang Mulzer
2015· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Space-efficient geometric divide-and-conquer algorithms
Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel Smid, Jan Vahrenhold
2006· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
afffundno abstractunlabeled
Embedding grids in surfaces
Jim Geelen, R. Bruce Richter, Gelasio Salazar
2004· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Colouring Eulerian Triangulations
Joan Hutchinson, R. Bruce Richter, Paul Seymour
2002· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Analysis of range search for random k-d trees
Philippe Chanzy, Luc Devroye, Carlos Zamora-Cura
2001· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
The strength of weak proximity
Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
2006· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Area-preserving approximations of polygonal paths
Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc van Kreveld, Bettina Speckmann
2005· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Counting the onion
2004· article· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Polyhedral Computation
David Avis, Antoine Deza
2009· book· en· CRM proceedings & lecture notes· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
fundno affunlabeled
Affine translation surfaces in Euclidean 3-space
Huili Liu, Yanhua Yu
2013· article· en· Proceedings of the Japan Academy Series A Mathematical Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
← previousnext →

How this was built: Screen · Findings · About