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 18 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
On the Determinism of Multi-core Processors
Vladimir‐Alexandru Paun, Bruno Monsuez, Philippe Baufreton
2013· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
A Case Study in Reverse Engineering GPGPUs
Ahmad Lashgar, Ebad Salehi, Amirali Baniasadi
2016· article· en· ACM SIGARCH Computer Architecture News· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
MIX10
Vineet Kumar, Laurie Hendren
2014· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
A Generative Process for Contractive Auto-Encoders.
Salah Rifai, Yann Dauphin, Pascal Vincent, Yoshua Bengio
2012· article· en· International Conference on Machine Learning· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Approximate Cache in GPGPUs
Ehsan Atoofian
2020· article· en· ACM Transactions on Embedded Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Phantom-BTB
Ioana Burcea, Andreas Moshovos
2009· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Kind analysis for MATLAB
Jesse Doherty, Laurie Hendren, Soroush Radpour
2011· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Parallel Simulation of Pore Networks Using Multicore CPUs
J. Matadamas-Hernández, Graciela Román-Alonso, Fernando Rojas, Miguel A. Castro-García, Azzedine Boukerche, Manuel Aguilar-Cornejo
2012· article· en· IEEE Transactions on Computers· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
User-level Threading
Martin Karsten, Saman Barghi
2020· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Parallelism in Ada: Status and Prospects
Luís Miguel Pinho, Brad Moore, Stephen Michell
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
DynaSprint
Ziqiang Huang, José A. Joao, Alejandro Rico, Andrew D. Hilton, Benjamin C. Lee
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
A GPGPU PROGRAMMING FRAMEWORK BASED ON A SHARED-MEMORY MODEL
Kazuhiko Ohno, Dai Michiura, Masaki Matsumoto, Takahiro Sasaki, Toshio Kondo
2013· article· en· Parallel and Distributed Computing and Networks· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Tree-Traversal Orientation Analysis
Kevin Andrusky, Stephen Curial, José Nelson Amaral
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
rNdN: Fast Query Compilation for NVIDIA GPUs
Alexander Krolik, Clark Verbrugge, Laurie Hendren
2023· article· en· ACM Transactions on Architecture and Code Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Pointy
Ioana Burcea, Livio Soares, Andreas Moshovos
2012· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
5
citations
affunlabeled
BLUTune: Query-informed Multi-stage IBM Db2 Tuning via ML
Connor Henderson, Spencer Bryson, Vincent Corvinelli, Parke Godfrey, Piotr Mierzejewski, Jaroslaw Szlichta +1 more
2022· article· en· Proceedings of the 31st ACM International Conference on Information & Knowledge Management· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About