Problem detail · source-aware
VibeMathed reports this item as partial. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Korsky, Saffat and Aiylam bounded the growth constant $c(G)$ for integer-valued Lipschitz functions on $G(n,d/n)$ between $1/(2d)$ and $4\log^2 d/d$ up to lower-order terms. The random-graph side is sharpened.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
The acknowledgement is unusually direct about scope: the author credits GPT-5.5 with producing fully the mechanism of the upper bound for the hypercube graph. The author is one of the three who set the original bounds.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
Single-author arXiv preprint; not yet peer-reviewed.
Correctness: unknown · statement fidelity: unaudited · peer review: none
Resolved the sharp constant (w.h.p.) for random graphs G(n, d/n)
Source-reported tools: argument.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.