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
Parallel Computing and Optimization Techniques
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.

2,094 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.
2,094 works in the cohort · of 4,299,418page 16 of 42

Labels cover 1 of 2,094 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 2,094 of 2,094 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
Retargetable binary utilities
Maghsoud Abbaspour, Jianwen Zhu
2002· article· en· Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324)· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
IDEal: Efficient and Precise Alias-Aware Dataflow Analysis
Johannes Späth, Karim Ali, Eric Bodden
2017· article· en· Conference on Object-Oriented Programming Systems, Languages, and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Employing Software-Managed Caches in OpenACC
Ahmad Lashgar, Amirali Baniasadi
2016· article· en· ACM Transactions on Modeling and Performance Evaluation of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
miNI
Reza Azimi, Angelos Bilas
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Warp size impact in GPUs
Ahmad Lashgar, Amirali Baniasadi, Ahmad Khonsari
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Genesis
Alton Chiu, Joseph Garvey, Tarek S. Abdelrahman
2015· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
7
citations
affunlabeled
Shift-aware racetrack memory
Ehsan Atoofian, Ahsan Saghir
2015· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Correcting Errors in Message Passing Systems
Jan Bækgaard Pedersen, Alan Wagner
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Error Invariants for Concurrent Traces
Andreas Holzer, Daniel Schwartz‐Narbonne, Mitra Tabaei Befrouei, Georg Weißenbacher, Thomas Wies
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Cold code decompression at runtime
Saumya Debray, William Evans
2003· article· en· Communications of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Real-Time Fine-Grained Parallelism in Ada
Luís Miguel Pinho, Brad Moore, Stephen Michell, S. Tucker Taft
2015· article· en· ACM SIGAda Ada Letters· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
EDGE: Event-Driven GPU Execution
Tayler Hetherington, Maria Lubeznov, Deval Shah, Tor M. Aamodt
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
GPUPool
Xiaodan Serina Tan, Pavel Golikov, Nandita Vijaykumar, Gennady Pekhimenko
2022· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations

How this was built: Screen · Findings · About