{
  "family_id": "138",
  "title": "Subset Sum in $`O(2^{0.49n})`$ time",
  "discipline": "Theoretical computer science",
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "papers": [
    {
      "title": "Subset Sum in Time $`O(2^{0.49n})`$ ",
      "path": "preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/subset-sum.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/subset-sum.pdf",
      "readme_path": "preprints/Subset-Sum-in-Time-2-power-0-49n-October-4-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    },
    {
      "title": "A Low-Space Algorithm for Worst-Case Subset Sum",
      "path": "preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/paper.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/paper.pdf",
      "readme_path": "preprints/A-Low-Space-Algorithm-for-Worst-Case-Subset-Sum-September-26-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    }
  ],
  "lean_scope_path": null,
  "lean_scope_url": null,
  "verification_status": "no_family_scope_document",
  "review_status": "inventory_complete_deep_review_pending"
}