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
Error Correcting Code Techniques
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.

812 results · 1 filter active ·
Results by year
20012025
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.
812 works in the cohort · of 4,299,418page 6 of 17

Labels cover 0 of 812 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 812 of 812 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
Relaxed Half-Stochastic Belief Propagation
François Leduc-Primeau, Saied Hemati, Shie Mannor, Warren J. Gross
2013· article· en· IEEE Transactions on Communications· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Repetition‐assisted decoding of polar codes
Mohammad Rowshan, Emanuele Viterbo, Rino Micheloni, Alessia Marelli
2019· article· en· Electronics Letters· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Relaxed Gaussian Belief Propagation
Yousef El-Kurdi, Dennis D. Giannacopoulos, Warren J. Gross
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Stochastic Multiple Stream Decoding of Cortex Codes
Matthieu Arzel, Cyril Lahuec, Christophe Jégo, Warren J. Gross, Yvain Bruned
2011· article· en· IEEE Transactions on Signal Processing· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Scaling of analog LDPC decoders in sub-100 nm CMOS processes
Meysam Zargham, Christian Schlegel, Jorge Pérez Chamorro, Cyril Lahuec, Fabrice Seguin, Michel Jézéquel +1 more
2010· article· en· Integration· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Low-Latency Software Polar Decoders
2016· article· en· Journal of Signal Processing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Polar codes for data storage applications
Gabi Sarkis, Warren J. Gross
2013· article· en· 2013 International Conference on Computing, Networking and Communications (ICNC)· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Polar codes for noncoherent MIMO signalling
Philip R. Balogun, Ian Marsland, Ramy H. Gohary, Halim Yanıkömeroğlu
2016· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Iterative decoding in analog CMOS
Saied Hemati, Amir H. Banihashemi
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations

How this was built: Screen · Findings · About