{
  "schema_version": "1.0.0",
  "source": "vibemath",
  "problem_id": "vibemathed:logarithmic-basis-number-of-graphs",
  "title": "Logarithmic basis number of graphs",
  "canonical_statement": "The basis number $\\mathrm{bn}(G)$ of a graph $G$ is the minimum edge-congestion of a basis of its cycle space. We prove that every finite $n$-vertex multigraph satisfies\n$$\\mathrm{bn}(G)=O(\\log n),$$\nresolving, for simple graphs, a question of Bazargani, Biedl, Bose, Maheshwari and Miraftab, subsequently stated as a conjecture by Miraftab, Morin and Yuditsky. The argument also yields the cycle-rank refinement\n$$\\mathrm{bn}(G)=O(\\log \\beta(G)),$$\nwhere $\\beta(G)$ is the dimension of the cycle space, and a reduction of Lehner and Miraftab, based on a theorem of Richter and Shank, then gives\n$$\\mathrm{bn}(G)=O(\\log g)$$\nfor graphs of Euler genus $g$. These orders are best possible.",
  "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:logarithmic-basis-number-of-graphs:event",
      "problem_id": "vibemathed:logarithmic-basis-number-of-graphs",
      "type": "proved",
      "status": "resolved",
      "occurred_at": "2026-09-02T00:00:00.000Z",
      "title": "arXiv",
      "summary": "Knauer proves that every finite $n$-vertex multigraph satisfies $\\mathrm{bn}(G)=O(\\log n)$, improving the previous general $O(\\log^2 n)$ bound and matching the known $\\Omega(\\log n)$ order. He also proves the sharper cycle-rank bound $\\mathrm{bn}(G)=O(\\log\\beta(G))$. Combined with a reduction of Lehner and Miraftab, this yields $\\mathrm{bn}(G)=O(\\log g)$ for graphs of Euler genus $g$, improving the previous $O(\\log^2 g)$ bound to the optimal logarithmic order.",
      "ai_contribution": "ai_co_developed",
      "attempt_ids": [
        "vibemathed:logarithmic-basis-number-of-graphs:attempt"
      ],
      "method_family_ids": [
        "vibemathed:logarithmic-basis-number-of-graphs:method"
      ],
      "source_assertion_ids": [
        "vibemathed:logarithmic-basis-number-of-graphs:assertion"
      ]
    }
  ],
  "attempts": [
    {
      "id": "vibemathed:logarithmic-basis-number-of-graphs:attempt",
      "problem_id": "vibemathed:logarithmic-basis-number-of-graphs",
      "model": "ChatGPT-5.6 Sol",
      "provider": "OpenAI",
      "attempted_at": "2026-09-02T00:00:00.000Z",
      "human_collaborators": [
        "Kolja Knauer"
      ],
      "exposure": "unknown",
      "prompt_public": null,
      "outcome": "The proof was found with the help of GPT-5.6 Sol. The model was also used to explore proof strategies, locate potentially relevant literature, and assist with drafting and revising the manuscript. Knauer independently checked the arguments and references and takes responsibility for the final result.",
      "failed_routes": [],
      "artifacts": [
        {
          "label": "Bazargani, Biedl, Bose, Maheshwari and Miraftab, where the question is asked (Section 5)",
          "url": "https://arxiv.org/abs/2412.18595",
          "kind": "problem-record",
          "license": null
        },
        {
          "label": "Miraftab, Morin and Yuditsky, who state it as Conjecture 12",
          "url": "https://arxiv.org/abs/2601.14095",
          "kind": "problem-record",
          "license": null
        }
      ],
      "sources": [
        {
          "label": "arXiv",
          "url": "https://arxiv.org/abs/2609.02080",
          "kind": "primary-mathematical-source",
          "license": null
        },
        {
          "label": "VibeMathed: Logarithmic basis number of graphs",
          "url": "https://vibemathed.com/problem/logarithmic-basis-number-of-graphs",
          "kind": "source-assertion",
          "license": "https://vibemathed.com/data-license"
        }
      ],
      "cost_usd": null,
      "independence": "unknown"
    }
  ],
  "verifications": [
    {
      "id": "vibemathed:logarithmic-basis-number-of-graphs:verification",
      "problem_id": "vibemathed:logarithmic-basis-number-of-graphs",
      "solution_event_id": "vibemathed:logarithmic-basis-number-of-graphs:event",
      "level": "unreviewed",
      "mathematical_correctness": "unknown",
      "statement_fidelity": "unaudited",
      "peer_review": "none",
      "verifier": "VibeMathed (source-reported label)",
      "verified_at": null,
      "note": "Unreviewed. A nine-page preprint one day old at submission, with no peer review and no formal verification. The argument is conventional and self-contained - weighted cycle-basis bounds, minimax duality and dependent randomized rounding - so it is readable by any combinatorialist, and the author states he checked the arguments and references himself. Nobody independent has.",
      "sources": [
        {
          "label": "VibeMathed: Logarithmic basis number of graphs",
          "url": "https://vibemathed.com/problem/logarithmic-basis-number-of-graphs",
          "kind": "source-assertion",
          "license": "https://vibemathed.com/data-license"
        },
        {
          "label": "arXiv",
          "url": "https://arxiv.org/abs/2609.02080",
          "kind": "primary-mathematical-source",
          "license": null
        }
      ]
    }
  ],
  "sources": [
    {
      "label": "arXiv",
      "url": "https://arxiv.org/abs/2609.02080",
      "kind": "primary-mathematical-source",
      "license": null
    },
    {
      "label": "VibeMathed: Logarithmic basis number of graphs",
      "url": "https://vibemathed.com/problem/logarithmic-basis-number-of-graphs",
      "kind": "source-assertion",
      "license": "https://vibemathed.com/data-license"
    }
  ],
  "recommended_mode": "verify",
  "recommended_exposure": "result_only",
  "opportunity_signals": [
    {
      "id": "vibemathed:logarithmic-basis-number-of-graphs:signal:watch_only",
      "problem_id": "vibemathed:logarithmic-basis-number-of-graphs",
      "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"
}