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
Evolutionary Algorithms and Applications
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.

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

Labels cover 0 of 691 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 691 of 691 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.

affunlabeled
DEAP: evolutionary algorithms made easy
Félix-Antoine Fortin, François-Michel De Rainville, Marc-André Gardner, Marc Parizeau, Christian Gagné
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
1,670
citations
afffundno abstractunlabeled
Open issues in genetic programming
Michael O’Neill, Leonardo Vanneschi, Steven Gustafson, Wolfgang Banzhaf
2010· article· en· Genetic Programming and Evolvable Machines· Computer Science
machine prediction:candidate · noneconsensus · none
230
citations
affunlabeled
Search-Based Procedural Generation of Maze-Like Levels
Daniel Ashlock, C. Lee, Cameron McGuinness
2011· article· en· IEEE Transactions on Computational Intelligence and AI in Games· Computer Science
machine prediction:candidate · noneconsensus · none
107
citations
affno abstractunlabeled
Data Dependence in Combining Classifiers
Mohamed S. Kamel, Nayer Wanas
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
Numerical Bifurcation Analysis
Hil G. E. Meijer, Fabio Dercole, Bart E. Oldeman
2009· book-chapter· en· Encyclopedia of Complexity and Systems Science· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
affunlabeled
Genetic programming on GPUs for image processing
Simon Harding, Wolfgang Banzhaf
2008· article· en· International Journal of High Performance Systems Architecture· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Two-factor designs
Martin Krzywinski, Naomi Altman
2014· article· en· Nature Methods· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations

How this was built: Screen · Findings · About