MétaCan
Menu
Back to cohort
Record W2699718143

Embedded dangers: the history of the year 2000 problem and the politics of technological repair

2016· article· en· W2699718143 on OpenAlexaff
Dylan Mulvin

Bibliographic record

VenueLSE Research Online · 2016
Typearticle
Languageen
FieldComputer Science
TopicHistory of Computing Technologies
Canadian institutionsMcGill University
Fundersnot available
KeywordsContingency planContingencyPoliticsTechnological changeInvestment (military)Dimension (graph theory)BusinessPublic relationsComputer securityPolitical scienceLaw and economicsLawEconomicsComputer science
DOInot available

Abstract

fetched live from OpenAlex

This paper draws on archival research to revisit the Year 2000 Problem as an episode of recent technological history. I argue that the ways Y2K was addressed set the groundwork for the large-scale infrastructural management of technological contingency in the early 21st century. I approach the organized response to the perceived threat of the Y2K bug as one of the greatest, public-facing attempts to educate and train individuals and organizations to manage the unforeseen, and potentially devastating, effects old computer code can have on contemporary computerized infrastructures. This paper examines three key effects of the crisis: 1) the massive resource investment and funding expenditures on computerized infrastructures that few other crises have compelled; 2) the changes in insurance and tort law developed as a dimension of the crisis’ legal repair; and 3) the proliferation of risk management training around computerized infrastructures. By studying these three effects, this paper reconfigures the role of Y2K in the history of computers, infrastructure, and information systems by placing the bug within the larger contexts of infrastructure renewal, public works, and technological literacy.

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.007
metaresearch head score (Gemma)0.021
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Qualitative · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.984
Threshold uncertainty score0.112

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0070.021
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0040.004
Science and technology studies0.0160.048
Scholarly communication0.0150.027
Open science0.0020.008
Research integrity0.0100.013
Insufficient payload (model declined to judge)0.0120.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.058
GPT teacher head0.314
Teacher spread0.256 · 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.

Study designQualitative
Domainnot available
GenreEmpirical

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

Citations1
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueLSE Research OnlineSame topicHistory of Computing TechnologiesFrench-language works237,207