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
IEEE Computer Architecture Letters
Topic
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.

16 results · 1 filter active ·
Results by year
20072025
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.
16 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 16 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 16 of 16 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
Stripes: Bit-Serial Deep Neural Network Computing
Patrick Judd, Jorge Albericio, Andreas Moshovos
2016· article· en· IEEE Computer Architecture Letters· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affunlabeled
Inter-Core Locality Aware Memory Scheduling
Dongdong Li, Tor M. Aamodt
2015· article· en· IEEE Computer Architecture Letters· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
afffundunlabeled
MCsim: An Extensible DRAM Memory Controller Simulator
Reza Mirosanlou, Danlu Guo, Mohamed Hassan, Rodolfo Pellizzoni
2020· article· en· IEEE Computer Architecture Letters· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Soft Failures in Large Datacenters
Sriram Sankar, Sudhanva Gurumurthi
2013· article· en· IEEE Computer Architecture Letters· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
By-Software Branch Prediction in Loops
Maziar Goudarzi, Reza Azimi, Julian Humecki, Faizaan Rehman, Richard Zhang, Chirag Sethi +2 more
2023· article· en· IEEE Computer Architecture Letters· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
A Performance Model for Disintegrated Manycores
Mark C. Jeffrey, Natalie Enright Jerger
2025· article· IEEE Computer Architecture Letters· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Fusing Adds and Shifts for Efficient Dot Products
Pavel Golikov, Karthik Ganesan, Gennady Pekhimenko, Mark C. Jeffrey
2025· article· en· IEEE Computer Architecture Letters· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About