{
  "abstract": "In this article, we propose a benchmark to quantify the non-triviality and novelty of machine-generated mathematical proofs compared to existing literature. Our core methodology uses a probabilistic measure to evaluate the non-triviality of the underlying mathematical arguments in comparison to the current \\texttt{MATHLIB} library. Finally, we apply this benchmark to the recent proof generated by Claude on the complex zeros of the Riemann zeta function to test for non-trivial steps.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.22612",
  "author_total": 2,
  "authors": [
    {
      "name": "Madhuparna Das"
    },
    {
      "name": "Soumya Banerjee"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/26c0spnvm5z0p.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.22612",
  "fulltext_url": null,
  "id": "26c0spnvm5z0p",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.22612",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.LO"
    ],
    [
      "openalex",
      "1703|Mathematics, Computing, and Information Processing"
    ]
  ],
  "openalex": "W7222917006",
  "pdf_url": "https://arxiv.org/pdf/2610.22612",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-15",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/26c0spnvm5z0p.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:30:37Z",
      "native_id": "2610.22612",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.22612"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.LO",
      "subfield": "logic-foundations"
    }
  ],
  "title": "Proof Perplexity: A Probabilistic Approach to Measuring non-triviality in Machine Generated Proofs",
  "title_text": "Proof Perplexity: A Probabilistic Approach to Measuring non-triviality in Machine Generated Proofs",
  "type": "preprint",
  "updated_at": "2026-10-30T12:33:31Z",
  "url": "https://research.draconitic.com/paper/26c0spnvm5z0p",
  "venue": "arXiv",
  "versions": []
}