Minimal superpermutation length $L(4)$

The shortest length of a string that contains each permutation of $4$ symbols as a substring.

Value: $33$

Updates

Lower bound: $33$
Reference unknown
[via Superpermutations - Greg Egan]
Upper bound: $33$
Reference unknown
[via Superpermutations - Greg Egan]