Problem packetWorkR1104
[#R1104] Current status and unresolved remainder
claim. UNKNOWN: A 2025 computational proof determines \(\mu_5(n)\) through n=16; the 2026-07-31 search found no exact n=17 value. Give a realizable 17-point configuration with m convex five-subsets and a proof or independently checkable SAT or order-type certificate that every realizable configuration has at least m.
1Summary
UNKNOWN: A 2025 computational proof determines \(\mu_5(n)\) through n=16; the 2026-07-31 search found no exact n=17 value.
A complete resolution must satisfy this condition: Give a realizable 17-point configuration with m convex five-subsets and a proof or independently checkable SAT or order-type certificate that every realizable configuration has at least m.
Supported evidence. Replay readiness: source only.
2Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: arxiv.org ↗, See dataset.references[0] for the exact external source and locator.
3How it connects
Addressed by
- attempt
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1104",
"content_hash": null,
"slug": "minimum-convex-pentagons-seventeen-claim-status-20260731",
"type": "claim",
"title": "Current status and unresolved remainder",
"summary": "UNKNOWN: A 2025 computational proof determines \\(\\mu_5(n)\\) through n=16; the 2026-07-31 search found no exact n=17 value. Give a realizable 17-point configuration with m convex five-subsets and a proof or independently checkable SAT or order-type certificate that every realizable configuration has at least m.",
"relevance": "For minimum convex pentagons seventeen, pins the dated research frontier: UNKNOWN: A 2025 computational proof determines \\(\\mu_5(n)\\) through n=16; the 2026-07-31 search found no exact n=17 value. Give a realizable 17-point configuration with m convex five-subsets and a proof or independently checkable SAT or order-type certificate that every realizable configuration has.",
"relevance_source": "recorded",
"body": "UNKNOWN: A 2025 computational proof determines \\(\\mu_5(n)\\) through n=16; the 2026-07-31 search found no exact n=17 value.\n\nA complete resolution must satisfy this condition: Give a realizable 17-point configuration with m convex five-subsets and a proof or independently checkable SAT or order-type certificate that every realizable configuration has at least m.",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://arxiv.org/abs/2311.03645",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://arxiv.org/abs/2311.03645",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"models": [],
"relations": [
{
"slug": "R1103",
"title": "Resolve the stated acceptance condition",
"object_type": "attempt",
"relation": "addresses",
"direction": "incoming"
},
{
"slug": "minimum-convex-pentagons-seventeen",
"title": "minimum convex pentagons seventeen",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- minimum-convex-pentagons-seventeen-source-review
- Locator
- See dataset.references[0] for the exact external source and locator.
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- arxiv.org ↗
- Public record
- R1104
- Stable alias
- minimum-convex-pentagons-seventeen-claim-status-20260731
- 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.