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
Metaheuristic Optimization Algorithms Research
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.

762 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.
762 works in the cohort · of 4,299,418page 13 of 16

Labels cover 0 of 762 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 762 of 762 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
One-Shot Learning for MIPs with SOS1 Constraints
Charly Robinson La Rocca, Jean-François Cordeau, Emma Frejinger
2024· article· en· Operations Research Forum· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Graph Based Evolutionary Algorithms
Steven Corns, Daniel Ashlock, Kenneth M. Bryden
2009· book-chapter· en· IGI Global eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Optimally Efficient Bidirectional Search
Eshed Shaham, Ariel Felner, Nathan Sturtevant, Jeffrey S. Rosenschein
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Conclusion and future research directions
Shouvik Paul, Sourav De, Siddhartha Bhattacharyya
2024· book-chapter· en· Elsevier eBooks· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Nonmyopic Multifidelity Acitve Search
Quan Nguyen, Arghavan Modiri, Roman Garnett
2021· article· en· International Conference on Machine Learning· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Towards agent Swarm Optimization
Dario Schor, Witold Kinsner
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About