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
Computers & Operations Research
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.

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

Labels cover 1 of 270 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 270 of 270 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
Hybrid methods for lot sizing on parallel machines
Diego Jacinto Fiorotto, Silvio Alexandre de Araújo, Raf Jans
2015· article· en· Computers & Operations Research· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
30
citations
afffundno abstractunlabeled
The dial-a-ride problem with private fleet and common carrier
Cleder Marcos Schenekemberg, Antônio Augusto Chaves, Leandro C. Coelho, Thiago André Guimarães, Gustavo G. Avelino
2022· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
The balanced traveling salesmanproblem
John Larusic, Abraham P. Punnen
2010· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
A Tabu search algorithm for the network pricing problem
Luce Brotcorne, Fabien Cirinei, Patrice Marcotte, Gilles Savard
2012· article· en· Computers & Operations Research· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundno abstractunlabeled
Appointment scheduling with a quantile objective
Peijun Sang, Mehmet A. Begen, Jiguo Cao
2021· article· en· Computers & Operations Research· Health Professions
machine prediction:candidate · noneconsensus · none
17
citations
afffundno abstractunlabeled
The doubly open park-and-loop routing problem
Nicolás Cabrera, Jean‐François Cordeau, Jorge E. Mendoza
2022· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Heuristics for the mixed swapping problem
Charles Bordenave, Michel Gendreau
2009· article· en· Computers & Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
17
citations

How this was built: Screen · Findings · About