{
  "schema_version": "1.0.0",
  "source": "vibemath",
  "problem_id": "vibemathed:avidor-zwick-max-cut-sdp",
  "title": "Avidor-Zwick Question on Low-Dimensional Max-Cut SDP",
  "canonical_statement": "For fixed $d$, can every $d$-dimensional feasible solution of the triangle-strengthened Max-Cut SDP be rounded in polynomial time with ratio strictly larger than $\\alpha_{GW}$? A rounding achieving $\\alpha_{GW} + 2^{-O(d)}$ answers yes.",
  "plain_summary": "VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.",
  "current_status": "resolved",
  "solution_events": [
    {
      "id": "vibemathed:avidor-zwick-max-cut-sdp:event",
      "problem_id": "vibemathed:avidor-zwick-max-cut-sdp",
      "type": "proved",
      "status": "resolved",
      "occurred_at": "2026-04-16T00:00:00.000Z",
      "title": "arXiv:2604.13971 - Max Cut with small-dimensional SDP solutions",
      "summary": "VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.",
      "ai_contribution": "ai_co_developed",
      "attempt_ids": [
        "vibemathed:avidor-zwick-max-cut-sdp:attempt"
      ],
      "method_family_ids": [
        "vibemathed:avidor-zwick-max-cut-sdp:method"
      ],
      "source_assertion_ids": [
        "vibemathed:avidor-zwick-max-cut-sdp:assertion"
      ]
    }
  ],
  "attempts": [
    {
      "id": "vibemathed:avidor-zwick-max-cut-sdp:attempt",
      "problem_id": "vibemathed:avidor-zwick-max-cut-sdp",
      "model": "Gemini (internal), ChatGPT-5.2 Extended Pro, Gemini 3.0 Pro DeepThink",
      "provider": "Google DeepMind / OpenAI",
      "attempted_at": "2026-04-16T00:00:00.000Z",
      "human_collaborators": [],
      "exposure": "unknown",
      "prompt_public": null,
      "outcome": "The key anti-concentration lemma for signs of low-dimensional Gaussian projections was first proved by Google's internal Gemini model with a weaker bound; the optimal $2^{-\\Theta(d)}$ form was then obtained with ChatGPT-5.2 Extended Pro and Gemini 3.0 Pro DeepThink, with proofs edited by the authors.",
      "failed_routes": [],
      "artifacts": [],
      "sources": [
        {
          "label": "arXiv:2604.13971 - Max Cut with small-dimensional SDP solutions",
          "url": "https://arxiv.org/abs/2604.13971",
          "kind": "primary-mathematical-source",
          "license": null
        },
        {
          "label": "VibeMathed: Avidor-Zwick Question on Low-Dimensional Max-Cut SDP",
          "url": "https://vibemathed.com/problem/avidor-zwick-max-cut-sdp",
          "kind": "source-assertion",
          "license": "https://vibemathed.com/data-license"
        }
      ],
      "cost_usd": null,
      "independence": "unknown"
    }
  ],
  "verifications": [
    {
      "id": "vibemathed:avidor-zwick-max-cut-sdp:verification",
      "problem_id": "vibemathed:avidor-zwick-max-cut-sdp",
      "solution_event_id": "vibemathed:avidor-zwick-max-cut-sdp:event",
      "level": "unreviewed",
      "mathematical_correctness": "unknown",
      "statement_fidelity": "unaudited",
      "peer_review": "none",
      "verifier": "VibeMathed (source-reported label)",
      "verified_at": null,
      "note": "Author-edited and checked arXiv preprint. Not yet peer-reviewed.",
      "sources": [
        {
          "label": "VibeMathed: Avidor-Zwick Question on Low-Dimensional Max-Cut SDP",
          "url": "https://vibemathed.com/problem/avidor-zwick-max-cut-sdp",
          "kind": "source-assertion",
          "license": "https://vibemathed.com/data-license"
        },
        {
          "label": "arXiv:2604.13971 - Max Cut with small-dimensional SDP solutions",
          "url": "https://arxiv.org/abs/2604.13971",
          "kind": "primary-mathematical-source",
          "license": null
        }
      ]
    }
  ],
  "sources": [
    {
      "label": "arXiv:2604.13971 - Max Cut with small-dimensional SDP solutions",
      "url": "https://arxiv.org/abs/2604.13971",
      "kind": "primary-mathematical-source",
      "license": null
    },
    {
      "label": "VibeMathed: Avidor-Zwick Question on Low-Dimensional Max-Cut SDP",
      "url": "https://vibemathed.com/problem/avidor-zwick-max-cut-sdp",
      "kind": "source-assertion",
      "license": "https://vibemathed.com/data-license"
    }
  ],
  "recommended_mode": "verify",
  "recommended_exposure": "result_only",
  "opportunity_signals": [
    {
      "id": "vibemathed:avidor-zwick-max-cut-sdp:signal:watch_only",
      "problem_id": "vibemathed:avidor-zwick-max-cut-sdp",
      "kind": "watch_only",
      "reason": "Current public evidence does not meet the default replay threshold.",
      "generated_at": "2026-09-13T16:28:40.178Z"
    }
  ],
  "uncertainties": [
    "VibeMath has not independently verified the mathematical claim.",
    "AI-attempt independence and training-data exposure are unknown unless explicitly documented.",
    "VibeMath has not independently audited the mathematical statement, proof, or novelty claim."
  ],
  "generated_at": "2026-09-13T16:28:40.178Z"
}