v0.1.0 - Ledgered Scientific Availability finite PoC

Initial public proof-of-concept release for cgt-ledgered-scientific-availability.

This release implements a finite Python reference checker for selected-terminal run-to-status transport in Ledgered Scientific Availability. It makes the distinction between terminal proof success, visible report success, and final scientific availability executable on small synthetic cases.

Included:

• capability selection, ordinary replay, terminal control, and terminal spend;
• rows extraction, coordinate-level rows coverage, transport agreement, and BuildStatus;
• finite decision bridge, NonSynth, registry residual, residue mode, projection coherence, and severe evidence tensor checks;
• toy availability, natural-kind availability, and causal-power frontier examples;
• docs for engineers, theory mapping, transport record schema, limitations, walkthroughs, and failure catalog.

This is not a theorem prover and does not implement the full CGT theory. The paper remains the source of truth:
https://doi.org/10.5281/zenodo.20426928