\item For each $\pd \isdirdep \pc$, find a merge base
$M \le W,\; \le \tipdy$ and merge $\tipdy$ into $W$.
That is, use $\alg{Merge}$ with $L = W,\; R = \tipdy$.
-(Dependency merge.)
+(Dependency Merge.)
\item For each $S \in S^{\pcn}_i$, merge it into $W$.
That is, use $\alg{Merge}$ with $L = W,\; R = S,\; M = M^{\pcn}_i$.
-(Base sibling merge.)
+(Base Sibling Merge.)
\end{enumerate}
\item
Use $\alg{Create Base}$ with $L$ = $\pdy,\; \pq = \pc$ to generate $C$
-and set $W \iassign C$.
+and set $W \iassign C$. (Recreate Base Beginning.)
\item
Execute the subalgorithm $\alg{Recreate-Recurse}(\pc)$.
+\item
+
+Declare that we contain all of the relevant information from the
+sources. That is, use $\alg{Pseudo-merge}$ with $L = W, \;
+\set R = \{ W \} \cup \set S^{\pcn}$.
+(Recreate Base Final Declaration.)
+
\end{enumerate}
\subsubsection{$\alg{Recreate-Recurse}(\pd)$}
\item TODO what about non-Topbloke base branches
\item Use $\alg{Pseudo-Merge}$ with $L = W,\; \set R = \{ \tipdn \}$.
-(Recreate Base Psuedo-merge.)
+(Recreate Base Dependency Base Declaration.)
\item For all $\hasdep$-maximal $\pd' \isdirdep \pd$,
execute $\alg{Recreate-Recurse}(\pd')$.
(Recreate Reapply.)
\end{enumerate}
+
+
+\subsection{$\alg{Merge-Tip}(\pc)$}
+
+\begin{enumerate}
+
+\item TODO CHOOSE/REFINE W AND S as was done during Ranking for bases
+
+\item $\alg{Merge}$ from $\tipcn$. That is, $L = W, \;
+R = \tipcn$ and choose any suitable $M$. (Tip Base Merge.)
+
+\item For each source $S \in \set S^{\pcy}$,
+$\alg{Merge}$ with $L = W, \; R = S$ and any suitable $M$.
+(Tip Source Merge.)
+
+\end{enumerate}