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 30 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.

affunlabeled
Cross-Stitching Using Little Thread.
Thérèse Biedl, Joseph D. Horton, Alejandro López-Ortíz
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Quebec
2017· other· en· Open Collections· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Discrete Fréchet distance oracles
2025· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The asteroid surveying problem and other puzzles
Timothy M. Chan, Alexander Golynski, Alejandro López-Ortíz, Claude-Guy Quimper
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Distinct distances on two lines
Micha Sharir, Adam Sheffer, József Solymosi
2013· preprint· en· Journal of Combinatorial Theory Series A· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A note on fi-drawable k-trees
David Avis, Jonathan Lenchner, Giuseppe Liotta, Christophe Paul, Marc Pouget, Svetlana Stolpner +1 more
2008· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Optimal Polygon Placement
Prosenjit Bose, Jason Morrison
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Layered Polyline Drawings of Planar Graphs
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Realizations of higher rank toroids
Barry Monson
2023· article· en· The Art of Discrete and Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Upward Point Set Embeddings of Paths and Trees
Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada +1 more
2021· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Curve Stabbing Depth: Data Depth for Plane Curves
Stéphane Durocher, Alexandre Leblanc, Spencer Szabados
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
CAPA newsletter May 1983
2005· other· en· TSpace (University of Toronto)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Advances in discrete geometry
Srečko Brlek, Xavier Provençal
2011· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
and Jewish General Hospital
2015· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
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
afffundno abstractunlabeled
Optimal Art Gallery Localization is NP-hard
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel Smid
2020· preprint· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Instance Optimal Geometric Algorithms
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2015· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
PolyMerge
C. Antonio Sánchez, Sidney Fels
2014· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About