Papex

Preprint · arXiv · 06 Aug 2026 · Computer science · Not signed on Papex

A Near-Optimal Lower Bound for Prefix-Matrix Factorizations

Honghao Lin, Vahab Mirrokni, David P. Woodruff

AI use, as the source states it

“The proof was obtained using a fully automated Gemini-based agentic system developed internally at Google.”

Model: Gemini, as stated

Named here, or see a mistake? Write to privacy@papex.org.