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 26 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

fundno affunlabeled
Covering families of triangles
Otfried Cheong, Olivier Devillers, Marc Glisse, Jiwon Park
2023· article· en· Periodica Mathematica Hungarica· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Some Excluded Minors for the Spindle Surface
Thomas J. Savitsky, Steven Schluchter
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
River Crossing Problems
Marcel Danesi
2024· book-chapter· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
venueno affno abstractunlabeled
Minimum Sets Forcing Monochromatic Triangles.
Arie Bialostocki, Mark J. Nielsen
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Linear-Time Fitting of a k-Step Function
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Spectral geometry
Yaiza Canzani
2018· other· en· Contemporary mathematics - American Mathematical Society· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
On the Planar Spherical Depth and Lens Depth.
David Avis, Rasoul Shahsavarifar
2017· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · stsconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/0967-0653(95)97931-x
2000· article· en· Time to knit· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Linear Recurrence Sequences
Eric L. F. Roettger, Hugh C. Williams
2025· book-chapter· en· CMS/CAIMS books in mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Intersection of Tetrahedra
Conor McCoid, Martin J. Gander
2025· article· en· ACM Transactions on Mathematical Software· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Visibility Center of a Simple Polygon
Anna Lubiw, Anurag Murty Naredla
2021· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
0
citations
affno abstractunlabeled
SURFICIAL MAPPING WITH A TWIST
Lauren Brunton, Abigail Burt, Brian Cousens
2024· article· en· Abstracts with programs - Geological Society of America· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Large Matchings in Maximal 1-planar graphs
Thérèse Biedl, John Wittnebel
2023· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affunlabeled
Dynamic unit-disk range reporting
2025· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Noncrossing Longest Paths and Cycles
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari +4 more
2025· preprint· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About