aspireai.
PUBLIC EDITION

Google released Gemini 4 Carbon today: #1 on the Artificial Analysis Intelligence Index at 59, 88.2 percent on SEC-bench Pro, and an introductory price of 2 dollars per million input tokens

AspireAI community · Google
Google DeepMind announced Gemini 4 Carbon on October 28, two weeks after Gemini 4 Argon, calling it its strongest model with state-of-the-art cybersecurity and long-horizon capability. Carbon takes the number one spot on version 5.0 of the Artificial Analysis Intelligence Index at a score of 59, and leads the external cyber benchmarks Google reports: 88.2 percent on SEC-bench Pro for finding vulnerabilities, 54.8 percent on ExploitGym for exploitation, and 71.0 percent on CWE-bench for patching. On WebDev Arena it jumps 89 Elo points to fourth place at 1769. It launches at the same introductory price as Argon, 2 dollars per million input tokens and 10 dollars per million output tokens with cached input at 95 percent off, rising to 4 and 20 dollars after the introductory period. One honest caveat: Carbon is not shipping to developers yet. Rollout starts with a subset of cyber defenders this week, then widens through the Fairwind Program, so the numbers above are Google's own reported evaluations rather than figures an outside party has reproduced.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.