{
  "schema_version": "1.0.0",
  "source": "vibemath",
  "problem_id": "vibemathed:seymour-second-neighborhood-outdegree-7",
  "title": "Seymour's Second Neighborhood Conjecture",
  "canonical_statement": "Seymour conjectured that every oriented graph has a vertex $x$ with $|N^{++}(x)| \\ge |N^{+}(x)|$. It holds for oriented graphs of minimum out-degree exactly $7$, the first improvement to the out-degree threshold since Kaneko and Locke settled degree $6$ in 2001.",
  "plain_summary": "VibeMathed reports this item as partial. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.",
  "current_status": "partial",
  "solution_events": [
    {
      "id": "vibemathed:seymour-second-neighborhood-outdegree-7:event",
      "problem_id": "vibemathed:seymour-second-neighborhood-outdegree-7",
      "type": "proved",
      "status": "partial",
      "occurred_at": "2026-06-29T00:00:00.000Z",
      "title": "arXiv:2606.30588 - A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree seven",
      "summary": "minimum out-degree 7; the conjecture is open in general",
      "ai_contribution": "ai_assisted",
      "attempt_ids": [
        "vibemathed:seymour-second-neighborhood-outdegree-7:attempt"
      ],
      "method_family_ids": [
        "vibemathed:seymour-second-neighborhood-outdegree-7:method"
      ],
      "source_assertion_ids": [
        "vibemathed:seymour-second-neighborhood-outdegree-7:assertion"
      ]
    }
  ],
  "attempts": [
    {
      "id": "vibemathed:seymour-second-neighborhood-outdegree-7:attempt",
      "problem_id": "vibemathed:seymour-second-neighborhood-outdegree-7",
      "model": "ChatGPT 5.5 Pro",
      "provider": "OpenAI",
      "attempted_at": "2026-06-29T00:00:00.000Z",
      "human_collaborators": [
        "Arpan Sadhukhan",
        "R. B. Sandeep",
        "Sagnik Sen"
      ],
      "exposure": "unknown",
      "prompt_public": null,
      "outcome": "The CP-SAT models behind the computational part were developed with assistance from ChatGPT 5.5 Pro; the resulting OR-Tools encodings were then run and independently checked by the authors.",
      "failed_routes": [],
      "artifacts": [],
      "sources": [
        {
          "label": "arXiv:2606.30588 - A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree seven",
          "url": "https://arxiv.org/abs/2606.30588",
          "kind": "primary-mathematical-source",
          "license": null
        },
        {
          "label": "VibeMathed: Seymour's Second Neighborhood Conjecture",
          "url": "https://vibemathed.com/problem/seymour-second-neighborhood-outdegree-7",
          "kind": "source-assertion",
          "license": "https://vibemathed.com/data-license"
        }
      ],
      "cost_usd": null,
      "independence": "unknown"
    }
  ],
  "verifications": [
    {
      "id": "vibemathed:seymour-second-neighborhood-outdegree-7:verification",
      "problem_id": "vibemathed:seymour-second-neighborhood-outdegree-7",
      "solution_event_id": "vibemathed:seymour-second-neighborhood-outdegree-7:event",
      "level": "unreviewed",
      "mathematical_correctness": "unknown",
      "statement_fidelity": "unaudited",
      "peer_review": "none",
      "verifier": "VibeMathed (source-reported label)",
      "verified_at": null,
      "note": "The proof leans on a CP-SAT computation whose encodings the authors state they verified independently. arXiv preprint, not peer-reviewed.",
      "sources": [
        {
          "label": "VibeMathed: Seymour's Second Neighborhood Conjecture",
          "url": "https://vibemathed.com/problem/seymour-second-neighborhood-outdegree-7",
          "kind": "source-assertion",
          "license": "https://vibemathed.com/data-license"
        },
        {
          "label": "arXiv:2606.30588 - A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree seven",
          "url": "https://arxiv.org/abs/2606.30588",
          "kind": "primary-mathematical-source",
          "license": null
        }
      ]
    }
  ],
  "sources": [
    {
      "label": "arXiv:2606.30588 - A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree seven",
      "url": "https://arxiv.org/abs/2606.30588",
      "kind": "primary-mathematical-source",
      "license": null
    },
    {
      "label": "VibeMathed: Seymour's Second Neighborhood Conjecture",
      "url": "https://vibemathed.com/problem/seymour-second-neighborhood-outdegree-7",
      "kind": "source-assertion",
      "license": "https://vibemathed.com/data-license"
    }
  ],
  "recommended_mode": "expand",
  "recommended_exposure": "result_only",
  "opportunity_signals": [
    {
      "id": "vibemathed:seymour-second-neighborhood-outdegree-7:signal:recent_partial_result",
      "problem_id": "vibemathed:seymour-second-neighborhood-outdegree-7",
      "kind": "recent_partial_result",
      "reason": "A source-reported partial result may support bounded expansion.",
      "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"
}