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

affunlabeled
Truly Optimal Euclidean Spanners
2019· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
31
citations
affno abstractunlabeled
On RAC drawings of 1-planar graphs
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Algorithms for optimal outlier removal
2009· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Box cutter
2018· article· en· ACM Transactions on Graphics· Computer Science
distilled prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Coloring axis-parallel rectangles
2009· article· en· Journal of Combinatorial Theory Series A· Computer Science
distilled prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Polygons cuttable by a circular saw
2001· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
29
citations
fundno affno abstractunlabeled
Homotopic -Oriented Routing
2013· article· en· Graph Drawing E-print Archive (Die Universität zu Köln)· Computer Science
distilled prediction:candidate · noneconsensus · none
27
citations
afffundno abstractunlabeled
Moving coins
2005· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
aboutno affunlabeled
Open Problems from CCCG 2002
2002· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
26
citations
affno abstractunlabeled
Watchman tours for polygons with holes
2012· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Editorial
2001· editorial· en· Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
25
citations
affno abstractunlabeled
On Constrained Minimum Pseudotriangulations
2003· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
25
citations

How this was built: Screen · Findings · About