Used properly it's proven to be unbreakable.

Ostensibly the author decrypted the the second document by doing a brute force search of the key space (that is the set of documents available at the time). This is functionally the same as aes - just a much smaller key space.

This is clearly not true for a simple substitution cipher though, otherwise it couldn't be attacked with frequency analysis

The reason one time pads are not used in general is that you need a “perfect” rng, and you have to be able to get the random values to the recipient. Those old “person traveling with brief case of secrets” trope was a real thing. Key distribution is the problem solved by public key cryptography. But you can’t use one time pads with public key crypto, because the weakness is then breaking public keys (which is probably possible).

Stream ciphers loosely acted like a one time pad in that you generate a “random” stream and xor with the message. But it doesn’t reach the actual requirement of security for a one time pad because the key is the RNG seed, which means you can brute force the seed key space and only the correct key will produce a completely sensible decrypted output.

A true one time pad means that a brute force search of the key space for a message of length N will find every valid message of length N.

Eg an 11 letter message would produce (among others) “hello world” and “hello earth” as well as “die planet!”.