MétaCan
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.

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 5 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
The shortest path problem in the Knödel graph
Hayk Grigoryan, Hovhannes A. Harutyunyan
2014· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Theta-3 is connected
2014· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
fundno affno abstractunlabeled
Node-to-set disjoint paths problem in cross-cubes
Xi Wang, Jianxi Fan, Shukui Zhang, Jia Yu
2021· article· en· The Journal of Supercomputing· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
Nonadaptive broadcasting in trees
Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer
2010· article· en· Networks· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Common Unfoldings of Polyominoes and Polycubes
Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb +4 more
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Detecting Threats in Star Graphs
N. Imani, Hamid Sarbazi‐Azad, Albert Y. Zomaya, Parya Moinzadeh
2009· article· en· IEEE Transactions on Parallel and Distributed Systems· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Substrate-Integrated Antennas on Silicon
Natalia K. Nikolova, Maryam Ravan, Reza K. Amineh
2012· book-chapter· en· Advances in imaging and electron physics· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Collection of BCNET BGP traffic
Tanjila Farah, Sukhchandan Lally, Rajvir Gill, Nabil Al-Rousan, Ravinder Paul, Don Xu +1 more
2011· article· en· Summit (Simon Fraser University)· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Placement Optimization for NoC-Enhanced FPGAs
Srivatsan Srinivasan, Andrew Boutros, Fatemehsadat Mahmoudi, Vaughn Betz
2023· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
venueno affno abstractunlabeled
Extraconnectivity of Folded Hypercubes.
Weihua Yang, Jixiang Meng
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
On the surface area of the augmented cubes
Eddie Cheng, Ke Qiu, Zhizhang Shen
2011· article· en· The Journal of Supercomputing· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
MESSY BROADCASTING IN MULTIDIMENSIONAL DIRECTED TORI
Francesc Comellas, Hovhannes A. Harutyunyan, Arthur L. Liestman
2003· article· en· Journal of Interconnection Networks· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations

How this was built: Screen · Findings · About