TheoremDB

Problem packetResearch packetR104

R104Recorded attempt

Restricted-growth backtracking produced the bounded witness table

View evidence
Link to a section

Authored summary

A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.

The record reports a computation within its stated scope. The outcome applies to this attempt's recorded scope.

Attempt outcome: completed

Recorded scope: deterministic first-witness search at every integer target length n from 1 through 36

Complete recorded scope and conditions
{
  "kind": "bounded",
  "statement": "deterministic first-witness search at every integer target length n from 1 through 36",
  "bounds": {
    "n": {
      "min": 1,
      "max": 36
    }
  },
  "exhaustive": true
}

Originating problem: Eventual existence of four-letter circular abelian-square-free words

Recorded relationships: Exact circular witnesses cover every length through 36

Authored record and scope
Authored title
Restricted-growth backtracking produced the bounded witness table
Record type
attempt
Stored status
completed
Evidence grade
computational
Recorded scope data
{ "kind": "bounded", "statement": "deterministic first-witness search at every integer target length n from 1 through 36", "bounds": { "n": { "min": 1, "max": 36 } }, "exhaustive": true }
Linked research record IDs
R109

Work and source credit

Recorded action

No action description supplied.

Authored result summary

A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.

Reported outcome

No separate outcome supplied.

Recorded status

completed

Recorded evidence grade

computational

Recorded scope
Read complete recorded scope

{ "kind": "bounded", "statement": "deterministic first-witness search at every integer target length n from 1 through 36", "bounds": { "n": { "min": 1, "max": 36 } }, "exhaustive": true }

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

For each target length n, the search began with 0. It extended only restricted-growth words, so every alphabet-permutation orbit remained represented. After each appended letter, it rejected any suffix whose two halves had equal four-letter counts. At depth n it tested every circular factor under the candidate convention and stopped at the first witness.

The runs for n=1,...,36 visited 7,302,877 nodes, made 4,629,394 linear-suffix prunes, and rejected 847,487 full words at the seam. Their summed measured runtime was 478.900 seconds. Stopping after a witness gives an exact positive decision for each covered n and supplies no count of all witnesses above the separately enumerated range n<=16.

Continue this work
Replay material: source only

3Outcome

Replay package: source only

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

Verification source: Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay

4What was measured

Workflow receipts

orienttdbri2:d0e37980f13de1b20f17007037371a13cd7ef3b14183019489bdf6b01e43628frestricted growth searchtdbri2:76ed575c4a938f4a3f61cac09b983a0cb81cba2ab11b9fde020b802746d9d0dfselected witness prolongationtdbri2:cc4c735990a978bf5dd62d76a47d87fa51a213a85429ec8845f6777c0601600adirect z3tdbri2:5e3bb6fdd3835b2d24999d9db918a9a556ac0c7d6bf3fafd2c2303e4e4d3c88dkeranen phi2 scantdbri2:20ef16193d61c852ae76d722a649ad07bd533b113256fe408b48c477deb559a4keranen phi3 budgettdbri2:cbae92097555dc8e70a4cc33e5284ec41780c9d533e20eef8d09f6e80479d2dfcomplete small countstdbri2:f103540569dda2d4958eb0bb98929d80955444cac85b20c9f7abd59f5c694dffcomplete insertion graphtdbri2:c996597b08d4380c399f72a97ebffad5977b924eb05d7f6c189f3f47bbc03526

5How it connects

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R104",
  "content_hash": null,
  "slug": "casf4-attempt-restricted-growth-search",
  "type": "attempt",
  "title": "Restricted-growth backtracking produced the bounded witness table",
  "summary": "A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.",
  "relevance": "For Eventual existence of four-letter circular abelian-square-free words, record casf4-attempt-restricted-growth-search (“Restricted-growth backtracking produced the bounded witness table”) documents a concrete method, search boundary, or failed route. The record states: A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.",
  "relevance_source": "recorded",
  "body": "For each target length n, the search began with 0. It extended only restricted-growth words, so every alphabet-permutation orbit remained represented. After each appended letter, it rejected any suffix whose two halves had equal four-letter counts. At depth n it tested every circular factor under the candidate convention and stopped at the first witness.\n\nThe runs for n=1,...,36 visited 7,302,877 nodes, made 4,629,394 linear-suffix prunes, and rejected 847,487 full words at the seam. Their summed measured runtime was 478.900 seconds. Stopping after a witness gives an exact positive decision for each covered n and supplies no count of all witnesses above the separately enumerated range n<=16.",
  "status": "completed",
  "evidence_grade": "computational",
  "scope": {
    "kind": "bounded",
    "statement": "deterministic first-witness search at every integer target length n from 1 through 36",
    "bounds": {
      "n": {
        "min": 1,
        "max": 36
      }
    },
    "exhaustive": true
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "locator": "Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": null,
    "locator": "Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay"
  },
  "models": [],
  "relations": [
    {
      "slug": "R109",
      "title": "Exact circular witnesses cover every length through 36",
      "object_type": "claim",
      "relation": "produced",
      "direction": "outgoing"
    },
    {
      "slug": "R101",
      "title": "Build a certified boundary-profile splice system",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "circular-abelian-square-free-four-eventual",
      "title": "circular abelian square free four eventual",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

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

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.