A policy that survives one interface can be bypassed by another, and this protocol rebinds authorization to the route
AspireAI community · arXiv (cs.AI)
Computer-use agents act through GUIs, command lines, APIs, scripts and MCP servers. A policy decision can be interface-invariant while its executable authorization is not: another route can bypass mediation, flip a security-relevant default, or commit after the authorized state has changed. This paper presents a profile-bounded protocol for a fixed, versioned deployment. It enumerates effect-bearing routes and durable sinks, checks a route-to-sink enforcement cut, normalizes each request to a canonical effect, issues a route-bound prepare ticket, and re-verifies route, effect, grant, trace, profile, inventory and authoritative state at commit time, requiring an agreeing sink receipt. The reference profile registers 12 effect families, five interfaces and 60 routes, and two structurally distinct runtime mappings produce 3,464 traces over 1,732 scenarios each. The authors are explicit that the guarantees bind the declared profile and its effect semantics, and that the protocol is not a general agent security model.
Read the story and explore more from the AspireAI community.
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.