[#R1645] Strongest checked neighboring result
claim. The conjectured bound holds for commuting matrices and for matrices of rank at most \(n/\log^3 n\); general concentration gives an extra \(\sqrt{\log n}\) factor.
1Summary
This leaves the following boundary unresolved: Remove the logarithmic loss without rank or commutativity hypotheses. The distinction is retained here so a restricted theorem, finite computation, or neighboring case is not presented as a solution of the full target.
Supported evidence. Replay readiness: source only.
2Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, Afonso S. Bandeira, Anastasia Kireeva, Antoine Maillard, and Almut Rödder, “Randomstrasse101: Open Problems of 2024,” arXiv:2504.20539, version dated 22 March 2026. Conjecture 1 and 2026 update record
3What was measured
- As of
- 2026-08-01
4How it connects
Informs
- 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": "R1645",
"content_hash": null,
"slug": "matrix-spencer-discrepancy-claim-literature-frontier",
"type": "claim",
"title": "Strongest checked neighboring result",
"summary": "The conjectured bound holds for commuting matrices and for matrices of rank at most \\(n/\\log^3 n\\); general concentration gives an extra \\(\\sqrt{\\log n}\\) factor.",
"relevance": "Locates the present research frontier immediately below Matrix Spencer discrepancy conjecture.",
"relevance_source": "recorded",
"body": "The conjectured bound holds for commuting matrices and for matrices of rank at most \\(n/\\log^3 n\\); general concentration gives an extra \\(\\sqrt{\\log n}\\) factor.\n\nThis leaves the following boundary unresolved: Remove the logarithmic loss without rank or commutativity hypotheses. The distinction is retained here so a restricted theorem, finite computation, or neighboring case is not presented as a solution of the full target.",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://doi.org/10.48550/arXiv.2504.20539",
"locator": "Afonso S. Bandeira, Anastasia Kireeva, Antoine Maillard, and Almut Rödder, “Randomstrasse101: Open Problems of 2024,” arXiv:2504.20539, version dated 22 March 2026. Conjecture 1 and 2026 update record"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.48550/arXiv.2504.20539",
"locator": "Afonso S. Bandeira, Anastasia Kireeva, Antoine Maillard, and Almut Rödder, “Randomstrasse101: Open Problems of 2024,” arXiv:2504.20539, version dated 22 March 2026. Conjecture 1 and 2026 update record"
},
"relations": [
{
"slug": "R1646",
"title": "Current status and exact unresolved remainder",
"object_type": "claim",
"relation": "informs",
"direction": "outgoing"
},
{
"slug": "matrix-spencer-discrepancy",
"title": "matrix spencer discrepancy",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
- Project
- matrix-spencer-discrepancy-release-300-source-review
- Locator
- Afonso S. Bandeira, Anastasia Kireeva, Antoine Maillard, and Almut Rödder, “Randomstrasse101: Open Problems of 2024,” arXiv:2504.20539, version dated 22 March 2026. Conjecture 1 and 2026 update record
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- doi.org ↗
- Public record
- R1645
- Stable alias
- matrix-spencer-discrepancy-claim-literature-frontier
- 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.