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
SIAM Journal on Optimization
Topic
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.

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

Labels cover 0 of 43 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 43 of 43 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 Proximal Average: Basic Theory
Heinz H. Bauschke, Rafal Goebel, Yves Lucet, Xianfu Wang
2008· article· en· SIAM Journal on Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
120
citations
affunlabeled
Exact Regularization of Convex Programs
Michael P. Friedlander, Paul Tseng
2007· article· en· SIAM Journal on Optimization· Engineering
machine prediction:candidate · noneconsensus · none
105
citations
affunlabeled
Asplund Decomposition of Monotone Operators
Jonathan M. Borwein, Herre Wiersma
2007· article· en· SIAM Journal on Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
fundno affunlabeled
Dual Space Preconditioning for Gradient Descent
Chris J. Maddison, Daniel Paulin, Yee Whye Teh, Arnaud Doucet
2021· preprint· en· SIAM Journal on Optimization· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
The Bregman Proximal Average
Xianfu Wang, Heinz H. Bauschke
2022· article· en· SIAM Journal on Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Lattice Reformulation Cuts
Karen Aardal, Andrea Lodi, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey
2021· article· en· SIAM Journal on Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About