AI Science Tracker

Claude's Cycles: a Hamiltonian cycle decomposition found by Claude

Stanford University; Anthropic · 28 Feb 2026 · computer science

Discovery

Claude's Cycles: a Hamiltonian cycle decomposition found by Claude

Knuth's note reports that Claude Opus 4.6 found an explicit decomposition of the arcs of the m^3-vertex digraph into three directed Hamiltonian cycles for odd m, an open problem Knuth posed. Knuth's proof of the construction was reportedly formally verified in Lean by Kim Morrison. Caveat: sources disagree on the even case, which an independent arXiv paper (2603.24708) and a GPT-5.4 Pro proof treat differently.

Technology: Claude Opus 4.6

Family Claude: profile · models page

Publication: Not annotated in this catalog · Test context: Not annotated in this catalog. Catalog categories, not an evidence grade.

Source checked · editorial details

The source page was checked against this entry. Independent confirmation is not assessed by this label.

Source type: other. Paper: not linked in this catalog; this does not mean no paper exists.

Review scope and date are not recorded; source checked does not establish full-text review.

Editorial assessment: Impact 3/5 · Validation 4/5 · Novelty 5/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.

Follow-up and relationships

No follow-up recorded; this is not a claim that no follow-up exists.

Follow-up review scope and date are not recorded.

No source-supported relationships recorded.

Open in the full catalog for filters, charts and related discoveries.