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
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 3 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Memory-Efficient Polar Decoders
2017· article· en· IEEE Journal on Emerging and Selected Topics in Circuits and Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
On codes from hypergraphs
2003· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
35
citations
affunlabeled
Dithered Belief Propagation Decoding
2012· article· en· IEEE Transactions on Communications· Computer Science
distilled prediction:candidate · noneconsensus · none
31
citations
affunlabeled
Learning from the Syndrome
2018· article· en· 2018 52nd Asilomar Conference on Signals, Systems, and Computers· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
30
citations
affunlabeled
Survey of Stochastic Computation on Factor Graphs
2007· article· en· Proceedings/Proceedings - International Symposium on Multiple-Valued Logic· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
30
citations
affunlabeled
Windowed Erasure Codes
2006· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Zipper Codes
2022· article· en· Journal of Lightwave Technology· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
afffundunlabeled
Energy Consumption of VLSI Decoders
2015· article· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
← previousnext →

How this was built: Screen · Findings · About