{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R8",
  "content_hash": null,
  "slug": "ac0123-attempt-direct-ten-million-budget",
  "type": "attempt",
  "title": "Direct ascending search stalls near the thesis hard boundary",
  "summary": "An empty-prefix ascending search spent 10,000,000 candidate tests on a 30,000-letter target and ended with a valid 24,382-letter word.",
  "relevance": "For Additive-cube avoidance on the alphabet zero through three, record ac0123-attempt-direct-ten-million-budget (“Direct ascending search stalls near the thesis hard boundary”) documents a concrete method, search boundary, or failed route. The record states: An empty-prefix ascending search spent 10,000,000 candidate tests on a 30,000-letter target and ended with a valid 24,382-letter word.",
  "relevance_source": "recorded",
  "body": "The failed route kept the priority \\(0,1,2,3\\) throughout and backtracked lexicographically after rejected extensions. It started from the empty word, targeted length 30,000, and stopped exactly at 10,000,000 tested candidate letters. The final retained prefix had length 24,382 and passed a full scan of 99,076,257 candidate factors. Its file digest, including the final line feed, is `c7fdbaa5242a859193ee96fa8a6a767f3be7162e00417a9f0b3a8e6cc4c44a1d`.\n\nThe thesis reports that its direct approach reaches 24,396 quickly and then spends two more hours reaching 24,397. The unavailable original code and possible initial-prefix difference prevent an exact replay comparison. The present run calibrates this reconstruction and lands in the same narrow length range. Raising the candidate cap alone would repeat a poor route. A retry is justified if the original source and initial word are recovered, or if a structural pruning rule changes the search tree.",
  "status": "inconclusive",
  "evidence_grade": "computational",
  "scope": {
    "kind": "bounded",
    "statement": "one deterministic empty-prefix ascending search over {0,1,2,3} under the recorded candidate-test cap",
    "bounds": {
      "target_word_length": {
        "min": 30000,
        "max": 30000
      },
      "tested_letters": {
        "min": 10000000,
        "max": 10000000
      },
      "reached_length": {
        "min": 24382,
        "max": 24382
      }
    },
    "exhaustive": false
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "locator": "Execution of ac0123-artifact-updown-constructor in direct mode on 2026-07-28; comparison with Lietard thesis PDF page 121 (printed page 102)"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": null,
    "locator": "Execution of ac0123-artifact-updown-constructor in direct mode on 2026-07-28; comparison with Lietard thesis PDF page 121 (printed page 102)"
  },
  "relations": [
    {
      "slug": "R5",
      "title": "Deterministic Up-and-Down finite-word constructor",
      "object_type": "artifact",
      "relation": "uses",
      "direction": "outgoing"
    },
    {
      "slug": "R6",
      "title": "Search beyond image length seven with a decision certificate",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "additive-cube-four-term-progression-alphabet",
      "title": "additive cube four term progression alphabet",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}