For n≥7 and r between consecutive thresholds r_k(n) and r_(k−1)(n), the k-isolated cut C_k is globally maximum.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For n≥7 and r between consecutive thresholds r_k(n) and r_(k−1)(n), the k-isolated cut C_k is globally maximum. Open residue: Exhaustive through n=21; near-isolated checks through n=100.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 5/5
All 2^(n−1) cuts were exhausted through n=21 and local verification reaches n=100; the objective is exact and parameterized.
- finite witness
- 4/5
- oracle cost
- 4/5
- freshness
- 5/5
- seedability
- 5/5
Verification note
Enumerate cuts or solve parametric MILPs, deriving the exact upper envelope of cut-weight polynomials. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.