The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Maintaining a Library of Formal Mathematics
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Existing benchmarks of olympiad mathematics do not cover geometry because of a focus on formal mathematics in general-purpose languages1,9, whose formulation poses great challenges to representing geometry.”
From Solving olympiad geometry without human demonstrations (2024) · cites this paper as [9]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The problem is even worse for geometry because of its unique translation challenges1,5, resulting in severe scarcity of training data.”
From Solving olympiad geometry without human demonstrations (2024) · cites this paper as [9]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Previous methods to generate them are based on hand-crafted templates and domain-specific heuristics8–12, and are, therefore, limited by a subset of human experiences expressible in hard-coded rules.”
From Solving olympiad geometry without human demonstrations (2024) · cites this paper as [9]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45949-9 · Cited by 1,629
How to make ad-hoc polymorphism less ad hoc
Wadler, P., & Blott, S. (1989) · Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 · doi:10.1145/75277.75283 · Cited by 773
The Lean Theorem Prover (System Description)
de Moura, L., Kong, S., Avigad, J., van Doorn, F., & von Raumer, J. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-21401-6_26 · Cited by 416
Self-citationA Machine-Checked Proof of the Odd Order Theorem
Gonthier, G., Asperti, A., Avigad, J., Bertot, Y., Cohen, C., Garillot, F., Le Roux, S., Mahboubi, A., O’Connor, R., Ould Biha, S., et al. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39634-2_14 · Cited by 290
The Role of the Mizar Mathematical Library for Interactive Proof Development in Mizar
Bancerek, G., Byliński, C., Grabowski, A., Korniłowicz, A., Matuszewski, R., Naumowicz, A., & Pąk, K. (2018) · Journal of Automated Reasoning · doi:10.1007/s10817-017-9440-6 · Cited by 204
Analyzing Program Termination and Complexity Automatically with AProVE
Giesl, J., Aschermann, C., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Hensel, J., Otto, C., Plücker, M., Schneider–Kamp, P., et al. (2016) · Journal of Automated Reasoning · doi:10.1007/s10817-016-9388-y · Cited by 165
Community, T. M. (2020) · Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs · doi:10.1145/3372885.3373824 · Cited by 161
A metaprogramming framework for formal verification
Ebner, G., Ullrich, S., Roesch, J., Avigad, J. D., & de Moura, L. (2017) · Proceedings of the ACM on Programming Languages · doi:10.1145/3110278 · Cited by 80
Self-citationQED at Large: A Survey of Engineering of Formally Verified Software
Ringer, T., Palmskog, K., Sergey, I., Gligoric, M., & Tatlock, Z. (2019) · Foundations and Trends® in Programming Languages · doi:10.1561/2500000045 · Cited by 74
Buzzard, K., Commelin, J., & Massot, P. (2020) · ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) · doi:10.1145/3372885.3373830 · Cited by 41
Research works printed but not linked: 5
- Kaliszyk, C., Sternagel, T.: Initial experiments on deriving a complete HOL simplification set. In: Blanchette, J.C., Urban, J. (eds.) PxTP 2013. EPiC Series in Computing, vol. 14, pp. 77–86. EasyChair (2013)
- Marlow, S., Peyton-Jones, S.: The Glasgow Haskell Compiler. In: Brown, A., Wilson, G. (eds.) The Architecture of Open Source Applications, Volume II (2012)
- Sakaguchi, K.: Validating mathematical structures. arXiv (2020). https://arxiv.org/abs/2002.00620 · arXiv
- Selsam, D., Ullrich, S., de Moura, L.: Tabled typeclass resolution (2020). https://arxiv.org/abs/2001.04301 · arXiv
- Wenzel, M.: Isabelle technology for the Archive of Formal Proofs with application to MMT (2019). https://arxiv.org/abs/1905.07244 · arXiv
Cited by
Solving olympiad geometry without human demonstrations
Trinh, T. H., Wu, Y., Le, Q. V., He, H., & Luong, T. (2024) · Nature · doi:10.1038/s41586-023-06747-5 · Cited by 311
The Lean 4 Theorem Prover and Programming Language
Moura, L. D., & Ullrich, S. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-79876-5_37 · Cited by 258
Metadata
- Authors
- van Doorn, F., Ebner, G., & Lewis, R. Y.
- Affiliations
- University of Pittsburgh (US)
- Vrije Universiteit Amsterdam (NL)
- Corresponding author
- Lewis, Robert Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2020
- Pages
- 251-267
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W3015399600
- Cited by
- 29
- References
- 14
- Citations by year
- 2026: 4 · 2025: 5 · 2024: 6 · 2023: 4 · 2022: 7 · 2021: 1 · 2020: 2
- FWCI
- 2.30
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- Locations
- Lecture notes in computer science (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- VU Research Portal (submittedVersion)
- Data Archiving and Networked Services (DANS) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (016.Vidi.189.037)
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Mathematics, Computing, and Information Processing
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
- Keywords
- Mathlib, Lean theorem prover, proof verification, automated verification, documentation generation, contributor onboarding, formal verification
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Maintaining a Library of Formal Mathematics. https://app.cochat.ai/papers/10.1007/978-3-030-53518-6_16
- The paper
- van Doorn, F., Ebner, G., & Lewis, R. Y. (2020). Maintaining a Library of Formal Mathematics. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-53518-6_16
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
