Before revision:  Based on this model, we formally define the problem of network evolution (NE) and subsequently prove it to be fundamentally hard  by means of reduction from the Knapsack problem (KP).
After revision:  Based on this model, we formally define the problem of network evolution (NE) and subsequently prove it to be fundamentally hard (NP-hard) by means of reduction from the Knapsack problem (KP).