What was already known
Sidorenko’s conjecture predicts the lower bound for every bipartite pattern. One rigorously established counterexample would refute that universal statement despite many known positive classes.
What changed and why it matters
Refutes the universal Sidorenko assertion with an explicitly specified finite pattern.
The AI contribution
OpenAI attributes these manuscripts to its internal model. The entry does not infer individual human contributions beyond that publisher attribution.
Limitations
Homomorphisms include noninjective maps. The statement is about the specified bipartite pattern and existence of a host, not failure for every bipartite graph. Preprint. This is a source-statement and significance assessment, not a proof audit. No independent checking or successful formal compilation is asserted by this entry.
Verification evidence
Evidence labels show what supports the claim. Importance rates its impact if correct.
Author claim
The publisher reports the scoped result. AIProofWatch has not independently validated its correctness.
Accessible artifact / proof
The original written argument is accessible. Availability does not establish a successful proof check or Lean verification.
Correction and publication history
Historical report added after statement, scope, and importance review. No proof audit or formal checking asserted; subscriber alerts disabled.
Read this published revision