{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-11-09-constant-query-lccs-over-reals-dvir-chatgpt-astra/","md":"https://postcutoff.com/e/2026-11-09-constant-query-lccs-over-reals-dvir-chatgpt-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-09-constant-query-lccs-over-reals-dvir-chatgpt-astra","date":"2026-11-09","date_precision":"day","short_title":"Constant-query LCCs over the reals (Dvir, ChatGPT Astra)","deck":null,"takeaway":"Locally correctable codes that repair any symbol from a constant number of queries were known only over finite fields, and Dvir had conjectured in 2016 that over the real numbers they cannot have growing dimension. His note says 'The complete construction of the new codes was found using ChatGPT Astra' and that his only contribution was the presentation.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.13281: Constant query LCCs over the reals (Zeev Dvir)","url":"https://arxiv.org/abs/2611.13281","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"Dvir, Saraf, Wigderson: Superquadratic lower bound for 3-query LCCs over the reals (Theory of Computing 2017)","url":"https://theoryofcomputing.org/articles/v013a011/","type":"paper","group":"primary","domain":"theoryofcomputing.org"}],"official":2,"filed":"2026-11-15","updated":"2026-11-15","orgs":["OpenAI","Princeton University"],"title":"Zeev Dvir: ChatGPT Astra found constant-query locally correctable codes over the reals, disproving Dvir's own 2016 conjecture that they do not exist","summary":"arXiv 2611.13281 (cs.CC, 9 Nov 2026), Zeev Dvir (Princeton): for every q ≥ 3 there are linear q-query locally correctable codes over ℝ of every dimension d, with block length N ≤ exp(O_q(d^(1/s) log d)), s = ⌊(q−1)/2⌋. This disproves the conjecture of Dvir's 2016 survey that constant-query LCCs over the reals have bounded dimension. The codes are low-degree polynomial evaluations on an integer grid, decoded along random quadratic curves through a point. The acknowledgment attributes the whole construction to ChatGPT Astra. Unrefereed; no formal proof.","key_facts":["Claim (Theorem 1.2): for every integer q ≥ 3 and d ≥ 2 there is a linear (q, 1/(8q))-LCC C ⊂ ℝ^N of dimension d with N ≤ exp(O_q(d^(1/s) log d)), s = ⌊(q − 1)/2⌋","Disclosure (verbatim, §1.3): 'The complete construction of the new codes was found using ChatGPT Astra. The named author's only contribution was in improving/simplifying the presentation and explaining the connection to prior work.'","Prior state (paper): for q = 2, Barak–Dvir–Yehudayoff–Wigderson (2011) showed real LCCs have bounded dimension; 'It was even conjectured in [Dvi16] that d = O_{q,δ}(1) should also hold over ℝ for every fixed q'; for q = 3, Dvir–Saraf–Wigderson (2017) proved d ≤ N^(1/2 − 1/1000); stable real LCCs with constant queries were shown impossible (Ai–Dvir–Saraf–Wigderson)","Method (abstract): low-degree polynomial evaluations over an integer grid plus a 'smooth' sampler that outputs, for a grid point P, a random quadratic curve through P meeting the grid in many nearby points (the decoding queries)","Status: unrefereed 7-page note; no Lean formalization; no public expert reaction found by 15 Nov (web search, HN Algolia)"],"key_numbers":[],"tags":["computer-science","coding-theory","locally-correctable-codes","complexity-theory","chatgpt-astra","gpt-6-astra","arxiv","counterexample"],"science":{"field":"computer-science","subfield":"coding theory / complexity","problem":"Do constant-query locally correctable codes with growing dimension exist over the real numbers? (conjectured not, Dvir 2016)","result":"Constructed for every q ≥ 3, disproving the conjecture","open_since":"2016","ai_system":["ChatGPT Astra"],"human_role":"AI-found construction; the author simplified the presentation and placed it in the literature","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint by the conjecture's author"},"status":"pending","shock":"The researcher who conjectured impossibility reports that the model found the full counterexample construction."},"body_md":"## What happened\n\nZeev Dvir posted a short note describing locally correctable codes over the real numbers that can repair any coordinate by\nreading a constant number q ≥ 3 of other coordinates, for every dimension. Over finite fields such codes come from Reed–Muller\ncodes; over the reals they were believed impossible, and Dvir himself had conjectured so. The note states that ChatGPT Astra found\nthe complete construction.\n\n## Why it matters\n\nReal-valued LCCs are tied to Sylvester–Gallai-type incidence theorems and to matrix-rigidity questions, and the non-existence\nconjecture shaped a line of lower-bound work. A disproof credited entirely to a model, and reported by the conjecture's author,\nis a clear case of an AI system settling a research question in theoretical computer science. The block length is\nexponential in d^(1/s), so the open questions shift to the best possible length.","disputed":[{"label":"Verification","text":"Unrefereed preprint by the conjecture's author","sources":[]}],"related":[{"id":"2026-11-15-ai-assisted-results-november-15-listing","url":"https://postcutoff.com/e/2026-11-15-ai-assisted-results-november-15-listing/","date":"2026-11-15","date_precision":"day","short_title":"AI-assisted results, 15 Nov","deck":null,"takeaway":"arXiv posts no listings at weekends and Hexagon had no new works, so this sweep read the 366 arXiv papers of 7–13 Nov with AI statements that no file cited, line by line in the PDFs, and 59 conjecture papers without a statement. Five got their own entries; 115 with a substantive AI role are listed here. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":9,"official":9,"filed":"2026-11-15","updated":"2026-11-15","orgs":["OpenAI","Anthropic","Google","Axiom Math","various researchers"]}],"people":[{"id":"zeev-dvir","name":"Zeev Dvir","url":"https://postcutoff.com/person/zeev-dvir/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-15","type":"filed","text":"Created (science agent; abstract, introduction, discussion and acknowledgment read in the PDF)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-15","run":null,"sources_read":"Science agent; abstract, introduction, discussion and acknowledgment read in the PDF","updated":"2026-11-15","human_review":null,"version":{"date":"2026-11-15"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":162,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":132,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":223,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":162,"in_training_data":false}],"short_url":"https://postcutoff.com/s/constant-query-lccs-reals-dvir"}