{
  "family_id": "102",
  "title": "The Unique Games Conjecture and optimal approximation thresholds",
  "discipline": "Theoretical computer science",
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "papers": [
    {
      "title": "The Unique Games Theorem",
      "path": "preprints/The-Unique-Games-Theorem-September-23-2026/paper.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/The-Unique-Games-Theorem-September-23-2026/paper.pdf",
      "readme_path": "preprints/The-Unique-Games-Theorem-September-23-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    },
    {
      "title": "A Direct Proof of Optimal Max-Cut Hardness",
      "path": "preprints/A-Direct-Proof-of-Optimal-Max-Cut-Hardness-September-23-2026/paper.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/A-Direct-Proof-of-Optimal-Max-Cut-Hardness-September-23-2026/paper.pdf",
      "readme_path": "preprints/A-Direct-Proof-of-Optimal-Max-Cut-Hardness-September-23-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    },
    {
      "title": "The Factor-Two Hardness Threshold for Vertex Cover",
      "path": "preprints/The-Factor-Two-Hardness-Threshold-for-Vertex-Cover-September-23-2026/paper.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/The-Factor-Two-Hardness-Threshold-for-Vertex-Cover-September-23-2026/paper.pdf",
      "readme_path": "preprints/The-Factor-Two-Hardness-Threshold-for-Vertex-Cover-September-23-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    },
    {
      "title": "Constant-factor hardness of Min-UnCut",
      "path": "preprints/Constant-factor-hardness-of-Min-UnCut-September-23-2026/paper.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Constant-factor-hardness-of-Min-UnCut-September-23-2026/paper.pdf",
      "readme_path": "preprints/Constant-factor-hardness-of-Min-UnCut-September-23-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    },
    {
      "title": "Constant-factor hardness of directed feedback vertex set",
      "path": "preprints/Constant-factor-hardness-of-directed-feedback-vertex-set-September-23-2026/paper.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Constant-factor-hardness-of-directed-feedback-vertex-set-September-23-2026/paper.pdf",
      "readme_path": "preprints/Constant-factor-hardness-of-directed-feedback-vertex-set-September-23-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    }
  ],
  "lean_scope_path": "lean/docs/102.md",
  "lean_scope_url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/102.md",
  "verification_status": "scope_document_available_not_independently_verified",
  "review_status": "inventory_complete_deep_review_pending"
}