监测单一信道不等于通信控制：联合消息—路由编码自适应重分配的因果证据

Authors:Liu Hung Ming (PARRAWA AI, cyril.liu@gmail.com, equal contribution), Tian Xia (PAII, TianXia0209@gmail.com, equal contribution)

View PDF HTML (experimental)

Abstract:Monitoring a visible channel can change how learned agents communicate without removing why communication is useful. We test this distinction in an end-to-end game where a sender and receiver learn a discrete protocol and route policy without communication supervision. In two independent 20-seed batches, 20/20 and 19/20 protocols form. Online partial coverage increases shadow-route share over no monitoring by .701 [.574,.826] and .575 [.412,.737], while task accuracy remains .905/.913 and signed frozen message contribution remains .592/.563. Complete coverage removes most selective migration without removing communication. Frozen interventions, including a fresh pre-outcome confirmation, show that route is semantic: joint message--route shuffling changes .668 of receiver predictions and route alone retains .388 accuracy versus .25 chance. A corrected explicit-silence cost makes 18/20 policies fully silent and lowers mean sending to .050, but its strict complete-suppression gate fails because two seeds retain communication. Failed semantic-evasion and operational gates further bound the result. The evidence supports adaptive reallocation of a joint message--route code under partial monitoring, not open-world route discovery, emergent encryption, or a universal defense.

Comments:	23 pages total: 8-page main paper plus 15-page supplementary material; 1 main-paper figure and 3 main-paper tables. Equal contribution. Code available at: this https URL
Subjects:	Artificial Intelligence (cs.AI); Information Theory (cs.IT)
Cite as:	arXiv:2611.12959 [cs.AI]
	(or arXiv:2611.12959v1 [cs.AI] for this version)
	https://doi.org/10.48550/arXiv.2611.12959 arXiv-issued DOI via DataCite

Submission history

From: Tian Xia [view email]
[v1] Sat, 7 Nov 2026 08:03:23 UTC (370 KB)