In [3] we constructed the parity-biquandle bracket valued in pictures (linear combinations of 4valent graphs). We gave no example of classical links such that the parity-biquandle bracket of which is not trivial.In the present paper we slightly change the notation of the parity-biquandle bracket and give examples of knots and links having a non-trivial parity-biquandle bracket. As a result we get the minimality theorem. This is the first evidence that graphs (link shadows) appear as invariants of link diagrams instead of just polynomials groups and other tractable objects.1) it is defined by using states in a way similar to the Kauffman bracket, 2) it is valued not in numbers or (Laurent) polynomials but in diagrams meaning that we do not completely resolve a knot diagram leaving some crossings intact.It is important to note that for some (completely odd) diagrams, no crossings are smoothed at all. It is the first appearance of diagram-valued invariants in knot theory. For virtual knots, it allows one to make very strong conclusions about the shape of any diagram by looking just at one diagram. Unfortunately, the value of the bracket at classical knots is trivial.