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 4 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
Broadcasting in Harary-Like Graphs
Puspal Bhabak, Hovhannes A. Harutyunyan, Shreelekha Tanna
2014· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Reduction design for generic universal switch blocks
Hongbing Fan, Jiping Liu, Yu‐Liang Wu, C. K. Wong
2002· article· en· ACM Transactions on Design Automation of Electronic Systems· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
The average connectivity of a digraph
Michael A. Henning, Ortrud R. Oellermann
2003· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Routing in Series Parallel Networks
Paola Flocchini, Flaminia L. Luccio
2003· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
afffundunlabeled
HIGHER DIMENSIONAL HONEYCOMB NETWORKS
Jean Carle, Ivan Stojmenović
2001· article· en· Journal of Interconnection Networks· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
afffundunlabeled
Switch-based interconnect architecture for future systems on chip
Partha Pratim Pande, Cristian Grecu, A. Ivanov, Resve Saleh
2003· article· en· Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
The fat banyan ATM switch
Hussein Alnuweiri, R.W. Donaldson
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Computing majority with triple queries
Gianluca De Marco, Evangelos Kranakis, Gábor Wiener
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Worst case constant time priority queue
Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro
2004· article· en· Journal of Systems and Software· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
SEEC: stochastic escape express channel
Mayank Parasar, Natalie Enright Jerger, Paul V. Gratz, Joshua San Miguel, Tushar Krishna
2021· article· en· IEEE International Conference on High Performance Computing, Data, and Analytics· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
On the g-extra connectivity of augmented cubes
Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen, Abhishek Vangipuram
2023· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
On K-broadcasting in graphs
Bin Shao
2006· dissertation· en· Spectrum Research Repository (Concordia University)· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
← previousnext →

How this was built: Screen · Findings · About