MétaCan
Menu
Back to cohort
Record W2081605254 · doi:10.1109/pcoda.2015.7067178

A generalized monitor verdict for log trace triaging

2015· article· en· W2081605254 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 institutionsUniversité du Québec à Chicoutimi
Fundersnot available
KeywordsTRACE (psycholinguistics)Computer scienceProperty (philosophy)Equivalence (formal languages)Event (particle physics)Set (abstract data type)Cluster analysisTheoretical computer scienceCompleteness (order theory)Data miningProgramming languageArtificial intelligenceMathematicsDiscrete mathematics

Abstract

fetched live from OpenAlex

This paper introduces a new approach at classifying event traces with respect to some property expressed in Linear Temporal Logic generalizing the classical Boolean outcome. We produce from the evaluation of the formula on a given trace a data structure called a trace hologram. When such holograms are interpreted as equivalence classes, we show how manipulating them produce a clustering of event traces into various categories, depending on the precise way in which each group of traces violate the specification. The approach has been integrated into in an existing bug tracker in an entirely automated fashion, and experimented on a set of traces extracted from the execution of a real-world program.

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.001
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.735
Threshold uncertainty score0.278

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.046
GPT teacher head0.297
Teacher spread0.250 · 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