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

21 results · 1 filter active ·
Results by year
20122025
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.
21 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 21 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 21 of 21 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
QPLIB: a library of quadratic programming instances
Fabio Furini, Pietro Belotti, Antonio Frangioni, Ambros Gleixner, Leo Liberti, Andrea Lodi +5 more
2018· article· en· Mathematical Programming Computation· Engineering
machine prediction:candidate · noneconsensus · none
82
citations
affno abstractunlabeled
Local cuts for mixed-integer programming
Vašek Chvátal, William J. Cook, Daniel Espinoza
2013· article· en· Mathematical Programming Computation· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Optimization of algorithms with OPAL
Charles Audet, Kien-Cong Dang, Dominique Orban
2014· article· en· Mathematical Programming Computation· Mathematics
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
The strength of multi-row models
Quentin Louveaux, Laurent Poirrier, Domenico Salvagnin
2014· article· en· Mathematical Programming Computation· Engineering
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Enumeration of 2-level polytopes
Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich
2018· article· en· Mathematical Programming Computation· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Split cuts from sparse disjunctions
Ricardo Fukasawa, Laurent Poirrier, Shenghao Yang
2020· article· en· Mathematical Programming Computation· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
The MIP Workshop 2023 Computational Competition on reoptimization
Suresh Bolusani, Mathieu Besançon, Ambros Gleixner, Timo Berthold, Claudia D’Ambrosio, Gonzalo Muñoz +2 more
2024· article· en· Mathematical Programming Computation· Decision Sciences
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Local elimination in the traveling salesman problem
William J. Cook, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder
2024· article· en· Mathematical Programming Computation· Engineering
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About