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 3 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.

affno abstractunlabeled
Honeycomb toroidal graphs are Cayley graphs
Brian Alspach, Matthew Dean
2009· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Parallel cleaning of a network with brushes
Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Paweł Prałat
2009· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
Routability of Network Topologies in FPGAs
Manuel Saldaña, Lesley Shannon, Yue Jia, Sikang Bian, Jeffrey Craig, Paul Chow
2007· article· en· IEEE Transactions on Very Large Scale Integration (VLSI) Systems· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Range majority in constant time and linear space
Stéphane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
2012· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Packet delay in models of data networks
Henryk Fukś, Anna T. Ławniczak, Stanislav Volkov
2001· article· en· ACM Transactions on Modeling and Computer Simulation· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
<i>k</i>‐Broadcasting in trees
Hovhannes A. Harutyunyan, Arthur L. Liestman
2001· article· en· Networks· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
A Note on the Edge-Connectivity of Cages
Ping Wang, Baoguang Xu, Jianfang Wang
2003· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
ON THE COMBINATORIAL PROPERTIES OF k-ARY n-CUBES
Hamid Sarbazi‐Azad, M. Ould‐Khaoua, Lewis Mackenzie, Selim G. Akl
2004· article· en· Journal of Interconnection Networks· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
Collection and characterization of BCNET BGP traffic
Sukhchandan Lally, Tanjila Farah, Rajvir Gill, Ravinder Paul, Nabil Al-Rousan, Ljiljana Trajković
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Optimal Broadcasting in Fully Connected Trees
Saber Gholami, Hovhannes A. Harutyunyan, Edward Maraachlian
2022· article· en· Journal of Interconnection Networks· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Surfing Interconnect
Mark R. Greenstreet, Jihong Ren
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
← previousnext →

How this was built: Screen · Findings · About