Guruswami and Wootters first provided a decoding framework for repairing Reed-Solomon codes. There is a series of work after Guruswami-Wootters' repairing scheme. In particular, based on this framework a repairing scheme achieving the cut-set bound was presented by Tamo, Ye and Barg. Guruswami-Wootters' repairing scheme can be modified so that we require downloading less data, i.e., less communication bandwidth. We illustrate our improvement by two examples given in the pioneer paper by Guruswami and Wootters. These examples show that our repairing scheme can save bandwidth $(1-R)^2n$ and $\left(1-2R\right)n$ over the base field, respectively, where $R$ is the code rate and $n$ is the code length.