{
  "schema_version": "1.0.0",
  "source": "vibemath",
  "problem_id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget",
  "title": "Exact SSUF scenario-count ladder on the four-terminal planar gadget",
  "canonical_statement": "For the released four-terminal planar acyclic single-source unsplittable-flow gadget, require one unsplittable routing to be no more expensive than a prescribed fractional routing under each of $m$ strictly positive full-demand route-cost-difference scenarios. What is the worst-case normalized additive upper-arc deviation? The v0.3.0 fixed-gadget scenario-count ladder proves\n\n$$\\beta_G^{(m,+)}=\n\\begin{cases}\n\\dfrac{299-41\\sqrt{41}}{32},&m=1,\\\\\n\\dfrac{17}{8},&m=2,\\\\\n3,&m=3,\\\\\n4,&m\\ge4.\n\\end{cases}$$\n\nThe $m\\ge2$ values are non-attained suprema; no attainment or non-attainment assertion is made for $m=1$. The one-scenario value also holds for legally realizable signed and zero route-cost differences; no such multi-scenario extension is claimed.",
  "plain_summary": "VibeMathed reports this item as open. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.",
  "current_status": "open",
  "solution_events": [
    {
      "id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget:event",
      "problem_id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget",
      "type": "proved",
      "status": "open",
      "occurred_at": "2026-08-04T00:00:00.000Z",
      "title": "v0.3.0 fixed-gadget scenario-cover release",
      "summary": "Fixed four-terminal planar DAG; positive route-cost differences for m≥2, with non-attained suprema; signed/zero only for m=1, whose attainment is unstated. No topology-wide/unrestricted-planar claim.",
      "ai_contribution": "ai_co_developed",
      "attempt_ids": [
        "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget:attempt"
      ],
      "method_family_ids": [
        "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget:method"
      ],
      "source_assertion_ids": [
        "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget:assertion"
      ]
    }
  ],
  "attempts": [
    {
      "id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget:attempt",
      "problem_id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget",
      "model": "GPT-5.6 Pro; Codex",
      "provider": "OpenAI",
      "attempted_at": "2026-08-04T00:00:00.000Z",
      "human_collaborators": [
        "Matthew Protti"
      ],
      "exposure": "unknown",
      "prompt_public": null,
      "outcome": "GPT-5.6 Pro generated and developed substantial portions of the construction and parameter searches, symbolic derivations, analytic proofs, exact verifiers, adversarial analyses, and manuscript drafts. Codex sessions implemented or reconstructed code paths, performed repository-level checks, and attacked proposed claims. Matthew Protti selected and framed the targets, required exact arithmetic, exhaustive finite checks, mutation tests and hostile review, identified and forced correction of material errors and overclaims, chose the final theorem scope and public wording, reviewed the work, and authorized the release. Role-separated model review reduced some shared-context risk but was not independent human verification.",
      "failed_routes": [],
      "artifacts": [
        {
          "label": "Fixed-gadget scenario-cover synopsis (v0.3.0)",
          "url": "https://github.com/matthewprotti/planar-ssuf-four-terminal-bound/releases/download/v0.3.0/ssuf_fixed_gadget_scenario_cover_synopsis.pdf",
          "kind": "paper",
          "license": null
        },
        {
          "label": "Exact verification suite (v0.3.0)",
          "url": "https://github.com/matthewprotti/planar-ssuf-four-terminal-bound/blob/v0.3.0/scripts/verify_all.py",
          "kind": "code",
          "license": null
        },
        {
          "label": "AI use and research provenance (v0.3.0)",
          "url": "https://github.com/matthewprotti/planar-ssuf-four-terminal-bound/blob/v0.3.0/AI_USE_AND_PROVENANCE.md",
          "kind": "transcript",
          "license": null
        },
        {
          "label": "Related VibeMathed entry: four-terminal planar DGG counterexample",
          "url": "https://vibemathed.com/problem/planar-four-terminal-dgg",
          "kind": "problem-record",
          "license": null
        },
        {
          "label": "Original two-scenario release (28 July 2026)",
          "url": "https://github.com/matthewprotti/planar-ssuf-four-terminal-bound/releases/tag/v0.2.1",
          "kind": "other",
          "license": null
        },
        {
          "label": "Complete proof corpus and claim ledger (v0.3.0)",
          "url": "https://github.com/matthewprotti/planar-ssuf-four-terminal-bound/tree/v0.3.0/research/fixed_gadget_scenario_cover",
          "kind": "code",
          "license": null
        }
      ],
      "sources": [
        {
          "label": "v0.3.0 fixed-gadget scenario-cover release",
          "url": "https://github.com/matthewprotti/planar-ssuf-four-terminal-bound/releases/tag/v0.3.0",
          "kind": "primary-mathematical-source",
          "license": null
        },
        {
          "label": "VibeMathed: Exact SSUF scenario-count ladder on the four-terminal planar gadget",
          "url": "https://vibemathed.com/problem/exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget",
          "kind": "source-assertion",
          "license": "https://vibemathed.com/data-license"
        }
      ],
      "cost_usd": null,
      "independence": "unknown"
    }
  ],
  "verifications": [
    {
      "id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget:verification",
      "problem_id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget",
      "solution_event_id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget:event",
      "level": "unreviewed",
      "mathematical_correctness": "unknown",
      "statement_fidelity": "unaudited",
      "peer_review": "none",
      "verifier": "VibeMathed (source-reported label)",
      "verified_at": null,
      "note": "The unrefereed v0.3.0 release contains complete analytic proof sources, exact certificates, deterministic replay, claim ledgers, and review evidence for the fixed-gadget ladder. The $m=2$ rung was first released on 28 July 2026 in immutable v0.2.1; Matthew Protti's no-error review covered that corpus only. v0.3.0 adds the exact $m=1$, $m=3$, and $m\\ge4$ branches while preserving the earlier source. Exact-arithmetic checks, exhaustive finite enumeration, mutation tests, claim-scoped role-separated AI reviews, a blind independent reconstruction of the fixed finite atlas, and one scope-limited human-directed AI-assisted adversarial report are included. The latter did not inspect every theorem component. No Lean proof, full independent expert verification, or journal peer review is documented, so the catalog status remains Unreviewed. The analytic proofs are authoritative; computation is corroborative.",
      "sources": [
        {
          "label": "VibeMathed: Exact SSUF scenario-count ladder on the four-terminal planar gadget",
          "url": "https://vibemathed.com/problem/exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget",
          "kind": "source-assertion",
          "license": "https://vibemathed.com/data-license"
        },
        {
          "label": "v0.3.0 fixed-gadget scenario-cover release",
          "url": "https://github.com/matthewprotti/planar-ssuf-four-terminal-bound/releases/tag/v0.3.0",
          "kind": "primary-mathematical-source",
          "license": null
        }
      ]
    }
  ],
  "sources": [
    {
      "label": "v0.3.0 fixed-gadget scenario-cover release",
      "url": "https://github.com/matthewprotti/planar-ssuf-four-terminal-bound/releases/tag/v0.3.0",
      "kind": "primary-mathematical-source",
      "license": null
    },
    {
      "label": "VibeMathed: Exact SSUF scenario-count ladder on the four-terminal planar gadget",
      "url": "https://vibemathed.com/problem/exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget",
      "kind": "source-assertion",
      "license": "https://vibemathed.com/data-license"
    }
  ],
  "recommended_mode": "verify",
  "recommended_exposure": "result_only",
  "opportunity_signals": [
    {
      "id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget:signal:watch_only",
      "problem_id": "vibemathed:exact-two-scenario-ssuf-bound-on-the-four-terminal-planar-gadget",
      "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"
}