Each document from Example 1 is represented by a circle. Shingles shown in the intersection are common to both documents. Only a subset of shingles are shown due to space constraints. Result of two hash functions being applied to shingles is shown with last 34 digits dropped. Minimum hash value for each document is circled in orange. The first hash function selects a shingle common to both documents. The second selects a shingle that exists only in the right document (minimum hash values for the docs don’t match).