AI methodology

The author used Anthropic’s Claude (Claude Opus 5.5 as the main research collaborator, and Claude Fable 5.1 for part of the analysis of Algorithm RSC), OpenAI Codex and GitHub Copilot. These tools materially affected every section of the paper.

The author directed the research, contributed ideas, among them graded closure (Section 8), checked the proofs and the Lean statements, edited the manuscript and extended the literature search. The project started from work of the author from 2020: the W[1]-hardness of MaxLeaf-Extension (Theorem C.2) and the product form of multivariate Monotone Local Search, which were the basis of an Honours thesis (Lu 2020). The author verified the correctness and originality of all content, including references.

Back to top

References

Lu, Edward. 2020. “The \(k\)-Leaf Spanning Tree Problem.” Honours thesis, UNSW Sydney.