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
Cooperative Communication and Network Coding
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.

2,341 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.
2,341 works in the cohort · of 4,299,418page 1 of 47

Labels cover 3 of 2,341 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 2,341 of 2,341 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
How Practical is Network Coding?
Mea Wang, Baochun Li
2006· article· en· International Workshop on Quality of Service· Computer Science
machine prediction:candidate · noneconsensus · none
1,402
citations
affunlabeled
Multihop Diversity in Wireless Relaying Channels
John Boyer, D.D. Falconer, Halim Yanıkömeroğlu
2004· article· en· IEEE Transactions on Communications· Computer Science
machine prediction:candidate · noneconsensus · none
673
citations
affunlabeled
Max-Max Relay Selection for Relays with Buffers
Aïssa Ikhlef, Diomidis S. Michalopoulos, Robert Schober
2012· article· en· IEEE Transactions on Wireless Communications· Computer Science
machine prediction:candidate · noneconsensus · none
310
citations
affunlabeled
Distributed space-time block coding
Simon Yiu, Robert Schober, Lutz Lampe
2006· article· en· IEEE Transactions on Communications· Computer Science
machine prediction:candidate · noneconsensus · none
257
citations
affunlabeled
Buffer-Aided Relaying with Adaptive Link Selection
Nikola Zlatanov, Robert Schober, Petar Popovski
2012· article· en· IEEE Journal on Selected Areas in Communications· Computer Science
machine prediction:candidate · noneconsensus · none
245
citations
affunlabeled
Power allocation in wireless multi-user relay networks
Khoa T. Phan, Tho Le‐Ngoc, Sergiy A. Vorobyov, Chintha Tellambura
2009· article· en· IEEE Transactions on Wireless Communications· Computer Science
machine prediction:candidate · noneconsensus · none
157
citations
affunlabeled
Rateless Coding for Wireless Relay Channels
Jeff Castura, Yongyi Mao
2007· article· en· IEEE Transactions on Wireless Communications· Computer Science
machine prediction:candidate · noneconsensus · none
143
citations

How this was built: Screen · Findings · About