% Source revision: fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb

@misc{OAI:Subset-Sum-in-Time-2-power-0-49n-October-4-2026,
  author = {{OpenAI}},
  title = {{Subset Sum in Time $O(2^{0.49n})$}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/subset-sum.pdf}{OAI:Subset-Sum-in-Time-2-power-0-49n-October-4-2026}},
  year = {2026}
}

@misc{OAI:A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026,
  author = {{OpenAI}},
  title = {{A Low-Space Algorithm for Worst-Case Subset Sum}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/paper.pdf}{OAI:A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026}},
  year = {2026}
}