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
Interconnection Networks and Systems
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.

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

Labels cover 0 of 1,044 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 1,044 of 1,044 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
Searching for majority with k-tuple queries
Gianluca De Marco, Evangelos Kranakis
2015· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Comment on "Generic universal switch blocks"
Hongbing Fan, Yu-Liang Wu, Yao‐Wen Chang
2002· article· en· IEEE Transactions on Computers· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
Myrinet networks: a performance study
Ying Qian, Ahmad Afsahi, Reza Zamani
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
A New Construction of Broadcast Graphs
Hovhannes A. Harutyunyan, Zhiyuan Li
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Bipartite roots of graphs
Lap Chi Lau
2004· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
HopliteBuf
Tushar Garg, Saud Wasly, Rodolfo Pellizzoni, Nachiket Kapre
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
There and Back Again
Matthew Poremba, Itir Akgun, Jieming Yin, Onur Kayıran, Yuan Xie, Gabriel H. Loh
2017· article· en· ACM SIGARCH Computer Architecture News· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
7
citations
affunlabeled
HopliteBuf
Tushar Garg, Saud Wasly, Rodolfo Pellizzoni, Nachiket Kapre
2020· article· en· ACM Transactions on Reconfigurable Technology and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
← previousnext →

How this was built: Screen · Findings · About