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
IEEE Transactions on Information Theory
Topic
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.

451 results · 1 filter active ·
Results by year
20002025
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.
451 works in the cohort · of 4,299,418page 2 of 10

Labels cover 0 of 451 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 451 of 451 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Efficient Search of Girth-Optimal QC-LDPC Codes
Alireza Tasdighi, Amir H. Banihashemi, Mohammad‐Reza Sadeghi
2016· article· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
77
citations
affunlabeled
On sampling in shift invariant spaces
Wen Chen, Shintaro Itoh, Junji Shiki
2002· article· en· IEEE Transactions on Information Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
68
citations
affunlabeled
Communication Over Finite-Field Matrix Channels
Danilo Silva, Frank R. Kschischang, Ralf Kötter
2010· article· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
66
citations
afffundunlabeled
Estimation Efficiency Under Privacy Constraints
2018· article· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · open_science+insufficient_payloadconsensus · none
64
citations
affunlabeled
How Do More Golay Sequences Arise?
F. Fiedler, Jonathan Jedwab
2006· article· en· IEEE Transactions on Information Theory· Engineering
distilled prediction:candidate · noneconsensus · none
60
citations
affunlabeled
On the Redundancy of Slepian–Wolf Coding
Dake He, L. A. Lastras-Montaño, En‐hui Yang, Ashish Jagmohan, Jun Chen
2009· article· en· IEEE Transactions on Information Theory· Engineering
distilled prediction:candidate · noneconsensus · none
59
citations
affunlabeled
On the Construction of Skew Quasi-Cyclic Codes
Taher Abualrub, Ali Ghrayeb, Nuh Aydın, İrfan Şiap
2010· article· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
55
citations
afffundunlabeled
Optimization of Heterogeneous Coded Caching
Alexander Michael Daniel, Wei Yu
2019· article· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
47
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
distilled prediction:candidate · noneconsensus · none
47
citations

How this was built: Screen · Findings · About