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

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

Labels cover 0 of 195 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 195 of 195 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
Optimal 3-terminal cuts and linear programming
Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang
2005· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
fundno affno abstractunlabeled
The submodular joint replenishment problem
Maurice Cheung, Adam N. Elmachtoub, Retsef Levi, David B. Shmoys
2015· article· en· Mathematical Programming· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Nash equilibria in the two-player kidney exchange game
Margarida Carvalho, Andrea Lodi, João Pedro Pedroso, Ana Viana
2016· article· en· Mathematical Programming· Decision Sciences
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Equilibria for networks with malicious users
George Karakostas, Anastasios Viglas
2006· article· en· Mathematical Programming· Decision Sciences
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Finding small stabilizers for unstable graphs
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
2014· article· en· Mathematical Programming· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
The capacitated max k-cut problem
Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli
2007· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
afffundno abstractunlabeled
On the mixing set with a knapsack constraint
Ahmad Abdi, Ricardo Fukasawa
2016· article· en· Mathematical Programming· Decision Sciences
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Symbolic Fenchel Conjugation
Jonathan M. Borwein, Chris Hamilton
2007· article· en· Mathematical Programming· Mathematics
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Restricted 2-factor polytopes
William H. Cunningham, Yaoguang Wang
2000· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations

How this was built: Screen · Findings · About