chore(release): bump to v0.19.0

[avrabe]

v0.19.0 — network-calculus tightening on converging TSN topologies

Scope is exactly the implemented set (release-planning hygiene — the 11
still-proposed/planned items were moved to v0.20.0 in #287):

• REQ-NC-PLP-CONVERGE-001 — PLP on converging sink-trees via topological relabel (feat(network): PLP on converging sink-trees via topological relabel (REQ-NC-PLP-CONVERGE-001) #285)
• REQ-NC-PLP-003 — TFA-strengthened PLP tightening to EXACT (feat(network): TFA-strengthened PLP tightening to EXACT (REQ-NC-PLP-003) #287)

Headline

REQ-NC-PLP-003 repairs the pure-PLP / TFA incomparability. On the
converging-bridge net where pure PLP's tagged flow exceeds TFA
(1148.33 µs > 1048.09 µs — both sound, neither dominates), the TFA-delay-
strengthened LP drives the bound to EXACT 1035.2 µs — back below TFA.
Combined with CONVERGE-001, the many-talkers→one-listener TSN topology now
yields the PLP ≤ TFA dominance LUDB/PMOO cannot show on a tree.

Verification

• Pre-tag clean-room verification (two fresh-context refutation agents): work
  sound, no bugs (constraint block byte-identical to panco, d[j] per-server
  TFA delay, LP always feasible, monotone by construction); campaign machinery
  clean (gate non-empty, tags signed, no orphan claims).
• Both scope items are implemented with closed V-traces (TEST-NC-PLP-CONVERGE,
  TEST-NC-PLP-STR passing), panco-pinned oracles under EXACT ≤ str ≤ pure ≤ —.

Bump

Workspace Cargo.toml 0.18.0 → 0.19.0, Cargo.lock (23 crates), vscode-spar/package.json.

🤖 Generated with Claude Code

[github-actions]

Rivet verification gate

✅ 20/20 passed

	count
Passed	20
Failed	0
Skipped (no steps)	0

Filter: (and (= type "feature") (or (has-tag "v093") (has-tag "v0100")))

Failed artifacts

(none)

_{Updated automatically by tools/post_verification_comment.py. Source of truth: artifacts/verification.yaml.}

[codecov]

Codecov Report

✅ All modified and coverable lines are covered by tests.

📢 Thoughts on this report? Let us know!