The whitepaper positions holonic BRAID as scaling "by reuse, not by raw compute." In practice, how is cache invalidation handled for shared reasoning graphs? If a graph stored as a holon is updated (e.g. improved or corrected), how do agents that have already loaded a copy get notified or invalidated?