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

afffundno abstractunlabeled
Small separations in pinch-graphic matroids
Bertrand Guenin, Cheolwon Heo
2023· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Recognizing pinch-graphic matroids
Bertrand Guenin, Cheolwon Heo
2023· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Small Chvátal Rank
Tristram Bogart, Annie Raymond, Rekha R. Thomas
2010· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Recognizing even-cycle and even-cut matroids
Bertrand Guenin, Cheolwon Heo
2023· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
General bounds for incremental maximization
Aaron Bernstein, Yann Disser, Martin Groß
2020· preprint· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Complete positivity and distance-avoiding sets
Evan DeCorte, Fernando Mário de Oliveira Filho, Frank Vallentin
2020· preprint· en· Mathematical Programming· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Stabilization of capacitated matching games
Matthew Gerstbrein, Laura Sanità, Lucy Verberk
2024· article· en· Mathematical Programming· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
1
citations
fundno affno abstractunlabeled
The two-stripe symmetric circulant TSP is in P
Samuel C. Gutekunst, Billy Jin, David P. Williamson
2025· article· en· Mathematical Programming· Materials Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On the chromatic polynomial of a graph
David Avis, Caterina De Simone, Paolo Nobili
2002· article· en· Mathematical Programming· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Mixed-integer bilevel representability
Amitabh Basu, Christopher Ryan, Sriram Sankaranarayanan
2019· preprint· en· Mathematical Programming· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Compressing branch-and-bound trees
Gonzalo Muñoz, Joseph Paat, Álinson Santos Xavier
2024· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Fast Combinatorial Algorithms for Efficient Sortation
Madison Van Dyk, Kim Klause, Jochen Koenemann, Nicole Megow
2025· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About