Before revision:  We demonstrate the application of local information cost by deriving a lower bound on the communication complexity of computing a (2t-1)-spanner that consists of at most O(n^{1+ \frac{1 + \epsilon})
After revision:  For the synchronous CONGEST-KT1 model, where each node has initial knowledge of its neighbors' IDs, we prove that \Omega( local information cost by deriving a lower bound on the communication complexity of computing a (2t-1)-spanner that consists of at most O(n^{1+ \frac{1 + \epsilon})