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 2 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
On-chip networks
Natalie Enright Jerger, Tushar Krishna, Li-Shiuan Peh
2017· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
venueno affno abstractunlabeled
Note on the generalized connectivity.
Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
A note on the alternating group network
Eddie Cheng, Ke Qiu, Zhizhang Shen
2010· article· en· The Journal of Supercomputing· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affunlabeled
DART
Danyao Wang, Natalie Enright Jerger, J. Gregory Steffan
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affunlabeled
Hoplite
Nachiket Kapre, Jan Gray
2017· article· en· ACM Transactions on Reconfigurable Technology and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affunlabeled
Take the Highway
Mohamed S. Abdelfattah, Andrew Bitar, Vaughn Betz
2015· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affunlabeled
DBAR
Sheng Ma, Natalie Enright Jerger, Zhiying Wang
2011· article· en· ACM SIGARCH Computer Architecture News· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
On broadcasting in unicyclic graphs
Hovhannes A. Harutyunyan, Edward Maraachlian
2008· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
DRAIN: Deadlock Removal for Arbitrary Irregular Networks
Mayank Parasar, Hossein Farrokhbakht, Natalie Enright Jerger, Paul V. Gratz, Tushar Krishna, Joshua San Miguel
2020· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Interconnection Networks
Fayez Gebali
2011· other· en· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
afffundunlabeled
Networks-on-Chip for FPGAs
Mohamed S. Abdelfattah, Vaughn Betz
2014· article· en· ACM Transactions on Reconfigurable Technology and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Bounds on the average connectivity of a graph
Peter Dankelmann, Ortrud R. Oellermann
2003· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
afffundunlabeled
The runahead network-on-chip
Zimo Li, Joshua San Miguel, Natalie Enright Jerger
2016· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
← previousnext →

How this was built: Screen · Findings · About