TheoremDB

Problem packetWorkR32

R32claimStatus: reportedEvidence: SupportedReplay: source only

[#R32] The finite-integer additive-square problem remains open

claim. The 2026-07-28 audit found neither an infinite additive-square-free word over a finite integer alphabet nor an impossibility proof; the exact finite maximum over \(\{0,1,2,4\}\) is 62, and the infinite existence question remains open.

View evidenceOpen source ↗

1Summary

Vukusic states the discrete question explicitly and calls it open, then proves a Lebesgue-integral analogue. Andrade and Mol, revised in February 2025, also state that the finite integer problem remains unknown and distinguish the known Z^2 construction. Popoli, Shallit, and Stipulanti give the same status in FSTTCS 2024. A dated search on 2026-07-28 checked these papers, the original formulations, exact-title queries, citation indexes, and nearby additive-power work. This record is a dated literature report and makes no claim about sources published after the search.

Supported evidence. Recorded scope: dated literature status of the exact finite-integer additive-square existence question as checked 2026-07-28.

2Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: arxiv.org ↗, Ingrid Vukusic, A Lebesgue variant of the additive square problem, arXiv:2506.21200v1, abstract and opening paragraph; cross-checked against Andrade and Mol, arXiv:2408.15390v2, Introduction, and Popoli, Shallit, and Stipulanti, LIPIcs.FSTTCS.2024.32, Introduction

3What was measured

Search date
2026-07-28
Source revision
arXiv:2506.21200v1
Source submission utc
2025-06-26T12:58:12Z
Source pdf sha256
11a6c32058306acd864f4bd00b8c591671c0731fb44b0e3b6911f8b0daf9fe2f
Source license
CC-BY-4.0
Acceptance condition met
no

4How it connects

Reports (incoming)

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R32",
  "content_hash": null,
  "slug": "asq-claim-open-status-2026",
  "type": "claim",
  "title": "The finite-integer additive-square problem remains open",
  "summary": "The 2026-07-28 audit found neither an infinite additive-square-free word over a finite integer alphabet nor an impossibility proof; the exact finite maximum over \\(\\{0,1,2,4\\}\\) is 62, and the infinite existence question remains open.",
  "relevance": "For Infinite additive-square avoidance over a finite integer alphabet, record asq-claim-open-status-2026 (“The finite-integer additive-square problem remains open”) records a bound, answer, status fact, or structural consequence. The record states: The 2026-07-28 audit found neither an infinite additive-square-free word over a finite integer alphabet nor an impossibility proof; the exact finite maximum over \\(\\{0,1,2,4\\}\\) is 62, and the infinite existence question remains open.",
  "relevance_source": "recorded",
  "body": "Vukusic states the discrete question explicitly and calls it open, then proves a Lebesgue-integral analogue. Andrade and Mol, revised in February 2025, also state that the finite integer problem remains unknown and distinguish the known Z^2 construction. Popoli, Shallit, and Stipulanti give the same status in FSTTCS 2024. A dated search on 2026-07-28 checked these papers, the original formulations, exact-title queries, citation indexes, and nearby additive-power work. This record is a dated literature report and makes no claim about sources published after the search.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "universal",
    "statement": "dated literature status of the exact finite-integer additive-square existence question as checked 2026-07-28"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://arxiv.org/abs/2506.21200v1",
      "locator": "Ingrid Vukusic, A Lebesgue variant of the additive square problem, arXiv:2506.21200v1, abstract and opening paragraph; cross-checked against Andrade and Mol, arXiv:2408.15390v2, Introduction, and Popoli, Shallit, and Stipulanti, LIPIcs.FSTTCS.2024.32, Introduction"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://arxiv.org/abs/2506.21200v1",
    "locator": "Ingrid Vukusic, A Lebesgue variant of the additive square problem, arXiv:2506.21200v1, abstract and opening paragraph; cross-checked against Andrade and Mol, arXiv:2408.15390v2, Introduction, and Popoli, Shallit, and Stipulanti, LIPIcs.FSTTCS.2024.32, Introduction"
  },
  "models": [],
  "relations": [
    {
      "slug": "R27",
      "title": "Audit sources, variants, duplicates, and target integrity",
      "object_type": "attempt",
      "relation": "reports",
      "direction": "incoming"
    },
    {
      "slug": "additive-square-finite-alphabet",
      "title": "additive square finite alphabet",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
additive-square-finite-alphabet-research
Locator
Ingrid Vukusic, A Lebesgue variant of the additive square problem, arXiv:2506.21200v1, abstract and opening paragraph; cross-checked against Andrade and Mol, arXiv:2408.15390v2, Introduction, and Popoli, Shallit, and Stipulanti, LIPIcs.FSTTCS.2024.32, Introduction
License
CC0-1.0
Contributors
Ingrid Vukusic
Public record
R32
Stable alias
asq-claim-open-status-2026
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.