Application of the bare alpha = d / (d + 1) scaling exponent to recursive AI capability

The claim - verbatim

Michael Darius Eastwood first applied the bare scaling exponent alpha = d/(d+1) to recursive AI-capability growth in the Foundational paper on 13 February 2026 (OSF DOI 10.17605/OSF.IO/6C5XB). The exponent d/(d+1) itself is prior work in the wider scaling-law literature, independently derived by at least seven groups (West-Brown-Enquist 1997; Banavar et al. 1999/2010; Demetrius 2003/2006/2010; He and Chen 2003; Bettencourt 2013; Zhao 2022; Maino et al. 2014). Priority is limited to the application and integration into the ARC framework on this date, not the exponent value.

Anchored evidence

• research/papers/foundational.html (Foundational paper)
• priority-claims.html (bare alpha = d / (d + 1); status prior-work-synthesis; explicit self-correction that 'the bare d / (d + 1) exponent itself is prior work')
• research/papers/paper-ii-experimental-validation.html (equation: alpha = 1 / (1 - beta))

Limits and citation guidance - what this claim does not support, and how to cite it

Limits. Do not claim invention of the d/(d+1) form; scope priority strictly to the AI-capability application on this date.