LINKS: Brendle and Hung's preprint https://t.co/jtzv9cewhR Refine Report (need to create an account to view) https://t.co/KLFXbkQDxP (we also used an internal unreleased model to do some additional stress-testing, where some of the comments come from)
Ben Golub
Researcher with public evidence across AI research, Compute & infrastructure.
- AI signals
- 3 past 30d
- Sources
- 2 distinct domains
- Discussions
- 1 past 30d
- Latest signal
- 18d ago
Articles & links
@lm_guirola @Jackbmeyer Funny you should say that 😁 (see also Bramoullé Kranton and d'Amours) https://t.co/7QpdOgeUO9
@AlexZevelev One difference from Fable 5 is that it catches a lot more errors See below https://t.co/ecKatcZ7C5
Recent commentary
The Erdős–Sós conjecture is a shockingly simple statement about graphs that we did not know was true: a (simple) graph with average degree > t−2 contains every tree on t vertices. A few days ago, OpenAI's Astra proved it as part of an Epoch AI project. Here's a simple exposition. 1/
In Ben Golub's orbit
Center = Ben Golub. Left = members they follow (green edges). Right = members who follow them (blue edges). Top = mutual follows (orange edges, slightly larger). Drag any node to reposition; click to open that profile.
Are you Ben Golub? Show it.
Add the Who’s Who of AI badge to your site or bio. It links back to this profile.
Markdown: [](https://aiweekly.co/whos-who/person/bengolub-bsky-social)