CFA and Generalizability Theory applied to LLM leaderboards show latent general-factor slopes are stable (R_g=0.97) while manifest scaling-law slopes are unreliable (R_β=0.53), with contributor metadata explaining more rank variance than architecture.
Title resolution pending
1 Pith paper cite this work, alongside 99 external citations. Polarity classification is still indexing.
1
Pith paper citing it
99
external citations · OpenAlex
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
AI Cartography: Mapping the Latent Landscape of AI Benchmark Ecosystems
CFA and Generalizability Theory applied to LLM leaderboards show latent general-factor slopes are stable (R_g=0.97) while manifest scaling-law slopes are unreliable (R_β=0.53), with contributor metadata explaining more rank variance than architecture.