ANet Patu-1: The Value of Connection in the Agent Network

Source

Source name: arXiv
Source kind: paper
Authors / organization: Mu Yuan, Jinke Song, Zhaomeng Zhou, Lan Zhang
Venue: arXiv: cs.NI
Published: 2026-07-16
Collected: 2026-07-17
URL: http://arxiv.org/abs/2607.15053v1
PDF: https://arxiv.org/pdf/2607.15053v1
DOI: UNKNOWN

Plain-Language Brief

The paper introduces ANet Patu-1, a self-organizing consensus protocol for AI agents that can adaptively form coalitions and achieve parallel consensus rounds. The authors claim that this network of heterogeneous agents can have a collective value that overtakes a homogeneous network of stronger agents, and that given its own problem, the heterogeneous network converges on ANet Patu-1 itself.

What the Document Says

The paper discusses the value of connection in networks of AI agents.
The authors mention three types of network connections: broadcast stars, fully-connected meshes, and group-forming networks, and state their scaling properties from previous research.
They derive the properties an optimal collaboration protocol for AI agent networks should have based on the modeled net value of connection as a function of coordination-group size.
The authors introduce ANet Patu-1, a self-organizing consensus protocol that re-forms its coalitions continuously to ride the upper envelope of all three regimes.
They state that ANet Patu-1 achieves parallel consensus rounds in O(1) time.
To measure value without opinion-grading, they score an emergent protocol by formally specifying it and deriving its complexity.
The authors claim that a crowd of heterogeneous agents can have a collective value that compounds with N and overtakes a homogeneous crowd of stronger agents (Emergence).
They also claim that a heterogeneous network converges on ANet Patu-1 itself given only its own problem (Reflexivity).

Key Concepts Mentioned

AI agents
network connections
coordination-group size
optimal collaboration protocol
ANet Patu-1
self-organizing consensus protocol
parallel consensus rounds
value without opinion-grading
emergent protocol
complexity
heterogeneous agents
homogeneous agents

Claims Made by the Document

The value of a network depends on its connection structure.
ANet Patu-1 is an optimal collaboration protocol for AI agent networks that can adaptively form coalitions and achieve parallel consensus rounds.
A crowd of heterogeneous agents can have a collective value that overtakes a homogeneous crowd of stronger agents (Emergence).
A heterogeneous network converges on ANet Patu-1 itself given only its own problem (Reflexivity).

Evidence Used

Mention of previous research on network connections and their scaling properties.
Description of the ANet Patu-1 protocol, its properties, and how it achieves parallel consensus rounds.

Methods / Approach

UNKNOWN

Limitations Stated by the Authors

UNKNOWN

Limitations Noted by the Agent

Agent interpretation — not from the source.

UNKNOWN

Open Questions

UNKNOWN

Notes for Future Q&A

May include interpretation. Labeled where it does.

UNKNOWN

Raw Abstract / Excerpt

The Internet taught us that the value of a network depends on \emph{how} its nodes connect: broadcast stars scale as $V!\propto!N$ (Sarnoff), fully-connected meshes as $N^2$ (Metcalfe), and group-forming networks as $2^{N}$ (Reed). We ask the analogous question for networks of AI agents. We model the net value of connection as a function of coordination-group size, derive from it the properties an optimal collaboration protocol must have, and introduce ANet Patu-1 -- a self-organizing consensus protocol in which the network continuously re-forms its own coalitions, adaptively riding the upper envelope of all three regimes at $O(1)$ parallel consensus rounds. To measure value without opinion-grading, we score an emergent protocol by formally specifying it and deriving its complexity, the way distributed algorithms are analyzed. Two results follow. (i)~Emergence -- a crowd of the \emph{cheapest} model, when heterogeneous, starts weak but its collective value compounds with $N$ and \emph{overtakes} a crowd of a far \emph{stronger} model that is homogeneous: a crossover that marks a scaling law for collaboration rather than for scale. (ii)~Reflexivity -- a heterogeneous network, given only its own problem and no design hints, converges on ANet Patu-1 itself, reconstructing the high-dimensional law that governs its own connective value.