MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
Topic
Vehicle Routing Optimization Methods
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.

1,187 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.
1,187 works in the cohort · of 4,299,418page 22 of 24

Labels cover 1 of 1,187 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 1,187 of 1,187 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.

aboutno affunlabeled
Contributors
2011· article· en· Operations Research· Engineering
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
afffundunlabeled
Selective arc‐ng pricing for vehicle routing
Luciano Costa, Claudio Contardo, Guy Desaulniers, Diego Pecin
2020· article· en· International Transactions in Operational Research· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Solving Canadian Traveller Problem
2017· dissertation· cs· Brno University of Technology Digital Library (Brno University of Technology)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Set Covering Problem
2003· article· en· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
GERAD and HEC Montreal, Canada,
2004· article· en· Engineering
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Trip Planning Problem
Reda Alhajj, Jon Rokne
2018· book-chapter· en· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About