anchor.diff:  
   handle_custom_message({rt_get_node, From}, State) ->
       MyNode = nodelist:node(rt_loop:get_neighb(State)),
  -    comm:send(From, {rt_learn_node, {node:id(MyNode), node:pidX(MyNode), comm:this()}}),
  +    comm:send(From, {rt_learn_node, node2mynode(MyNode, comm:this())}),
       State;
   
   handle_custom_message({rt_learn_node, NewNode}, State) ->
  
positive.code:     % request approximated ring size
      gossip_load:get_values_best([]),
  
      MyNode = node2mynode(nodelist:node(Neighbors)),
      update_entries(Neighbors, add_source_entry(MyNode, #rt_t{})).
  
  %% @doc Hashes the key to the identifier space.
  
negative.code:     ToBeAddedNodes1 = sets:subtract(NewNeighbors3, OldNeighbors3),
      %% Add PidRTs to the nodes to be added. There might be PidRTs in the old RT
      %% even for "new" nodes, e.g. for nodes added through get_rt_reply (i.e. for
      %% normal nodes are converted to sticky nodes). Get the VersionIds from the
      %% list of new nodes.
      OldNodes = lists:map(fun rt_entry_node/1, gb_trees:values(get_rt_tree(RT))),
      NewNodes = lists:map(fun(Node) -> {node:id(Node), node:id_version(Node),
                                         node:pidX(Node)}
                           end, NewNeighbors1),
      ToBeAddedNodes2 =
          util:sets_map(fun({Id, PidDHT}) ->
                                PidRT = case lists:keyfind(Id, 1, OldNodes) of
                                    {_Id, _IdVersion, _PidDHT, PidRT0} -> PidRT0;
                                    _else -> none
                                end,
                                {_, IdVersion, _} = lists:keyfind(Id, 1, NewNodes),
                                {Id, IdVersion, PidDHT, PidRT}
                        end, ToBeAddedNodes1),
  
      %% uncomment for debugging
  