MétaCan
Menu
Back to cohort
Record W7069364912

Lost Again

2024· article· en· W7069364912 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

VenueDOAJ (DOAJ: Directory of Open Access Journals) · 2024
Typearticle
Languageen
FieldEngineering
TopicAstronomical Observations and Instrumentation
Canadian institutionsConcordia University
Fundersnot available
KeywordsFeelingIdeal (ethics)State (computer science)Video gameGame studiesGenerative grammar
DOInot available

Abstract

fetched live from OpenAlex

In tackling chronophobia, which Svetlana Boym (2001) defines as the anxiety of deciding how to use our time meaningfully as it depletes, video games become purposeful spaces where we can revisit the things we have lost, or what we anticipate will be lost with time. As such, video games are ideal tools that help us retreat from chronophobia. However, following Boym, I argue that this “does not help us to deal with the future” (2001, p. 351). To revisit or experience what is already “lost” with time through games, players must lose more time and resources in the present to pursue it. This circular use of nostalgia may leave players with chronophobia and in a state of feeling “lost again.” This paper presents three case studies where nostalgic players have “found” something generative for their present and future, rather than feeling “lost again.” This original solution to chronophobia combines Boym’s work, game studies, and nostalgia research, amounting to my contribution of what I call “refractive nostalgia.”

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 categoriesScholarly communication, Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.577
Threshold uncertainty score1.000

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.001
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0100.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.195
GPT teacher head0.509
Teacher spread0.314 · 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