On the Feasibility of Fidelity$^-$ for Graph Pruning