A theoretical computer science preprint establishing optimal rates for networked information aggregation in agentic AI through mathematical analysis and construction of adversarial instances, not yet peer reviewed.
Reported
Prior upper bound (Kearns, Roth,…O(M/√D)
Prior lower bound (cyclic instanc…Ω(M/D) for D < M²
Improved lower bound (this work)Ω(√(M/D)) for D < M²