Dijkstra keeps the best distance known so far for each router. Those tentative values are not final until the router is chosen.
Source starts at zero
Dijkstra starts by giving source A distance 0. Other routers wait for a discovered path.
A proposes first distances
A proposes C at 2 and B at 4.
d(C)=2,d(B)=4
Discovered is not final
A proposed B at 4, but that number is still tentative. Another path could replace it before B is chosen.
d(B)tentative=4
Tentative means best so far
C is currently closer because 2 is less than 4.
Remember who proposed it
Those first claims also remember A as the predecessor for C and B. The predecessor can change only when a smaller claim appears.
predecessor records the best claim
Summary
Tentative distances are best-so-far claims that can still improve until their router is chosen as the smallest unsettled router.
tentative best so far