arXiv (All)
open access
Provisional Reachability: Containing Agents by Making Every Crossing Revocable
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, audit each held item independently with probability r, and revoke the window if any audit catches something. An adversary
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Provisional Reachability: Containing Agents by Making Every Crossing Revocable#1006779
- Provably Secure Agent Guardrail#238526
- Legal Probabilism and Anti-Probabilism#97295
- Standing Algebra Σᴿ: A Domain-Agnostic Closure-Theoretic Framework for Admissibility Enforcement Under Structural Invariants#31447
- Fair Division of Graphs: Beyond Traceability#799152
Record · ID 1036345
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive