Dual-Route Top-K Retrieval with 1v1 VLM Reranking for the CoVR-R 事件

Dual-Route Top-K Retrieval with 1v1 VLM Reranking for the CoVR-R arXiv:2606.01097v1 Announce Type: new Abstract: We describe \emph{Dual-Route Top-K Retrieval with 1v1 VLM Reranking} for the CoVR-R challenge. The method treats composed video retrieval as two coupled problems: finding a sufficiently complete top-k candidate set, and then safely deciding whether any candidate should replace a strong current top-1. We first improve the reasoning/text seed with a VLM slot selector over existing cand