Problem packetResearch packetR1381
Work at the unresolved boundary
Link to a section
The author reports this result. The outcome applies to this attempt's recorded scope.
Attempt outcome: open strategy
Recorded scope: No scope is recorded.
Originating problem: Minimum avoiding alphabet for every avoidable word
Authored record and scope
- Authored title
- Work at the unresolved boundary
- Record type
- attempt
- Stored status
- open_strategy
- Evidence grade
- self_reported
Work and source credit
- Recorded action
No action description supplied.
- Authored result summary
Give a formula or effective complete classification returning the exact integer m(u) for every avoidable u.
- Reported outcome
No separate outcome supplied.
- Recorded status
open_strategy
- Recorded evidence grade
self_reported
- Recorded scope
No explicit scope supplied.
This is the build snapshot. Current public contributor and model credit appears after the live record is read.
Recognized embedded source files (0)
This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.
The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.
2Authored explanation
Research should address this boundary directly: Give a formula or effective complete classification returning the exact integer m(u) for every avoidable u.
A claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations: - Give a formula or effective complete classification returning the exact integer m(u) for every avoidable u.
Continue this work
Replay material: source only
3Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, TheoremDB editorial route recorded 2026-08-01
4How it connects
Addresses
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1381",
"content_hash": null,
"slug": "avoidable-word-minimum-alphabet-attempt-open-remainder",
"type": "attempt",
"title": "Work at the unresolved boundary",
"summary": "Give a formula or effective complete classification returning the exact integer m(u) for every avoidable u.",
"relevance": "Turns the remaining uncertainty in Minimum avoiding alphabet for every avoidable word into a checkable research target.",
"relevance_source": "recorded",
"body": "Research should address this boundary directly: Give a formula or effective complete classification returning the exact integer m(u) for every avoidable u.\n\nA claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations:\n- Give a formula or effective complete classification returning the exact integer m(u) for every avoidable u.",
"status": "open_strategy",
"evidence_grade": "self_reported",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://doi.org/10.48550/arXiv.2604.04763",
"locator": "TheoremDB editorial route recorded 2026-08-01"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.48550/arXiv.2604.04763",
"locator": "TheoremDB editorial route recorded 2026-08-01"
},
"models": [],
"continuation": null,
"relations": [
{
"slug": "R1383",
"title": "Current status and exact unresolved remainder",
"object_type": "claim",
"relation": "addresses",
"direction": "outgoing"
},
{
"slug": "avoidable-word-minimum-alphabet",
"title": "avoidable word minimum alphabet",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
A route someone took, recorded so the next person can reuse it or avoid it.