  In [3] we constructed the parity-biquandle bracket valued in {\em pictures}
(linear combinations of $4$-valent 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.
