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
Topic
Computational Geometry and Mesh Generation
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.

1,616 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.
1,616 works in the cohort · of 4,299,418page 32 of 33

Labels cover 0 of 1,616 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 1,616 of 1,616 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
Light edges in degree-constrained graphs
Prosenjit Bose, Michiel H. M. Smid, David R. Wood
2004· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Algorithms for Problems on Maximum Density Segment
Md. Shafiul Alam, Atri Mukhopadhyay
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Bounded-degree polyhedronization of point sets
Gill Barequet, Nadia M. Benbernou, D. G. Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque +5 more
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Decomposition for Simple Polygons.
Marilyn Breen
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Touring Convex Polygons in Polygonal Domain Fences
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Path cover using only short paths
Mingyang Gong, Guangting Chen, Zhizhong Chen, Guohui Lin, Riki Uchida
2025· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Piercing unit geodesic disks
Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer
2025· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Abstract Ovals Of Order 9.
Massimo Giulietti, Elisa Montanucci
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
10.1145/3757377.3794980
AI Generated
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affno abstractunlabeled
Nested BIBDs from affine planes.
David R. Berman
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Simple Silhouettes for Complex Meshes.
Danil Kirsanov, Pedro V. Sander, Steven J. Gortler
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Forest Covers and Bounded Forest Covers
Daya Ram Gaur, Barun Gorain, Shaswati Patra, Rishi Ranjan Singh
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Thalidomide: The journey from curse to boon
2023· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On Some Polyhedra Covering Problems
Cao An Wang, Boting Yang, Binhai Zhu
2000· article· en· Journal of Combinatorial Optimization· 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
Colored anchored visibility representations in 2D and 3D space
Carla Binucci, Emilio Di Giacomo, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Vera Sacristán +1 more
2019· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Isoperimetric Enclosures
Greg Aloupis, Luis Barba, Jean-Lou De Carufel, Stefan Langerman, Diane L. Souvaine
2015· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Segment Visibility for k-Transmitters
Yeganeh Bahoo, Somnath Kundu, Kody Manastyrski
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Approximability of covering cells with line segments
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luı́s Fernando Schultz Xavier da Silveira
2019· preprint· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About