Anchor Semantic Neighborhood Publication

Mechanism

Each anchor in the adaptive index maintains a description of its reachable semantic neighborhood. This description, the neighborhood publication, is the data structure that the search step of the three-in-one traversal step evaluates against a discovery object's semantic state to produce the candidate transition set. The neighborhood publication is the mechanism by which the adaptive index makes itself traversable without requiring the discovery object or the inference engine to possess prior knowledge of the index's full structure. It is not the content of the anchor's container; it is a description of the semantic territory that container covers and of what is navigable from the current position.

The neighborhood publication is dynamic, policy-scoped, and entropy-sensitive. It is not a static document list, not a fixed catalog of contained objects, and not a precomputed inverted index. It is a continuously evolving description that changes as the anchor's container evolves: as semantic objects are added, removed, or mutated; as sub-anchors are created, split, merged, or migrated; and as the policy context governing the container shifts. The publication exists so that a discovery object arriving at an anchor can determine whether the local territory is relevant to its intent, and which transitions are available, without enumerating or inspecting individual objects and without holding a global map of the index.

Components of the Publication

In accordance with the disclosure, the neighborhood publication comprises at least five components. A semantic content descriptor is a structured summary of the types, domains, and topical characteristics of the semantic objects reachable from the current anchor. It is not an enumeration of individual objects; it is an abstracted description of the semantic territory the container covers, expressed in terms that let the search step judge relevance to the discovery object's intent without inspecting the objects themselves.

A reachability graph is the set of sub-anchors and peer anchors directly navigable from the current anchor, together with the semantic relationship between the current anchor and each reachable anchor. The reachability graph is what lets the search step identify candidate next-transition targets without global knowledge of the index topology. A policy envelope carries the governance constraints that apply to entities traversing the current anchor's container, including access control requirements, content restriction policies, and any additional constraints the anchor imposes on traversal.

A freshness indicator carries the timestamp or epoch of the most recent update to the publication, letting the discovery object assess whether the publication is current. An entropy summary carries a measure of the semantic diversity, update frequency, and information density of the anchor's container, letting the inference engine estimate the information gain available from entering the neighborhood. These five components together let an anchor advertise both what it governs and the terms under which it may be entered.

Requester Scoping

The neighborhood publication is scoped to the requester. Different discovery objects with different policy profiles may receive different neighborhood publications from the same anchor, because the anchor's governance configuration restricts which portions of the neighborhood are visible to which traversal entities. A discovery object with broad access credentials receives a comprehensive neighborhood publication. A discovery object with restricted credentials receives a narrower publication that excludes the semantic neighborhoods its policy profile does not authorize it to access.

This scoping operates through the policy reference field the discovery object carries and the policy envelope the anchor publishes. Because the publication itself is shaped by the requester's authorization before it is ever evaluated for relevance, a discovery object cannot discover, score, or plan a transition into territory it is not permitted to enter. Visibility is governed at the point of publication, not deferred to a later check.

Decentralized Maintenance

The neighborhood publication is maintained by the anchor itself, not by a central authority. Each anchor computes and updates its own publication based on the current state of its container, its sub-anchors, and its governance configuration. This decentralized maintenance keeps the publication consistent with the anchor's actual content and lets updates propagate without coordination with a global index management service.

The anchor recomputes its publication in response to mutation events: when objects are added or removed, when sub-anchors split or merge, when policy configurations change. The updated publication is then made available to discovery objects arriving at the anchor for traversal evaluation. Because each anchor owns the description of its own territory, the structural evolution of the index, including the splitting, merging, and migration operations the anchors perform under load, is reflected in the publications without a separate reconciliation step against any external registry.

Entropy Sensitivity

The entropy sensitivity of the neighborhood publication is a distinguishing feature of the disclosure. The publication does not merely describe what is reachable; it describes the informational character of what is reachable. An anchor governing a container with high entropy, meaning high semantic diversity, rapid mutation, and frequent updates, publishes a neighborhood description that reflects that dynamism, letting discovery objects assess the potential value and risk of entering the neighborhood. An anchor governing a low-entropy container, meaning stable, well-organized, infrequently mutated content, publishes a description that reflects that stability, letting discovery objects assess the reliability and predictability of the neighborhood.

The entropy summary is not cosmetic metadata. It is an input to the inference step. The inference engine uses the entropy characteristics of candidate neighborhoods to inform its scoring and selection among candidate transitions, so that the informational character of a territory, and not only its topical match, shapes which transition the traversal prefers.

Role in the Traversal Step

The neighborhood publication is consumed by the search step, the first phase of the three-in-one traversal step. When a discovery object arrives at an anchor, the anchor evaluates the object's current semantic state, comprising the intent field, the context block, the memory field, and the policy reference field, against the published reachable neighborhood. The search step narrows the full index to the relevant subgraph and emits a candidate transition set, each candidate described by its target anchor or semantic object, the semantic relationship between the current state and the target, and the structural cost of the transition.

Because the search is evaluated only against the local neighborhood the anchor advertises, rather than against the whole corpus, the search step is local, not global. This locality bounds the computational cost of each step and ensures the search space narrows as the traversal descends deeper into the index. The candidate set the search step produces from the publication is then passed to the inference step for scoring and to the execution step for admissibility evaluation, so the neighborhood publication is the entry point through which the anchor's territory becomes a set of governed, evaluable transitions.

Disclosure Scope

The anchor-level semantic neighborhood publication, comprising the dynamic, policy-scoped, entropy-sensitive description of an anchor's reachable territory, its semantic content descriptor, reachability graph, policy envelope, freshness indicator, and entropy summary, its requester-scoped visibility, its decentralized per-anchor maintenance and recomputation on mutation events, and its role as the data structure the search step evaluates against a discovery object's semantic state to produce the candidate transition set, is disclosed in the cognition filing (U.S. Application No. 19/647,395 and its international counterpart) at Section 10.4. This article describes that disclosed mechanism. The scope extends to embodiments in which the publication is realized over different anchor and container representations, provided the description remains dynamic, policy-scoped, entropy-sensitive, and maintained by the anchor governing the territory it describes.