As of Python 3.6, for the CPython implementation of Python, dictionaries remember the order of items inserted. This is considered an implementation detail in Python 3.6; you need to use OrderedDict if you want insertion ordering that's guaranteed across other implementations of Python.
As of Python 3.7, this is no longer an implementation detail and instead becomes a language feature.
[1] https://stackoverflow.com/questions/39980323/are-dictionarie...
So now that its upgraded to language feature, you can actually expect backwards compatibility in future updates.
PyPy has had ordered dicts for longer than CPython, and Jython and IronPython don't look like they're ever going to support Python 3, so I'm not sure who this declaration is even even hypothetically relevant to.
I think you can be more clear here: all dicts are ordered by insertion order (not by key).
Now, with ordered dictionaries, that order is maintained for free.
Kwarg order in functions is also maintained as far as I know.
This is a handy way of making classification rules for a many stepped process, where certain rules have priority over others. The alternative would be a lengthy set of ifs and elifs which is both ugly and not fun to edit on the fly.