What was already known
The conjecture was known for important special graph classes. The unrestricted oriented-graph target removes those structural restrictions.
What changed and why it matters
Resolves the second-neighborhood target for the full stated oriented-graph class.
The AI contribution
OpenAI attributes these manuscripts to its internal model. The entry does not infer individual human contributions beyond that publisher attribution.
Limitations
Loops, parallel arcs, and opposite arc pairs are excluded. Second neighbors are at distance exactly two, so vertices already reached in one step are not counted again. 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