In paper 'The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree', section vertex-color distance oracles mentioned an oracle that expected size ˜O(n^{1+1}/k), and reports (4k −5)-approximate distances in O(k) time. That oracle is from another paper that you've read. Provide the full name of that paper.