The square root law of steganographic capacity

A paper on the square root law of steganographic capacity. Both papers cite it, with Cachin, for the limit that over n events a hidden hand can shift the total by only about the square root of n unseen. This is why large effects show in aggregate, the basis of the aggregate tests for teleological saturation (C2) in prediction 11.

Cited in: both papers (Flagship: Three conjectures; Companion §10)
Used for: C2 Prediction 11C2; prediction 11
Strand: Studying up: reflexivity, observation & method · Cryptography, detection & inspection games

Cite

@inproceedings{ker2008square,
  title = {The square root law of steganographic capacity},
  author = {Andrew D. Ker and Tomáš Pevný and Jan Kodovský and Jessica Fridrich},
  year = {2008},
  howpublished = {Proceedings of the 10th ACM Workshop on Multimedia and Security (MM&Sec '08)},
  doi = {10.1145/1411328.1411349},
}