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 3 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
VC Dimensions of Principal Component Analysis
Yohji Akama, Kei Irie, Akitoshi Kawamura, Yasutaka Uwano
2009· article· en· Discrete & Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Simplices and Spectra of Graphs
Bojan Mohar, Igor Rivin
2009· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
On Arithmetic Progressions in Model Sets
Anna Klick, Nicolae Strungaru, Adi Tcaciuc
2021· article· en· Discrete & Computational Geometry· Materials Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Linkless and Flat Embeddings in 3-Space
Ken‐ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar
2012· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
The Facial Weak Order on Hyperplane Arrangements
Aram Dermenjian, Christophe Hohlweg, Thomas McConville, Vincent Pilaud
2021· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
The Small Octagons of Maximal Width
Charles Audet, Pierre Hansen, Frédéric Messine, Jordan Ninin
2013· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
How to Walk Your Dog in the Mountains with No Magic Leash
Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
2015· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Star Unfolding from a Geodesic Curve
Stephen Kiazyk, Anna Lubiw
2016· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
fundno affno abstractunlabeled
Lines Pinning Lines
Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote
2010· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Oriented Matroid Rigidity of Multiplices
Tibor Bisztriczky, Károly J. Böröczky
2000· article· en· Discrete & Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Packing Convex Bodies by Cylinders
2016· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
aboutno affunlabeled
Realizations of Multiassociahedra via Rigidity
Luis Crespo Ruiz, Francisco Santos
2024· article· lv· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Cubic Tessellations of the Helicosms
Isabel Hubard, Mark Mixer, Daniel Pellicer, Asia Ivić Weiss
2015· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Average Stretch Factor: How Low Does It Go?
Vida Dujmović, Pat Morin, Michiel Smid
2015· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Tight Bounds for Connecting Sites Across Barriers
David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth
2008· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
fundno affno abstractunlabeled
Lines Tangent to Four Triangles in Three-Dimensional Space
Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
2007· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Three-Dimensional Graph Products with Unbounded Stack-Number
David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michał T. Seweryn, David R. Wood
2023· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
An Eberhard-Like Theorem for Pentagons and Heptagons
Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Šámal
2010· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Combinatorics of Intervals in the Plane I: Trapezoids
Daniel Di Benedetto, József Solymosi, Ethan Patrick White
2022· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Drawing Graphs as Spanners
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin +1 more
2022· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Schubert Curves in the Orthogonal Grassmannian
Maria Gillespie, Jake Levinson, Kevin Purbhoo
2023· article· en· Discrete & Computational Geometry· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About