Rainbow Family: Machine Listening, Improvisation and Access to Justice in International Family Law
Bibliographic record
Abstract
Throughout the Commonwealth and beyond, and whether we agree with it or not, family law is becoming increasingly digitised in contemporary society. It is thus timely and necessary to undertake a careful investigation of the current and potential use of Digital Family Law and to develop a critical framework for examining the role that listening algorithms may play in resolving family disputes to ensure that what is dispensed by machine ‘judges’ approximates something like justice. Focusing on improvising trombonist, composer, and computer/installation artist George E. Lewis’ Rainbow Family (1984) – “a groundbreaking work that employs proto-machine-listening software to analyze an improviser’s performance in real time, while simultaneously generating both complex responses to the musician’s playing and independent behavior arising from the program’s internal processes” – this chapter provides a brief overview of the key issues surrounding the digitisation of family law and the reasons why (machine) listening as improvisation might offer some hope for the future of international Family Justice.
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.004 | 0.012 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.006 | 0.029 |
| Scholarly communication | 0.007 | 0.010 |
| Open science | 0.001 | 0.004 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.011 | 0.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.
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".