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

venueno affunlabeled
Study on the Duality between MFP and ACP
Xiaojun Lei, Zhian Liang
2008· article· en· Modern Applied Science· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Chapter 29: The Proximal Gradient Method
Heinz H. Bauschke, Walaa M. Moursi
2023· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Global optimization workshop 2012
2014· article· en· Greater South Information System· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Canada.
2005· article· en· Mathematics
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Equation solving with and without Solver
Bernard V. Liengme
2014· book-chapter· en· Morgan & Claypool Publishers eBooks· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Applications of duality*
Bertrand Guenin, Jochen Könemann, Levent Tunçel
2018· book-chapter· en· Cambridge University Press eBooks· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Sieve Methods
M. Ram Murty
2001· book-chapter· en· Graduate texts in mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The convex hull of the disjunction of polymatroids
Alexander Bockmayr, Nicolai Pisaruk
2000· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Circumcentered methods induced by isometries
Heinz H. Bauschke, Hui Ouyang, Xianfu Wang
2019· preprint· en· arXiv (Cornell University)· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Conjugate gradient in Hilbert spaces
2004· dissertation· ca· eScholarship@McGill (McGill)· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Decomposition theorems for linear programs
Jean-Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke
2014· article· en· RWTH Publications (RWTH Aachen)· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
More Iterative Algorithms
2024· book-chapter· en· Cambridge University Press eBooks· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About