MétaCan
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.

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

affno abstractunlabeled
Planar Graphs as VPG-Graphs
Steven Chaplick, Torsten Ueckerdt
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
fundno affno abstractunlabeled
Universal point sets for planar three-trees
Radoslav Fulek, Csaba D. Tóth
2015· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Sand drawings and Gaussian graphs§
Erik D. Demaine, Martin L. Demaine, Perouz Taslakian, Godfried T. Toussaint
2007· article· en· Journal of Mathematics and the Arts· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
ON SPANNERS OF GEOMETRIC GRAPHS
Joachim Gudmundsson, Michiel Smid
2009· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Improved Routing on the Delaunay Triangulation
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid
2023· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On Generalized Diamond Spanners
Prosenjit Bose, Aaron Lee, Michiel Smid
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
affno abstractunlabeled
Localized geometric query problems
John Augustine, Sandip Das, Anil Maheshwari, Sabhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2012· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
affno abstractunlabeled
Volume requirements of 3D upward drawings
Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
New Codes from Old; A New Geometric Construction
Aiden A. Bruen, David L. Wehlau
2001· article· en· Journal of Combinatorial Theory Series A· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
The Shape of Orthogonal Cycles in Three Dimensions
Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
2011· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Finding one tight cycle
Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
2008· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
COMPUTING LINE INTERSECTIONS
Marina L. Gavrilova, Jon Rokne
2001· article· en· International Journal of Image and Graphics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
On k-enclosing objects in a coloured point set
Luis Barba, Stéphane Durocher, Robert Fraser, Ferrán Hurtado, Saeed Mehrabi, Debajyoti Mondal +3 more
2013· article· en· RECERCAT (Consorci de Serveis Universitaris de Catalunya)· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On the Bounds of Conway’s Thrackles
Luis Goddyn, Yian Xu
2017· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Euclidean chains and their shortcuts
Boting Yang
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Quality encoding for tetrahedral mesh optimization
Kai Xu, Zhi‐Quan Cheng, Yanzhen Wang, Yueshan Xiong, Hao Zhang
2009· article· en· Computers & Graphics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Computing the Greedy Spanner in Near-Quadratic Time
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel Smid
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affunlabeled
SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM
Mustaq Ahmed, Anna Lubiw
2011· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affunlabeled
Reconstructing Odd Necklaces
Luke Pebody
2007· article· en· Combinatorics Probability Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations

How this was built: Screen · Findings · About