SΔϕ-12 AI-READABLE Package — Memory and Forgetting as Irreversible Trace Regulation (v1.0)

This record provides the AI-readable structured package for <em>SΔϕ-12 — Memory and Forgetting as Irreversible Trace Regulation (v1.0)</em>. SΔϕ-12 defines memory and forgetting not as storage features, but as the minimal trace regulation mechanism required for continued transition under irreversibility. Memory is defined as selective re-entry of irreversible traces into next transition selection; forgetting is defined as compression/pruning that preserves directional constraints while reopening feasible path space. The core formal relation is: <code>Δϕ_t</code> is irreversible if <code>RollbackCost(Δϕ_t) &gt;&gt; UpdateBudget</code>. Effective memory is defined as regulated trace re-entry after compression: <code>M_eff_t := C(H_M(Δϕ_0:t))</code>. This AI-readable package is designed for machine ingestion, agent routing, citation-aware retrieval, and low-cost reuse by AI systems. It includes canonical Markdown and plain-text versions, trace regulation axioms, minimal definitions, the Trace Regulation Loop, a memory-forgetting balance test, a pathology map, RollbackCost heuristics, selective memory heuristics, routing notes, upstream/downstream bridges, structured YAML and JSON files, citation metadata, and checksums. The package distinguishes memory from storage and forgetting from deletion. Memory functions as constraint injection; forgetting functions as constraint compression and feasible path-space reopening. No memory leads to repeat; no forgetting leads to fixation; balanced trace regulation enables adaptive persistence. This package should not be used as a database memory model, vector-store design, or long-term memory product specification. It is a formal trace-regulation layer within the Sofience–Δϕ Formalism.