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
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 2 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
Stochastic iterative decoders
Chris Winstead, Vincent Gaudet, Anthony Rapley, Christian Schlegel
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
64
citations
afffundunlabeled
Fast Successive-Cancellation-Based Decoders of Polar Codes
Maryam Haghighi Ardakani, Muhammad Hanif, Masoud Ardakani, Chintha Tellambura
2019· article· en· IEEE Transactions on Communications· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
affunlabeled
237 Gbit/s unrolled hardware polar decoder
Pascal Giard, Gabi Sarkis, Claude Thibeault, Warren J. Gross
2015· article· en· Espace ÉTS (ETS)· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
affno abstractunlabeled
Fast Low-Complexity Decoders for Low-Rate Polar Codes
Pascal Giard, Alexios Balatsoukas‐Stimming, Gabi Sarkis, Claude Thibeault, Warren J. Gross
2016· article· en· Journal of Signal Processing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
affunlabeled
On Designing Good LDPC Codes for Markov Channels
Andrew W. Eckford, Frank R. Kschischang, Subbarayan Pasupathy
2007· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Low-voltage CMOS circuits for analog iterative decoders
Chris Winstead, Nhan Trung Nguyen, Vincent Gaudet, Christian Schlegel
2006· article· en· IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affunlabeled
On Factor Graphs and the Fourier Transform
Yongyi Mao, Frank R. Kschischang
2005· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affunlabeled
Rateless Slepian-Wolf Codes
Andrew W. Eckford, Wei Yu
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
← previousnext →

How this was built: Screen · Findings · About