MétaCan
Menu
Back to cohort
Record W2033427227 · doi:10.1145/1711475.1711499

Introduction to the SIGACT news online algorithms column

2010· article· en· W2033427227 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.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueACM SIGACT News · 2010
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Search Problems
Canadian institutionsnot available
Fundersnot available
KeywordsPagingColumn (typography)Computer scienceCompetitive analysisQuarter (Canadian coin)Online algorithmAlgorithmOperations researchInformation retrievalTelecommunicationsHistoryMathematicsUpper and lower bounds

Abstract

fetched live from OpenAlex

Pros and cons of competitive analysis have been debated since its inception in mid 1980s. Much of this discussion centered around the accuracy of performance evaluation methods for paging, which is probably the most central among online optimization problems studied in the literature, and, at the same time, ironically, the most prominent example of shortcomings of competitive analysis. In this quarter's column, Reza Dorrigiv and Alejandro Lopez-Ortiz review the history of the problem, discuss several performance models from the literature, and propose a new model that avoids shortcomings of previous approaches. If you are interested in contributing to the column as a guest writer, feel free to contact me by email. All kinds of contributions related to online algorithms and competitive analysis are of interest: technical articles, surveys, conference reports, opinion pieces, and other.

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.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.585
Threshold uncertainty score0.881

Codex and Gemma teacher scores by category

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

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.022
GPT teacher head0.287
Teacher spread0.265 · 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