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
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Polynomial and algebraic computation
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.

656 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.
656 works in the cohort · of 4,299,418page 5 of 14

Labels cover 1 of 656 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 656 of 656 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Doing Algebraic Geometry with the RegularChains Library
Parisa Alvandi, Changbo Chen, Steffen Marcus, Marc Moreno Maza, Éric Schost, Paul Vrbik
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
afffundunlabeled
Positive polynomials on fibre products
Salma Kuhlmann, Mihai Putinar
2007· article· fr· Comptes Rendus Mathématique· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
7
citations
venueno affno abstractunlabeled
On Graceful Generalized Spiders and Caterpillars.
Hui Cheng, Bing Yao, Chen Xiang-en, Zhang Zhong-fu
2008· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
On the representation of constructible sets
Changbo Chen, Liyun Li, Marc Moreno Maza, Wei Pan, Yuzhen Xie
2009· article· en· ACM communications in computer algebra· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Formal Theories for Linear Algebra
Stephen Cook, Lila Fontes
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affno abstractunlabeled
Power Series Arithmetic with the BPAS Library
Alexander Brandt, Mahsa Kazemi, Marc Moreno-Maza
2020· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
6
citations
affno abstractunlabeled
The Art of Shaving Logs
Timothy M. Chan
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Polynomials vanishing on grids
Orit E. Raz, Micha Sharir, József Solymosi
2014· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Computing the Level Set Convex Hull
Bilal Abbasi, Adam M. Oberman
2017· article· en· Journal of Scientific Computing· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
5
citations

How this was built: Screen · Findings · About