A team selects IVF for a very large corpus. Which characteristic explains its candidate-pruning mechanism?

1. Requiring every vector to be identical within a partition
2. Traversing only a hierarchy of graph edges
3. Searching selected neighbor partitions instead of comparing every stored vector
4. Sorting document titles alphabetically before every query