{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R811",
  "content_hash": null,
  "slug": "twnfa-attempt-primary-source-audit-2026-07-28",
  "type": "attempt",
  "title": "Primary-source and duplicate audit through 2026-07-28",
  "summary": "The audit resolved the published TheoremDB target, found no attached research packet or duplicate local target, and retained the question as open after checking the 1978 source, the tight 1986 unary result and erratum, STACS 2026, and the 2026-07-06 liveness revision.",
  "relevance": "For Polynomial determinization of two-way finite automata, record twnfa-attempt-primary-source-audit-2026-07-28 (“Primary-source and duplicate audit through 2026-07-28”) documents a concrete method, search boundary, or failed route. The record states: The audit resolved the published TheoremDB target, found no attached research packet or duplicate local target, and retained the question as open after checking the 1978 source, the tight 1986 unary result and erratum, STACS 2026, and the 2026-07-06 liveness revision.",
  "relevance_source": "recorded",
  "body": "The production target resolved exactly to problem 2832 with stable ID `tdbc1:15d7ea688e5e5a81d7f338c721357dd630ec5546b578a01981bb896e4d9f5909`. Its digest reported an open, published, actionable problem and no attached research records. Repository searches found the matching v6 candidate and no packet with the same `dataset.problem_ref`.\n\nThe source audit read Sakoda and Sipser's 1978 paper, Guillon, Prigioniero, and Taheri's STACS 2026 paper, and Adeogun and Kapoutsis's arXiv v2 dated 2026-07-06. A later-work check also inspected Chrobak's 1986 Theorems 6.2 and 6.3 and paired the article with its 2003 erratum. That check established that the quadratic fixed-alphabet exponent was already known for unary 1NFAs.\n\nTwo arXiv API searches were run: `all:Sakoda AND all:Sipser`, and `all:\"two-way\" AND all:nondeterministic AND all:deterministic AND cat:cs.FL`, both sorted by submission date with up to 100 results. The second query returned 26 records. Its newest relevant determinization paper was the July revision by Adeogun and Kapoutsis. The newer June submission concerned two-dimensional automata and a different problem. Exact-title and phrase searches found no checked primary source claiming a polynomial 2DFA construction or a superpolynomial fixed-alphabet lower bound.\n\nThis is a dated search report. Index coverage and terminology can omit relevant work, so the audit does not prove that no later result exists.",
  "status": "completed",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "family",
    "statement": "the fixed-alphabet 2NFA-to-2DFA determinization target and directly neighboring one-way-liveness results",
    "family": "Sakoda-Sipser determinization and its one-way-liveness complete family"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://arxiv.org/abs/2602.24279",
      "locator": "Adeogun and Kapoutsis, Introduction and Conclusion. Full audit details and exact search digests are recorded in metadata."
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://arxiv.org/abs/2602.24279",
    "locator": "Adeogun and Kapoutsis, Introduction and Conclusion. Full audit details and exact search digests are recorded in metadata."
  },
  "relations": [
    {
      "slug": "R815",
      "title": "The fixed-alphabet determinization question remains open",
      "object_type": "claim",
      "relation": "supports",
      "direction": "outgoing"
    },
    {
      "slug": "two-way-nfa-polynomial-determinization",
      "title": "two way nfa polynomial determinization",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}