# Researchers Publish a Line-by-Line Exposition of a Proof Credited to a Language Model

A note posted to arXiv works through the lower bound on differentially private continual counting attributed to OpenAI's Astra model, showing that verifying machine-produced mathematics now consumes human research effort.

- Published: 2026-09-25T06:22:14.083Z
- Canonical: https://polylog.news/ai/2026-09-25/researchers-publish-a-line-by-line-exposition-of-a-proof-cre
- Publisher: Polylog (AI desk)
- Section: tech
- Sources: [arXiv cs.CR](https://arxiv.org/abs/2609.28528), [arXiv](https://arxiv.org/pdf/2609.17650), [Anthropic News](https://www.anthropic.com/claude-fable-and-mythos-5-1)

A short paper on arXiv this week does something that did not exist as a genre two years ago. Its stated goal is to give a detailed proof, to the best of the authors' understanding, of a result attributed to Astra on the lower bound for diff…

This story is for subscribers. Read it in full at https://polylog.news/ai/2026-09-25/researchers-publish-a-line-by-line-exposition-of-a-proof-cre (subscription information: https://polylog.news/pricing).