arXiv:2607.16275v1 Announce Type: cross
Abstract: Classical supply chain risk models treat node failures as statistically independent events, systematically underestimating correlated cascade failures across multi-tier supplier networks. We present QR-SPPS (Quantum-Native Retail Shock Propagation and Policy Stress Simulator), a quantum-native framework for retail supply chain risk analysis implemented on the Qiskit ecosystem using OpenFermion-based Ising Hamiltonian encoding. A 40-node, four-tier supply network is mapped to a 40-qubit Hamiltonian with ZZ coupling terms representing correlated supplier dependencies. A hardware-efficient Variational Quantum Eigensolver (VQE) computes the stress ground state, revealing entangled cascade failures that differ substantially from classical Monte Carlo predictions. We further introduce the application of ADAPT-VQE gradient screening for counterfactual policy evaluation, enabling real-time ranking of six crisis interventions without repeated variational optimization. Finally, Density-of-States Quantum Phase Estimation (DOS-QPE) reconstructs the eigenspectrum through Trotter evolution and estimates Boltzmann-weighted catastrophe probabilities as a function of market-volatility temperature, providing a quantum-native tail-risk metric compatible with Value-at-Risk analysis. The framework demonstrates scalable quantum algorithms for correlated supply chain stress propagation, policy optimization, and systemic risk quantification while highlighting the exponential computational barriers faced by classical simulation at industrial-scale problem sizes.
Science Journals
arXiv:2607.16276v1 Announce Type: cross
Abstract: Quantum-repeater networks require adaptive control policies that balance entanglement generation rate, end-to-end fidelity, purification overhead, and memory-induced latency. This tradeoff becomes more complex when the classical control plane is degraded by cyber anomalies or denial-of-service traffic. We develop a CUDA-Q/SeQUeNCe co-simulation workflow for studying adaptive entanglement purification in heterogeneous linear repeater chains. CUDA-Q noisy quantum kernels are used to estimate primitive entanglement purification and swapping behavior, while SeQUeNCe provides an event-layer model for stochastic link generation, waiting-time-dependent memory decay, purification failure, and end-to-end swapping. Under stationary conditions, we compare no purification, local threshold purification, mean-field predictive purification, fixed purification, and a resource-penalized risk-aware predictive policy. In an 8-node chain, the resource-penalized risk-aware controller increases above-target delivery probability relative to fixed purification while reducing latency and purification overhead. We then couple the quantum-network controller to anomaly scores derived from the CSE-CIC-IDS2018 benign-to-SSDP intrusion-detection trace. During the attack period, the attack-unaware controller maintains high raw delivery, but its above-target entanglement delivery falls to 0.098+/-0.007; the IDS-aware resource-adaptive controller switches to more purification-heavy masks and increases above-target delivery to 0.344+/-0.011, closely matching the oracle-aware value of approximately 0.335. These results demonstrate that cyber-state awareness can improve useful quantum-network outcomes by trading raw throughput for fidelity-qualified entanglement delivery.
arXiv:2607.16296v1 Announce Type: cross
Abstract: Continuous EEG monitoring for epilepsy is constrained by the limited power and memory budgets of wearable and implantable devices. Deep neural networks can detect seizures with high accuracy, but their computational cost and model size make them difficult to deploy on such platforms. In this work we use a single 1D CNN seizure detector on the CHB-MIT scalp EEG dataset as a common baseline, and then investigate three brain-inspired efficiency strategies: (i) conversion of the CNN into a spiking neural network (SNN) via parameter transfer, (ii) EEG channel pruning combined with 2:4 structured weight sparsity, and (iii) INT8 quantization using FX- and ONNX-based workflows, including quantization-aware training and operator fusion. The quantized CNN variants reduce stored model size from 1.63 MB to 0.44 MB, lower estimated energy per inference by up to 64%, and achieve as much as 2.8 times speedup in CPU latency while preserving, and in one case slightly improving, AUC. The pruned CNN halves the number of input channels and non-zero weights with only a modest accuracy drop, and the SNN conversion provides a spiking implementation with sparse temporal activity. Together, these experiments characterize three complementary efficiency directions for seizure detection.
arXiv:2607.16306v1 Announce Type: cross
Abstract: Hybrid beamforming (HB) with quality-of-service (QoS) provisioning per stream in millimeter waves is indispensable in 5G/6G networks. HB includes baseband and radio frequency (RF) beamforming, and requires error-free channel state information (CSI), which is erroneous in practice. So there is a need for efficient, feasible, robust, and QoS-aware HB. To achieve this, we mitigate CSI uncertainty via baseband beamforming, and we steer the RF beamformer by using the estimates of the channel's eigenvectors. In doing so, we consider the effective channel's uncertainty region instead of the uncertainty region of the channel itself, as the former is smaller than the latter, requiring less transmit power to satisfy the QoS constraint. We also detect and eliminate the infeasible data streams. Our iterative scheme (which is based on the cutting-set method) for baseband beamforming satisfies the mean-squared error (MSE) constraint per stream, where a limited number of constraints are considered instead of infinitely many constraints. In our low-complexity scheme, we derive a simple sufficient condition to check the feasibility of each stream, we diagonalize the effective channel at the baseband precoder, and we use minimum MSE combining at the baseband combiner. Extensive simulations validate our formulations and theoretical derivations.
arXiv:2607.16350v1 Announce Type: cross
Abstract: Sensor-based human activity recognition (HAR) has achieved significant progressed in fully supervised learning settings. However, these supervised learning models rely on large amount of labeled data, which require labor-intensive collection and meticulous annotation. To address these challenges, this paper proposes a Joint Embedding Predictive Architecture framework tailored for sensor-based HAR, designed to learn robust and generalizable representations from unlabeled datasets. The proposed framework features an encoder designed to explicitly model both the fine-grained local temporal representations within individual window and the long-term temporal sequence of adjacent windows. Furthermore, we introduce an improved Variance-Invariance-Covariance Regularization (VICReg) objective function that incorporates computationally lightweight norm term to stabilize the JEPA pre-training phase. This term balances variance, invariance and covariance constraints to prevent representation collapse. The proposed HAR-JEPA framework is evaluated using two benchmark continuously performed activity datasets. The results show that high-quality representations are successfully learned by the proposed framework. Furthermore, the representations learned by HAR-JEPA demonstrates superior generalization on minority, high variance transitional activities such as sit-to-stand and sit-to-lie where supervised learning tend to overfit due to limited support.
arXiv:2607.16363v1 Announce Type: cross
Abstract: A large body of Semi-supervised Learning~(SSL) algorithms encounter the threshold $\tau$ to select pseudo-labels. The value of $\tau$ across different SSL algorithms can vary depending on the learning perspective, yet they may achieve similar performance. It motivates us to establish a unified theoretical framework to explain the role of $\tau$ in SSL. We statistically explained that the unsupervised loss is affected independently by correct and incorrect pseudo-labels, while $\tau$ adjusts their numbers to balance the corresponding error term. This inherent trade-off indicates that SSL can reach the same loss with varying $\tau$, precise optimal values of $\tau$ during training may be unnecessary. With this, we treat $\tau$ as an updatable parameter and optimize it via differentiation; the new policy is named \textbf{Meta-Thresholding Semi-Supervised Learning (MTSSL)}. Extensive experiments demonstrate the superior performance of MTSSL. We observe that the accuracy curves of SSL algorithms can overlap completely even when the values of $\tau$ differ significantly, which supports our theoretical framework and indicates that the selection of $\tau$ can be relaxed in the future design of SSL algorithms.
arXiv:2607.16377v1 Announce Type: cross
Abstract: The magnitude of a metric space constitutes an expressive invariant that subsumes numerous different geometrical-topological invariants. Building on recent advances in magnitude homology, i.e., a bigraded homology theory that recovers the magnitude, we develop a novel local measure of the centrality or importance of nodes in a graph. Our measure is inspired by the concept of relative homology as it considers the change in magnitude homology when removing a vertex. We show that our proposed measure satisfies several properties a centrality measure is reasonably expected to respect and demonstrate that we introduce a new perspective on centrality by comparing to several established centrality measures.
arXiv:2607.18108v1 Announce Type: new
Abstract: While modern vehicle security depends on effective Cyber Threat Intelligence (CTI) synthesis, current automated tools struggle with unstructured data and automotive-specific architectural nuances. To bridge this gap, we introduce GARAGE, a RAG-powered framework that converts fragmented CTI into an actionable, domain-specific knowledge base for automated attack graph generation. GARAGE synthesizes a dataset of 12,786 CVEs and 140 incident reports into a STIX 2.1 and Auto-ISAC ATM-compliant knowledge base. By formalizing tactical-pattern-level scenarios through granular kill chain analysis, GARAGE achieves threat generation capabilities. Our 320 Leave-One-Out experiments reveal that the framework can accurately transfer security knowledge to entirely unseen vehicle architectures. Furthermore, we position GARAGE as a scalable TARA support tool within human-in-the-loop workflows, offering a comprehensive cost-performance analysis to guide its deployment across various LLM tiers.
arXiv:2607.16410v1 Announce Type: cross
Abstract: The EWF-(FCI,SQD) method, a wave-function-based embedding approach combining full configuration interaction (FCI) and sample-based quantum diagonalization (SQD), is a promising new tool for the simulation of molecular systems. However, applications of EWF-(FCI,SQD) have so far been limited to single-point calculations, whereas the study of complex chemical processes requires the ability to explore potential energy surfaces. In this work, we demonstrate geometry optimization with EWF-(FCI,SQD), scaling our simulations to molecules as large as menthone and benzidine within the STO-3G basis set. Without fragmentation, these systems comprise 73 and 82 molecular orbitals respectively, presenting an intractable Hilbert space for conventional exact or high-level subspace solvers and establishing a clear necessity for fragmentation-based methodologies. The underlying fragment SQD simulations in the EWF-(FCI,SQD) geometry optimizations use up to 70 qubits. The resulting geometries show exceptional accuracy relative to the classical reference, with deviations below 4 picometers.
arXiv:2607.16424v1 Announce Type: cross
Abstract: Let $G=(V,E)$ be a finite simple graph of order $n\geq 1$, and let $\ell:V\to\{0,1\}$ be a prescribed parity labeling. A set $S\subseteq V$ is called $\ell$-admissible if $d_S(v)\equiv \ell(v)\pmod 2$ for every $v\in S$, where $d_S(v)=|N_G(v)\cap S|$. Let $h_\ell(G)$ be the maximum order of an $\ell$-admissible set and let $f_{\rm oe}(G)=\min_\ell h_\ell(G)$. For $x\in\mathbb R$, define the weighted counting polynomial $$
M_{\ell,x}(G)=\sum_{S\in {\cal A}_\ell(G)}x^{|S|}, $$ where ${\cal A}_\ell(G)$ is the collection of all $\ell$-admissible sets in $G$. For $R\subseteq V$, let $z_\ell(R)$ be the number of vertices $v\in V\setminus R$ for which $d_R(v)\equiv\ell(v)\pmod 2$. We prove the exact identity $$
M_{\ell,x}(G)
=2^{-n}\sum_{R\subseteq V}
x^{|R|}(2+x)^{z_\ell(R)}(2-x)^{n-z_\ell(R)-|R|}. $$ If $G$ has no isolated vertices, then, for every $\ell$ and every $x\in(0,2)$, $
M_{\ell,x}(G)>x^{n/2}(4-x^2)^{n/4}. $ Combining this estimate with a binary-entropy upper bound and optimizing $x$ gives $$
f_{\rm oe}(G)>c_*n>\frac{2n}{21}, $$ where $c_*\approx0.095862615$. Ferber and Krivelevich (Adv. Math. 2022) proved that $h_{\mathbf{1}}(G)\ge 10^{-4}n$, where $\mathbf{1}$ is the all-one labeling. Since $h_{\mathbf{1}}(G)\ge f_{\rm oe}(G)$, our result improves coefficient in their bound by almost three orders of magnitude, and does so simultaneously for every labeling.
arXiv:2607.16430v1 Announce Type: cross
Abstract: The integration of distributed energy resources (DERs) into the power grid has introduced new challenges to AC optimal power flow (AC-OPF) problems. Traditional OPF optimize consider transmission systems, treating distribution networks as static loads. However, the growing presence of DERs makes accurate distribution system modeling crucial for grid operations. Consequently, efficiently solving the resultant large-scale, nonconvex transmission and distribution (T&D) AC-OPF problem remains a significant challenge. This paper proposes a Smoothed Two-Stage Decomposition Optimizer (StsDOpt) to address these complexities by decomposing the T&D AC-OPF problem into a master-subproblem(s) structure, enabling parallel solving. Unlike traditional methods, StsDOpt does not rely on approximations or relaxations. It uses a smoothing technique to render the subproblems responses differentiable with respect to the master problem, leveraging the barrier problem properties inherent in primal-dual interior point methods. This approach is crucial for accurately modeling and solving distribution systems, which are multiphase, unbalanced, and nonlinear, distinguishing StsDOpt apart from other methods. Integrated into the PowerModelsITD framework, StsDOpt has been validated through numerical experiments, demonstrating reduced wall-clock solve time and increased scalability. Results highlight its efficacy as a robust, scalable solution for large-scale T&D AC-OPF problems, facilitating the reliable integration of DERs into complex T&D systems.
arXiv:2607.18043v1 Announce Type: new
Abstract: Accurately solving partial differential equations (PDEs) on arbitrary geometries and a variety of meshes is an important task in science and engineering applications. In this paper, we propose Adaptive Mamba Neural Operators (AMO), which integrates reproducing kernels for state-space models (SSMs) rather than the kernel integral formulation of SSMs. This is achieved by constructing Takenaka-Malmquist systems for the PDEs. AMO offers new representations that align well with the adaptive Fourier decomposition (AFD) theory and can approximate the solution manifold of PDEs on a wide range of geometries and meshes. In several challenging benchmark PDE problems in the fields of fluid physics, solid physics, and finance on point clouds, structured meshes, regular grids, and irregular domains, AMO consistently outperforms state-of-the-art solvers in terms of relative $L^2$ error. Overall, this work presents a new paradigm for designing explainable neural operator frameworks.
arXiv:2607.18115v1 Announce Type: new
Abstract: Physical artificial intelligence (AI) systems involve distributed sensing agents with embedded AI models that must coordinate to perceive, reason, and act in networked environments. Transmitting raw sensor data incurs significant communication overhead, latency, and redundancy. While semantic communication (SC) mitigates these challenges by transmitting task-relevant information, existing deep learning-based joint source-channel coding approaches exhibit limited adaptability, poor out-of-distribution generalization, and scalability challenges. To address these limitations, this paper proposes a framework for compositional semantic communication (CSC), enabling heterogeneous physical AI sources to transmit semantic representations (SRs) that compose meaningfully at a base station (BS) or edge server for remote inference. First, a category-theoretic measure of compositional semantics is developed to quantify each device's contribution to inference tasks beyond mutual information. Second, Grothendieck topologies and presheaves formalize semantic composition across devices, ensuring consistency and task relevance. Building on these foundations, multi-device coordination is formulated as a Stackelberg game in which devices commit to encoding strategies and the BS optimally composes received SRs. An ADMM-based algorithm computes equilibrium signaling strategies. Equilibrium existence is established under mild conditions and is Pareto optimal when compositional information yields increasing collective benefit. Simulation results demonstrate that the proposed approach achieves up to 17% bandwidth reduction and 53% lower end-to-end latency than cooperative multi-agent, distributed gradient descent, and uniform-selection CSC baselines while maintaining 85% inference accuracy across diverse autonomous driving scenarios.
arXiv:2607.18147v1 Announce Type: new
Abstract: Large language models (LLMs) and agentic AI systems have evolved from natural language tasks to using external tools to plan, retrieve, and act in technical domains. In smart grids, recent work applies agentic schemes to forecasting, optimization, and control, wrapping trusted solvers behind language interfaces and orchestrating multi-step workflows. The literature lacks a unified approach to designing and evaluating such systems. LLMs can produce numerically plausible yet physically infeasible outputs, evaluation protocols vary across tasks, and the boundary between what the model should and should not compute is implicit. This paper presents a solver-grounded design principle: a numerical result is reported only when it originates from a trusted tool and passes explicit verification. We review the building blocks of LLM and agentic AI systems for power systems: prompting strategies and agentic architectures. We instantiate the principle in four case studies: wind power forecasting, EV charging scheduling, power flow analysis, and contingency diagnosis, each comparing an LLM-only baseline against its solver-grounded counterpart on identical data and metrics. EVAgent reproduces the CVXPY optimum while reducing LLM-only unmet energy by 7.5-9.5x, and GridDebugAgent repairs 17/39 contingency cases while reducing total violations by 52.3%. We propose a four-group evaluation framework spanning task utility, solver-grounded correctness, faithfulness and safe failure, and cost and latency. A consistent division of labor emerges: the agentic system reliably orchestrates, retrieves, and explains, while trusted tools compute and a verification gate decides what is reported.
arXiv:2607.16436v1 Announce Type: cross
Abstract: We consider a formal model of quantum circuit description languages (QCDLs) in which semantically meaningful programs correspond to computable unitary matrices. We show that any semantically universal QCDL -- that is, any QCDL able to describe all computable unitary matrices, which in turn form the set of matrices we can meaningfully represent on digital hardware -- cannot have a semi-decidable set of semantically meaningful descriptions. In particular, no such language admits a compiler that reliably recognizes all valid program descriptions. This result stands in contrast to classical programming languages. While compilation in languages such as C or C++ may itself involve non-terminating computations, the set of semantically meaningful programs remains recursively enumerable, since successful compilation provides a witness of validity. The essential difference lies in the nature of the semantic domains: classical languages describe partial recursive functions, whereas QCDLs describe total unitary operators. Our analysis establishes a fundamental limitation of quantum circuit description languages and highlights a structural distinction between classical and quantum models of computation at the level of formal language theory.
arXiv:2607.16466v1 Announce Type: cross
Abstract: Molecular materials that enable coherent control over an electron's spin state at room temperature are promising candidates for quantum technologies, including quantum sensors and ultra-low noise microwave amplifiers, known as masers. Host-guest molecular crystals enable independent control of spin-active guests and their local environments to enhance molecular spin properties and so improve device performance. Using electron paramagnetic resonance and optically-detected magnetic resonance, we demonstrate the ability to tune triplet population, depopulation, and spin-lattice relaxation by modulating host-dependent lattice rigidity and vibrational coupling to significantly reduce the operating requirements for building useful masers. Importantly, the most rigid host, picene, reveals the ability to slow spin-lattice relaxation without lengthening triplet lifetime, though at the cost of strain-induced line width broadening and reduced triplet spin polarisation. We also find that deuteration reduces the triplet resonance line width and vibrationally-mediated triplet depopulation. Consequently, we find that perdeuterated pentacene in perdeuterated p-terphenyl is the most viable candidate for building a continuous wave maser. This work demonstrates host-guest engineering as an important and practical method for tuning the spin-dependent performance of room-temperature molecular quantum technologies.
arXiv:2607.16470v1 Announce Type: cross
Abstract: We develop a new approach to the problem of the motion of a large number of rigid bodies immersed in a viscous fluid. The leading idea is the concept of cluster - a collection of individual rigid objects that may be grouped or even connected in such a way that their collective impact on the bulk motion of the system is similar to that of a single body. The applications of the new approach include:
1. Improving the critical value of the number of balls of small radius such that their cloud has no impact on the limit system represented by the incompressible Navier--Stokes equations.
2. The balls follow the fluid flow in the asymptotic limit of vanishing radius and increasing number even if a gravitational force is imposed.
arXiv:2607.16504v1 Announce Type: cross
Abstract: In Dynamic Data Driven Applications Systems (DDDAS), non-linear continuous-discrete (CD) tracking algorithms have been proposed to recursively estimate stochastic processes which follow continuous-time stochastic differential equations (SDE) using non-linear discrete-time measurement sequences. In this paper, a new filter in this class which is based on the polynomial chaos expansion (PCE) is proposed as an alternative solution to these tracking problems. Using the orthogonality properties of the PCE basis, PCE coefficient-wise prediction and update steps are derived via the Galerkin projection. This differs from previous PCE based filters where collocation points are independently propagated through the motion model and the PCE is recomputed at each time step. For this reason, we call the proposed filter the CD-PCE coefficient filter (CD-PCE-CF). A case study is provided where the CD-PCE-CF and the CD-Extended Kalman Filter (CD-EKF) are used to track a ballistic object undergoing process noise using radar measurements. It is shown that the proposed method significantly outperforms the CD-EKF in terms of estimation accuracy and stability.
arXiv:2607.16517v1 Announce Type: cross
Abstract: Neural activity is widely held to organize on low-dimensional structure embedded in a high-dimensional state space. Persistent homology reads such structure directly from the pattern of pairwise correlations, without assuming in advance which variables are relevant. We apply persistent homology to microelectrode-array (MEA) recordings of spontaneous activity from human (Lancaster) and mouse (Pa\c{s}ca) cortical organoids, spanning $26$--$234$ simultaneously sorted units, and ask whether topological data analysis resolves structure at the node counts that neural recordings actually deliver. Building weighted networks in correlation space and characterizing them by Vietoris--Rips filtration, we find that the first homology ($H_1$, loops) rises significantly above a rate- and population-preserving null in $14$ of $18$ datasets. This loop structure occupies a non-redundant core: it is robust to random removal of units yet disrupted by targeted removal of the units that carry it. Topological richness grows with network size, and second homology ($H_2$) emerges significantly above the null only in the larger networks. These results show that persistent homology resolves structured topology in neural recordings at the scale experiments actually deliver.
arXiv:2607.16529v1 Announce Type: cross
Abstract: We introduce a positive-allocation companion construction for Koopman-inspired finite-dimensional prediction of nonlinear dynamical systems. The method determines recurrence coefficients by representing a target observable snapshot as a nonnegative, normalized combination of earlier training snapshots. These coefficients define a companion matrix whose spectral structure is induced by the allocation constraints at the construction stage. We prove that normalized positive allocation places the companion spectrum in the closed unit disk and, because the coefficients sum to one, includes $1$ as an eigenvalue. Additionally, we develop modal and non-modal diagnostics for the resulting model trajectory. When the companion matrix is diagonalizable, the modal representation shows that first and second finite differences act as spectral filters through factors of $\lambda_\ell-1$ and $(\lambda_\ell-1)^2$. We also derive $C$-based finite-difference bounds that avoid diagonalization and can be evaluated directly from the training data and companion matrix. Numerical experiments on the FitzHugh--Nagumo and susceptible--infectious--recovered (SIR) models illustrate the behavior of the construction in oscillatory and transient dissipative settings. The examples demonstrate both the interpretability of the companion recurrence and its limitations, particularly when pointwise trajectory agreement degrades while finite-difference and modal diagnostics remain informative.
arXiv:2607.16531v1 Announce Type: cross
Abstract: Many dynamical systems exhibit diverse modes of behavior. In biology, such modes can represent individual or cell fates. While the emergence of multimodality is commonly studied, transient bimodality is much less well understood. Under transient bimodality, a system moving from a well-defined initial to a final state transiently undergoes a bifurcation into multiple probability modes. This noise-driven phenomenon can significantly impact processes such as cell differentiation and speciation in the presence of changing environmental conditions. We detail a theoretical approach for understanding transient bimodality connecting results from ecology, optics, chemical reaction networks and cell biology, propose a ``minimal model'' of transient bimodality and derive a general criterion for its presence. We show that fast-to-slow dynamics can lead to transient bimodality in addition to the well-known case of slow-to-fast dynamics. Finally, we discuss the role of transient bimodality across the scientific literature, with emphasis on biochemical kinetics and gene regulation.
arXiv:2607.16541v1 Announce Type: cross
Abstract: Optimal Polynomial Intersection (OPI) is a structured optimization problem for which Decoded Quantum Interferometry (DQI) attains a satisfaction guarantee governed by the semicircle law. Sun and Wootters recently showed that, for balanced OPI over prime fields, a Fourier-defined distribution $P_u$ gives a strict worst-case improvement from limiting rate $0.6225$ onward and asymptotically perfect solutions from rate $0.7496$ onward, and asked whether $P_u$ can be sampled efficiently. We answer this question for Reed--Solomon OPI parameters satisfying their exponent condition strictly below the dual Johnson radius. Under coherent membership-oracle access, we give a bounded-error polynomial-time quantum sampler for $P_u$. The ideal circuit samples $P_u$ exactly conditioned on success, while a finite-precision implementation achieves any prescribed inverse-polynomial total-variation error. Consequently, every fixed limiting rate $0.6225\le r<1$ admits a strict worst-case improvement over the DQI semicircle value, and every limiting rate $r\ge 3/4$ admits solutions of satisfaction $1-o(1)$ with high probability. The algorithm coherently sums the amplitudes of all low-weight errors in each syndrome class using deterministic complete list decoding. Complete Reed--Solomon list decoding and the Sun--Wootters denominator estimate make the list size and postselection overhead polynomial. In concurrent and independent work, Horinaga and Yamakawa obtain worst-case OPI algorithms over prime-power fields and exact satisfaction at every fixed rate strictly above $3/4$.
arXiv:2607.16570v1 Announce Type: cross
Abstract: Organic mixed ionic electronic conductors (OMIECs) are a promising class of polymer materials for applications spanning neuromorphic computation to energy efficient electronics and bioelectronics. Despite being highly tunable, the relationship between structural features and key performance properties such as charge carrier mobility is poorly understood. Scanning nanodiffraction in the transmission electron microscope (TEM) is a powerful probe for elucidating this structure-property relationship, but produces large, noisy datasets that are difficult to interpret because polymer reflections exhibit several distinct morphologies. To address the complexity, we trained a machine learning (ML) model to detect these polymer diffraction peaks and their intensities from synthetic data. Compared to correlative peak detection algorithms, the conventional method for analyzing nanobeam 4D scanning transmission electron microscopy (4DSTEM) data, we show that the ML model is significantly faster and outperforms correlative algorithms in almost all cases, opening up the possibility of near-live visualization of 4DSTEM experiments.
arXiv:2607.16580v1 Announce Type: cross
Abstract: Structural reliability analysis supports the design and safety assessment of buildings and civil infrastructure but requires specialized expertise throughout the workflow. This study presents a multi-agent large language model framework that automates component-level reliability analysis from a natural-language problem statement to interpreted estimates of the reliability index and failure probability. Specialized agents handle problem formulation, method planning, code generation, execution, and result interpretation, with human confirmation at key decision points. The Method Planner is fine-tuned using QLoRA for a priori reliability-method category selection. Analysis results are not generated directly by an LLM; instead, validated deterministic solvers compute the reliability estimates, improving reproducibility and reducing hallucination risk. The framework uses open-weight models and supports local execution without closed APIs. Results show that it lowers the expertise barrier to structural reliability assessment while preserving computational trustworthiness.
arXiv:2607.16592v1 Announce Type: cross
Abstract: We develop a quantum model for the rotational dynamics of a freely floating levitated ferromagnetic gyroscope (LFG), emphasizing the interplay between intrinsic spin $\boldsymbol{S}$, mechanical angular momentum $\boldsymbol{L}$, and magnetic torque. The conserved total angular momentum projection along the $z$-directed magnetic field $\boldsymbol{B}$, $J_z=S_z+L_z$, is quantized, leading in the small-libration-amplitude limit to discrete precessional states $|m\rangle$ (eigenstates of $J_z$ with eigenvalues $J_z = m\hbar$) and librational harmonic oscillator states $|n\rangle$ ($n=0,1,2,\ldots$). The discreteness of the energies and dynamical variables is governed by the quantum precession scale $\Omega_Q=\hbar/I$, where $I$ is the moment of inertia of the LFG. We find that the phenomenon of LFG precession persists into high-field regimes where the magnitude of the rotational angular momentum associated with precession exceeds the total intrinsic spin. We analyze the complementary quantum limits of localized semiclassical LFG orientation wave packets and exact $J_z$-eigenstates $|m\rangle$, clarifying the relation between classical precession signals and the underlying quantized spin-rotor dynamics. We further show that radio-frequency fields can drive $\Delta m = \pm 1$ and $\Delta n = \pm 1$ transitions, enabling ladder spectroscopy, tilt-angle control, and sideband-like coupling between precession and libration. The coupled dynamics also exhibit branch-point magnetic resonances where precession and librational motion become strongly coupled. These results establish a framework for using LFGs not only as ultrasensitive torque and magnetic-field sensors, but also as controllable mesoscopic quantum systems. The techniques developed here may be applied to searches for exotic, beyond-the-standard model spin-dependent interactions, ultralight dark matter, and spin-gravity couplings.