Before revision:  Our first algorithm maintains a polylog(n)-spanner of size \tilde  (n) in polylog(n) amortized update time.
After revision:  Our first algorithm maintains a polylog(n)-spanner of size \tilde O (n) in polylog(n) amortized update time.