Assign as SE-0372 and begin review

Author: allevato

proposals/0000-stable-sort.md renamed to proposals/0372-document-sorting-as-stable.md

@@ -1,17 +1,16 @@
 # Document Sorting as Stable
 
-* Proposal: [SE-NNNN](0000-stable-sort.md)
+* Proposal: [SE-0372](0372-document-sorting-as-stable.md)
 * Author: [Nate Cook](https://github.com/natecook1000)
-* Review Manager: TBD
-* Status: **Awaiting review**
+* Review Manager: [Tony Allevato](https://github.com/allevato)
+* Status: **Active review (September 7, 2022...September 20, 2022)**
 * Implementation: [apple/swift PR #60936](https://github.com/apple/swift/pull/60936)
+* Review: ([pitch](https://forums.swift.org/t/pitch-document-sorting-as-stable/59880))
 
 ## Introduction
 
 Swift's sorting algorithm was changed to be stable before Swift 5, but we've never updated the documentation to provide that guarantee. Let's commit to the sorting algorithm being stable so that people can rely on that behavior.
 
-Swift-evolution thread: [Pitch](https://forums.swift.org/t/pitch-document-sorting-as-stable/59880)
-
 ## Motivation
 
 A *stable sort* is a sort that keeps the original relative order for any elements that compare as equal or unordered. For example, given this list of players that are already sorted by last name, a sort by first name preserves the original order of the two players named "Ashley":