anchor.diff:                  _ -> ok
               end,
               Changed = (Index =:= first_index() orelse
  -                       (gb_trees:lookup(prev_index(Index), RT) =/= {value, {Node, RTLoop}})),
  -            {gb_trees:enter(Index, {Node, RTLoop}, RT), Changed};
  +                       (gb_trees:lookup(prev_index(Index), RT) =/= {value, {Node, PidRT}})),
  +            {gb_trees:enter(Index, {Node, PidRT}, RT), Changed};
           false ->
               %% there should be nothing shorter than succ
               case intervals:in(node:id(Node), nodelist:succ_range(Neighbors)) of
                   %% ignore message
                   false -> {RT, false};
                   %% add succ to RT
  -                true -> {gb_trees:enter(Index, {Node, RTLoop}, RT), true}
  +                true -> {gb_trees:enter(Index, {Node, PidRT}, RT), true}
               end
       end.
   %% userdevguide-end rt_chord:stabilize
  
positive.code: %% @doc Removes dead nodes from the routing table.
  -spec filter_dead_node(rt(), DeadPid::comm:mypid(), Reason::fd:reason()) -> rt().
  filter_dead_node(RT, DeadPid, _Reason) ->
      DeadIndices = [Index || {Index, {Node, _RTLoop}}  <- gb_trees:to_list(RT),
                              node:same_process(Node, DeadPid)],
      lists:foldl(fun(Index, Tree) -> gb_trees:delete(Index, Tree) end,
                  RT, DeadIndices).
  
negative.code:     Tree = lists:foldl(fun(Node, Tree) ->
                                  gb_trees:enter(node:id(Node), node:pidX(Node), Tree)
                          end, gb_trees:empty(), Preds ++ Succs),
      ERT = util:gb_trees_foldl(fun (_Key, {Node, PidRT}, Acc) ->
                                   % only store the id and the according PidRT Pid
                                   case node:id(Node) =:= Id of
                                       true  -> Acc;
                                       false -> gb_trees:enter(node:id(Node), PidRT, Acc)
                                   end
                          end, Tree, RT),
      ERT.
  