{
  "family_id": "113",
  "title": "Approximate counting and entropy of perfect matchings",
  "discipline": "Theoretical computer science",
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "papers": [
    {
      "title": "A Fully Polynomial Randomized Approximation Scheme for Perfect Matchings in General Graphs",
      "path": "preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/main.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/main.pdf",
      "readme_path": "preprints/A-Fully-Polynomial-Randomized-Approximation-Scheme-for-Perfect-Matchings-in-General-Graphs-September-23-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    },
    {
      "title": "Entropy and Face Dimension of the Perfect-Matching Polytope",
      "path": "preprints/Entropy-and-Face-Dimension-of-the-Perfect-Matching-Polytope-September-23-2026/main.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Entropy-and-Face-Dimension-of-the-Perfect-Matching-Polytope-September-23-2026/main.pdf",
      "readme_path": "preprints/Entropy-and-Face-Dimension-of-the-Perfect-Matching-Polytope-September-23-2026/README.md",
      "tex_paths": [],
      "pdf_exists": true
    }
  ],
  "lean_scope_path": "lean/docs/113.md",
  "lean_scope_url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/lean/docs/113.md",
  "verification_status": "scope_document_available_not_independently_verified",
  "review_status": "inventory_complete_deep_review_pending"
}