# [A Polynomial-Time 2-Approximation for Shortest Common Superstring](paper.pdf)

**Author:** OpenAI

**Date:** September 24, 2026

## Citation

```bibtex
@misc{OAI:A-Polynomial-Time-2-Approximation-for-Shortest-Common-Superstring-September-24-2026,
  author = {{OpenAI}},
  title = {{A Polynomial-Time 2-Approximation for Shortest Common Superstring}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/A-Polynomial-Time-2-Approximation-for-Shortest-Common-Superstring-September-24-2026/paper.pdf}{OAI:A-Polynomial-Time-2-Approximation-for-Shortest-Common-Superstring-September-24-2026}},
  year = {2026}
}
```