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
Neural Computation
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.

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

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

afffundunlabeled
A Fast Learning Algorithm for Deep Belief Nets
Geoffrey E. Hinton, Simon Osindero, Yee‐Whye Teh
2006· article· en· Neural Computation· Computer Science
machine prediction:candidate · noneconsensus · none
16,404
citations
afffundunlabeled
The Cocktail Party Problem
S. Haykin, Zhe Chen
2005· review· en· Neural Computation· Computer Science
machine prediction:candidate · noneconsensus · none
515
citations
affunlabeled
Boosting Neural Networks
Holger Schwenk, Yoshua Bengio
2000· article· en· Neural Computation· Computer Science
machine prediction:candidate · noneconsensus · none
303
citations
affunlabeled
Correlational Neural Networks
Sarath Chandar, Mitesh M. Khapra, Hugo Larochelle, Balaraman Ravindran
2015· article· en· Neural Computation· Computer Science
machine prediction:candidate · noneconsensus · none
137
citations
affunlabeled
Sophisticated Inference
Karl Friston, Lancelot Da Costa, Danijar Hafner, Casper Hesp, Thomas Parr
2021· article· en· Neural Computation· Neuroscience
machine prediction:candidate · noneconsensus · none
120
citations
affunlabeled
Gated Orthogonal Recurrent Units: On Learning to Forget
Li Jing, Çağlar Gülçehre, John Peurifoy, Yichen Shen, Max Tegmark, Marin Soljačić +1 more
2019· article· en· Neural Computation· Computer Science
machine prediction:candidate · noneconsensus · none
101
citations
affunlabeled
Fast Population Coding
Quentin J. M. Huys, Richard S. Zemel, Rama Natarajan, Peter Dayan
2007· letter· en· Neural Computation· Neuroscience
machine prediction:candidate · noneconsensus · none
69
citations
afffundunlabeled
An Infinite Restricted Boltzmann Machine
Marc-Alexandre Côté, Hugo Larochelle
2016· article· en· Neural Computation· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
next →

How this was built: Screen · Findings · About