Problem detail · source-aware
VibeMathed reports this item as partial. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
For $A=\{0,1,2\}^d$, write $f(d)$ for the fewest proper sub-boxes covering every point exactly twice. Leader, Miličević and Tan asked whether $f(d)\ge 2^d$ for all $d$, as Question 4.1 of the PatternBoost paper. The paper gives new bounds on $f(d)$.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
The author credits large language models used as reasoning engines with producing several of the key ideas, naming the modular refinement of Section 3, the crossing lemma of Section 5 and the constructions of Section 7.
Provider: Anthropic · Prompt public: unknown · Independence: unknown
No independent check. The disclosure is unusually specific about which sections the model produced. Preprint, not refereed.
Correctness: unknown · statement fidelity: unaudited · peer review: none
Improved bounds rather than a settled question: the asked-for inequality is not established in general.
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.