Net Good IndexSubmit a correction

OpenAI

GPT

A family is a named generation or product line. Scores below are the sum of its named releases and any documented internal systems in the same line.

Benefit

+20.67

Harm

−4.44

Net Good

16.23

Releases

Leaderboard

RankModelOrganizationBenefitHarmNetEventsLast impact
3ChatGPT

GPT

OpenAI+18.93−1.6817.2674 Oct 2026
36GPT-5 Pro

GPT

OpenAI+1.010.001.01124 Oct 2025
46GPT-4

GPT

OpenAI+0.400.000.4028 May 2024
51GPT-5

GPT

OpenAI+0.320.000.32120 Nov 2025
80GPT-4o

GPT

OpenAI+0.01−2.77-2.76417 Sep 2026

Timeline

  • Benefit
  • Harm
  • Net
051015202023202420252026

Events

Benefit4 Oct 2026

ChatGPT contributes most proof ideas in a proposed proof of the KLS conjecture

A 4 October 2026 arXiv preprint presents a proof of the Kannan–Lovász–Simonovits conjecture and says most proofs and mathematical ideas were found by ChatGPT; the authors supplied the suspension idea and improved the exposition.

MathematicsprovisionalTier 4 Historic+5.16
Benefit17 Sep 2026

ERPBench: A State-Grounded Evaluation Paradigm for Computer-Use Agents in Enterprise Software

arXiv:2609.17885v1 Announce Type: new Abstract: Computer-use agents that operate through screenshots and simulated actions are advancing rapidly, yet their evaluation remains anchored to general desktop and web tasks. Enterprise Resource Planning (ERP) systems run the finance, procurement, inventory, and customer operations of organizations worldwide, and pose distinct challenges for computer-use agents: dense interfaces, coordinated multi-step interactions, and errors that alter persistent business records rather than surfacing on screen. Existing enterprise benchmarks rely on proprietary pl

BiologyprovisionalTier 1 Useful+0.00
Benefit14 Sep 2026

GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs

arXiv:2609.12265v1 Announce Type: new Abstract: Large Language Models (LLMs) are increasingly asked to reason over structured data such as graphs, yet how reliably they can carry out multi-step graph algorithms in language remains unclear. Existing evaluations tend to use simple tasks on small graphs, to score code generation rather than reasoning over the graph itself, or to fix a single input format. We introduce Graph Theory Bench (GT Bench), a benchmark covering 24 classical graph problems in 44 task-structure settings, with over 100,000 examples across four representations: natural langu

BiologyprovisionalTier 1 Useful+0.01
Harm9 Sep 2026

An Oklahoma judge acknowledges ChatGPT produced fictitious citations in a ruling

On 9 September 2026 Reuters reported that Stephens County District Judge Lawrence Wheeler told investigators he used ChatGPT for research and that an order he drafted contained two citations to cases that do not exist.

Computer ScienceverifiedTier 2 Significant Harm−0.14
Harm9 Sep 2026

New Mexico Supreme Court holds a lawyer in contempt for ChatGPT-fabricated witnesses

In September 2026 the New Mexico Supreme Court held attorney Stephen Aarons in contempt, fined him $5,000, and referred him for discipline after a murder-appeal brief prepared with ChatGPT included wholly fabricated witnesses and false police testimony.

Computer ScienceverifiedTier 2 Significant Harm−0.24
Harm4 Aug 2026

OpenAI disrupts a Cambodia-based ChatGPT scam-compound operation

On 4 August 2026 OpenAI reported banning a coordinated ChatGPT account network, likely operating around Poipet, Cambodia, that used the models for romance, investment, gambling, and law-enforcement impersonation scams and for compound administration, after a WhatsApp lead.

Economics & ProductivityprovisionalTier 2 Significant Harm−0.19
Benefit20 Nov 2025

GPT-5 supplies key steps on Erdős 848, a tree-count inequality, and network identifiability

In a 20 November 2025 OpenAI science-acceleration paper, GPT-5 helped Mehtaab Sawhney and Mark Sellke finish Erdős problem 848, produced a short proof of a conjectured small-subgraph inequality in trees that Bubeck, Sellke, and Yin checked, and pointed to leaf fraction as the statistic that identifies a hidden network parameter.

MathematicsverifiedTier 2 Notable+0.32
Benefit24 Oct 2025

Ryu and Jang, using GPT-5 Pro, prove point convergence of Nesterov accelerated gradient

In October 2025 UCLA mathematicians Ernest Ryu and Uijeong Jang resolved the long-open question of whether Nesterov’s 1983 accelerated gradient method converges in iterates, in a collaboration they describe as heavily assisted by GPT-5 Pro. The human authors wrote and checked the final proof.

MathematicsprovisionalTier 3 Major+1.01