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 16 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
A 45 GS/s optical soft-decision front-end
Meer Sakib, Monireh Moayedi, Odile Liboiron-Ladouceur
2012· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Learning from the Syndrome
Loren Lugosch, Warren J. Gross
2018· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affunlabeled
Stopping Redundancy Hierarchy Beyond the Minimum Distance
Yauhen Yakimenka, Vitaly Skachek, Irina E. Bocharova, Boris D. Kudryashov
2018· preprint· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Coding for Erasures and Fountain Codes
2024· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
<scp>B</scp>ayesian Belief Networks
Brendan J. Frey
2005· other· en· Encyclopedia of Cognitive Science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Stochastic Computing with Integrated Optics
Hassnaa El-Derhalli, Sébastien Le Beux, Sofiène Tahar
2019· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
A Multi-Kernel Multi-Code Polar Decoder Architecture
Gabriele Coppolino, Carlo Condo, Guido Masera, Warren J. Gross
2018· preprint· en· IEEE Transactions on Circuits and Systems I Regular Papers· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Energy-Efficient protograph-based LDPC codes
Mohamed Yaoumi, Elsa Dupraz, François Leduc-Primeau, Frédéric Guilloud
2019· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
0
citations
affunlabeled
Valiant transform of forney graphs
Ali Al-Bashabsheh, Yongyi Mao
2010· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About