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
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 2 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. 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
The RegularChains library in MAPLE
François Lemaire, Marc Moreno Maza, Yongjian Xie
2005· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
39
citations
affno abstractunlabeled
A criterion for the half-plane property
David G. Wagner, Yehua Wei
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Elimination theory and Newton polytopes
Alexander Esterov, Askold Khovanskiĭ
2008· article· en· Functional Analysis and Other Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affunlabeled
Computing minimal nullspace bases
Wei Zhou, George Labahn, Arne Storjohann
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affunlabeled
Fast arithmetic for triangular sets
Xin Li, Marc Moreno Maza, Éric Schost
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Weak theories of linear algebra
Neil Thapen, Michael Soltys
2004· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Certified dense linear system solving
Thom Mulders, Arne Storjohann
2003· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Computations modulo regular chains
Xin Li, Marc Moreno Maza, Wei Pan
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Likelihood degenerations
Daniele Agostini, Taylor Brysiewicz, Claudia Fevola, Lukas Kühne, Bernd Sturmfels, Simon Telen +1 more
2023· article· en· Advances in Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
A package for solving parametric polynomial systems
Jürgen Gerhard, David J. Jeffrey, Guillaume Moroz
2010· article· en· ACM communications in computer algebra· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Formal Theories for Linear Algebra
Stephen Cook, Lila Fontes
2012· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
afffundunlabeled
Highly Parallel, High-Precision Numerical Integration
David H. Bailey, Jonathan M. Borwein
2005· article· en· University of North Texas Digital Library (University of North Texas)· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Multi-point evaluation in higher dimensions
Joris van der Hoeven, Éric Schost
2012· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Faithful Realizability of Tropical Curves
Man-Wai Cheung, Lorenzo Fantini, Jennifer Park, Martin Ulirsch
2015· article· en· International Mathematics Research Notices· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
The Tropical Double Description Method
Xavier Allamigeon, Stéphane Gaubert, Éric Goubault
2010· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
afffundno abstractunlabeled
Homogenization and the polynomial calculus
Joshua Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
2002· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
← previousnext →

How this was built: Screen · Findings · About