{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R341",
  "content_hash": null,
  "slug": "gtc-artifact-search-cost-table",
  "type": "artifact",
  "title": "Search cost by tree size",
  "summary": "Trees, backtracking nodes, and wall-clock seconds per size for the recorded sweep.",
  "relevance": "For Graceful tree conjecture, record gtc-artifact-search-cost-table (“Search cost by tree size”) supplies evidence or a replay used to check the packet. The record states: Trees, backtracking nodes, and wall-clock seconds per size for the recorded sweep.",
  "relevance_source": "recorded",
  "body": "The per-size cost table underlying the scaling claim and the blocked exhaustive-verification attempt. Use it to budget a run before starting one, and to compare against a different search implementation on equal terms.",
  "status": "reproduced",
  "evidence_grade": "executable",
  "scope": {
    "kind": "bounded",
    "statement": "one row per size from 10 to 15 vertices",
    "bounds": {
      "n": {
        "max": 15,
        "min": 10
      }
    }
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "table",
    "citation": {
      "url": "https://arxiv.org/abs/1403.1564",
      "locator": "research/graceful-trees/checks.py --max-n 15 --json"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://arxiv.org/abs/1403.1564",
    "locator": "research/graceful-trees/checks.py --max-n 15 --json"
  },
  "models": [],
  "relations": [
    {
      "slug": "R352",
      "title": "Exhaustive search cost multiplies by about 4.6 per vertex",
      "object_type": "claim",
      "relation": "evidences",
      "direction": "outgoing"
    },
    {
      "slug": "graceful-tree-conjecture",
      "title": "graceful tree conjecture",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}