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 9 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
Approximating the fixed linear crossing number
Robert Cimikowski, Brendan Mumey
2007· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Upward drawings to fit surfaces
S. Mehdi Hashemi, Ivan Rival
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
11
citations
affno abstractunlabeled
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann +2 more
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
11
citations
affno abstractunlabeled
Stable Roommates Spanner
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman
2012· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Nice Perspective Projections
Francisco Gómez, F. Hurtado, J. Antoni Sellarès, Godfried Toussaint
2001· article· en· Journal of Visual Communication and Image Representation· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
fundno affunlabeled
Mesh collapse compression
Martin Isenburg, Jack Snoeyink
2003· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
fundno affunlabeled
5-choosability of graphs with crossings far apart
2012· article· en· Iowa State University Digital Repository (Iowa State University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
11
citations
venueno affunlabeled
On Zindler Curves in Normed Planes
Horst Martini, Senlin Wu
2011· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
10
citations
afffundno abstractunlabeled
More Colourful Simplices
Antoine Deza, Tamon Stephen, Feng Xie
2010· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
An in-place min–max priority search tree
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel Smid
2012· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Stabbing Pairwise Intersecting Disks by Four Points
Paz Carmi, Matthew J. Katz, Pat Morin
2023· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
affno abstractunlabeled
Integral Simplex Using Decomposition with Primal Cuts
Samuel Rosat, Issmail Elhallaoui, François Soumis, Andrea Lodi
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
affno abstractunlabeled
The within-strip discrete unit disk cover problem
Robert Fraser, Alejandro López-Ortíz
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · sts
10
citations
venueno affunlabeled
Surface distance maps
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, Erik C. Andersen, Dinesh Manocha
2007· article· en· Proceedings· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Generating simple convex Venn diagrams
Khalegh Mamakani, Wendy Myrvold, Frank Ruskey
2012· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Planar segment visibility graphs
Hazel Everett, Chı́nh T. Hoàng, K. Kilakos, Marc Noy
2000· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
On Planar Greedy Drawings of 3-Connected Planar Graphs
Giordano Da Lozzo, Anthony D’Angelo, Fabrizio Frati
2018· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
affunlabeled
Critical sets of inertias for matrix patterns
In‐Jae Kim, D.D. Olesky, P. van den Driessche
2008· article· en· Linear and Multilinear Algebra· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Edge-unfolding nested polyhedral bands
Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O’Rourke, Ileana Streinu +1 more
2007· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Symmetric matroid polytopes and their generation
Jürgen Bokowski, David Avis, Gábor Gévay
2009· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations

How this was built: Screen · Findings · About