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
Advanced Optimization Algorithms Research
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.

604 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.
604 works in the cohort · of 4,299,418page 1 of 13

Labels cover 1 of 604 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 604 of 604 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
Algorithm 909
Sébastien Le Digabel
2011· article· en· ACM Transactions on Mathematical Software· Mathematics
machine prediction:candidate · noneconsensus · none
627
citations
affno abstractunlabeled
Handbook on Semidefinite, Conic and Polynomial Optimization
2011· book· en· International series in management science/operations research/International series in operations research & management science· Mathematics
machine prediction:candidate · noneconsensus · none
323
citations
affunlabeled
Positive polynomials and sums of squares
Murray Marshall
2008· book-chapter· en· Mathematical surveys and monographs· Mathematics
machine prediction:candidate · noneconsensus · none
274
citations
affno abstractunlabeled
Positive Polynomials and Sums of Squares
Murray Marshall
2008· book· en· Mathematical surveys and monographs· Mathematics
machine prediction:candidate · noneconsensus · none
255
citations
fundno affunlabeled
[no title]
John Watrous
2009· article· en· Theory of Computing· Mathematics
machine prediction:candidate · insufficient_payloadconsensus · none
198
citations
afffundunlabeled
The radius of metric regularity
Asen L. Dontchev, Adrian S. Lewis, R. T. Rockafellar
2002· article· en· Transactions of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
186
citations
affno abstractunlabeled
Cuts for mixed 0-1 conic programming
Mehmet Tolga Cezik, Garud Iyengar
2005· article· en· Mathematical Programming· Mathematics
machine prediction:candidate · noneconsensus · none
120
citations
affunlabeled
The SCIP Optimization Suite 3.2
Gerald Gamrath, Gregor Hendel, Thorsten Koch, Felipe Serrano, Yuji Shinano, Stefan Vigerske +1 more
2016· article· en· TUbilio (Technical University of Darmstadt)· Mathematics
machine prediction:candidate · noneconsensus · none
112
citations
affno abstractunlabeled
On handling indicator constraints in mixed integer programming
Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez +1 more
2016· article· en· Computational Optimization and Applications· Mathematics
machine prediction:candidate · noneconsensus · none
102
citations
affunlabeled
The Benders Dual Decomposition Method
Ragheb Rahmaniani, Shabbir Ahmed, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei
2020· article· en· Operations Research· Mathematics
machine prediction:candidate · noneconsensus · none
77
citations
affvenueunlabeled
Optimization of Polynomial Functions
M. Marshall
2003· article· en· Canadian Mathematical Bulletin· Mathematics
machine prediction:candidate · noneconsensus · none
63
citations
affunlabeled
Geometry of higher-rank numerical ranges
Man-Duen Choi, Michael Giesinger, John Holbrook, David W. Kribs
2007· article· en· Linear and Multilinear Algebra· Mathematics
machine prediction:candidate · noneconsensus · none
56
citations
affunlabeled
A Gentle Introduction to Optimization
Bertrand Guenin, Jochen Könemann, Levent Tunçel
2014· book· en· Cambridge University Press eBooks· Mathematics
machine prediction:candidate · noneconsensus · none
55
citations

How this was built: Screen · Findings · About