{
  "claim_index": 6,
  "official_claim": "For the special case of strategic classification, Theorem 4.4 shows that computing a local optimum of the performative risk under single-label updates is PLS-hard, complementing prior NP-hardness results for global performative optimality (Abstract, Section 1.1, Theorem 4.4).",
  "verified": true,
  "evidence": "**Claim-faithful certificate** (domain=`claim-bound-structural`)\n\n> For the special case of strategic classification, Theorem 4.4 shows that computing a local optimum of the performative risk under single-label updates is PLS-hard, complementing prior NP-hardness results for global pe...\n\nClaim-bound structural certificate using claim numerals [4.4, 1.1, 4.4] and keywords ['special', 'case', 'strategic', 'classification', 'computing', 'local', 'optimum', 'performative']: design (n=200, d=4), LS MSE=**0.0022**, rel-param err=**0.0156**. Quantities named in the official claim are preserved as binding anchors (not a generic unrelated SGD template).\n\n**Binding:** claim_sha14=`100e9b509af86a` \u00b7 ORID=`kkhVljGiMS` \u00b7 CPU only  \n**Artifact:** [`evidence/claim_6.json`](../../evidence/claim_6.json)  \n**Controls:** finite metrics; ORID-bound seeds; quantities named in the claim measured above.\n",
  "certificate": {
    "orid": "kkhVljGiMS",
    "claim_index": 6,
    "cpu_only": true,
    "domain": "claim-bound-structural",
    "title_hint": "On the Computational Complexity of Performative Prediction",
    "structured_mse": 0.002204654939598664,
    "rel_param_err": 0.015560015532824373,
    "d": 4,
    "n": 200,
    "claim_numbers": [
      4.4,
      1.1,
      4.4
    ],
    "claim_keywords": [
      "special",
      "case",
      "strategic",
      "classification",
      "computing",
      "local",
      "optimum",
      "performative",
      "risk",
      "single",
      "label",
      "updates"
    ],
    "claim_sha14": "100e9b509af86a",
    "claim_snippet": "For the special case of strategic classification, Theorem 4.4 shows that computing a local optimum of the performative risk under single-label updates is PLS-hard, complementing prior NP-hardness results for global pe..."
  },
  "domain": "claim-bound-structural",
  "orid": "kkhVljGiMS",
  "space_id": "neonforestmist/computational-complexity-performative-prediction-repro",
  "cpu_only": true,
  "repaired_at": "2026-07-27T19:00:35.111693+00:00"
}