{
  "artifact_schema": "fprd.result-review-certificate.v1",
  "review_date": "2026-09-01",
  "review_units": [
    {
      "title": "starred-word universal left-quotient obstruction",
      "claims": ["FPRD-SH-T03", "FPRD-SH-T06", "FPRD-SH-X02"]
    },
    {
      "title": "starred-word ordinary-quotient dichotomy",
      "claims": ["FPRD-SH-T04", "FPRD-SH-T05", "FPRD-SH-C03"]
    }
  ],
  "mathematical_decisions": [
    {
      "claims": ["FPRD-SH-T04", "FPRD-SH-T05"],
      "decision": "confirmed with proof clarification",
      "detail": "Every position pair is reachable in the asynchronous starred-cycle grid; a mixed pair has two incoming labels, while each syntactically unmarked prefix state is incoming-label homogeneous. The common-letter projection gives exact state, edge, initial, and final images at the unit and general boundaries."
    },
    {
      "claims": ["FPRD-SH-T03", "FPRD-SH-T06", "FPRD-SH-X02"],
      "decision": "confirmed with exceptional-case clarification",
      "detail": "The initial fork forces both boundary successors into q00. Left invariance makes every member of that block share one predecessor-block profile, which cannot realize the target's three predecessor blocks except at (1,1); there initial saturation forces the interior state into q00 although it lacks the initial predecessor."
    }
  ],
  "independent_audit": {
    "checker": "starred_shuffle_independent_review.py",
    "checker_sha256": "b3d4dce88084d04672d4362b4371edc6648e922a68641dbf980c5193d569d20e",
    "output": "independent-output.json",
    "output_sha256": "f9eaf5b0b2f6a669c9e9fec1280f0a211d82783664b5276725db8224c11a5d28",
    "result": "pass",
    "coverage": {
      "ordered_word_pairs": 4923,
      "mixed_label_negative_witnesses": 4878,
      "common_letter_unary_controls": 45,
      "constructive_quotient_parameter_cases": 1024,
      "left_obstruction_parameter_cases": 4096,
      "direct_labelled_maps_tested": 69975,
      "ordinary_quotient_maps_found": 29,
      "left_quotient_maps_found": 0
    },
    "hostile_controls": [
      "the exceptional one-letter-by-one-letter case",
      "asymmetric unit boundaries (1,2), (2,1), (1,3), and (3,1)",
      "the first two-dimensional boundary (2,2)",
      "every mixed versus common-letter word pair over {a,b,c} with total length at most six"
    ]
  },
  "source_artifacts_inspected": [
    "fprd-starred-shuffle-dichotomy-attack-2026-08-31.md",
    "shuffle_attack.py",
    "fprd-starred-shuffle-dichotomy-verification.json",
    "fprd-unary-left-quotient-attack-2026-08-31.md",
    "unary_starred_shuffle_left_quotient.py",
    "fprd-unary-left-quotient-verification.json"
  ],
  "primary_sources": [
    {
      "citation": "Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis, Location based automata for expressions with shuffle and intersection, Information and Computation 295(B) (2023), article 104917",
      "doi": "10.1016/j.ic.2022.104917"
    },
    {
      "citation": "Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, and Rogério Reis, A Mesh of Automata, Information and Computation 265 (2019), 94-111",
      "doi": "10.1016/j.ic.2019.01.003"
    },
    {
      "citation": "Sabine Broda, Eva Maia, Nelma Moreira, and Rogério Reis, The Prefix Automaton, Journal of Automata, Languages and Combinatorics 26(1-2) (2021), 17-53",
      "doi": "10.25596/jalc-2021-017"
    }
  ],
  "maturity_changes": [],
  "unresolved_items": [
    "The classification is restricted to shuffles of two starred nonempty fixed words.",
    "No literature-priority claim is made for either FPRD classification."
  ]
}