Problem packetWorkR27
[#R27] Audit sources, variants, duplicates, and target integrity
1Summary
The 2026-07-28 audit resolved the canonical target, found no attached research records or duplicate exact targets, and separated the open Z question from known Z^2, unequal-length, approximation, cube, and bounded-alphabet results.
The canonical statement, revision, integrity state, prior-art search, live research graph, and duplicate candidates were read before computation. Exact-title and formulation searches found one TheoremDB target and no attached projects or records. The source audit checked the 2025 status papers, the Rao-Rosenfeld Z^2 construction, the Freedman-Brown four-letter finite maxima, Brown's bounded-error approximation theorem, and Halbeisen-Hungerbuhler's unequal-length equal-sum theorem and final same-length question. Each nearby result has a different quantifier, codomain, or equality condition.
Supported evidence. Recorded scope: canonical-target identity, attached research state, and dated source and duplicate audit completed 2026-07-28.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: arxiv.org ↗, Dated audit performed 2026-07-28 UTC; primary sources and exact locators listed in metadata.sources_checked
3What was measured
- Search date
- 2026-07-28
- Canonical problem id
- tdbc1:076546d01aa904a2986df678a355daeca0bb24363798eea16fc4e5db22263949
- Canonical revision id
- tdbcr1:19d5ac9b685430c3bdfb8e5d9d623313f17f1018d22a53d13d308a3351de50bb
- Canonical statement hash
- 93eeb6dec6e07ee2d967e1a0736fe66192a571701c23cca704e3dfb0133112cb
- Live problem number observed
- 2,824
- Blocking integrity advisory
- no
- Live attached projects
- 0
- Live attached records
- 0
- Variant boundaries
- Rao-Rosenfeld gives a construction over Z^2; the canonical target asks for scalar integer weights., Halbeisen-Hungerbuhler forces adjacent equal sums with possibly unequal lengths; the target requires equal lengths., Brown gives a uniform bounded difference between sums; the target requires exact equality avoidance., Finite maxima for a bounded list of alphabets cannot settle the existential quantifier over all finite alphabets.
Citation audit
4How it connects
Reports
- claim
- claim
- claim
- claim
Recorded for
- problem
5Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R27",
"content_hash": null,
"slug": "asq-attempt-source-and-duplicate-audit",
"type": "attempt",
"title": "Audit sources, variants, duplicates, and target integrity",
"summary": "The 2026-07-28 audit resolved the canonical target, found no attached research records or duplicate exact targets, and separated the open Z question from known Z^2, unequal-length, approximation, cube, and bounded-alphabet results.",
"relevance": "For Infinite additive-square avoidance over a finite integer alphabet, record asq-attempt-source-and-duplicate-audit (“Audit sources, variants, duplicates, and target integrity”) documents a concrete method, search boundary, or failed route. The record states: The 2026-07-28 audit resolved the canonical target, found no attached research records or duplicate exact targets, and separated the open Z question from known Z^2, unequal-length, approximation, cube, and bounded-alphabet results.",
"relevance_source": "recorded",
"body": "The canonical statement, revision, integrity state, prior-art search, live research graph, and duplicate candidates were read before computation. Exact-title and formulation searches found one TheoremDB target and no attached projects or records. The source audit checked the 2025 status papers, the Rao-Rosenfeld Z^2 construction, the Freedman-Brown four-letter finite maxima, Brown's bounded-error approximation theorem, and Halbeisen-Hungerbuhler's unequal-length equal-sum theorem and final same-length question. Each nearby result has a different quantifier, codomain, or equality condition.",
"status": "completed",
"evidence_grade": "sourced",
"scope": {
"kind": "universal",
"statement": "canonical-target identity, attached research state, and dated source and duplicate audit completed 2026-07-28"
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://arxiv.org/abs/2506.21200",
"locator": "Dated audit performed 2026-07-28 UTC; primary sources and exact locators listed in metadata.sources_checked"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://arxiv.org/abs/2506.21200",
"locator": "Dated audit performed 2026-07-28 UTC; primary sources and exact locators listed in metadata.sources_checked"
},
"models": [],
"relations": [
{
"slug": "R32",
"title": "The finite-integer additive-square problem remains open",
"object_type": "claim",
"relation": "reports",
"direction": "outgoing"
},
{
"slug": "R30",
"title": "Any positive construction needs at least four letters",
"object_type": "claim",
"relation": "reports",
"direction": "outgoing"
},
{
"slug": "R29",
"title": "The balanced four-letter family has finite maxima at most 60",
"object_type": "claim",
"relation": "reports",
"direction": "outgoing"
},
{
"slug": "R31",
"title": "A six-letter morphic construction works over Z^2",
"object_type": "claim",
"relation": "reports",
"direction": "outgoing"
},
{
"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
- Dated audit performed 2026-07-28 UTC; primary sources and exact locators listed in metadata.sources_checked
- License
- CC0-1.0
- Source
- arxiv.org ↗
- Public record
- R27
- Stable alias
- asq-attempt-source-and-duplicate-audit
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.