MétaCan
Menu
Back to cohort
Record W1599928621 · doi:10.22230/src.2013v4n3a126

Cracking the Agrippa Code: Cryptography for the Digital Humanities

2013· article· en· W1599928621 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.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueScholarly and Research Communication · 2013
Typearticle
Languageen
FieldComputer Science
TopicDigital and Cyber Forensics
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsCryptanalysisEncryptionCryptographySubject (documents)ArtComputer scienceCode (set theory)Computer securityWorld Wide WebProgramming language

Abstract

fetched live from OpenAlex

In The Laws of Cool, Liu (2004) argues that the art book Agrippa (A Book of the Dead) (Gibson, 1992) is an exhibit of destructive creativity. According to Liu, the book’s great auto-da-fé occurs when the software program, which is included with the book, displays an electronic poem, and then self-encrypts, a mechanism that destroys or “permanently disappears” (p. 340) the poem. This article argues that Liu’s understanding of encryption is incorrect. Encryption is not destruction because enciphered text is necessarily subject to cryptanalysis (“cracking”). Relatedly, this article demonstrates that Kirschenbaum’s thesis of “no round trip” is mistaken (Kirschenbaum, Reside, & Liu, 2008). Agrippa was fully cracked and reverse-engineered in the course of an online, global cryptanalysis challenge. This article describes the forensic details of Agrippa and its cryptographic routines.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies, Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.707
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0020.001
Scholarly communication0.0110.005
Open science0.0020.001
Research integrity0.0000.001
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.081
GPT teacher head0.317
Teacher spread0.236 · 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