Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 11 September
Let $\Gs(2,q)$ denote the graph induced in the Grassmann graph by the $q$-ary simplex codes of dimension $2$. We determine its diameter for every prime power $q$. The cases $q=2,3$ are elementary, while the diameter for $q=4$ follows from a known description of the distance relation. We prove that the diameter equals $3$ for every $q\ge5$, so that it is $0$ for $q=2$, $2$ for $q=3$, and $3$ for all $q\ge4$. The proof uses the realization of two-dimensional simplex codes as projective lines and a ratio criterion for collinearity of simplex points. A consequence of a theorem of Marshall Hall on finite abelian groups yields a bridge lemma and gives the uniform upper bound $3$. To obtain the matching lower bound for $q\ge5$, we construct an explicit diagonal pair of simplex lines and rule out a common neighbor by two independent arguments, one based on moments and the other on products. For $q\ge7$, we also give an independent counting proof. The case $q=4$ is treated separately. In particular, for $q\ge4$ the simplex-code graph is not isometrically embedded in the ambient Grassmann graph.
Probability
The sharp $L^p$ bound for the imaginary part of the Beurling-Ahlfors operator on the lattice
We prove the sharp $\ell^p$ bound $p^\star-1$ for certain second-order discrete Riesz transforms on products of integers, in all dimensions. The family includes the imaginary part of the discrete Beurling-Ahlfors operator in dimension two as a special case. While these operators admit a martingale representation via compound Poisson jump processes and heat extensions, the martingale attached to a function and the martingale attached to its transform do not enjoy strong differential subordination, so the operator-norm estimate is not accessible through prior work.
Read the full abstract
Robotics
An MRI-Guided Robotic System to Improve Hippocampal Access for Epilepsy Interventions
This paper presents an MRI-guided robotic system that improves hippocampal access by delivering a curved needle-like laser ablator through the foramen ovale, a natural opening in the base of the skull. Both the delivery path and the curved nature of the needle improve upon current clinical straight-line laser interstitial thermal therapy (LITT) as measured by hippocampal cannulation percentage. We describe the design of the robotic system which includes positioning, aiming, and curved needle deployment stages, followed by experimental results assessing cannulation percentages using MRI images in phantoms. In three curvilinear, single-insertion experiments, we achieved cannulation percentages of 93.5%, 96.5%, and 60.4%, exceeding reported clinical averages of 50-60%. Seizure control is believed by physicians to be a function of hippocampal volume treated, and our system provides a means of treating a greater volume of the hippocampus with LITT-based interventions.
Read the full abstract
Distributed Computing
Object Model Analysis of a Supercomputer with Digital Twin
Operators and developers need a mental model of both the structure and the live behavior of a large supercomputer, but its physical layout, logical organization, and streams of per-node telemetry are difficult to relate to one another, making it hard to trace a metric or event back to a specific hardware component. We present DAT, an interactive three-dimensional digital analytics twin of a compute cluster built in a real-time game engine, Unreal Engine. DAT expands a compact, parametric description of a supercomputer, a reusable Digital Twin Prototype (DTP), into a navigable Digital Twin Instance (DTI) that mirrors its physical containment hierarchy of racks, chassis, blades, and network links, encoding each node's role and health in its appearance, while a lightweight event-driven simulator animates job and hardware activity over a virtual clock. Our current implementation adds a two-path node-selection mechanism, unifying direct 3D pointing with command-shell queries, that opens an in-world visual-analytics panel beside any selected component showing summary statistics and live, time-varying metrics. We describe this architecture, report qualitative behavior from the working prototype, and outline the path toward driving the panels with recorded telemetry and in-situ anomaly detection.
Read the full abstract
Probability
Cutoff for q-deformed classical card shuffles in the type A Iwahori–Hecke algebra
We study the mixing behavior of three q-deformed card shuffles on $\mathcal{H}_q(S_n)$: the short systematic scan introduced in \cite{DiaconisRam2000}, the $q$–deformed random–to–random shuffle introduced in \cite{AxelrodFreedBraunerChiangComminsLang2024}, and the $q$–deformed $k$–star transposition shuffle, whose $q=1$ counterpart was studied in \cite{ArfaeeNestoridi}. The first two chains were diagonalized in \cite{DiaconisRam2000} and \cite{AxelrodFreedBraunerChiangComminsLang2024}, respectively. Here, we diagonalize the $q$–deformed $k$–star transposition shuffle and use the spectra of the three chains to study their mixing behavior. For fixed $q>1$, we prove that all three exhibit total variation and $\ell^2$ cutoff. For the short systematic scan, these improve both the upper and lower bounds of Diaconis and Ram \cite{DiaconisRam2000}.
Read the full abstract
Machine Learning (Statistics)
A pullback-corrected scalar auxiliary variable optimizer with momentum and adaptive mobility
Objectives in scientific machine learning are often prescribed as a sum of several terms, such as the residual, boundary, initial, and data losses of a physics-informed neural network. In the pullback-corrected scalar auxiliary variable (PB–SAV) method, one scalar tracks the shifted objective while the component gradients build a positive semidefinite curvature correction of rank at most the number of components. We carry that correction into an optimizer with momentum and an adaptive mobility, applying it to the gradient and the stored momentum in a single implicit solve. A mobility that is nonincreasing in the Loewner order yields an exact modified energy law, covering Euclidean and AMSGrad-type choices; the corresponding identity for momentum appended after the solve carries a cross term of indefinite sign. For a fixed mobility we give a necessary and sufficient condition for local stability at a stationary point, depending on the Hessian minus twice the correction, and show that it also gives local geometric convergence for every scalar relaxation sequence. The implicit solve reduces to a dense system whose order is the number of components. In the forward Burgers comparison, four components reduce the mean tail objective by 64.7% and the final solution error by 50.2% relative to one component at the same learning rate and momentum settings.
Read the full abstract
Superconductivity
Disorder-driven transport in ZrN thin films grown by ion-beam-assisted sputtering
We investigate the structural and electronic transport properties of zirconium nitride (ZrN) thin films grown by dc ion-beam assisted sputtering (IBAS) as a function of nitrogen partial pressure, sputtering power and deposition temperature. Variation of growth conditions enables controlled tuning from disordered metallic and superconducting behavior to insulating transport. Increasing nitrogen flow drives an increase in sheet resistance, suppression of superconducting transition temperature, and non-metallic conduction. XRD shows no measurable change in long range crystallinity or order. In the insulating regime, low-temperature transport is well described by 3D Mott variable-range hopping (VRH), with the characteristic temperature $T_0$ increasing monotonically with sheet resistance over four orders of magnitude. Despite this strong correlation between $T_0$ and disorder, $T_c$ exhibits no systematic dependence on $T_0$, indicating a decoupling between localization physics and the superconducting energy scale. Magnetotransport measurements are not well described by the standard BCS model nor the dirty type-II Werthamer-Helfand-Hohenberg model. The phase boundary is instead captured by a free-exponent power law, $\mu_0 H_{c2}(T) = \mu_0 H_{c2}(0)[1 - (T/T_c)^{n}]$ with $n \approx 3.47$, and extrapolates to $\mu_0 H_{c2}(0) \approx 6.4$ T. The films have an extracted coherence length of 7 nm. These results establish IBAS-grown ZrN as a broadly tunable platform for investigating disorder-driven transport and the crossover between metallic conduction, electronic localization, and superconductivity.
Read the full abstract
Artificial Intelligence
Causal multi-modal AI for personalized chemosensitivity prediction
Chemotherapy improves survival for some patients with breast cancer, but doctors cannot reliably predict who. Current guidelines rely on recurrence scores as a proxy for treatment benefit, which may contribute to the overprescription of chemotherapy. Here we present a causal multi-modal AI model that predicts personalized chemosensitivity using routinely collected pathology and clinical information. We developed our model on a multi-national dataset of 9,141 patients (twelve cohorts, nine countries) and evaluated it on another 1,994 patients (five cohorts, three countries). The model generated treatment-specific recurrence probabilities for each patient, with near-perfect calibration and strong prognostic discrimination across both 5- and 10-year follow-up horizons. Moreover, its chemotherapy benefit predictions demonstrated robust predictive performance, and out-performed existing recurrence-score-based tests. Compared to the standard of care, using the model to support personally tailored therapeutic decisions could reduce the number of patients receiving chemotherapy by 30% while achieving the same recurrence-free rate. Tumors predicted to be highly chemosensitive displayed concordant molecular and morphological programs of proliferation, cell cycle progression, and replication stress. The model's predictive capabilities transferred zero-shot to non-breast cancers, indicating our causal multi-modal AI approach may provide a universal strategy to predict treatment outcomes across cancer types.
Read the full abstract
Artificial Intelligence
Planning or Learning: Reliability and Cost in Multi-Asset Maintenance
Industrial maintenance systems involve multiple interacting assets and shared resources, making it challenging to balance reliability and operational cost using a single decision framework. While recent work has focused on reinforcement learning (RL) for maintenance scheduling, direct comparisons with planning approaches under identical settings remain limited. In this work, we empirically compare planning and RL for multi-asset bearing maintenance using run-to-failure data. We examine how these methods behave when balancing preventive maintenance against tolerable failures across a range of failure penalty scenarios. We observed a consistent behavioral difference driven by objective formulation. Planning enforces reliability as a hard constraint and produces zero-failure policies whose total cost is largely insensitive to the magnitude of failure penalties. RL agents optimize expected cost and often trade off preventive maintenance against occasional failures as penalties vary, resulting in lower costs under low-penalty regimes but persistent non-zero failures even when penalties are high. We also investigate lightweight constraint mechanisms, including reward shaping and action masking, to encourage RL's reliability. From a practical perspective, planning may be more suitable when strict reliability is required and deployment horizons are short, whereas RL may provide cost-efficient policies when limited failures are acceptable and long-run operational efficiency is prioritized. Overall, this study clarifies the trade-offs between reliability and cost in multi-asset maintenance and suggests that planning and RL are complementary approaches. Beyond these findings, the controlled benchmark protocol itself that unifies environment, cost model, and evaluation across paradigms, offers a reusable template for comparing decision-making approaches in other maintenance settings.
Read the full abstract
Game Theory
Scaling Chance-Constrained Correlated Equilibrium Computation for Exclusive Resource-Assignment Games
The chance-constrained correlated equilibrium concept provides a robust coordination technique for self-interested agents whose costs are uncertain to a central coordinator, but the number of joint actions considered in its computation grows exponentially with the number of agents. We propose an exact-one resource-assignment restriction for games in which agents compete for shared resources and simultaneous use of a resource is undesirable or unsafe. The restriction allows each resource to be assigned to exactly one agent, reducing the number of joint actions considered from O(2^(nr)) to O(n^r) for n agents and r resources. The resulting problem is solved over the restricted joint action set while retaining all incentive constraints associated with unilateral deviations. We show that the feasible set of the restricted problem is exactly the convex hull of the chance-constrained pure Nash equilibria contained in the exact-one assignment set, yielding a necessary and sufficient condition for nonemptiness. We further derive a sufficient condition under which all chance-constrained pure Nash equilibria of the unrestricted game are retained by the restriction. Numerical experiments in a vertiport departure-corridor coordination scenario demonstrate a 99.81% reduction in median computation time relative to the unrestricted formulation while achieving equivalent coordination performance.
Read the full abstract
Machine Learning
When Greedy Sampling Explores: KL-Regularized Contextual Bandits without Eluder-Dimension Dependence
We study KL-regularized contextual bandits under both reward and preference feedback. While existing regret guarantees typically depend on the eluder dimension, we show that simple greedy sampling can achieve polylogarithmic regret without explicit dependence on this complexity measure. For reward feedback, we analyze a greedy algorithm that samples directly from the Gibbs policy induced by the estimated reward. We extend the result to preference feedback under both general preference and Bradley–Terry models, while also sharpening existing dimension-dependent guarantees. Our analysis reveals a trade-off between greedy sampling and upper confidence bound-style exploration: greedy sampling enjoys stronger regret guarantees when KL regularization is sufficiently strong, whereas additional exploration yields sharper bounds as the regularization weakens.
Read the full abstract
Hardware Architecture
A Unified Interconnection Network for Chiplet-Based Scaling of the BrainScaleS Neuromorphic System
The BrainScaleS-2 (BSS-2) neuromorphic architecture combines analog emulation of spiking neural network (SNN) primitives with tightly coupled ADCs and digital processing units. These analog SNN primitives are fixed hardware resources that cannot be multiplexed, limiting the emulated network size to the number of physical hardware copies. To overcome the challenges of scaling analog designs, chiplet-based designs offer a promising approach with cost and flexibility advantages over monolithic scaling. Implementing a chiplet-based BSS-2 architecture requires an interconnection network that handles two distinct classes of traffic: error-tolerant traffic such as spikes and error-intolerant traffic like configuration data or data exchanged by the processing units. This work presents the design of a routing chiplet for the BSS-2 architecture that enables interconnection of multiple BSS-2 units in a 2D mesh topology. Both traffic classes are multiplexed over a single wide parallel die-to-die link. Exploiting the fault tolerance of SNNs, spikes are transmitted unsecured and synchronously, with the arrival time on the receiving side directly determining the pre-synaptic time of the spike. Conversely, error-intolerant data transmission is secured by a point-to-point Automatic Repeat Request protocol and uses credit-based flow control. These design choices are validated in simulation, where the proposed design can sustain $95\,\%$ link bandwidth utilization for the use case of surrogate gradient training across a wide range of spike-to-secured traffic ratios under a $1 \times 10^{-10}$ bit error rate with little impact on spike timing jitter.
Read the full abstract
High Energy Physics (Phenomenology)
Direct detection of right-handed fermionic dark matter: electron-recoil measurements in Xe atoms
We present theoretical estimations of the event rates for the interaction between a right-handed fermionic dark matter with an electron bound to a xenon atom. Motivated by recent astrophysical and cosmological constraints on a fermionic dark matter candidate in the sub-MeV mass range, we study such an interaction through an effective electromagnetic channel where the output consists of standard-model particles. This mechanism allows right-handed neutral dark matter fermions to couple with standard-model particles with the interchange of $W^{\pm}$ or $Z$ bosons, without the need to add extra fields. We generalize and extend previous results on this type of channels, by including for the ionization form factor arising from the interaction of the fermionic candidate with bound electrons. In addition, we compute the sensitivity curves for different direct detection experiments in such a challenging light particle mass range.
Read the full abstract
Artificial Intelligence
A Hybrid Agentic AI Framework for Intelligent Supply Chain Analytics
Efficient utilization of supply chain analytics for decision making remains a significant challenge for planners, as critical tasks such as database querying, key performance indicator (KPI) analysis, demand forecasting, and performance diagnosis require heterogeneous expertise spanning data engineering, operations research, and domain knowledge. In this work, we propose an agentic system for supply chain analytics that bridges the gap between business decision-making and technical expertise, where a coordinator agent interprets user intent and delegates sub-tasks to specialized agents. The system supports both exploratory analysis and deterministic workflows, enabling planners to transition between ad hoc questions and structured processes. Domain logic is encapsulated within specialist agents and prompts, yielding a scalable, modular, and auditable design and lowering the cost of functional extension through prompt-centric development. We evaluate the proposed architecture on a test environment that replicates multi-echelon inventory management operations. Results show that our multi-agent design achieves a 90% accuracy, which is competitive with a single agent baseline while reducing input token usage by roughly fourfold, substantially improving scalability and cost-efficiency. Furthermore, we provide case studies to demonstrate interpretable suboptimality detection and automated forecast optimization, illustrating how agentic architectures can effectively combine open-ended exploratory analysis and deterministic supply chain analytics workflows, and provide a practical pathway toward more accessible and extensible decision-support systems.
Read the full abstract
Fluid Dynamics
A learning-based joint flow and kinematic state estimation for bodies in highly disturbed flows
Accurate estimation of unsteady aerodynamic flows from sparse measurements remains a fundamental challenge, particularly in the presence of strong disturbances, unknown body kinematics, and incomplete observations. This study presents a data-driven sequential estimation framework for joint reconstruction of unsteady flow fields, aerodynamic loads, and airfoil kinematics from sparse measurements. The approach combines a kinematics-aware nonlinear flow autoencoder with online filtering of streaming measurements. In the resulting reduced-order representation, the forecast and observation operators are learned directly from data, with each forecast-assimilation cycle requiring only a few milliseconds. The framework is evaluated on two-dimensional incompressible flow over an airfoil subjected to random vortical gusts while undergoing arbitrary pitch-up motions. Results demonstrate accurate reconstruction from surface pressure sensors, vertical lines of vorticity sensors, and synthetic velocimetry data with representative shadow regions. The transient informativeness of pressure sensors is quantified through their time-varying contributions to dominant observation modes. While lift is reconstructed from the leading modes, drag, pitch angle, and angular velocity require higher modes. Incorporating limited off-body measurements alongside surface pressure improves observability and reduces estimation error and uncertainty.
Read the full abstract
Artificial Intelligence
Carbon-Aware Routing for Function Calling in Edge-Cloud LLM Systems
Large Language Models (LLMs) with function-calling capabilities are becoming critical for modern agentic AI systems. Nevertheless, current deployments typically route inferences to powerful cloud-based models, incurring significant energy use and carbon emissions. We address this sustainability challenge with a carbon-aware routing framework that distributes function-calling queries across a three-tier edge-cloud architecture, combining edge and cloud LLMs on heterogeneous hardware. At its core, a lightweight k-NN predictor operating in a unified semantic-lexical embedding space estimates query-specific accuracy, delay, and power consumption on each edge tier. These predictions are then combined with real-time grid carbon intensity to route every query to the lowest-emission tier capable of executing it successfully. Evaluated on state-of-the-art function-calling benchmarks and LLM families, our framework matches cloud-level accuracy while reducing operational carbon emissions by $4\times$ on average.
Read the full abstract
High Energy Physics (Theory)
Electromagnetic Duality Sensitivity of Holographic Complexity
We investigate electromagnetic duality as a diagnostic of the sensitivity of information content of holographic complexity via "complexity=anything" in Einstein-ModMax theory. Functionals constructed solely from gravitational invariants are duality invariant, whereas matter-sensitive functionals can distinguish electromagnetic configurations that share the same bulk geometry and energy-momentum tensor. As an explicit example, we consider a functional involving $F_{\mu\nu}F^{\mu\nu}$ and show that its complexity and complexity growth vary along the duality orbit, interpolating between purely electric, mixed electric-magnetic, and purely magnetic configurations. This provides an explicit realization of the freedom inherent in generalized holographic complexity and shows that different choices of complexity functional can retain different sensitivity to information about the bulk matter sector even when the gravitational geometry is insensitive to that information.
Read the full abstract
Signal Processing
Noise-Domain OTFS: Statistical Delay-Doppler Signaling for Future Wireless Networks
Orthogonal time frequency space (OTFS) usually conveys information through deterministic constellation symbols placed on a delay–Doppler (DD) grid. This article develops a different viewpoint, termed noise-domain OTFS (ND-OTFS), in which each message selects the covariance of a random DD-domain vector. The resulting statistical codeword can encode information through per-bin variance, equal-energy correlation structure, or separable DD covariance. We explain the transceiver principle, receiver implications, reliability–rate tradeoffs, and practical challenges. Representative results show that a matched-payload coherent OTFS reference retains a clear raw-reliability advantage, whereas ND-OTFS enables information recovery from covariance geometry even when competing states have identical average energy. Additional statistical observations reduce finite-sample overlap at the cost of latency and rate. ND-OTFS therefore complements, rather than replaces, deterministic OTFS by introducing a matrix-valued statistical signaling dimension across DD resources.
Read the full abstract
Computation and Language
Domain-Specific Jargon in Large Language Models: A Comparative Analysis between General-Purpose and Specialist Models
Large Language Models (LLMs) have shown remarkable proficiency on general-purpose tasks, yet their performance often degrades in highly-specialized technical domains. Moreover, little is known about how parametric knowledge of domain-specific terms is encoded within these models. We address this gap by contributing two novel medical jargon evaluation benchmarks and evaluate a general-purpose Llama-3.1 model against a variant fine-tuned on medical-domain data. Surprisingly, the general-purpose model outperforms the medically fine-tuned model on both tasks. Using mechanistic interpretability tools, we find systematic patterns of miscalibration for the medically fine-tuned model. Instead of reorganizing parametric knowledge, the fine-tuned model places greater emphasis on a small subset of model components associated with jargon-favoring predictions. We find that applying component reweighting strategies against the benchmark tasks successfully suppresses these components and closes the gap with the general-purpose baseline. We also observe that some jargon-sensitive components transfer knowledge to the same tasks involving materials science jargon, suggesting they encode a partially domain-agnostic notion of specialized terminology. Our results provide a case study in which a medically fine-tuned checkpoint does not improve jargon comprehension over its general-purpose counterpart, highlighting that domain adaptation should not be assumed to yield better performance on specialized terminology.
Read the full abstract
Distributed Computing
The Essence of Git: Concepts for P2P Replication
Git is most commonly known as a decentralized version control system. Underneath the surface, the design of Git exhibits an elegant object model and incremental replication protocols that have been used to build a variety of applications that go much beyond version control. In this paper, we survey those applications and show how application concepts have been mapped to Git concepts to show the latter's generality. We also show the connection between the Git commit history and the theory of distributed algorithms and convergent replicated data structures, suggesting that it approaches their essence. We finally compare to current peer-to-peer frameworks to establish the level of abstraction of the Git object model and peek at its potential universality. Throughout, we frame our discussion using the conceptual design approach proposed by Daniel Jackson.
Read the full abstract
Plasma Physics
Hydrogen and Lithium Isotope Analysis via Optical Spectroscopy of Laser-Produced Plasmas
Accurate detection and quantification of light-element isotopes, particularly hydrogen (H) and lithium (Li), are essential across chemistry, materials science, geology, nuclear energy, forensics, and defense applications. Their isotopic compositions provide insight into fuel cycles, materials degradation, mass transport, and environmental processes. Hydrogen and Li isotopes are especially relevant in nuclear environments because neutron-induced reactions directly connect their isotopic inventories. Despite their importance, analysis of these light isotopes remains challenging due to their low atomic mass, high mobility, and, in some cases, radiological constraints. While some existing analytical techniques can detect and measure H and/or Li, they typically require extensive sample preparation, laboratory-based instrumentation, or extended analysis times that preclude real-time monitoring capabilities. To address these limitations, optical spectroscopy of laser-produced plasmas offers a promising solution, enabling field-deployable, standoff sensing of isotopic signatures with real-time analysis capability and no sample preparation requirement. This Topical Review summarizes fundamentals and recent advances in H and Li isotopic analysis using optical spectroscopy, with emphasis on laser-produced plasmas generated by laser ablation of solid targets. Key concepts relevant to isotope-resolved optical measurements are introduced, including isotope shifts, fine and hyperfine structure, and line-broadening mechanisms. Progress in optical emission, laser induced fluorescence, and absorption spectroscopy is reviewed for H and Li isotopes.
Read the full abstract
Statistical Methodology
A Conditional-Distribution Framework for Validating Synthetic Multivariate Data
Statistical validation of synthetic multivariate data requires assessing whether a generator preserves the joint dependence structure of the target population without merely reproducing observed records. We develop a model-agnostic framework based on full conditional distributions. For each coordinate, we normalize the conditional probability assigned to the observed value by the largest conditional probability available in the same record context; averaging this quantity yields a one-sided MAP-alignment statistic that can be estimated using a conditional model fitted on held-out real data. The mathematical contribution is twofold: under strict positivity and compatibility, the complete normalized conditional profile identifies the joint distribution, and its integrated L1 difference defines a metric on finite-state generative processes; we also establish consistency and finite-sample concentration for the corresponding empirical estimators. Because high conditional alignment alone can arise from copying or concentration on conditional modes, we pair it with nearest-real similarity as a separate record-level novelty diagnostic. We evaluate the framework on NSHAP health and aging data, influenza B genomic surveillance, and 34 General Social Survey waves. In GSS, the Large Science Model matched the original-data control in mean conditional alignment while retaining substantial novelty, indicating preservation of conditional structure without row reuse. In influenza B, a Chow-Liu generator matched the control alignment but had almost no novelty, revealing near-reproduction of observed records. The framework therefore distinguishes three statistically different failure modes: loss of dependence, record reuse, and mode concentration, and provides a principled basis for validating synthetic health, surveillance, and population data.
Read the full abstract
Artificial Intelligence
Toward a Decision-Assurance Layer for AI-Assisted Flight Planning in Air Traffic Management
Generative AI is increasingly being used informally in Air Traffic Management (ATM) for tasks such as flight plan generation, trajectory interpretation, and constraint checking. Although these tools can reduce workload and accelerate planning, their non-deterministic outputs create safety and operational risks in human-in-the-loop settings. This paper proposes the AI Trust and Assurance Layer (ATAL), a model-agnostic decision assurance architecture that evaluates whether AI-generated flight-planning outputs are sufficiently reliable for operational use. ATAL combines semantic stability under prompt variation, operational consistency of structured outputs, and normative constraint validation against domain rules, and maps these signals to a Decision Readiness Level (DRL) for human operators. An ATM-inspired experimental study shows how unsafe, inconsistent, or misleading outputs can be identified before influencing flight-plan validation or execution. Although demonstrated in aviation, the framework is also transferable to other safety-critical decision-support domains that require human oversight under regulatory constraints.
Read the full abstract
Computer Vision
Towards Practical Precision Agriculture: Real-Time Fruit Detection and Video Analytics on Embedded Edge Hardware
Static-image benchmarks do not capture the computational and temporal requirements of practical orchard video analytics. This study presents an end-to-end framework for real-time fruit detection, tracking, and counting on the NVIDIA Jetson Orin Nano Super. A lightweight YOLO26s detector is trained independently on four public datasets representing apples, mangoes, blueberries, and strawberries under a common protocol. The models are deployed on embedded platform using PyTorch and TensorRT at FP32, FP16, and INT8 precision. APPLE MOTS is then used for temporal video analytics because it provides orchard sequences with persistent fruit identities, enabling evaluation of multi-object tracking and unique-fruit counting. The selected FP16 TensorRT detector is integrated into an NVIDIA DeepStream pipeline combining hardware-accelerated decoding, ByteTrack tracking, and motion-aware line-crossing analytics. Across the four detection tasks, mean test mAP@50:95 ranges from 0.4957 to 0.8656. On the Jetson, TensorRT FP16 achieves 66.76-74.56 images/s at 13.41-14.98 ms prediction latency, while reducing mAP@50:95 by only 0.0020-0.0054 and gross energy consumption by approximately 64-66% relative to PyTorch FP32. The complete detector-tracker-analytics pipeline reaches 44.96-54.11 FPS and sustains the configured 30-FPS input rate without output-frame loss. On held-out orchard video sequences, HOTA ranges from 0.345 to 0.538, event-level counting F1 from 0.611 to 0.803, and relative count error from 6.2% to 51.6%. Performance varies across acquisition geometries: near-lateral row viewing yields the most stable tracking and counting, whereas forward traversal remains association- and recall-limited despite spatially adaptive counting geometry. These results show that practical edge-based fruit monitoring requires efficient detection and acquisition geometries that support reliable temporal association.
Read the full abstract
Quantum Physics
An entropic characterization of Haag duality
Motivated by Haag duality in quantum spin systems, we show that Haag duality for a pair of commuting factors generated by increasing sequences of finite-dimensional matrix algebras is equivalent to the asymptotic vanishing of a suitable conditional mutual information. For spin systems, let an annulus separate a finite region from the exterior. Haag duality then holds for a region $A$ if and only if the mutual information of the inner region and the exterior, conditioned on the part of $A$ inside the annulus, vanishes as the outer radius becomes large. As a corollary, assuming a strict area law with subleading corrections, Haag duality holds for single cones, and it holds for unions of two or more disjoint cones precisely when the topological entanglement entropy vanishes. For translation-invariant pure states on spin chains, half-chain Haag duality is equivalent to vanishing entropy density.
Read the full abstract
Quantum Physics
Practical Considerations for Processing Massive Classical Data via Quantum Oracle Sketching
Classical-to-quantum I/O is a critical bottleneck for data-intensive quantum workloads. Quantum Oracle Sketching (QOS) has been proposed to address this problem. We identify its practical requirements, including the representation of data as a probability distribution over oracle addresses, the relation between sample count, approximation error, and update cost, and the coherence and runtime support required for online execution. To study QOS on current quantum computing devices, we develop an offline realization that compiles sample blocks into empirical phase oracles and evaluate it using DNA fingerprinting. The application converges with relatively few samples, while exact phase fusion combines repeated updates to the same address. However, the compiled circuits remain too deep for current quantum computing devices. Practical QOS therefore requires lower depth oracle synthesis and interactive quantum runtimes.
Read the full abstract
Artificial Intelligence
AutoTailor: Automatic, User-Aligned Capability Selection and Adaptation for Web Agents
Web agents can utilize reusable tools to reduce the cost and latency of low-level browser interaction, but automatically discovered tool collections can be large, redundant, and poorly aligned with user demand. We present AutoTailor, a meta-agentic framework for constructing and maintaining a compact set of trajectory-derived Model Context Protocol (MCP) APIs. Offline, AutoTailor converts web trajectories into parameterized browser-automation programs, applies a Quality Filter to remove APIs with unsuitable granularity and redundant functionality, and applies a Usage Likelihood Filter to prioritize broadly useful capabilities while preserving semantic coverage. Online, Dynamic Reselection monitors task outcomes and API usage, identifies recurring coverage gaps, adds relevant candidates, and prunes persistently unused capabilities. We evaluate AutoTailor on 106 WebArena Postmill tasks. Offline filtering reduces the initial 1,283 unrefined APIs to 87, and Dynamic Reselection produces a 33-API set. With reasoning and acting (ReAct) fallback, this set achieves 90.6% correctness, compared with 87.5% for ReAct alone, while reducing average total request-token cost by 57.8% and latency by 29.4%. Without ReAct, it achieves 60.1% correctness, marginally matching the performance of unrefined set, while reducing request-token usage by 94.9%. Together, these results show that static filtering produces a compact inventory of APIs expected to support core, high-likelihood tasks, while dynamic reselection further tailors that inventory to observed user needs. This combination improves accuracy and latency while sharply reducing token usage and end-to-end cost, demonstrating the value of user-aligned capability management for efficient web agents.
Read the full abstract
Machine Learning
Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary
We study switching regret in adversarial multi-armed bandits, where the learner competes with an arm sequence that changes at most $S$ times. When $S$ is known, an optimal expected regret of $\widetilde{\mathcal{O}}(\sqrt{(S+1)KT})$ is obtainable [Auer et al., 2002]. However, when $S$ is unknown, Marinov and Zimmert [2021] show that this guarantee is impossible under an adaptive adversary. In this paper, we show that a single algorithm achieves $\widetilde{\mathcal{O}}(\sqrt{(S+1)KT})$ expected regret for every $S$ against an oblivious adversary, resolving an open problem of Auer et al. [2019b]. Our algorithm combines a fixed-share learner initialized with a small learning rate and dyadic-interval subroutines that search for local improvements using randomized learning rates and implicit exploration. Importantly, a non-uniform prior favors following the main learner, keeping the cost of maintaining many subroutines small. When the subroutines accumulate sufficient improvement over the main learner, its learning rate doubles, allowing adaptation to the unknown number of comparator switches $S$.
Read the full abstract
Quantum Physics
WISER: Systematic Design-Space Exploration of Trapped Ions with Multiplexed Control
Trapped-ion Quantum Charge-Coupled Devices (QCCD) are a leading contender for quantum computing, but their scalability is constrained by control wiring and electronics. Wiring using Integrated Switching Electronics (WISE), a recently proposed QCCD architecture, reduces wiring through multiplexing and integrated switching hardware. However, this leaves an execution model with limited parallelism and limited flexibility in ion movement. Further, these devices need to be paired with a quantum error correction (QEC) code to enable fault-tolerant quantum computation (FTQC). Can WISE architectures efficiently support FTQC requirements? Which QEC choices, device and control parameters are practical? We present WISER, a cross-layer design-space exploration framework for trapped-ion systems with multiplexed control. WISER combines a WISE-specific SAT-based compiler, a physics-informed noise model and logical-memory simulation to estimate logical error rates, logical clock speeds and control power across hardware parameters and QEC families. Its compiler reduces routing time by $2.6$–$18.8\times$ relative to a greedy WISE-compatible baseline. Our analysis provides concrete design guidance. Two-ion traps with $16$-way multiplexing, $8\times$ lower than the original WISE proposal, give the fastest logical clock that meets our reliability and cold-stage power targets. With current hardware parameters, the distance-7 surface code is the only evaluated code to meet our early-FTQC screen, at $4.58\,$Hz and $2.04\,$W of DAC power per logical qubit. At this operating point, ion transport and recooling take $94$–$96\%$ of the WISE cycle, and even without them sample-and-hold electrode charging leaves millisecond-scale syndrome-extraction rounds.
Read the full abstract
Robotics
Runtime-Incremental Transformer for Reinforcement-Learning-Based Adaptive Control
Learning-based adaptive control of robotic manipulators with non-observable friction memory has been addressed by attention- based meta-controllers whose number of attention heads is fixed before training and is tuned by costly offline search. At long memory horizons, such fixed-capacity controllers are prone to catastrophic failures on a sizeable fraction of training seeds. The present paper introduces a runtime mechanism that grows and prunes the heads of the attention block during reinforcement learning, governed by two signals: the effective rank of the on-policy context distribution, which triggers growth when representational capacity becomes insufficient, and the per-head output magnitude, which flags redundant heads for removal. Policy continuity at growth events and a quantitative bound at prune events are established analytically. On a two- link manipulator with Stribeck friction, the proposed mechanism attains full success across all memory regimes, eliminating the long-horizon failure mode and removing the need for offline tuning of the head count.