Akkoyunlu, E. A., Ekanadham, K. & Huber, R. V. (1975). Some constraints and tradeoffs in the design of network communications. In Proceedings of the Fifth ACM Symposium on Operating Systems Principles (SOSP ‘75), pp. 67–74. doi:10.1145/800213.806523.
Read in full on 2026-10-29 (NOTE-1410), from the TU Wien course-page copy. The coordinated attack problem is stated and proved in the paper’s appendix, “User Implemented Protocols”, pp. 73–74.
Why this is here
The owner raised the problem at U36 of the exchange (“Maybe also cryptography? Reminds me of the two generals problem.”), and A36 used it without a source: “Under two generals, agents may agree on what they want but cannot obtain the knowledge necessary to guarantee coordination.” Bears on CLAIM-346, as the canonical case of the epistemic obstruction that claim separates from feasibility and aggregation.