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 11 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
DC-Free Error-Control Block Codes
Fengqin Zhai, Y. Xin, I.J. Fair
2005· article· en· IEEE Transactions on Communications· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
The Complexity of Symmetry Breaking in Massive Graphs
Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Flexible soft-output decoding of polar codes
Sunghoon Lee, Joo Youn Park, Il‐Min Kim, Jun Heo
2021· article· en· EURASIP Journal on Wireless Communications and Networking· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Towards deterministic tree code constructions.
Mark Braverman
2011· article· en· Electronic colloquium on computational complexity· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundunlabeled
On polar multiple description coding
Mehrdad Valipour, Shahram Yousefi
2015· article· en· IET Communications· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Energy complexity of polar codes
Christopher Blake, Frank R. Kschischang
2016· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About