This branch is the constructive counterpart to the no-go package. It asks when exact recoverability can be guaranteed on restricted mixed-information classes and what minimal repair is required when exactness fails.
The strongest results are restricted-family characterization and augmentation statements, including free and constrained completion criteria. These are presented together with explicit failure boundaries, so positive claims and no-go structure remain coupled.
Canonical references are docs/restricted-results/positive-recoverability/positive_class_definitions.md, positive_theorem_candidates.md, positive_no_go_boundaries.md, and positive_recoverability_master_report.md.
Read this branch as a scoped design framework, not a universal positive theory.