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
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 2 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
Range Counting with Distinct Constraints.
J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The Gaussian Centre of a Set of Mobile Points
Stéphane Durocher, David Kirkpatrick
2003· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Collection depot location problem in the plane.
Robert Benkoczi, Binay Bhattacharya, Sandip Das, Jeff Sember
2005· article· en· Canadian Conference on Computational Geometry· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Weighted Minimum Backward Frechet Distance.
Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack
2015· 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
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
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
Computing a planar widest empty -siphon in o(n 3 ) time
Boaz Ben‐Moshe, Binay Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi
2007· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Distance-Two Coloring of Barnette Graphs.
Tomás Feder, Pavol Hell, Carlos Subi
2018· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affaboutunlabeled
Open Problems from CCCG 2014.
Sue Whitesides
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Covering Points with Pairs of Concentric Disks.
Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid
2020· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
An Acrophobic Guard Watchtower Problem on Terrains.
Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
2021· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
k-star-shaped polygons.
Jeff Sember, William Evans
2010· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On multi-level k-ranges for range search.
Sean M. Falconer, Bradford G. Nickerson
2004· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Graph Drawing via Layered Partitions.
Vida Dujmović
2019· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Watchtower for k-crossing Visibility.
Yeganeh Bahoo, Prosenjit Bose, Stéphane Durocher
2019· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Sliding k-Transmitters: Hardness and Approximation
Thérèse Biedl, Saeed Mehrabi, Ziting Yu
2016· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Rectangle-of-influence triangulations.
Thérèse Biedl, Anna Lubiw, Saeed Mehrabi, Sander Verdonschot
2016· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Generalizations of Interval Graphs
Pavol Hell
2009· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Reconstructing a Polyhedron between Polygons in Parallel Slices.
Thérèse Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen Merkel, Anurag Murty Naredla
2019· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Minimum Enclosing Circle Problem with Base Point.
Binay Bhattacharya, Lily Li
2017· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The 2x2 simple packing problem
AM André van Renssen, Bettina Speckmann
2011· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Three-Coloring Three-Dimensional Uniform Hypergraphs.
Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne
2019· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Drawing the Horton Set in an Integer Grid of Minimun Size.
Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano
2014· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Packing Boundary-Anchored Rectangles.
Thérèse Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi
2017· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Reconfiguring a Chain of Cubes.
Laurie J. Heyer, Anna Lubiw, Debajyoti Mondal, Ulrike Stege, Sue Whitesides
2015· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Cuttings in 2D Revisited.
Timothy M. Chan
2014· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On the Biplanar Crossing Number of K n .
Stéphane Durocher, Ellen Gethner, Debajyoti Mondal
2016· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Kinetic Data Structures on The Move.
Sue Whitesides
2013· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Online Packing of Equilateral Triangles
Shahin Kamali, Alejandro López-Ortíz, Zahed Rahmati
2015· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About