Thus, the assumption that c A (v t ) < c * (v t ) cannot be satisfied.
it can be proved that each node on the bipartite graph must reach the highest confidence it can reach so that the global confidence of the bipartite graph must be optimal when confidence boosting propagation process ends no matter what order time labels are propagated in.