MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 6 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
Diversity Analysis of Multi-User Multi-Relay Networks
Junsu Kim, Diomidis S. Michalopoulos, Robert Schober
2011· article· en· IEEE Transactions on Wireless Communications· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Algorithms for Next Generation Networks
Graham Cormode, Marina Thottan
2010· book· en· Computer communications and networks· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
afffundunlabeled
MAC design for analog network coding
Majid Khabbazian, Fabian Kühn, Nancy Lynch, Muriel Médard, Ali ParandehGheibi
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Encyclopedia of Wireless Networks
Xuemin Shen, Xiaodong Lin, Kuan Zhang
2020· book· en· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
An intrinsical description of group codes
José Joaquín Bernal, Ángel del Rı́o, Juan Jacobo Simón
2009· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Cooperative MIMO-beamforming for multiuser relay networks
Amr El‐Keyi, Benoı̂t Champagne
2008· article· en· Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Broadcasting in UDG radio networks with unknown topology
Yuval Emek, Leszek Gąsieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
2008· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
← previousnext →

How this was built: Screen · Findings · About