anchor.diff:  
           false -> OldRT
       end,
  -    ?RT:check(OldRT, RT, rt_loop:get_neighb(State), true),
  +    ?RT:check(OldRT, NewRT, rt_loop:get_neighb(State), true),
       rt_loop:set_rt(State, NewRT);
   
   % lookup a random key chosen with a pdf:
  
positive.code: 
      % convert former neighboring nodes to normal nodes and add sticky nodes
      FilteredRT = lists:foldl(fun sticky_entry_to_normal_node/2, RT, ConvertNodesIds),
      sets:fold(fun add_sticky_entry/2, FilteredRT, ToBeAddedNodes)
      .
  
  %% userdevguide-begin rt_frtchord:update
  
negative.code: %% @doc Converts the internal RT to the external RT used by the dht_node.
  %% The external routing table is optimized to speed up ?RT:next_hop/2. For this, it is
  %%  only a gb_tree with keys being node ids and values being of type node:node_type().
  -spec export_rt_to_dht_node_helper(rt()) -> external_rt().
  export_rt_to_dht_node_helper(RT) ->
      % From each rt_entry, we extract only the field "node" and add it to the tree
      % under the node id. The source node is filtered.
      util:gb_trees_foldl(
  