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

affno abstractunlabeled
Derivative-Free and Blackbox Optimization
Charles Audet, Warren Hare
2017· book· en· Springer series in operations research/Springer series in operations research and financial engineering· Computer Science
machine prediction:candidate · noneconsensus · none
499
citations
affno abstractunlabeled
On lattice reduction for polynomial matrices
Thom Mulders, Arne Storjohann
2003· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
119
citations
affno abstractunlabeled
Comprehensive Triangular Decomposition
Changbo Chen, Oleg Golubitsky, François Lemaire, Marc Moreno Maza, Wei Pan
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
94
citations
afffundunlabeled
Tropical Algebraic Geometry
Ilia Itenberg, Eugeniĭ Shustin, Grigory Mikhalkin
2007· book· en· Oberwolfach Seminars· Computer Science
machine prediction:candidate · noneconsensus · none
89
citations
affno abstractunlabeled
On the geometry of polar varieties
Bernd Bank, M Giusti, Joos Heintz, Mohab Safey El Din, Éric Schost
2010· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affunlabeled
Differential equations for algebraic functions
Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost
2007· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
68
citations
affno abstractunlabeled
Rank of divisors on tropical curves
Jan Hladký, Daniel Král͏̌, Serguei Norine
2013· article· en· Journal of Combinatorial Theory Series A· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affno abstractunlabeled
Triangular decomposition of semi-algebraic systems
Changbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican Xia, Rong Xiao
2011· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
fundno affunlabeled
Tropical Monte Carlo quadrature for Feynman integrals
Michael Borinsky
2023· article· en· Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affno abstractunlabeled
Normal forms for general polynomial matrices
Bernhard Beckermann, George Labahn, Gilles Villard
2006· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
afffundunlabeled
Sums of squares and varieties of minimal degree
Grigoriy Blekherman, Gregory G. Smith, Mauricio Velasco
2015· article· lv· Journal of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affno abstractunlabeled
On the complexity of the generalized MinRank problem
Jean‐Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2013· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
affunlabeled
On the complexity of the D5 principle
Xavier Dahan, Éric Schost, Marc Moreno Maza, Wenyuan Wu, Yongjian Xie
2005· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
fundno affunlabeled
Elliptic scattering equations
Carlos Cardona, Humberto Gomez
2016· article· en· Journal of High Energy Physics· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affunlabeled
Jet and prolongation spaces
Rahim Moosa, Thomas Scanlon
2010· article· en· Journal of the Institute of Mathematics of Jussieu· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Sparse polynomial division using a heap
Michael Monagan, Roman Pearce
2010· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Triangular <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>x</mml:mi></mml:math>-basis decompositions and derandomization of linear algebra algorithms over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mstyle mathvariant="sans-serif"><mml:mi>K</mml:mi></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mi>x</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>
Somit Gupta, Soumojit Sarkar, Arne Storjohann, Johnny Valeriote
2011· article· lv· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
A Recursive Test for P-Matrices
Michael J. Tsatsomeros, Lei Li
2000· article· en· BIT Numerical Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
Commutative Algebra in the Mizar System
Piotr Rudnicki, Christoph Schwarzweller, Andrzej Trybulec
2001· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
next →

How this was built: Screen · Findings · About