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 5 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
Autogenerating software polar decoders
Gabi Sarkis, Pascal Giard, Claude Thibeault, Warren J. Gross
2014· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Graph cuts is a max-product algorithm
Daniel Tarlow, Inmar E. Givoni, Richard S. Zemel, Brendan J. Frey
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Trapping Sets of Fountain Codes
Vivian Lucia Orozco, Shahram Yousefi
2010· article· en· IEEE Communications Letters· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Connecting spatially coupled LDPC code chains
Dmitri Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
afffundno abstractunlabeled
Tracking Forecast Memories for Stochastic Decoding
Saeed Sharifi Tehrani, Ali Naderi, Guy-Armand Kamendje, Shie Mannor, Warren J. Gross
2010· article· en· Journal of Signal Processing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Simplified Dynamic SC-Flip Polar Decoding
Furkan Ercan, Thibaud Tonnellier, Nghia Doan, Warren J. Gross
2020· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations

How this was built: Screen · Findings · About