A deterministic algorithm for signing bipartite graphs at the Ramanujan bound | ArxivCSExplorer