Your assertion about stable sort ordering is true, though I'd add that you cannot depend on ANY sort order when iterating through the keys of a normal hash.

Even two successive runs using the same hash full of data may give different ordering, since (1) it may be influenced by insertion order, and (2) it may be influenced by insertion attack protections, and (3) it may be influenced by other changes in the algorithms between versions of perl.