The source is the arXiv abstract for 2610.12466 (cs.AI, v1, submitted 8 October 2026). We read the abstract, not the full paper, so details of the method are limited to what the abstract states.
METR expresses AI capability as a 50% time horizon: the human completion time of software tasks that an AI system solves half the time. Fitting that number requires a model of how success probability falls as tasks get longer. METR's approach assumes difficulty is linear in the log of human time.
Nguyen and Fithian relax that assumption with splines and item-response theory. Their fitted spline is almost flat between roughly 2 and 30 minutes and near linear outside that range. A practical consequence: moving from 3 minutes to 30 minutes is easier for an AI than moving from 30 minutes to 5 hours, even though each is a factor of ten.
That matters for trend lines. A plot showing horizon doubling every fixed period implicitly treats each doubling as equal progress. If difficulty is not uniform in log time, the same doubling can hide very different gains.
The authors say their point estimates score better under cross-validated proper scoring rules. They also supply diagnostic plots to check whether time horizons measure what they claim to, and recommend using those plots as longer-task benchmarks appear.
Limits: this is one preprint, not reviewed, and we have not checked its code or data. Independent critiques of METR's statistics already exist, but this paper is the newest and uses a different method.