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
Advanced Data Storage Technologies
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.

585 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.
585 works in the cohort · of 4,299,418page 6 of 12

Labels cover 0 of 585 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 585 of 585 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
Security in DVB‐RCS2
Mark Bowyer, L. Erup, Hans Peter Lexow
2013· article· en· International Journal of Satellite Communications and Networking· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
3D NAND Flash Memories
Rino Micheloni, S. Aritome, Luca Crippa
2018· book-chapter· en· Springer series in advanced microelectronics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Spiffy: Enabling File-System Aware Storage Applications
Kuei Sun, Daniel Fryer, Joseph Chu, Matthew Lakier, Angela Demke Brown, Ashvin Goel
2018· article· en· File and Storage Technologies· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
A self-tuning page cleaner for DB2
Wenguang Wang, Richard B. Bunt
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affaboutunlabeled
Image baby image!
Carol Sin, Danny Wong
2007· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
3
citations
affunlabeled
IMAGine: An In-Memory Accelerated GEMV Engine Overlay
MD Arafat Kabir, Tendayi Kamucheka, Nathaniel Fredricks, Joel Mandebi, Jason D. Bakos, Miaoqing Huang +1 more
2024· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Data preservation in high energy physics
T. Basaglia, M. Bellis, J. Blomer, J. Boyd, C. Bozzi, D. Britzger +48 more
2023· article· en· The European Physical Journal C· Computer Science
machine prediction:candidate · metaresearchconsensus · none
3
citations
afffundunlabeled
The Aurora operating system
Emil Tsalapatis, Ryan Hancock, Tavian Barnes, Ali José Mashtizadeh
2021· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Codes for Distributed Storage
Vinayak Ramkumar, S. B. Balaji, Birenjith Sasidharan, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar
2022· book· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Storage management for large scale systems
Wenguang Wang
2004· article· en· University Library - University of Saskatchewan (University of Saskatchewan)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
10.1016/0967-0653(93)93649-c
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
3
citations
afffundno abstractunlabeled
Efficient Methods for Trace Analysis Parallelization
Fabien Reumont-Locke, Naser Ezzati‐Jivan, Michel Dagenais
2019· article· en· International Journal of Parallel Programming· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About