In our first participation in the SISAP Indexing Challenge, we secured victories in Tracks 1 and 3 by adapting our previously introduced Exploration Graph to achieve high throughput in low recall regimes. Details of the modifications, including feature compression and redundant path removal, are provided in our SISAP Indexing Challange Paper. To ensure accessibility and extensibility, we implemented our approach using the Python library deglib.