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 1 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
Realizations of the Associahedron and Cyclohedron
Christophe Hohlweg, Carsten E. M. C. Lange
2007· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
126
citations
affno abstractunlabeled
An Incidence Theorem in Higher Dimensions
József Solymosi, Terence Tao
2012· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
120
citations
affno abstractunlabeled
Matroid Polytopes and their Volumes
Federico Ardila, Carolina Benedetti, Jeffrey Doker
2009· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
89
citations
afffundno abstractunlabeled
Global Rigidity: The Effect of Coning
Robert Connelly, Walter Whiteley
2009· article· en· Discrete & Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
74
citations
fundno affno abstractunlabeled
Blowing Up Polygonal Linkages
Robert Connelly, Erik D. Demaine, G�nter Rote
2003· article· en· Discrete & Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
73
citations
afffundno abstractunlabeled
Covering Things with Things
Stefan Langerman, Pat Morin
2004· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
Enumerative Properties of Ferrers Graphs
Richard Ehrenborg, Stephanie van Willigenburg
2004· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
58
citations
afffundno abstractunlabeled
Computing Cartograms with Optimal Complexity
Md. Jawaherul Alam, Thérèse Biedl, Stefan Felsner, Michael Kaufmann, Stephen Kobourov, Torsten Ueckerdt
2013· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
fundno affno abstractunlabeled
Multi-Pass Geometric Algorithms
Timothy M. Chan, Eric Chen
2006· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
affno abstractunlabeled
Lattice substitution systems and model sets
Jeong-Yup Lee, Robert V. Moody
2001· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
54
citations
affno abstractunlabeled
Matroid Enumeration for Incidence Geometry
Yoshitake Matsumoto, Sonoko Moriyama, Hiroshi Imai, David Avis
2011· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
afffundno abstractunlabeled
Multiple Coverings of the Plane with Triangles
Gábor Tardos, Gézá Tóth
2007· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
42
citations
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
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
afffundno abstractunlabeled
Colourful Simplicial Depth
Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky
2006· article· en· Discrete & Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
29
citations
afffundno abstractunlabeled
Transversals to Line Segments in Three-Dimensional Space
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2005· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
afffundno abstractunlabeled
On Minimum Stars and Maximum Matchings
Sándor P. Fekete, Henk Meijer
2000· article· en· Discrete & Computational Geometry· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
27
citations
afffundno abstractunlabeled
Lines, Betweenness and Metric Spaces
Pierre Aboulker, Guangda Huzhang, Rohan Kapadia, Cathryn Supko
2016· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
fundno affno abstractunlabeled
The Size of Spanning Disks for Polygonal Curves
Joel Hass, Jack Snoeyink, William P. Thurston
2002· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
The Complexity of Hyperplane Depth in the Plane
Stefan Langerman, William Steiger
2003· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
afffundno abstractunlabeled
A Continuous d-Step Conjecture for Polytopes
Antoine Deza, Tamás Terlaky, Yuriy Zinchenko
2008· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Traversing a Set of Points with a Minimum Number of Turns
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferrán Hurtado, Pável Valtr
2008· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
The Odd-Distance Plane Graph
Hayri Ardal, Ján Maňuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho
2009· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations

How this was built: Screen · Findings · About