MétaCan
Menu
Back to cohort
Record W2984179089 · doi:10.1145/3357526.3357548

A unifying abstraction for data structure splicing

2019· article· en· W2984179089 on OpenAlexaff
Louis Ye, Mieszko Lis, Alexandra Fedorova

Bibliographic record

VenueProceedings of the International Symposium on Memory Systems · 2019
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Storage Technologies
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceLocalityAbstractionCacheData structureRNA splicingData spaceParallel computingSpace (punctuation)Cache coherenceDistributed computingTheoretical computer scienceCPU cacheProgramming languageCache algorithmsOperating systemArtificial intelligence

Abstract

fetched live from OpenAlex

Data structure splicing (DSS) refers to reorganizing data structures by merging or splitting them, reordering fields, inlining pointers, etc. DSS has been used, with demonstrated benefits, to improve spatial locality. When data fields that are accessed together are also collocated in the address space, the utilization of hardware caches improves and cache misses decline.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.016
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.009
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.016
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0020.006
Bibliometrics0.0030.006
Science and technology studies0.0030.009
Scholarly communication0.0090.020
Open science0.0070.012
Research integrity0.0030.010
Insufficient payload (model declined to judge)0.0080.006

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.026
GPT teacher head0.269
Teacher spread0.244 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations7
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the International Symposium on Memory SystemsSame topicAdvanced Data Storage TechnologiesFrench-language works237,207