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

affno abstractunlabeled
Compact Relaxations for Polynomial Programming Problems
Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine
2012· book-chapter· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
aboutno affunlabeled
Optimisation sans dérivées sous contraintes
Mathilde Peyrega
2016· article· fr· PolyPublie (École Polytechnique de Montréal)· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Structured Systems of Nonlinear Equations
Sana Jahedi, Timothy Sauer, James A. Yorke
2023· article· en· SIAM Journal on Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Criss-Cross Pivoting Rules
Tamás Terlaky
2008· book-chapter· en· Encyclopedia of Optimization· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Uniform simplex of an arbitrary orientation
Gabriel Jarry–Bolduc, Patrick Nadeau, Shambhavi Singh
2019· article· en· Optimization Letters· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Penalty Algorithms in Hilbert Spaces
Jean Pierre Dussault, Hai Shen, André D. Bandrauk
2006· article· en· Acta Mathematica Sinica English Series· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Skydiving to bootstrap islands
Aike Liu, David Simmons–Duffin, Ning Su, Balt C. van Rees
2025· article· en· Journal of High Energy Physics· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Mesh Adaptive Direct Search
Charles Audet, Warren Hare
2017· book-chapter· en· Springer series in operations research/Springer series in operations research and financial engineering· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About