Pith. sign in

REVIEW 2 cited by

Large Language Models for Mathematicians

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.04556 v2 pith:WN3UIUZO submitted 2023-12-07 cs.CL cs.AIcs.LGmath.HO

classification cs.CLcs.AIcs.LGmath.HO
keywords languagemodelsllmsmathematicianslargemathematicalpotentialwork
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large language models (LLMs) such as ChatGPT have received immense interest for their general-purpose language understanding and, in particular, their ability to generate high-quality text or computer code. For many professions, LLMs represent an invaluable tool that can speed up and improve the quality of work. In this note, we discuss to what extent they can aid professional mathematicians. We first provide a mathematical description of the transformer model used in all modern language models. Based on recent studies, we then outline best practices and potential issues and report on the mathematical abilities of language models. Finally, we shed light on the potential of LLMs to change how mathematicians work.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations

    cs.CL 2025-05 conditional novelty 5.0 of 10

    The proposed Faithful-Refiner, combining syntactic parsing, quantifier and consistency checks, logical-relation guidance, and detailed proof feedback, raises explanation refinement rates on three NLI benchmarks by lar...

  2. Grammars of Formal Uncertainty: When to Trust LLMs in Automated Reasoning Tasks

    cs.CL 2025-05 reject novelty 5.0 of 10

    A grammar-based model of LLM-generated SMT-LIB code produces uncertainty signals that predict formalization errors on some reasoning tasks, with fused signals giving large error reductions only in an in-sample evaluation.

Pith tools