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 44 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
Power-optimal MIMO two-way relay networks
2018· dissertation· en· e-scholar@UOIT (University of Ontario Institute of Technology)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Two-Way Source-Channel Coding
Jian-Jia Weng, Fady Alajaji, Tamás Linder
2020· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Spanning trees in pseudorandom graphs via sorting networks
Joseph Hyde, Natasha Morrison, Alp Müyesser, Matías Pavez‐Signé
2025· article· lv· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Evacuating from ℓp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _p$$\end{document} Unit Disks in the Wireless Model - (Extended Abstract).
Konstantinos Georgiou, Sean Leizerovich, Jesse Lucier, Somnath Kundu
2021· article· en· Algorithmic Aspects of Wireless Sensor Networks· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations

How this was built: Screen · Findings · About