{
  "family_id": "120",
  "title": "Almost-linear-time exact matching and prescribed-degree factors in general graphs",
  "discipline": "Theoretical computer science",
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "papers": [
    {
      "title": "Almost-Linear-Time Maximum-Cardinality Matching in General Graphs",
      "path": "preprints/Almost-Linear-Time-Maximum-Cardinality-Matching-in-Sparse-General-Graphs-September-24-2026/main.pdf",
      "url": "https://github.com/openai/math/blob/fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb/preprints/Almost-Linear-Time-Maximum-Cardinality-Matching-in-Sparse-General-Graphs-September-24-2026/main.pdf",
      "readme_path": "preprints/Almost-Linear-Time-Maximum-Cardinality-Matching-in-Sparse-General-Graphs-September-24-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"
}