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
Discrete & Computational Geometry
Topic
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.

172 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.
172 works in the cohort · of 4,299,418page 2 of 4

Labels cover 0 of 172 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 172 of 172 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.

affno abstractunlabeled
On Approximate Range Counting and Depth
Peyman Afshani, Timothy M. Chan
2009· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
afffundno abstractunlabeled
Symmetries of Equivelar 4-Toroids
Isabel Hubard, Alen Orbanić, Daniel Pellicer, Asia Ivić Weiss
2012· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
19
citations
afffundno abstractunlabeled
Long Non-crossing Configurations in the Plane
Adrian Dumitrescu, Csaba D. Tóth
2010· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Colourful and Fractional (p,q)-theorems
Imre Bárány, Ferenc Fodor, Luis Montejano, Déborah Oliveros, Attila Pór
2013· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
17
citations
afffundno abstractunlabeled
Coning, Symmetry and Spherical Frameworks
Bernd Schulze, Walter Whiteley
2012· article· en· Discrete & Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
17
citations
afffundno abstractunlabeled
The Art Gallery Theorem for Polyominoes
Thérèse Biedl, Mohammad Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell
2012· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundno abstractunlabeled
Flipturning Polygons
Aichholzer, Cortés, Demaine, Dujmovic, Erickson, Meijer +4 more
2002· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Primitive Zonotopes
Antoine Deza, George Manoussakis, Shmuel Onn
2017· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
14
citations
fundno affno abstractunlabeled
On the Number of Balanced Lines
János Pach, Rom Pinchasi
2001· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Metric Embeddings?Beyond One-Dimensional Distortion
Robert Krauthgamer, Nathan Linial, Avner Magen
2004· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
fundno affno abstractunlabeled
Spanning Trees Crossing Few Barriers
Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas Guibas, Jack Snoeyink, Hisao Tamaki
2003· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
More Colourful Simplices
Antoine Deza, Tamon Stephen, Feng Xie
2010· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Oriented Interval Greedoids
Franco Saliola, Hugh Thomas
2011· article· en· Discrete & Computational Geometry· Computer Science
machine 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
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
On the Bounds of Conway’s Thrackles
Luis Goddyn, Yian Xu
2017· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Dynamic Coresets
Timothy M. Chan
2009· article· en· Discrete & Computational Geometry· Computer Science
machine 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
machine 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
machine prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Sporadic Reinhardt Polygons
Kevin G. Hare, Michael J. Mossinghoff
2013· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Unique Determination of Convex Lattice Sets
Dmitry Ryabogin, Vladyslav Yaskin, Ning Zhang
2016· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Lattice Polytopes with Distinct Pair-Sums
M. D. Choi, T. Y. Lam, Bruce Reznick
2002· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Geometric Construction of a Coboundary of a Cycle
Madjid Állili, Tomasz Kaczyński
2001· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Incidence Theorems for Pseudoflats
Izabella Łaba, József Solymosi
2007· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Covering Squares with Squares
H. L. Abbott, Meir Katchalski
2000· article· en· Discrete & Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
6
citations

How this was built: Screen · Findings · About