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

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

Labels cover 0 of 58 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 58 of 58 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.

afffundno abstractunlabeled
Emergency path restoration problems
Igor Averbakh
2012· article· en· Discrete Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
The Delivery Man Problem with time windows
Géraldine Heilporn, Jean‐François Cordeau, Gilbert Laporte
2010· article· en· Discrete Optimization· Engineering
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
An exact algorithm for the network pricing problem
Luce Brotcorne, Fabien Cirinei, Patrice Marcotte, Gilles Savard
2010· article· en· Discrete Optimization· Engineering
machine prediction:candidate · noneconsensus · none
28
citations
fundno affno abstractunlabeled
How to recycle your facets
Samuel Fiorini
2006· article· en· Discrete Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
The Bipartite Boolean Quadric Polytope
Piyashat Sripratak, Abraham P. Punnen, Tamon Stephen
2021· article· en· Discrete Optimization· Engineering
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
The quadratic balanced optimization problem
Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya
2014· article· en· Discrete Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Multiroute flows: Cut-trees and realizability
Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair
2005· article· en· Discrete Optimization· Engineering
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Additive stabilizers for unstable graphs
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
2018· preprint· en· Discrete Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Berge’s theorem for the maximum charge problem
Ramesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, H. Sachs
2006· article· en· Discrete Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
A Special Issue in Memory of George B. Dantzig
Egon Balas, Alan J. Hoffman, S. Thomas McCormick
2008· article· en· Discrete Optimization· Psychology
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Generalized resolution search
Marius Posta, Jacques A. Ferland, Philippe Michelon
2010· article· en· Discrete Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On stars and Steiner stars
Adrian Dumitrescu, Csaba D. Tóth
2009· article· en· Discrete Optimization· Engineering
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About