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

Export CSVExport JSONAPI query

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
Canadian Conference on 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.

115 results · 1 filter active ·
Results by year
20012021
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.
115 works in the cohort · of 4,299,418page 1 of 3

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

affunlabeled
Zipper Unfoldings of Polyhedral Complexes
Erik D. DemaineMartin, L. Demaine, Anna Lubiw, Jonah L. Shallit
2010· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Optimal Bounds on Theta-Graphs: More is not Always Better.
Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot
2012· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Tiling Layouts with Dominoes
Chris Worman, Mark D. Watson
2004· article· en· Canadian Conference on Computational Geometry· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
When can a graph form an orthogonal polyhedron
Thérèse Biedl, Burkay Genç
2004· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
On the Inverse Beacon Attraction Region of a Point.
Bahram Kouhestani, David Rappaport, Kai Salomaa
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Time-Windowed Closest Pair
Timothy M. Chan, Simon Pratt
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Almost Online Square Packing
Shahin Kamali, Alejandro López-Ortíz
2014· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Morphing Planar Graph Drawings.
Anna Lubiw
2007· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
The Possible Hull of Imprecise Points
Jeff Sember, William Evans
2011· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Edge Guards for Polyhedra in 3-Space.
Javier Cano, Csaba D. Tóth, Jorge Urrutia
2012· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Weighted Region Problem in Arrangement of Lines
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2013· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
The Length of the Beacon Attraction Trajectory.
Bahram Kouhestani, David Rappaport, Kai Salomaa
2016· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Buttons & Scissors is NP-Complete.
Harrison Gregg, Jody Leonard, Aaron Santiago, Aaron Williams
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Emanation Graph: A New t-Spanner.
Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal
2018· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Computing Nice Sweeps for Polyhedra and Polygons
Prosenjit Bose, Marc van Kreveld
2004· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Flipping your lid
Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin
2001· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Efficient Snap Rounding with Integer Arithmetic.
Binay Bhattacharya, Jeff Sember
2007· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Bounded-Curvature Path Normalization
Jonathan Backer, David Kirkpatrick
2006· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
An In-Place Priority Search Tree
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2011· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Tight Bounds for Point Recolouring.
Yurai Núñez Rodríguez, David Rappaport
2006· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Turning Orthogonally Convex Polyhedra into Orthoballs
Fidel Barrera-Cruz, Thérèse Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour
2014· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Approximating Radio Maps.
Iris Ashkenazi, Boaz Ben‐Moshe, Jihad El‐Sana
2005· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Collinearities in Kinetic Point Sets
Benjamin Lund, George Purdy, Justin W. Smith, Csaba D. Tóth
2011· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Progressive Alignment of Shapes.
Ashwin Gopinath, David Kirkpatrick, Paul W. K. Rothemund, Chris Thachuk
2016· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
next →

How this was built: Screen · Findings · About