Searcharxiv⌕ Search

arXiv subjects

Eduardo Salazar

Publications and source records attributed to Eduardo Salazar.

4 recordsLinked to original sources

Composite-Operator Scaling on Triadic Hypergraphs: Formation Transitions in Multi-Agent Architectures with Three-Body Coupling

We study phase transitions on dynamic triadic hypergraphs, in which a continuous formation field evolves under stochastic Ginzburg--Landau dynamics with a cubic three-body coupling $g_τϕ_iϕ_jϕ_k$, while a discrete opinion variable $s_i\in\{-1,+1\}$ undergoes Kawasaki exchange under a Hamiltonian with pairwise alignment and an irreducible three-body energy $-λ_τ\prod_{a\inτ}s_a$. Near the formation critical point the cubic coupling is subleading and the transition remains continuous, controlled at leading order by a pairwise Ising baseline with renormalized coupling $J_{\rm eff}=J+γw$. The dominant observable is the triadic formation correlator $Ψ_{\rm form}\equiv\langleϕ_iϕ_jϕ_k\rangle$, a $k=3$ composite operator built over the underlying $\mathbb{Z}_2$-symmetric order parameter. Composite-operator scaling yields the effective exponents $β_{\rm TF}=3/2$ and $γ_{\rm TF}=-1$. The susceptibility conjugate to $Ψ_{\rm form}$ vanishes at the critical temperature $T_c$ rather than diverging, in contrast to the divergence characterizing scalar (pairwise) order parameters. The exact partition function of the minimal triad on $\{-1,+1\}^3$ identifies a crossover scale $T^*=4J_{\rm eff}/\ln 3$. A field-theoretic two-point function argument reproduces the same vanishing susceptibility. Restoring the three-body coupling ($λ\neq0$) makes the transition first-order, with a critical endpoint at $λ=0$. The exponent relations $β_{\rm TF}=3β_{\rm Ising}$ and $γ_{\rm TF}=γ_{\rm Ising}-4β_{\rm Ising}$ hold exactly on dense hypergraphs via cluster decomposition, and the vanishing-susceptibility signature persists for $d\geq3$ but fails in $d=2$. A Mori--Zwanzig memory kernel yields a continuously tunable dynamical exponent $z_{\rm TF}$, completing the composite-operator scaling regime.

cond-mat.stat-mech↗

Introducing COGENT3: An AI Architecture for Emergent Cognition

This paper presents COGENT3 (or Collective Growth and Entropy-modulated Triads System), a novel approach for emergent cognition integrating pattern formation networks with group influence dynamics. Contrasting with traditional strategies that rely on predetermined architectures, computational structures emerge dynamically in our framework through agent interactions. This enables a more flexible and adaptive system exhibiting characteristics reminiscent of human cognitive processes. The incorporation of temperature modulation and memory effects in COGENT3 closely integrates statistical mechanics, machine learning, and cognitive science.

cs.AI↗

A Privacy Protocol Using Ephemeral Intermediaries and a Rank-Deficient Matrix Power Function (RDMPF)

This paper presents a private transfer architecture for the Internet Computer (ICP) that decouples deposit and retrieval through two short-lived intermediaries, with sealed storage and attested teardown by an ephemeral witness. The protocol uses a non-interactive RDMPF-based encapsulation to derive per-transfer transport keys. A public notice hint is computed from the capsule to enable discovery without fingerprinting the recipient's key. Retrieval is authorized by a short proof of decapsulation that reveals no identities. All transaction intermediaries are ephemeral and issue certified destruction intents and proofs, allowing a noticeboard to publish auditable finalization records. The design provides sender identity privacy with respect to the recipient, content confidentiality against intermediaries, forward secrecy for transport keys after staged destruction, verifiable liveness and finality. We formalize the basic interfaces, provide the security arguments for encapsulation correctness, hint privacy, authorization soundness and timeout reclaim. In terms of implementation, it has been recently brought into production on the ICP under the name ICPP. It has been subject to exhaustive testing and incorporates a few enhancements, focusing on the operational possibilities offered by ICP's technology. This work hence serves as a broad reference for the protocol now publicly accessible.

cs.CR↗

Design and implementation of a novel cryptographically secure pseudorandom number generator

The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high quality random sequences, that is compact and easy to implement in practice, of portable design and offering reasonable execution times. Our procedure achieves those objectives through the use of a sequence of modular exponentiations followed by the application of Feistel-like boxes that mix up bits using a nonlinear function. The results of extensive statistical tests on sequences of about 2^40 bits in size generated by our algorithm are also presented.

cs.CR↗