@misc{ClaudeETH,
  author = {{Claude (Anthropic)}},
  title = {A {$2^{o(n)}$} Time Algorithm for {3-SAT}},
  year = {2026},
  month = oct,
  note = {Version 1, October 27, 2026},
  url = {https://hexagonmath.org/2610.00577v1}
}
@inproceedings{Freuder90,
  author = {Freuder, Eugene C.},
  title = {Complexity of K-Tree Structured Constraint Satisfaction Problems},
  booktitle = {Proceedings of the Eighth National Conference on Artificial Intelligence},
  year = {1990},
  pages = {4--9},
  url = {https://www.aiinternational.org/Papers/AAAI/1990/AAAI90-001.pdf}
}
@article{IP01,
  author = {Impagliazzo, Russell and Paturi, Ramamohan},
  title = {On the Complexity of {$k$-SAT}},
  journal = {Journal of Computer and System Sciences},
  volume = {62},
  number = {2},
  year = {2001},
  pages = {367--375},
  doi = {10.1006/jcss.2000.1727}
}
@inproceedings{KS13,
  author = {Kanj, Iyad and Szeider, Stefan},
  title = {On the Subexponential Time Complexity of {CSP}},
  booktitle = {Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence},
  year = {2013},
  pages = {459--465},
  url = {https://cdn.aaai.org/ojs/8609/8609-13-12137-1-2-20201228.pdf}
}
@article{Marx10,
  author = {Marx, D{\'a}niel},
  title = {Can You Beat Treewidth?},
  journal = {Theory of Computing},
  volume = {6},
  year = {2010},
  pages = {85--112},
  doi = {10.4086/toc.2010.v006a005}
}
@misc{OpenAIETH,
  author = {{OpenAI}},
  title = {The Exponential Time Hypothesis is False},
  year = {2026},
  note = {Preprint and accompanying Lean development, October 25, 2026},
  url = {https://github.com/openai/math/tree/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026}
}
@misc{OpenAILean,
  author = {{OpenAI}},
  title = {Native Exact-Counting and Satisfiability Verification},
  year = {2026},
  note = {Lean 4 source, revision 7ef5c0cc5ca4b0e072b7a050fca09ab24bc6fa3a},
  url = {https://github.com/openai/math/blob/7ef5c0cc5ca4b0e072b7a050fca09ab24bc6fa3a/lean/OAI/Algorithms/SubexponentialSAT/SqrtLogSpace/Final.lean}
}
@misc{AnthropicLean,
  author = {{Anthropic}},
  title = {Formalization Accompanying ``A {$2^{o(n)}$} Time Algorithm for {3-SAT}''},
  year = {2026},
  note = {Lean 4 source, revision 16a5ce41304fcdaea4e0be7c132e1c361dc26da5},
  url = {https://github.com/anthropics/formal-math/tree/16a5ce41304fcdaea4e0be7c132e1c361dc26da5/eth}
}
@misc{OpenAIGraph,
  author = {{OpenAI}},
  title = {Spectral Expander and Weighted-Tree Proof Foundations},
  year = {2026},
  note = {Lean source, revision 7ef5c0cc5ca4b0e072b7a050fca09ab24bc6fa3a; exact source ranges in GraphPortManifest.json},
  url = {https://github.com/openai/math/tree/7ef5c0cc5ca4b0e072b7a050fca09ab24bc6fa3a}
}