{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-11-18-bounded-integer-programming-chen-mao-zhang-gpt-6-2-astra/","md":"https://postcutoff.com/e/2026-11-18-bounded-integer-programming-chen-mao-zhang-gpt-6-2-astra/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-11-18-bounded-integer-programming-chen-mao-zhang-gpt-6-2-astra","date":"2026-11-18","date_precision":"day","short_title":"Integer programming below N^{2d} by GPT-6.2 Astra","deck":null,"takeaway":"arXiv 2611.24386 (Zhejiang University) shows that any polynomial saving for (min,+)-convolution carries over to integer programs with d equality constraints and coefficients at most N, giving Õ(n + N^{1.9602d}) randomized and Õ(n + N^{1.99986d}) deterministic time, below the authors' own recent N^{2d+ε}. The AI statement says the authors fed two papers to GPT-6.2 Astra, a day-old model, which 'with almost no human input and after several runs' obtained the result. Unrefereed; no outside reaction found by 20 Nov.","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.24386: Even Faster Algorithms for Bounded Integer Programming (Chen, Mao, Zhang)","url":"https://arxiv.org/abs/2611.24386","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"arXiv 2610.25955: Bounded integer programming in almost N^{2d} time (Chen, Mao, Zhang)","url":"https://arxiv.org/abs/2610.25955","type":"paper","group":"primary","domain":"arxiv.org"},{"n":3,"title":"arXiv 2611.15792: Bounded knapsack in truly subquadratic time (Zhou)","url":"https://arxiv.org/abs/2611.15792","type":"paper","group":"primary","domain":"arxiv.org"}],"official":3,"filed":"2026-11-20","updated":"2026-11-20","orgs":["Zhejiang University","OpenAI"],"title":"Bounded integer programming below N^{2d}: Chen, Mao and Zhang say GPT-6.2 Astra produced the result 'with almost no human input' and take 'no intellectual credit'","summary":"Lin Chen, Yuchen Mao and Guochuan Zhang posted 'Even Faster Algorithms for Bounded Integer Programming' on 18 Nov 2026, the day after GPT-6.2 Astra's release. For integer programs min{cᵀx : Ax = b, l ≤ x ≤ u, x ∈ ℤⁿ} with d constraints and coefficients bounded by N, it reduces the exponent to that of (min,+)-convolution: with recent truly subquadratic convolution algorithms this gives Õ(n + N^{1.9602d}) randomized and Õ(n + N^{1.99986d}) deterministic time. The authors state that GPT-6.2 Astra, given their earlier N^{2d} paper and Zhou's subquadratic Knapsack paper, obtained the result with almost no human input, and that they take no intellectual credit.","key_facts":["Result (abstract): 'If witnessed (min,+)-convolution of arrays of length m can be computed in Õ(m^ρ) time with error probability p, then for every ε>0 bounded integer programming can be solved in Õ(n+N^{(max{ρ,3/2}+ε)d}) time'","Concrete bounds: Õ(n + N^{1.9602d}) randomized, Õ(n + N^{1.99986d}) deterministic, up to polynomial factors in the encoding length and the cost of one linear program; previous: the same authors' O(N^{2d+ε})","AI statement (verbatim): 'We fed these two papers into GPT-6.2 Astra, and with almost no human input and after several runs, it obtained the result in this paper. The authors take no intellectual credit'","The two inputs: the authors' own 'Bounded integer programming in almost N^{2d} time' (arXiv 2610.25955, itself written with GPT Astra Ultra proofs, see 2026-10-19 entry) and Zhou's 'Bounded knapsack in truly subquadratic time' (arXiv 2611.15792)","Third Astra-credited paper by the trio in six weeks: near-linear Subset Sum (9 Oct), N^O(d) integer programming (19 Oct), now this","Timing: GPT-6.2 Astra was released on 17 Nov 2026; the preprint appeared on 18 Nov","Status: preprint, not refereed, no formal proof; no reaction found on HN, Mathstodon or blogs by 20 Nov"],"key_numbers":[],"tags":["math","computer-science","integer-programming","algorithms","fine-grained-complexity","gpt-6-2-astra"],"science":{"field":"computer-science","subfield":"algorithms (integer programming, fine-grained complexity)","problem":"Running time of integer programs with a fixed number d of equality constraints and coefficients bounded by N","result":"Reduction to (min,+)-convolution giving Õ(n + N^{1.9602d}) randomized and Õ(n + N^{1.99986d}) deterministic algorithms, below N^{2d}","open_since":"","ai_system":["GPT-6.2 Astra"],"human_role":"Authors supplied two papers and ran the model several times; they state 'almost no human input' and take no intellectual credit","verification":{"key":"preprint","label":"Preprint only","text":"unverified claim (preprint)"},"status":"pending","shock":"Established researchers in the area credit a model released the day before with essentially the whole improvement over their own recent bound."},"body_md":"## What happened\n\nOn 18 November 2026 three Zhejiang University researchers posted an improvement over their own recent algorithm for integer programs\nwith few constraints and small coefficients. The paper shows that the running time follows the exponent of (min,+)-convolution, so\nrecent subquadratic convolution algorithms push it below N^{2d}. Its AI statement, placed directly under the abstract, says the authors\ngave GPT-6.2 Astra their earlier paper and Zhou's subquadratic Knapsack paper, and that the model produced the result after several runs\nwith almost no human input. It was first listed in our 19 Nov catalogue.\n\n## Why it matters\n\nIt is one of the clearest statements so far by experts in a field that a model, not they, made a research advance, here one day after\nthe model's release. The claim is about the model's share, not only the result; both await independent checking.","disputed":[{"label":"Verification","text":"unverified claim (preprint)","sources":[]}],"related":[{"id":"2026-11-20-ai-assisted-results-november-20-listing","url":"https://postcutoff.com/e/2026-11-20-ai-assisted-results-november-20-listing/","date":"2026-11-20","date_precision":"day","short_title":"AI-assisted results, 20 Nov","deck":null,"takeaway":"The sweep listed 361 arXiv papers with AI statements (207 new on 20 Nov), 63 conjecture papers without one (9 new), 69 Hexagon works, 10 watched repos and 7 result-repo commits. Every new line was read and its AI statement checked in the PDF or the Hexagon provenance record. Six results got their own entries (two promoted from the 19 Nov listing), two existing entries were extended, and 97 arXiv papers and 62 Hexagon works where AI supplied proofs, constructions, code or Lean are listed here; 106 arXiv papers and 6 Hexagon works were dropped as editorial. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":16,"official":13,"filed":"2026-11-20","updated":"2026-11-20","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"]},{"id":"2026-11-19-ai-assisted-results-november-19-listing","url":"https://postcutoff.com/e/2026-11-19-ai-assisted-results-november-19-listing/","date":"2026-11-19","date_precision":"day","short_title":"AI-assisted results, 19 Nov","deck":null,"takeaway":"The sweep listed 379 arXiv papers with AI statements (253 new on 19 Nov), 72 conjecture papers without one (20 new), 71 Hexagon works, 6 result-repo commits and 1 watched repo. Every new line was read and its AI statement checked in the PDF or the Hexagon provenance record. Four results got their own entries, a fifth (Graph Minors in Lean) came from Mathstodon, seven existing entries were extended, and 112 arXiv papers and about 45 Hexagon works where AI supplied proofs, constructions, code or Lean are listed here. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":8,"official":8,"filed":"2026-11-19","updated":"2026-11-19","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"]},{"id":"2026-11-18-gpt-6-2-astra-first-48-hours-amateur-maths-wave","url":"https://postcutoff.com/e/2026-11-18-gpt-6-2-astra-first-48-hours-amateur-maths-wave/","date":"2026-11-18","date_precision":"day","short_title":"First 48 hours of GPT-6.2 Astra","deck":"A high-school student posts 25 claimed results, half Lean-checked","takeaway":"It shows how fast a new frontier model turns into a stream of formal-looking results from outside academia.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":9,"official":3,"filed":"2026-11-18","updated":"2026-11-20","orgs":["OpenAI"]},{"id":"2026-11-17-openai-gpt-6-2-astra-sol","url":"https://postcutoff.com/e/2026-11-17-openai-gpt-6-2-astra-sol/","date":"2026-11-17","date_precision":"day","short_title":"OpenAI releases GPT-6.2 Astra and GPT-6.2 Sol","deck":null,"takeaway":"The three US frontier labs now ship within eight days of each other (Fable 5.2 on Nov 9, Gemini 4 Carbon generally available on Nov 10, GPT-6.2 on Nov 17).","category":"model-release","category_label":"Model releases","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Confirmed"]},"sources":22,"official":7,"filed":"2026-11-17","updated":"2026-11-22","orgs":["OpenAI"]},{"id":"2026-10-19-integer-programming-linear-exponent-gpt-astra-ultra","url":"https://postcutoff.com/e/2026-10-19-integer-programming-linear-exponent-gpt-astra-ultra/","date":"2026-10-19","date_precision":"day","short_title":"Integer programming in standard form in N^O(d) time, improving Eisenbrand–Weismantel's N^O(d²): Zhejiang team's ideas, GPT Astra Ultra's proofs (Chen, Mao, Zhang)","deck":null,"takeaway":"Ten days after their Subset Sum claim, the same Zhejiang trio claim to settle a basic question in integer programming. With d constraints and entries bounded by N, the running time exponent drops from O(d²) to linear in d. As before, the authors give the idea and say GPT Astra Ultra wrote the complete proofs.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":2,"official":2,"filed":"2026-10-20","updated":"2026-10-20","orgs":["Zhejiang University","OpenAI"]},{"id":"2026-10-09-subset-sum-near-linear-time-gpt-astra-ultra","url":"https://postcutoff.com/e/2026-10-09-subset-sum-near-linear-time-gpt-astra-ultra/","date":"2026-10-09","date_precision":"day","short_title":"Subset Sum in O(n + N^(1+ε)) time claimed","deck":"Zhejiang team designed the route, GPT Astra Ultra wrote the complete proofs (Chen, Mao, Zhang)","takeaway":"A long-open question in algorithms, whether Subset Sum can be solved in time near-linear in the largest input number, gets a claimed positive answer. The authors designed the approach; GPT Astra Ultra turned it into a 105-page paper and generalized it without guidance.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":2,"official":2,"filed":"2026-10-12","updated":"2026-10-12","orgs":["Zhejiang University","OpenAI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-20","type":"filed","text":"Created (science agent; promoted from the 19 Nov listing after re-reading the PDF; no reactions found)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-20","run":null,"sources_read":null,"updated":"2026-11-20","human_review":null,"version":{"date":"2026-11-20"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":171,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":141,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":232,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":171,"in_training_data":false}],"short_url":null}