A finite sheaf-theoretic framework ranks obstruction measures to identify when an AI agent's theory must deform within its language or extend to a new one, validated on a controlled transition benchmark.
A sheaf-theoretic characterization of tasks in distributed systems
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Colorless tasks are solvable against a compact adversary iff there exists a spectral map from the projective limit of protocol states to the output space compatible with the task specification.
Proposes a multi-layered sheaf-theoretic semantics for SCEL that equates system processes to sheaf gluing and failures to topological obstructions.
citing papers explorer
-
Sheaf-Theoretic Transport and Obstruction for Detecting Scientific Theory Shift in AI Agents
A finite sheaf-theoretic framework ranks obstruction measures to identify when an AI agent's theory must deform within its language or extend to a new one, validated on a controlled transition benchmark.
-
Stone Duality Proofs for Colorless Distributed Computability Theorems
Colorless tasks are solvable against a compact adversary iff there exists a spectral map from the projective limit of protocol states to the output space compatible with the task specification.
-
A Categorial and Sheaf-Theoretic Semantics for Autonomic Component Ensembles
Proposes a multi-layered sheaf-theoretic semantics for SCEL that equates system processes to sheaf gluing and failures to topological obstructions.