Flow-by-Flow:Content-Judgment Bypass for Governing AI Output in High-Loss Domains

[Submitted on 26 Apr 2026 (v1), last revised 12 Aug 2026 (this version, v2)]

View PDF

Abstract:Prior work showed that human-in-the-loop oversight becomes structurally untenable in high-loss domains once AI output velocity V exceeds human cognitive capacity C_max. The operative constraint, however, is V x L, where L is per-item cognitive load: triage, judgment, and response. These components respond asymmetrically to capability improvement. Triage cost does not decline, because semantic indeterminacy is inherent in general-purpose design. Response cost is invariant to accuracy. Only judgment cost faces downward pressure, largely by inducing omission. Capability improvement therefore restructures L rather than reducing it. We prove a proposition: if V x L grows at any positive compound rate while supervisory capacity grows linearly, exceedance occurs in finite time; capacity investment buys time only logarithmically, while reducing the growth rate extends it hyperbolically. Supervision enhancement and flow control are therefore not remedies of the same kind. We propose Flow-by-Flow, a governance design that prices supervisory load without evaluating content, intent, or legitimacy. A cognitive cost score built from formal, countable features imposes compounding costs on volume expansion, and an institutional capacity cap fixes processing within C_max. Four design invariants characterize any admissible exceedance pathway: no content judgment, no scalable consumption of examiner capacity, identity-bound per-application friction, and no batch clearance. Excess claim and page fees in patent systems are precursors satisfying only the first two invariants. One reference implementation satisfying all four is presented. A Monte Carlo analysis across 1,000 parameter draws confirms that the analytically derived ordering survives the 30-year horizon in 90.8% of trials.

Submission history

From: Hiroki Naito [view email]
[v1] Sun, 26 Apr 2026 01:28:32 UTC (1,082 KB)
[v2] Wed, 12 Aug 2026 00:28:18 UTC (1,165 KB)