{"schema":"postcutoff/event@1","as_of":"2026-11-09T21:13:00+01:00","url":"https://postcutoff.com/e/2026-10-30-hopfield-model-thermodynamic-limit-barra-durante-claude-chatgpt/","md":"https://postcutoff.com/e/2026-10-30-hopfield-model-thermodynamic-limit-barra-durante-claude-chatgpt/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-10-30-hopfield-model-thermodynamic-limit-barra-durante-claude-chatgpt","date":"2026-10-30","date_precision":"day","short_title":"Hopfield model thermodynamic limit, AI-generated proofs","deck":null,"takeaway":"Adriano Barra and Fabrizio Durante (arXiv 2610.41938, 30 Oct 2026) prove that the quenched pressure of the Hopfield model with K ~ αN Rademacher patterns has a thermodynamic limit at every load, temperature and uniform field, with no replica-symmetry assumption.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.41938: Existence of the thermodynamic limit for the Hopfield model (Barra, Durante)","url":"https://arxiv.org/abs/2610.41938","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-11-02","updated":"2026-11-02","orgs":["Anthropic","OpenAI"],"title":"Existence of the thermodynamic limit for the Hopfield model at every load: proofs 'generated' by Claude Opus 5.5 and ChatGPT Sol 6.1 (Barra, Durante)","summary":"Adriano Barra and Fabrizio Durante (arXiv 2610.41938, 30 Oct 2026) prove that the quenched pressure of the Hopfield model with K ~ αN Rademacher patterns has a thermodynamic limit at every load, temperature and uniform field, with no replica-symmetry assumption. They write that the proofs \"were generated through extensive interaction\" with Claude Opus 5.5 and ChatGPT Sol 6.1 and that they \"do not claim credit for their derivation\". Unrefereed; not intended for journal publication in this form.","key_facts":["Result: the limit equals the supremum over r of limiting pressures of mixed models keeping r binary patterns in a Gaussian bulk; existence only, no explicit formula","Also gives an alternative proof of the Gaussian-pattern existence result announced by Camilli, Contucci and Mingione, extended to a uniform field","AI disclaimer (verbatim): 'The proofs presented in this paper were generated through extensive interaction with the AI models Claude (Opus 5.5) and ChatGPT (Sol 6.1), and the authors do not claim credit for their derivation … This write-up is made available as a service to the research community and is not intended for journal publication in its current form. All statements and proofs have been checked by the authors'","Verification status: preprint, checked by the authors; no Lean"],"key_numbers":[],"tags":["math","physics","spin-glasses","neural-networks","claude-opus-5-5","gpt-6-1-sol","arxiv"],"science":{"field":"physics","subfield":"mathematical physics (spin glasses, associative memory)","problem":"Existence of the thermodynamic limit of the Hopfield model's free energy at all loads α","result":"Limit exists for every α ∈ (0,∞), finite β and uniform external field, without replica-symmetry or concentration hypotheses","open_since":"","ai_system":["Claude Opus 5.5","ChatGPT Sol 6.1"],"human_role":"AI-generated proofs under the authors' problem formulation and guidance; authors checked all statements","verification":{"key":"preprint","label":"Preprint only","text":"Preprint, author-checked"},"status":"pending","shock":""},"body_md":"## What happened\n\nBarra and Durante posted a proof that the Hopfield associative-memory model has a well-defined infinite-volume free energy at every storage load, a question open in rigorous spin-glass theory (Guerra–Toninelli settled the Sherrington–Kirkpatrick case in 2002). Their method extracts large-overlap patterns, interpolates the rest to Gaussians, and reduces to results of Ho and of Chen, Ho and Issa on vector spin glasses.\n\nThe paper's disclaimer credits the proofs to Claude Opus 5.5 and ChatGPT Sol 6.1, with the authors posing questions and suggesting approaches.\n\n## Why it matters\n\nIt follows Panchenko's Mézard–Parisi proof found by ChatGPT Astra in the same week, another rigorous statistical-mechanics result whose authors attribute the derivation to models. Adriano Barra is a known researcher on Hopfield networks.","disputed":[{"label":"Verification","text":"Preprint, author-checked","sources":[]}],"related":[{"id":"2026-10-30-mezard-parisi-formula-panchenko-proof-found-by-chatgpt-astra","url":"https://postcutoff.com/e/2026-10-30-mezard-parisi-formula-panchenko-proof-found-by-chatgpt-astra/","date":"2026-10-30","date_precision":"day","short_title":"Mézard–Parisi formula: Panchenko's proof 'found by ChatGPT Astra'","deck":null,"takeaway":"Dmitry Panchenko (Toronto), a leading probabilist of spin glasses, posted a proof of the Mézard–Parisi formula on 29–30 Oct 2026. The formula gives the free energy of random K-SAT and diluted p-spin models with even p. Franz and Leone had proved the upper bound; Panchenko's paper claims the matching lower bound. His AI statement says: 'The proof in this paper was found by ChatGPT Astra.' A companion note was 'written by ChatGPT Astra'. He adds that OpenAI released another proof a few days later, which 'appears to follow a different approach'. OpenAI's version is family 221 of its maths repository. Both are unrefereed.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":4,"official":4,"filed":"2026-10-31","updated":"2026-10-31","orgs":["OpenAI","University of Toronto"]}],"people":[{"id":"dmitry-panchenko","name":"Dmitry Panchenko","url":"https://postcutoff.com/person/dmitry-panchenko/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-02","type":"filed","text":"Created from the 2 Nov sweep"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-02","run":null,"sources_read":"The 2 Nov sweep","updated":"2026-11-02","human_review":null,"version":{"date":"2026-11-02"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":183,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":122,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":213,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":152,"in_training_data":false}],"short_url":null}