Bibliographic record
Abstract
In the past seventeen or so years since the publication of pioneering work by David Lewin (Lewin 1990) and Henry Klumpenhouwer (Klumpenhouwer 1991), the theory of Klumpenhouwer networks (hereafter referred to as K-nets) has established itself as an important topic in music theory, but it seems that it is still in its youth.Michael Buchler's recent critical examination of K-net theory (Buchler 2007) is indicative of both its standing in the discipline of music theory and the need for ongoing evaluation of its premises.In this essay I respond to one of the four central issues in Buchler's thoughtful article: K-nets and their association with dual transformation.The juxtaposition of K-nets and dual transformation leads to a broader engagement with some fundamentals and phenomenological and metaphorical considerations of mathematical models in music theory.Remodeling K-nets as dual transformations, as Buchler advocates (Buchler 2007, 7), indeed elucidates transformational voice leading, but dual transformations also dispense with the network organization of K-nets, and thus evince fundamentally different structures than K-net isographies. K-nets, set theory, and graph theory[2] K-nets are typically employed to model sets of pitch classes through internal transformational pairings of pitch classes by the canonical operations of transposition (T ) and inversion (I ).(1) While a relatively large number of K-net representations can be constructed for any set, the number of well-formed K-net representations that can be constructed is considerably smaller.(2) Selecting one K-net representation from the (well-formed) alternatives is an interpretive act; when employed in analysis, the selection is based on musical context, usually in consideration of the relationship of one K-net to its successor(s) or predecessor(s).We turn now to theoretical aspects of K-nets.[3] K-nets call upon the mathematical models of set theory and graph theory, models of different conceptual origins, as Jeffrey Johnson describes: Graph-theoretical constructs are not dependent on Cartesian coordinates, but only on the abstract relationship between dots and connecting lines.Graph theory had its origin in solutions to puzzles and games rather than more intense desires to describe motion, quantify measurement, and, bring order to scientific inquiry that impelled other branches of mathematics (Johnson 1997, 12).
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.009 |
| Scholarly communication | 0.004 | 0.011 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.007 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".