# Эксперимент: Coupled Workload-Order Gate (#600)

{
  "worked": true,
  "confidence": 9,
  "verdict": "Built a paired-trace differentiable admission gate with the proposed workload-order penalty and verified the core mechanism numerically. The threshold sweep matched the predicted crossing within one grid step, the active penalty had the predicted unit quadratic scaling, and scaling ratios matched exactly. In the mini-experiment, increasing the order penalty reduced violation frequency from 1.00 to 0.53, mean violation from 3.28 to 0.03, and p99 violation from 11.32 to 0.57, while the strongest setting also reduced final workload below the reference; this is a real mechanism signal, though not a production-scale win claim.",
  "metrics": {
    "baseline": "lambda=0: violation frequency 1.000, mean violation 3.280, p99 violation 11.318, mean admission probability 0.99995, final workload 8.744",
    "idea": "lambda=2: violation frequency 0.532, mean violation 0.0301, p99 violation 0.572, mean admission probability 0.454, final workload 1.749; reference final workload 2.087",
    "math": "Predicted onset 1.90 vs observed grid onset 1.95; predicted quadratic slope 1.0 vs observed 1.0; scaling loss ratios matched predictions exactly"
  },
  "how_to_run": "/home/maxwelhelp/main/bin/python3 coupled_gate.py",
  "files": [
    "coupled_gate.py",
    "results.json",
    "REPORT.md"
  ],
  "limitations": "Only a synthetic six-arrival workload model was tested. The reference policy was a hand-designed threshold gate rather than a production router, no task accuracy or throughput-at-equal-admission constraint was measured, and stochastic tail-probability dominance over all times and thresholds was not formally established."
}