- Switch scheduler to generate the merge patch on pod status instead of the full pod ([#103133](https://github.com/kubernetes/kubernetes/pull/103133), [@marwanad](https://github.com/marwanad)) [SIG Scheduling]

## Dependencies

### Added
_Nothing has changed._

### Changed
- sigs.k8s.io/structured-merge-diff/v4: v4.0.3 → v4.1.2

### Removed
_Nothing has changed._

* 👥 Update FastAPI People - Experts. PR [#14034](https://github.com/fastapi/fastapi/pull/14034) by [@tiangolo](https://github.com/tiangolo).
* 👷 Detect and label merge conflicts on PRs automatically. PR [#14045](https://github.com/fastapi/fastapi/pull/14045) by [@svlandeg](https://github.com/svlandeg).

Luehr, Neil Girdhar, Nils Reichardt, Nishidha Panpaliya, Nobuo Tsukamoto, Om Thakkar, Patrice Vignola, Philipp Hack, Pooya Jannaty, Prianka Liz Kariat, pshiko, Rajeshwar Reddy T, rdl4199, Rohit Santhanam, Rsanthanam-Amd, Sachin Muradi, Saoirse Stewart, Serge Panev, Shu Wang, Srinivasan Narayanamoorthy, Stella Stamenova, Stephan Hartmann, Sunita Nadampalli, synandi, Tamas Bela Feher, Tao Xu, Thibaut Goetghebuer-Planchon, Trevor Morris, Xiaoming (Jason) Cui, Yimei Sun, Yong Tang, Yuanqiang Liu, Yulv-Git,...

changes the end // condition to [v = 0] rather than [u = 0]. This saves an extra // subtraction due to which coefficients were negated. // 5. Rename x and y to a and n, to capture that one is a modulus. // 6. Rearrange steps 4 through 6 slightly. Merge the loops in steps 4 and // 5 into the main loop (step 7's goto), and move step 6 to the start of // the loop iteration, ensuring each loop iteration halves at least one // value. // // Note this algorithm does not handle either input being zero. if...

changes the end // condition to [v = 0] rather than [u = 0]. This saves an extra // subtraction due to which coefficients were negated. // 5. Rename x and y to a and n, to capture that one is a modulus. // 6. Rearrange steps 4 through 6 slightly. Merge the loops in steps 4 and // 5 into the main loop (step 7's goto), and move step 6 to the start of // the loop iteration, ensuring each loop iteration halves at least one // value. // // Note this algorithm does not handle either input being zero. if...