3 papers
cs.CR2026
Provisional Reachability: Containing Agents by Making Every Crossing Revocable
Yoshiaki Takashita
A companion paper found that what a defender must block over time has units: bits per period [Takashita, 2026a]. This paper sets it. Hold every crossing in escrow for one period, a…
cs.CR2026
Reachability, Not Observation: Containing Systems Whose Wiring Changes
Yoshiaki Takashita
Containment decisions -- where to put a firewall, which links to monitor, what a program may reach -- are computed from an observed structure, and observation is a snapshot. We ask…
cs.LG2026
Reaching Every Position Without Searching: Rotating Sparse Wiring on the Hypercube as a Substitute for Attention
Yoshiaki Takashita
Attention pays, at every layer and for every input, the cost of searching for whom to connect. We ask how far one can get with wiring that is fixed, sparse, and simply rotated from…