Read the equation
Takes the maximum reliability-weighted match score across pool candidates. The aggregation chooses the best available candidate according to R_k rather than combining independent evidence.
Terms & definitions
The recovered passage does not supply a separate symbol table. Read the source context for the notation used in this version; familiar letters may carry different meanings in other builds.
How it works
Read κ_pool as the quantity being defined or updated by this relation.
Substitute the source-defined variables or recorded values and follow the displayed arithmetic and indexing exactly.
Use this version’s variable definitions and update order. The same symbol may be assigned a different meaning in another build.
Assumptions & limits
Source recovery establishes that the expression appears in this record. Its mathematical validity, implementation behavior, and interpretation must be assessed separately. See the linked source and research notes for the checks available for this version.
Original context
Read the surrounding source passage
MULTI-AGI POOL SHARING (ARCHITECTURE READY) CURRENT: Single AGI instance (AGIState.id = 0) READY FOR: Multiple AGI instances sharing knowledge via pool AGI-0 │ │ AGI-1 │ │ AGI-2 (Physics) │ │ (Biology) │ │ (History) Local state │ │ Local state │ │ Local state 16×5000 │ │ 16×5000 │ │ 16×5000 contribute │ contribute │ contribute ▼ SHARED POOL • Content-addressed by embedding hash • Each item has reliability ρ ∈ [0,1] • Time decay: e^(-λ(t - τ)) Query: κ_pool = max_k R_k(q,t) Where R = similarity × reliability × decay assimilate │ assimilate │ assimilate ▼ ▼ ▼ AGI-0 │ │ AGI-1 │ │ AGI-2 ASSIMILATION BOUND (prevents contamination) β = clamp(0, β_max × (κ_pool - κ_local), β_max) • Pool better than local (κ_pool > κ_local): β > 0, assimilate • Local better than pool (κ_local ≥ κ_pool): β = 0, ignore • Always bounded by β_max: can't be overwhelmed FILE STRUCTURE SEFERIM_AGI_G16/
Exact original notation
κ_pool = max_k R_k(q,t)