{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1767",
  "content_hash": null,
  "slug": "strong-exponential-time-hypothesis-attempt-dated-source-audit",
  "type": "attempt",
  "title": "Dated source and duplicate audit",
  "summary": "The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Improved algorithms exist for every fixed k, and circuit lower bounds or restricted-model SAT lower bounds give partial evidence. Unresolved remainder: The unrestricted quantified lower bound remains unproved and undisproved.",
  "relevance": "Documents why Strong Exponential Time Hypothesis was treated as a distinct open target on 2026-08-01.",
  "relevance_source": "recorded",
  "body": "The audit ran on 2026-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, 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- Strong Exponential Time Hypothesis open 2026\n- SETH k-SAT base 2 current algorithms\n\nThe exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Improved algorithms exist for every fixed k, and circuit lower bounds or restricted-model SAT lower bounds give partial evidence. Unresolved remainder: The unrestricted quantified lower bound remains unproved and undisproved.",
  "status": "completed",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.1006/jcss.2000.1727",
      "locator": "R. Impagliazzo and R. Paturi, On the complexity of k-SAT, Journal of Computer and System Sciences 62 (2001). definition and consequences"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1006/jcss.2000.1727",
    "locator": "R. Impagliazzo and R. Paturi, On the complexity of k-SAT, Journal of Computer and System Sciences 62 (2001). definition and consequences"
  },
  "relations": [
    {
      "slug": "R1770",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "evidences",
      "direction": "outgoing"
    },
    {
      "slug": "strong-exponential-time-hypothesis",
      "title": "strong exponential time hypothesis",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}