{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-11-20-biased-random-walk-speed-monotonicity-heng-ma-gpt-6-astra/","md":"https://postcutoff.com/e/2026-11-20-biased-random-walk-speed-monotonicity-heng-ma-gpt-6-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-20-biased-random-walk-speed-monotonicity-heng-ma-gpt-6-astra","date":"2026-11-20","date_precision":"day","short_title":"Biased random walk speed monotonicity (GPT-6 Astra)","deck":null,"takeaway":"This is the main case of the monotonicity problem raised by Lyons, Pemantle and Peres in 1996.","category":"science","category_label":"Science & math","importance":3,"confidence":"low","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"Hexagon 2611.00735: On the Monotonicity of the Speed of Biased Random Walks on GW Trees (Heng Ma, GPT-6 Astra)","url":"https://hexagonmath.org/abs/2611.00735","type":"paper","group":"primary","domain":"hexagonmath.org"},{"n":2,"title":"arXiv 2609.29894: A computer-assisted proof of speed monotonicity beyond the known range","url":"https://arxiv.org/abs/2609.29894","type":"paper","group":"primary","domain":"arxiv.org"},{"n":3,"title":"Song and Wang: the speed is monotonic for low values of bias (J. Appl. Probab.)","url":"https://resolve.cambridge.org/core/journals/journal-of-applied-probability/article/speed-of-a-biased-walk-on-a-galtonwatson-tree-without-leaves-is-monotonic-for-low-values-of-bias/9DAE0D26D603F3C72E0B960529EEC8F3","type":"paper","group":"primary","domain":"resolve.cambridge.org"},{"n":4,"title":"arXiv 1111.5865: Lyons–Pemantle–Peres monotonicity for high biases (Ben Arous, Fribergh, Sidoravicius)","url":"https://arxiv.org/abs/1111.5865","type":"paper","group":"primary","domain":"arxiv.org"},{"n":5,"title":"Hexagon 2611.00820: The speed of biased random walk on leafless Bienaymé trees is monotone (Kortchemski)","url":"https://hexagonmath.org/abs/2611.00820","type":"paper","group":"primary","domain":"hexagonmath.org"},{"n":6,"title":"arXiv 2611.25882: A proof of the Lyons–Pemantle–Peres monotonicity conjecture for high offspring laws (Schwarzfischer)","url":"https://arxiv.org/abs/2611.25882","type":"paper","group":"primary","domain":"arxiv.org"}],"official":6,"filed":"2026-11-20","updated":"2026-11-22","orgs":["OpenAI"],"title":"Heng Ma and GPT-6 Astra claim the Lyons–Pemantle–Peres speed monotonicity for biased random walks on Galton–Watson trees with at least two children","summary":"On 20 November 2026 Heng Ma deposited on Hexagon a 24-page paper, with \"GPT-6 Astra and Heng Ma\" as the running head, proving that the speed of the λ-biased random walk on a leafless Galton–Watson tree is decreasing on (0, m) when every vertex has at least two children. This is the main case of the monotonicity problem raised by Lyons, Pemantle and Peres in 1996. It also proves decrease on (0,1) and ((3+√5)/2, m) in general and sketches a computer-assisted proof for the rest. Only part of the arguments have been checked by the human contributor.","key_facts":["Claims (Hexagon 2611.00735): with at least two children per vertex, v(λ) is strictly decreasing on (0, m); for general leafless GW trees, decreasing on (0,1) ∪ ((3+√5)/2, m); strict decrease on (0, m) sketched with exact checks of about 750,000 rational coefficients, full proof in a companion GitHub version","Earlier known ranges: λ ≤ m₁/1160, λ ≤ 1/2 (Aïdékon), and λ ≤ m₁/(1+√(1−1/m₁)) when every vertex has at least m₁ ≥ 2 children (Song and Wang, J. Appl. Probab. 2025); Ben Arous, Fribergh and Sidoravicius treated high bias; a computer-assisted, partly Lean-verified preprint (arXiv 2609.29894, Mandarapu and Kunkunuru) reached [0, 1.755] for offspring uniform on {2,3}","AI statement in the PDF: 'The initial proof was found by GPT-6 Astra through extensive interaction with the author in September 2026. This manuscript was substantially generated and revised with the assistance of AI systems. At the time of this version, only part of the arguments and citations have been independently verified in full by the human contributor'","Hexagon provenance on how the model worked: it 'frequently lost in short-term rewards: it proved local lemmas that did not lead to the main result, checked special cases numerically, or carried out long computations without real progress. It also tended to keep pushing one approach instead of stepping back'; the author chose among directions or asked for a different approach","A 'digested and more streamlined version' is promised for Hexagon and arXiv 'in the coming months'","Independent full proof (Hexagon 2611.00820, 21 Nov): Igor Kortchemski's deposit proves that for every leafless Bienaymé–Galton–Watson tree with finite mean m > 1 the speed v(λ) is continuously differentiable on [0, m) with v′(λ) < 0, which 'answers a question posed by Lyons, Pemantle and Peres in 1996'; entirely analytic when E[1/ν] ≤ 31/49, otherwise two interval-arithmetic computations for biases between 1 and 9/5; one Lean formalization linked on Hexagon","Kortchemski's provenance: 'AI agents developed the mathematical arguments, wrote the computer-verification programs and drafted and revised substantial portions of the manuscript'; an exploratory phase with OpenAI GPT models through Codex, then 'a subsequent research campaign … coordinated by Anthropic's Claude Opus 5.5 through Claude Code and involved 134 recorded tasks'; Hexagon label: primarily AI-generated, some parts checked by a human","Third paper (arXiv 2611.25882, 19 Nov): Felix Schwarzfischer proves the monotonicity for high offspring laws; 'OpenAI's ChatGPT 6 Astra was used during the initial stages of this work. The proof in its final form was developed by the author'"],"key_numbers":[],"tags":["math","probability","random-walks","galton-watson","gpt-6-astra","hexagon","unverified"],"science":{"field":"mathematics","subfield":"probability / random walks on trees","problem":"Lyons–Pemantle–Peres monotonicity problem: is the speed of λ-biased random walk on a leafless Galton–Watson tree decreasing in λ?","result":"Claimed: decreasing on (0, m) when every vertex has at least two children; decreasing on (0,1) ∪ ((3+√5)/2, m) in general; a computer-assisted sketch for the full range.","open_since":"1996","ai_system":["GPT-6 Astra"],"human_role":"AI-assisted: GPT-6 Astra found the initial proof in long interaction; the author steered and has verified only part of it","verification":{"key":"preprint","label":"Preprint only","text":"Unverified preprint on Hexagon; computer-assisted part only sketched"},"status":"pending","shock":"","short":"LPP speed monotonicity"},"body_md":"## What happened\n\nHeng Ma posted the paper on Hexagon on 20 November 2026. The PDF gives \"GPT-6 Astra and Heng Ma\" as the running head and describes it\nas a preliminary version. The Hexagon record is labelled \"primarily AI-generated\", with some parts checked and understood by a human.\nThe provenance note also describes how the model behaved during the work: it chased local lemmas and numerical checks, and the author\nredirected it.\n\n## Why it matters\n\nLyons, Pemantle and Peres asked about monotonicity in 1996. It has been proved only for small or very large bias, and a\ncomputer-assisted preprint in September extended the range for one offspring law. The new claim covers the whole transient range in\nthe case of at least two children. It is unrefereed and only partly checked by its human author.","disputed":[{"label":"Verification","text":"Unverified preprint on Hexagon; computer-assisted part only sketched","sources":[]}],"related":[{"id":"2026-11-22-ai-assisted-results-november-22-listing","url":"https://postcutoff.com/e/2026-11-22-ai-assisted-results-november-22-listing/","date":"2026-11-22","date_precision":"day","short_title":"AI-assisted results, 22 Nov","deck":null,"takeaway":"arXiv published nothing new over the weekend, but the 127 uncited arXiv lines dated 14–19 Nov, which runs since 19 Nov had treated as already-read re-listings, had never been read: they held Google's autonomous Gemini proof of a polynomial sample compression bound, Norin's sharp topological overlap, the El-Zahar–Erdős disproof and Stafford's 1978 conjecture. All 252 disclosure lines and 49 conjecture lines were read in the PDFs; 6 own entries, 5 extended entries, 60 arXiv papers, 29 Hexagon works, 10 Zenodo records and 8 backlog works listed here; 187 disclosure lines dropped as editorial, no AI or AI only as topic or reference, 50 conjecture papers had no AI statement, 4 Hexagon works dropped. All unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":39,"official":38,"filed":"2026-11-22","updated":"2026-11-22","orgs":["Google","OpenAI","Anthropic","various researchers"]},{"id":"2026-11-21-ai-assisted-results-november-21-listing","url":"https://postcutoff.com/e/2026-11-21-ai-assisted-results-november-21-listing/","date":"2026-11-21","date_precision":"day","short_title":"AI-assisted results, 21 Nov","deck":null,"takeaway":"No new arXiv announcement reached the 21 Nov sweep: all 256 disclosure lines and 56 conjecture lines were re-listings from 13–20 Nov already read in earlier runs. The work came from 89 new Hexagon deposits (all provenance records read through the API), 49 Zenodo records and the watched repos. Five results got their own entries (one of them a September–November cs.GT cascade we had missed), two existing entries were extended, 80 Hexagon works and 27 Zenodo records (21 of them without an AI statement) are listed here, and 1 Hexagon work and 21 Zenodo records were dropped (out of scope or not mathematics). All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":24,"official":23,"filed":"2026-11-21","updated":"2026-11-21","orgs":["OpenAI","Anthropic","various researchers"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-22","type":"edit","text":"Added Kortchemski's independent full proof (Hexagon 2611.00820, Claude Code campaign of 134 tasks) and Schwarzfischer's high-offspring proof (arXiv 2611.25882) (science agent)"},{"date":"2026-11-20","type":"filed","text":"Created. 2026-11-21 (science agent; Hexagon record and PDF)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-20","run":null,"sources_read":null,"updated":"2026-11-22","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":173,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":143,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":234,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":173,"in_training_data":false}],"short_url":null}