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
Topic
Scheduling and Optimization Algorithms
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,020 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,020 works in the cohort · of 4,299,418page 1 of 21

Labels cover 2 of 1,020 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,020 of 1,020 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
Scheduling Algorithms
Fayez Gebali
2008· book-chapter· en· Engineering
machine prediction:candidate · noneconsensus · none
175
citations
affunlabeled
Combinatorial Optimization and Reasoning with Graph Neural Networks
Quentin Cappart, Didier Chételat, Elias B. Khalil, Andrea Lodi, Christopher Morris, Petar Veličković
2021· article· en· Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)· Engineering
machine prediction:candidate · noneconsensus · none
172
citations
affno abstractunlabeled
Two-machine flow shops with limited machine availability
Wiesław Kubiak, Jacek Błażewicz, Piotr Formanowicz, Joachim Breit, Günter Schmidt
2002· article· en· European Journal of Operational Research· Engineering
machine prediction:candidate · noneconsensus · none
116
citations
affno abstractunlabeled
Countering forgetting through training and deployment
Mohamad Y. Jaber, Hemant V. Kher, Darwin J. Davis
2003· article· en· International Journal of Production Economics· Engineering
machine prediction:candidate · noneconsensus · none
108
citations
affno abstractunlabeled
Multiagent based Supply Chain Management
Brahim Chaib-draa
2006· book· en· Studies in computational intelligence· Engineering
machine prediction:candidate · noneconsensus · none
99
citations
fundno affunlabeled
Minimizing Cycle Time in a Blocking Flowshop
Isa Nakhai Kamal Abadi, Nicholas G. Hall, Chelliah Sriskandarajah
2000· article· en· Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
93
citations
affno abstractunlabeled
Level Crossing Methods in Stochastic Models
Percy H. Brill
2008· book· en· International series in management science/operations research/International series in operations research & management science· Engineering
machine prediction:candidate · noneconsensus · none
69
citations

How this was built: Screen · Findings · About