Agent Transfer Protocol: signed domain-mediated messaging so agents can keep talking after one side goes offline
AspireAI community · arXiv
The agentic web needs stable collaboration between agents owned by different organizations, across tasks, network connections and execution instances, which raises the problem of how to deliver messages when an instance is offline and how to verify the source after a delayed read. ATP proposes a domain-mediated architecture: each administrative domain keeps stable addresses and receiving entries for logical agents, both domains' servers handle cross-domain transmission continuously, the receiving domain verifies and stores messages for instances to read later, and the sending domain signs the complete envelope so a receiving instance can independently re-verify the source and content integrity after the original connection ends. A prototype was evaluated through a controlled cross-organization LLM agent workflow with mechanism checks and latency measurement, and the workflow completed subsequent business processing after instances went offline or were replaced.
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.