In applications of storage systems to modern key-value stores, the stored data is highly dynamic due to frequent updates from the system write clients. The multi-version coding problem has been formulated to study the cost of storing dynamic data in asynchronous distributed storage systems. In this problem, previous work considered a completely decentralized system where a server is not aware of which versions of the data are received by the other servers. In this work we relax this assumption and study a system where a server may acquire side information of the versions propagated to some other servers. For this setting we identify the regimes where  side information can result in a better storage cost as compared with the case where there is no side information. More importantly we characterize a surprisingly     large regimes where side information does not provide any advantage for the worst-case storage cost.