From Directional Survival Volume to Anticipatory Network Viability: The BDHC-BSAC-BALC Mathematical Program and BALC-NET 001-007

This record releases the complete pre-canonical research handoff for the BDHC-BSAC-BALC mathematical program developed within Boundary Information Theory (BIT), together with the BALC-NET 001-007 network extension and its external-audit package. The program progresses from local directional conflict and capacity overload (BDHC), to a spacetime action lower bound and survival corridor (BSAC), to an asymmetric anticipation-lag envelope for rate-limited support (BALC). BALC-NET then extends these ideas to finite directed networks, coupled actuation budgets, positive transit times, multicommodity flows, time-expanded formulations, dual shortfall certificates, internal held-out replication, and multi-topology cross-formulation checks. The archive preserves analytic claims with explicit assumptions, randomized/property checks, LP cross-checks, benchmark artifacts, counterexamples, failed substitutions, claim boundaries, source ledgers, manifests, and reproducibility commands. The terminal NET-007 package freezes an external-audit protocol and the exact candidate archive hashes. External independent verification has not yet been performed. Status: analytic core established with scope; internal reproducibility checks passed in the declared model classes; core prior-art overlap acknowledged; exact synthesis novelty unverified; world/physical anchoring not established; external continuation open. This release does not claim a universally new theorem recognized by the mathematical community, a physical law, a validated galaxy model, production readiness, or independent verification. It is published so that other researchers may inspect, reproduce, falsify, formalize, generalize, or continue the open questions. The release contains the following research lineage: 1. BIT-BDHC v1.0 — Boundary Direction-History Compression Calculus.2. BIT-BSAC v1.0 — Boundary Spacetime Action Calculus.3. BIT-BALC v1.0 — Boundary Anticipation-Lag Calculus.4. BIT-BALC-NET-001 — Network Cut Anticipation and Viability Margin Calculus.5. BIT-BALC-NET-002 — Coupled Actuation and Time-Indexed Cut Debt.6. BIT-BALC-NET-003 — Boundary audit for edge caps, positive transit time, and multicommodity coupling.7. BIT-BALC-NET-004 — Joint Time-Expanded Actuation LP and Dual Shortfall Certificates.8. BIT-BALC-NET-005 — Internal held-out replication.9. BIT-BALC-NET-006 — Multi-topology cross-formulation audit.10. BIT-BALC-NET-007 — Expanded external-audit handoff. The archive deliberately preserves negative knowledge: global coherence cannot replace local coherence; memory is not universally beneficial; independent per-cut anticipation fails under shared actuation budgets; snapshot min-cut tests fail under positive transit time and deadlines; and separate per-commodity feasibility does not imply joint multicommodity feasibility. Open continuation routes include independent audit, proof-assistant formalization, prior-art review, dual interpretation, integral and unsplittable flows, nonlinear latency, stochastic demand, dynamic topology, continuum limits, stability theory, causal online control, inverse problems, typed physical adapters, and pre-registered empirical falsification. Notes AI-assisted mathematical development, computational checking, and editorial preparation. The human author retains responsibility for the research claims and publication decision. External independent audit remains open. NET-007 must not be marked as independently verified unless a separate reviewer supplies an independently frozen test suite, checker, execution artifacts, and a completed audit receipt. Proof, finite computation, independent checking, novelty review, and physical/world validation are maintained as separate evidence axes. The related source-ontology record is contextual only and is not evidence for the mathematical claims in this release.