APA (7th ed.) Citation

Wang, Z., Yin, H., Liu, L., Tong, H., Song, Y., Wong, G., & See, S. (2026). $\mathbb{R}^{2k}$ is Theoretically Large Enough for Embedding-based Top-$k$ Retrieval.

Chicago Style (17th ed.) Citation

Wang, Zihao, Hang Yin, Lihui Liu, Hanghang Tong, Yangqiu Song, Ginny Wong, and Simon See. $\mathbb{R}^{2k}$ Is Theoretically Large Enough for Embedding-based Top-$k$ Retrieval. 2026.

MLA (9th ed.) Citation

Wang, Zihao, et al. $\mathbb{R}^{2k}$ Is Theoretically Large Enough for Embedding-based Top-$k$ Retrieval. 2026.