anchor.diff:  
   %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
   
  -calc_network_partitions(Nodes, Seed1, OldPartition,
  +calc_network_partitions(Method, Nodes, Seed1, OldPartition,
                           OldThreshold, NoPartitionThreshold) ->
       {Cutoff2, Seed2} = random:uniform_s(100, Seed1),
       if Cutoff2 < OldThreshold ->
  
positive.code:             if Cutoff3 < NoPartitionThreshold ->
                      {Seed3, {[], [Nodes]}};
                 true ->
                      make_network_partition_locations(Nodes, Seed3)
              end
      end.
  
  make_network_partition_locations(Nodes, Seed1) ->
      %% TODO: To simplify debugging a bit, I'm switching to partitions that are
      %%       bi-directional only.
      Num = length(Nodes),
      {Seed2, WeightsNodes} = lists:foldl(
                                fun(Node, {Seeda, Acc}) ->
  
negative.code: 
  handle_call({get, Nodes}, _From, S) ->
      {Seed2, Partitions} =
          calc_network_partitions(S#state.method,
                                  Nodes,
                                  S#state.seed,
                                  S#state.old_partitions,
                                  S#state.old_threshold,
  