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

afffundno abstractunlabeled
Reprint of: Approximating majority depth
Dan Chen, Pat Morin
2013· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Metric Spaces
Volker Runde, S Axler, K.A. Ribet
2005· book-chapter· en· Universitext· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
venueno affno abstractunlabeled
On the Face Lattice of a Poset Polyhedron.
Stephan Foldes, Alexander Lawrenz
2001· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Homotopy Height, Grid-Major Height and Graph-Drawing Height
Thérèse Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders
2019· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · 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
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Spanning Trees in Multipartite Geometric Graphs
Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel Smid
2016· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Probing View Plan Solution Space
2005· article· en· NPARC· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Super-Mixed-Connected Line Digraphs.
Rui Li, Zhao Zhang
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the Oriented Line Graph.
Elizabeth Moseman, Christopher Storm
2014· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Geometric Spanners For Compact Regions
Francois-Xavier Chaplain Corriveau
2021· dissertation· en· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Representing Directed Trees as Straight Skeletons
Oswin Aichholzer, Thérèse Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader +1 more
2015· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Hamiltonian tetrahedralizations with Steiner points
Francisco Escalona, Ruy Fabila‐Monroy, Jorge Urrutia
2015· article· es· Boletín de la Sociedad Matemática Mexicana· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/0967-0653(95)99939-o
2000· article· en· Time to knit· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affno abstractunlabeled
(t, k)-Geodetic Set of a Graph.
Mustafa Atıcı
2007· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Perfect Delaunay Polytopes in Low Dimensions
Mathieu Dutour Sikirić, Robert Erdahl, Konstantin Rybnikov
2007· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · 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
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Approximating geometric bottleneck shortest paths
Prosenjit Bose, Anil K. Maheshwari, Giri Narasimhan, Norbert Zeh
2004· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · 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
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
α-Visibility
Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri-Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
afffundno abstractunlabeled
Rectilinear path problems in restricted memory setup
Binay Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Plane Spanners of Degree Eight
Darryl Hill
2015· dissertation· en· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Hamiltonian cycles in sparse vertex-adjacency duals
Perouz Taslakian, Godfried Toussaint
2004· article· en· Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
On the d-independence number in 1-planar graphs
Thérèse Biedl, Prosenjit Bose, Babak Miraftab
2025· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Packing Unit Disks
2008· dissertation· en· UWSpace (University of Waterloo)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About