Powered by OpenAIRE graph
Found an issue? Give us feedback
ZENODOarrow_drop_down
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

Cluster Navigation in Emulation Hierarchies: Multi-Agent Proposal Verification, Joint Lexicographic Grafting, Attention-Energy Budgeting, and a Lower Bound on Coordinated Maneuverability Suppression under Structural Doubt

Authors: DeMase, Joseph;

Cluster Navigation in Emulation Hierarchies: Multi-Agent Proposal Verification, Joint Lexicographic Grafting, Attention-Energy Budgeting, and a Lower Bound on Coordinated Maneuverability Suppression under Structural Doubt

Abstract

This paper extends the capillary navigation engine of DeMase (2026a–d) to multi-agent cluster settings under bounded attention-energy budgets. Multiple high-Γ proposers are jointly verified by a low-Γ pilot maintaining a coherent portfolio of admissible branches. The principal new result (Lemma 4ᶜ) establishes a computable lower bound on stealth portfolio maneuverability collapse under structural doubt. Any coordinated adversary reducing maneuverability from M₀ to M₁ while remaining below the joint threat threshold requires at least k* = ⌈(M₀ − M₁)·δ_res / (N·‖B‖_op·M_adv·B_max)⌉ steps. This yields a proactive rate-based detection statistic (COMMITMENT_ALARM) and formally bounds the Commitment Adversary class for the first time in the series. The extended lexicographic graft rule is proved unique within the admissible cluster class. Simulations verify the non-vacuous detection regime and illustrate correlated geometry collapse as a higher-order attack surface.

Keywords

Adversarial robustness, Control under uncertainty, Lexicographic optimization, Integration capacity (Γ), Commitment Adversary, Structural model mismatch, Multi-agent systems, Bounded rationality, Maneuverability suppression, Velocity Mismatch Criterion (VMC), Distributed control systems, Portfolio maneuverability, Attention-energy budgeting, Detection under adversarial forcing, Cluster navigation, Structural doubt, Capillary verification, Rate-based anomaly detection, Resource-constrained verification

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!