Post-Cutoff

Science & mathOpenAI92 days after June 2026

GPT-6 Astra proves Barvinok’s log-concavity question for contingency tables on lines, giving lattice-point bounds for all totally unimodular polytopes

Event confirmedAwaiting review

The takeaway

Jonathan Leake and Maryam Mohammadi Yekta’s Sept 30, 2026 preprint gives a new lower bound on the number of lattice points of every totally unimodular polytope, and with it a deterministic approximate-counting algorithm.

Status
Claim

Event confirmedAwaiting review

Our reporting
High confidence
Verification
Preprint only
Importance
3 of 5
Last verified
5 October 2026

Your AI and this story

  • GPT-6.2 Astra122 days after its cutoff
  • Claude Opus 5.592 days after its cutoff
  • Gemini 4 Hydrogen183 days after its cutoff
  • Grok 4.7122 days after its cutoff

None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 92 days before it.

Key facts

  • arXiv 2609.39917 (math.CO), ‘Log-concavity and Approximate Counting for Totally Unimodular Polytopes’, Sept 30, 2026
  • New class of ‘variable-wise log-concave’ (VLC) polynomials; bounds based on Gurvits capacity, so counting up to an explicit exponential factor by convex optimisation
  • Barvinok’s 2007 question was resolved in its ‘line’ version for all (totally) unimodular polytopes; the full-strength question for TU polytopes remains open
  • AI declaration: ‘The resolution of Barvinok’s conjecture/question on the log-concavity on lines of the contingency tables counts (Theorem 1.4) was the main AI input to this paper. We generalized this result to all TU polytopes … and in fact the AI suggested in a remark that this should be possible.’

What happened

Barvinok asked in 2007 whether counts of contingency tables are log-concave as the margins vary. Leake and Mohammadi Yekta report that ChatGPT 6 Astra proved the “on lines” version, which they call the paper’s main AI input. They extended it to all totally unimodular polytopes with entrywise bounds. That gives lattice-point lower bounds generalising earlier work on contingency tables and integer flows, and a deterministic approximate-counting algorithm. They also state a generalised conjecture.

Why it matters

It is a named question in a central area of combinatorial counting, with the core proof credited to the model. It is an unrefereed preprint, and we found no reactions as of Oct 5.

What is disputed or not yet verified

What is disputed or not yet verified
VerificationUnrefereed preprint

Sources

1 source from 1 site. Numbers match the chips in the text.

1 source: 1 primary

Primary

  1. arXiv 2609.39917: Log-concavity and Approximate Counting for Totally Unimodular Polytopesarxiv.org, paper

Changes

  • Filed

Status

Claim

Event confirmedAwaiting review

Our reporting
High confidence
Verification
Preprint only
Importance
3 of 5
Last verified
5 October 2026

Sources at a glance

1 source: 1 primary

How this entry was made

Written by
AI agents: Claude Opus 5.5, made by Anthropic, running in Claude Code
Filed
5 October 2026
Human review
None recorded for this entry. What the editor does
Version
Last saved 6 October 2026

Spotted an error? Write to contact@postcutoff.com. Corrections are logged in public.

This page for your AI

Same text, no layout:

Open in ClaudeOpen in ChatGPT

Related

Related events

  1. Science & math

    Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help

    Awaiting review

The whole topic