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 19 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
Crossing numbers of imbalanced graphs
János Pach, József Solymosi, Gábor Tardos
2009· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Progress on maximum weight triangulation
Jianbo Qian, Cao An Wang
2006· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Homothetic polygons and beyond: Maximal cliques in intersection graphs
Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvı́l, Martin Pergel, Paweł Rzążewski +2 more
2018· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Excuse me! or the courteous theatregoers' problem
Konstantinos Georgiou, Evangelos Kranakis, Danny Kriz̧anc
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Approximating the Average Stretch Factor of Geometric Graphs
Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel Smid
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
Angle Covers: Algorithms and Complexity
William Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
2021· article· en· Journal of Graph Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The asteroid surveying problem and other puzzles
Timothy M. Chan, Alexander Golynski, Alejandro López-Ortíz, Claude-Guy Quimper
2003· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Bounded-Curvature Path Normalization
Jonathan Backer, David Kirkpatrick
2006· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Monitoring the Plane with Rotating Radars
Jurek Czyzowicz, Stefan Dobrev, Benson Joeris, Evangelos Kranakis, Danny Kriz̧anc, Ján Maňuch +4 more
2015· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Computing the Widest Empty Boomerang.
Boaz Ben‐Moshe, Binay Bhattacharya, Qiaosheng Shi
2005· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Spindle starshaped sets
Károly Bezdek, Márton Naszódi
2014· article· la· Aequationes Mathematicae· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
2
citations
affunlabeled
Efficient Snap Rounding with Integer Arithmetic.
Binay Bhattacharya, Jeff Sember
2007· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Maximum Rectilinear Convex Subsets
Hernàn González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel +1 more
2021· article· en· SIAM Journal on Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The Ordinary Line Problem Revisited.
Atri Mukhopadhyay, Eugene Greene
2007· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Colouring the triangles determined by a point set
Ruy Fabila‐Monroy, David R. Wood
2011· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Tight Bounds for Point Recolouring.
Yurai Núñez Rodríguez, David Rappaport
2006· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel Smid, Yajun Wang
2010· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Computing Nice Sweeps for Polyhedra and Polygons
Prosenjit Bose, Marc van Kreveld
2004· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
Similarity of Polygonal Curves in the Presence of Outliers
Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer
2012· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Consensus meshing
Ryan Schmidt, Patricio Simari
2012· article· en· Computers & Graphics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About