MétaCan
Menu
Back to cohort
Record W4293248052 · doi:10.1145/3538401.3546599

EarlyBird

2022· article· en· W4293248052 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware System Performance and Reliability
Canadian institutionsHuawei Technologies (Canada)
Fundersnot available
KeywordsComputer scienceProcess (computing)Code (set theory)Distributed computingOperating systemProgramming language

Abstract

fetched live from OpenAlex

Many recent studies in datacenter networking have proposed the idea of using information from applications for optimizing and resource planning. These Application-Aware Networks generally assume that applications can provide an accurate view about their requirements from the network and their traffic characteristics in real time. However, relying on the applications and developers to convey the traffic information is not realistic. We believe that automating the process of information extraction from applications is a crucial step towards realizing the idea of Network-Application Integration (NAI). In this paper, we investigate whether we can automatically identify places in the application code that, when executed, lead to predictable changes in the host's network output. By augmenting the application code at these execution places, we can generate explicit signals that can be used to predict local network events (such as changes in rate, bursts, etc.). This creates a mechanism for automatic adjustment of the network based on application signals.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.731
Threshold uncertainty score0.321

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.006
GPT teacher head0.195
Teacher spread0.189 · 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