TheoremDB
R1380attemptStatus: completedEvidence: SupportedReplay: source only

[#R1380] Dated source and duplicate audit

View evidenceOpen source ↗

1Summary

The exact formulation, named variants, 2025–2026 updates, and repository-wide semantic duplicates were checked on 2026-08-01. The source collection still marks the stated remainder open. Living-database status remains subject to later literature not indexed there.

The audit ran on 2026-08-01 across source collection and its cited primary literature, Crossref/arXiv or MathSciNet stable records, TheoremDB published, prospecting, formal-conjecture, packet, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.

Queries included: - "Lyapin notebook" "Problem 2.5" - "Minimum avoiding alphabet for every avoidable word" - site:arxiv.org semigroup "avoidable word" open problem

Supported evidence. Replay readiness: source only.

2Outcome

Evidence package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, S. Bershadsky, S. Kublanovsky, and G. Mashevitzky, “The Lyapin’s notebook: a collection of unsolved problems in Semigroup Theory,” arXiv:2604.04763 (2026). Problem 2.5 and its immediately following status paragraph

3Overview

The exact formulation, named variants, 2025–2026 updates, and repository-wide semantic duplicates were checked on 2026-08-01. The source collection still marks the stated remainder open. Living-database status remains subject to later literature not indexed there.

4How it connects

Evidence for

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1380",
  "content_hash": null,
  "slug": "avoidable-word-minimum-alphabet-attempt-dated-source-audit",
  "type": "attempt",
  "title": "Dated source and duplicate audit",
  "summary": "The exact formulation, named variants, 2025–2026 updates, and repository-wide semantic duplicates were checked on 2026-08-01. The source collection still marks the stated remainder open. Living-database status remains subject to later literature not indexed there.",
  "relevance": "Documents why Minimum avoiding alphabet for every avoidable word was treated as a distinct open target on 2026-08-01.",
  "relevance_source": "recorded",
  "body": "The audit ran on 2026-08-01 across source collection and its cited primary literature, Crossref/arXiv or MathSciNet stable records, TheoremDB published, prospecting, formal-conjecture, packet, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.\n\nQueries included:\n- \"Lyapin notebook\" \"Problem 2.5\"\n- \"Minimum avoiding alphabet for every avoidable word\"\n- site:arxiv.org semigroup \"avoidable word\" open problem\n\nThe exact formulation, named variants, 2025–2026 updates, and repository-wide semantic duplicates were checked on 2026-08-01. The source collection still marks the stated remainder open. Living-database status remains subject to later literature not indexed there.",
  "status": "completed",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.48550/arXiv.2604.04763",
      "locator": "S. Bershadsky, S. Kublanovsky, and G. Mashevitzky, “The Lyapin’s notebook: a collection of unsolved problems in Semigroup Theory,” arXiv:2604.04763 (2026). Problem 2.5 and its immediately following status paragraph"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.48550/arXiv.2604.04763",
    "locator": "S. Bershadsky, S. Kublanovsky, and G. Mashevitzky, “The Lyapin’s notebook: a collection of unsolved problems in Semigroup Theory,” arXiv:2604.04763 (2026). Problem 2.5 and its immediately following status paragraph"
  },
  "relations": [
    {
      "slug": "R1383",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "evidences",
      "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
Project
avoidable-word-minimum-alphabet-release-300-source-review
Locator
S. Bershadsky, S. Kublanovsky, and G. Mashevitzky, “The Lyapin’s notebook: a collection of unsolved problems in Semigroup Theory,” arXiv:2604.04763 (2026). Problem 2.5 and its immediately following status paragraph
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1380
Stable alias
avoidable-word-minimum-alphabet-attempt-dated-source-audit
Projection
Reproduction fields are derived from the immutable record.

A route someone took, recorded so the next person can reuse it or avoid it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.