Our proposed system can be used to find match cuts both within a title and across multiple titles. However, the number of shot pairs that need to be compared is quadratic in the number of shots, which can quickly become a bottleneck if we want to find match cuts across multiple titles. To avoid this, we can replace steps 4 and 5 in Section REF  with an approximate nearest neighbors approach (ANN) such as FAISS [1]}. For this approach, we first need to build an index of the representations that we computed in Section REF . Once this index is built, we can retrieve the top-\(K\)  results for each shot, and then compute the global top-\(K\)  pairs.
