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 8 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
Control messages delivery protocol
Imad Khazali, Anjali Agarwal
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
6
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
afffundunlabeled
An Analysis of Hypermesh NoCs in FPGAs
Mohammadreza Binesh Marvasti, Ted H. Szymanski
2014· article· en· IEEE Transactions on Parallel and Distributed Systems· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
A Quality-Driven Design Approach for NoCs
S. Bourduas, Jean-Samuel Chenard, Željko Žilić
2008· article· en· IEEE Design & Test of Computers· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Efficient broadcast trees for weighted vertices
Hovhannes A. Harutyunyan, Shahin Kamali
2016· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Randomly twisted hypercubes
Andrzej Dudek, Xavier Pérez‐Giménez, Paweł Prałat, Hao Qi, Douglas B. West, Xuding Zhu
2018· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Broadcasting in necklace graphs
Hovhannes A. Harutyunyan, George Laza, Edward Maraachlian
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On the complexity of the shortest-path broadcast problem
Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina +1 more
2015· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
← previousnext →

How this was built: Screen · Findings · About