{
  "family_id": "128",
  "title": "A factor-two approximation for shortest common superstring",
  "discipline": "Theoretical computer science",
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "papers": [
    {
      "title": "A Polynomial-Time 2-Approximation for Shortest Common Superstring",
      "path": "preprints/A-Polynomial-Time-2-Approximation-for-Shortest-Common-Superstring-September-24-2026/paper.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/A-Polynomial-Time-2-Approximation-for-Shortest-Common-Superstring-September-24-2026/paper.pdf",
      "readme_path": "preprints/A-Polynomial-Time-2-Approximation-for-Shortest-Common-Superstring-September-24-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    }
  ],
  "lean_scope_path": "lean/docs/128.md",
  "lean_scope_url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/128.md",
  "verification_status": "scope_document_available_not_independently_verified",
  "review_status": "inventory_complete_deep_review_pending"
}