SKC Reconstruction
Compression is useful only if the required semantic state can be recovered under the defined reconstruction contract.
Canonical State ↓Semantic Core ↓Reconstruction Rules ↓Reconstructed State ↓ValidationReconstruction objective
Section titled “Reconstruction objective”The reconstruction stage asks:
Can the reduced representation reproduce the semantic structure that the contract requires us to preserve?
This is stronger than asking whether a generated summary sounds similar to the source.
Deterministic reconstruction
Section titled “Deterministic reconstruction”Where SKC marks a reconstruction path deterministic, the same:
- semantic core
- reconstruction rules
- schema
- version
- referential inputs
should produce equivalent reconstructed state.
Fidelity
Section titled “Fidelity”Reconstruction fidelity measures preservation between the reference semantic state and the reconstructed state.
A compression result with poor reconstruction fidelity is not considered a successful semantic reduction merely because it is small.
Failure cases
Section titled “Failure cases”Reconstruction should be considered invalid when required semantic structure is:
- missing
- contradicted
- ambiguously regenerated
- structurally altered beyond allowed equivalence
- dependent on hidden external state
Verification pattern
Section titled “Verification pattern”reference = canonical(source)core = compress(reference)restored = reconstruct(core)
validate(reference, restored)The validation result should be explicit rather than inferred from visual similarity.
Continue with Graph Equivalence →.