Machine Learning
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 30 August
Broad Learning System (BLS) is an efficient alternative to deep architectures due to its fast training, analytical learning, and strong generalization under limited data. However, existing BLS variants are confined to real-valued representations, restricting their ability to capture nonlinear interactions and second-order statistical dependencies inherent in real-world data. Notably, no prior BLS model fully exploits the complete second-order statistics that naturally emerge when data are embedded in the complex domain. To address this limitation, this paper introduces the first complex augmented Broad Learning System (CA-BLS), which transforms real-valued inputs into phase-encoded complex representations and adopts widely linear modeling to jointly leverage covariance and pseudo-covariance information via complex conjugate augmentation. This enables effective modeling of latent nonlinearities, coherence structures, and second-order dependencies inaccessible to conventional BLS formulations. To mitigate the additional computational cost of complex augmentation, an Efficient Complex Augmented BLS (ECA-BLS) is further developed, reformulating CA-BLS entirely in the real domain while preserving its exact decision function, achieving up to 75% fewer multiplications and over 60% fewer additions. A rigorous theoretical analysis proves the mathematical equivalence between CA-BLS and ECA-BLS, ensuring zero theoretical loss. Extensive experiments on 26 benchmark datasets from the UCI and KEEL repositories demonstrate that ECA-BLS consistently outperforms classical BLS and recent state-of-the-art randomized neural networks in accuracy, average rank, and statistical significance, establishing augmented second-order modeling as a critical and previously missing dimension of BLS research.
Fluid Dynamics
Splashing-regime transitions and secondary-droplet scaling in oblique drop impacts on a deep pool
Oblique drop impact onto a deep liquid pool produces asymmetric crowns, directional jetting, and splashing transitions that cannot be characterized by the total impact inertia alone. We numerically investigate water drops impacting a quiescent deep pool over $41\leq We\leq1790$ and $10^\circ\leq\theta\leq90^\circ$. The simulations reproduce the principal features observed experimentally and identify five post-impact regimes in the $We$–$\theta$ plane: deposition, front splashing, side splashing, side-front splashing, and crown splashing. The deposition–front-splashing transition is described by the tangential-inertial parameter $K_s=We\cos\theta$, with $K_s^c\approx120$. This criterion follows from the competition between downstream crown-rim inertia and capillary retraction at the Taylor–Culick velocity. The transition from front to side-front splashing is instead governed primarily by normal impact inertia, with a critical normal Weber number $We_N^c\approx318$. Beyond these regime transitions, the secondary-droplet statistics reveal fragmentation behavior common to the different splashing regimes. The droplet-size distributions are positively skewed, and the median diameter follows $d_{s,\mathrm{med}}/D\sim We^{-3/5}$. Second-order velocity structure functions support a scale-dependent capillary–inertial description of rim and ligament breakup. Combined with mass conservation, this scaling gives $N_s\sim We^{9/5}$, providing a numerical explanation for the secondary-droplet-number scaling observed experimentally. Thus, directional impact inertia governs the macroscopic selection of splashing regimes, whereas the secondary-droplet populations across these regimes exhibit a common capillary–inertial fragmentation scaling.
Read the full abstract
Geometric Topology
Simple geodesics in closed hyperbolic manifolds
Given any closed hyperbolic n-manifold M ($n\ge 3$), we show that for a fixed $\kappa>\frac{3}{n-2}$, a random closed geodesic of length close to r has the collar of width $r^{-\kappa}$ when r is large enough. In particular, most closed geodesics of length close to r are simple. This theorem positively answers Problem 3.16 from Kirby's list which asks whether every closed hyperbolic 3-manifold contains infinitely many simple closed geodesics.
Read the full abstract
Instrumentation and Methods for Astrophysics
A generalized likelihood model for segmented muon counters
Measurements of the muonic component of extensive air showers constrain cosmic-ray mass composition and hadronic interactions at energies beyond those accessible at accelerators. Arrays of segmented detectors with binary readout are widely used for this purpose: they sample the muon density at different distances from the shower core to reconstruct the muon lateral distribution function (LDF). Each detector response is summarized by the number of activated segments, $k$, whose probability distribution provides the likelihood relating the observation to the expected muon content. Signal pile-up, detector inefficiency, corner-clipping muons, and background signals shape this distribution, and neglecting them can bias the reconstruction. Existing analytical models include pile-up but otherwise assume an ideal detector response. In this work, we develop a unified statistical framework that incorporates inefficiency, corner clipping, and background through a small set of physically interpretable parameters. We derive exact expressions for the detector response and the likelihood required for muon-LDF reconstruction, together with a simple binomial approximation that preserves the main statistical properties of the exact distribution. Dedicated Monte Carlo simulations are used to assess the impact of the assumptions underlying the analytical treatment and show that it is negligible over the parameter range considered. They also show that the exact and approximate likelihoods yield similar performance in terms of estimator bias and confidence-interval coverage. Although motivated by the Underground Muon Detector of the Pierre Auger Observatory, the framework applies more broadly to segmented particle detectors with binary readout in which particle content is inferred from the number of activated segments.
Read the full abstract
Computer Vision
SynCrash: A Multi-Stage Pipeline for Zero-Shot Accident Detection and Localization in Traffic Surveillance Video
We present SynCrash, a multi-stage pipeline for zero-shot accident detection, spatial localization, and collision-type classification in fixed-view CCTV surveillance video. Our approach addresses the ACCIDENT at CVPR 2026 Challenge, which requires predicting when an accident occurs, where in the frame the impact happens, and what type of collision it is, all without access to labeled real-world training data. The pipeline operates in three decoupled stages: (1) Temporal localization via a VideoMAEv2-giant backbone fine-tuned on CARLA-based synthetic clips with metadata-aware embeddings and dense sliding-window inference; (2) Spatial localization using YOLO for object detection combined with a physics-informed hybrid heuristic that leverages bounding-box overlap and trajectory-based reasoning to predict the impact point; and (3) Collision-type classification using a lightweight rule-based strategy derived from the number and configuration of detected vehicles. The key insight is that temporal understanding benefits from supervised fine-tuning on synthetic data, whereas spatial understanding is better served by pretrained object detectors and physics priors that transfer naturally across domains.
Read the full abstract
Cryptography and Security
Building the Truman Show: A TrustZone-Based Framework for Lightweight Out-of-band Kernel Security Monitoring
The increasing number of vulnerabilities in operating systems, together with sophisticated kernel-level threats (e.g., rootkits), has weakened the effectiveness of traditional in-kernel protection mechanisms. Since these defenses operate at the same privilege level as the kernel, they share the same attack surface and can be bypassed once the kernel is compromised. Isolation-based security approaches provide stronger protection by separating security logic from the kernel, but strict isolation often introduces semantic gaps that limit system visibility and hinder timely threat detection. In this paper, we present LOOM, a lightweight out-of-band operating system monitoring architecture built on ARM TrustZone. By leveraging TrustZone's hardware-enforced isolation, LOOM establishes a tamper-resistant monitoring environment independent of the kernel. To bridge the semantic gap, we design a lightweight semantic reconstruction mechanism in the Secure World. It selectively captures the states and behavioral patterns of critical kernel objects, such as process control blocks and kernel modules. Additionally, LOOM introduces a dual-stage hazard prevention mechanism that combines atomic memory protection with an interrupt-driven adaptive agent to detect and mitigate kernel rootkit activities. An address translation cache is further incorporated to optimize repeated address access and reduce monitoring overhead. Overall, we develop a multi-layered collaborative architecture with platform, functional, and auxiliary layers for secure and efficient kernel monitoring. A prototype of LOOM has been implemented on the Phytium D2000 platform. Experimental results indicate that LOOM incurs negligible overhead while maintaining a strong monitoring capability. Furthermore, a security capability analysis based on CVE cases demonstrates that LOOM can detect and mitigate various kernel attacks.
Read the full abstract
Combinatorics
The cyclic-induction Schur cone: Boolean sums, Ramanujan-square positivity, and integral structure
We study the Schur-positive cone in $\Rspace_{n,\mathbb R}\coloneqq \operatorname{span}_{\mathbb R}\{p_d^{n/d}:d\mid n\}$ through its basis $Q_{n,d}\coloneqq\ell_{n/d}^{(1)}[p_d]$, where $\ell_m^{(1)}$ is the Frobenius characteristic of the representation induced to $S_m$ from a faithful linear character of the subgroup generated by an $m$-cycle; brackets denote plethysm. A Boolean $Q$-sum is a sum of distinct elements of this basis. We give a unified proof of four conjectures of Sundaram on Schur positivity by classifying all Schur-positive Boolean $Q$-sums; the case of sums over divisors up to a prescribed bound recovers Hou's theorem. Specifically, for a nonempty set $J$ of divisors of $n$, the sum $\sum_{d\in J}Q_{n,d}$ is Schur-positive exactly when $1\in J$ and, for even $n$, $n\in J$ implies $n/2\in J$. The same character estimates prove the Ramanujan-square conjecture of Shareshian and Sundaram: the function $\sum_{d\mid n}c_d(n/d)^2p_d^{n/d}$, where $c_d(r)$ is the Ramanujan sum, has a positive coefficient of $s_\lambda$ for every $n\ge1$ and $\lambda\vdash n$, except when $n\equiv2\pmod4$ and $\lambda=(1^n)$, in which case the coefficient is zero. We prove that an element of this space has integral Schur coefficients if and only if its $Q$-coordinates are integral. The Boolean classification also determines the convex hull of the Schur-positive Boolean points with $Q_{n,1}$-coordinate $1$. We compute its Ehrhart polynomial and volume, prove its integer decomposition property, and determine the Hilbert basis of its cone. For $n\ge18$, we prove that setting the coefficient of $s_{(n)}$ or $s_{(1^n)}$ equal to $0$ or $1$ defines a facet of the section of the Schur-positive cone with $Q_{n,1}$-coordinate $1$. The positivity results and coordinate formulas also yield inequalities for major-index residue multiplicities.
Read the full abstract
Quantum Physics
Pathwise Random Hamiltonian Simulation
Randomized product formulas such as qDrift offer a resource-efficient alternative to deterministic Trotter–Suzuki decompositions for Hamiltonian simulation, removing their polynomial dependence on the number of Hamiltonian terms. qDrift, however, is intrinsically limited to first order in the evolution time, so its query complexity remains linear in the inverse of the target accuracy, $1/\epsilon$. We introduce Pathwise Random Hamiltonian Simulation (PRHS), which extends qDrift to arbitrary order by subdividing each time step into $M$ correlated slices, each evolving under a term sampled from a quasi-probability distribution that we construct in closed form and prove unique, with a bias decaying factorially in $M$. Optimizing jointly over the number of slices $M$ and the number of independent blocks $N$ interpolates between the standard qDrift protocol at long times and a high-precision regime where the query cost grows slower than any power of $1/\epsilon$, without requiring ancillary qubits. Numerical simulations of five molecular Hamiltonians confirm this advantage, with PRHS achieving accuracies two to four orders of magnitude beyond qDrift at equal query cost.
Read the full abstract
Machine Learning
GraM-Diff: A Unified Graph-Mamba Diffusion Framework for EEG-Based Alzheimer's Disease Data Generation and Diagnosis
Electroencephalography (EEG) is a promising, non-invasive, and cost-effective modality for Alzheimer's disease (AD) detection, but deep learning methods are limited by small and imbalanced clinical datasets. Generative augmentation offers a solution, yet existing approaches rely on inefficient class-specific models or fail to capture complex spatial and temporal brain dynamics. To address this, we propose GraM-Diff, a unified classifier-guided Graph-Mamba diffusion framework for EEG synthesis. It embeds Graph Convolutional Networks within a diffusion U-Net to model inter-electrode connectivity and Bidirectional Mamba state-space blocks for linear-complexity long-range temporal modeling. Latent-space classifier guidance lets a single model generate both healthy and pathological EEG within a shared representation, avoiding fragmented per-cohort pipelines. Across four EEG-based AD benchmarks, synthetic augmentation improves classification, yields superior Context-FID and correlation scores over strong generative baselines, and enhances robustness in data-scarce settings.
Read the full abstract
Computational Engineering
Intrinsic Finite Element Methods for Fluids on Riemannian Manifolds Compared with Surface FEM
We present an intrinsic finite element formulation for the incompressible Navier–Stokes equations on Riemannian manifolds. We derive the corresponding weak formulation and prove that the backward Euler discretisation is energy stable. The proposed framework is validated on several representative manifolds, with particular attention paid to the long-time behaviour of the flow and its convergence to steady-state solutions represented by Killing vector fields. Comprehensive comparisons are performed with the surface finite element method and a corresponding eigenvalue formulation for Killing vector fields. The numerical results demonstrate that the intrinsic formulation provides an accurate, computationally efficient, and geometrically transparent alternative to embedded surface finite element formulations, while naturally extending to higher-dimensional Riemannian manifolds.
Read the full abstract
Artificial Intelligence
PAGE-RAG: Provenance-Aware Graph Evidence Promotion for Fixed-Budget Multi-hop Retrieval-Augmented Generation
Multi-hop question answering in retrieval-augmented gener?ation (RAG) often benefits from retrieving beyond the few candidates that will finally be read: narrow retrieval can miss an indispensable hop, while expanded retrieval introduces topical distractors. This challenge is not tied to a particu?lar knowledge-base format. Candidate pools may come from standalone retrievers, standard RAG backends, or graph-based retrieval pipelines. What is needed is a query-aware selection layer that can use relational structure to filter candidates be?fore generation. PAGE-RAG addresses this setting by using a graph as a temporary selection structure, rather than assum?ing a graph-structured knowledge base. It builds a query-local graph over retrieved candidates, records why candidates are connected, and treats each connection as a support hypothe?sis rather than support itself. We identify the resulting failure mode as a connectivity-support gap: connected candidates do not necessarily support the answer. We propose PAGE-RAG, a Provenance-Aware Graph Evidence promotion method that scores candidate paths with relevance, source-tracing meta?data, specificity, hubness, noise, and coherence signals, and applies minimal sufficient selection to promote supporting facts into a compact reader context. PAGE-RAG can serve as a complete retrieval-to-reading pipeline, and the same promo?tion stage can be inserted after existing retrieval or RAG sys?tems without replacing their upstream retrieval logic. Across three multi-hop QA benchmarks under the same final bud?get, PAGE-RAG improves support F1 and answer F1 by 10.4 and 3.3 points on a weighted average over a strong retriever. As a plug-in, PAGE-RAG further improves all reported RAG backends, including reasoning-oriented, compression-based, graph-based, and document/chunk-level systems.
Read the full abstract
Solar and Stellar Astrophysics
Ion-Scale Waves Regulated by Plasma Beta and Cross Helicity: Observational Evidence for the Helicity Barrier in Imbalanced Solar Wind Turbulence
Ion-scale waves are believed to play an important role in heating of the solar corona and wind, though their generation mechanism remains unclear. Based on Parker Solar Probe observations, this Letter investigates the occurrence of ion-scale waves in the near-Sun solar wind with heliocentric distances between 0.1 and 0.2 au. Results show that the occurrence rate of left-handed polarized waves significantly depends on the plasma beta ($\beta$) and cross helicity ($\sigma_c$). The occurrence rate rapidly increases with decreasing $\beta$ and increasing $\sigma_c$. Overall, the occurrence rate exceeds 45$\%$ when $\beta<0.2$ and $\sigma_c > 0.7$ are satisfied. These observations are consistent with the direct predictions of the helicity barrier theory that suggests the generation of ion cyclotron waves via imbalanced magnetized turbulence.
Read the full abstract
Computers and Society
Large-Scale Qualitative Research with AI: Infrastructure, Management and Operation of the Socioscope Data Pipeline
The Socioscope project is a pioneering effort in Large-Scale Qualitative Research (LSQR) collecting comparable, open-ended, multimedia field data on hundreds of cases and using AI to make the material analysable at scale. The domain studied is the food system. The entities documented are the organisations that act in it: farms, processors, distributors, retailers, restaurants; and, at meso level, the actors that shape their environment, such as municipalities, government programmes, banks, NGOs and universities. This paper provides the technical reference for how the resulting data Corpus was built and managed to enable AI-augmented analysis. It describes the data pipeline end to end: the systemic sampling frame; the transaction grid used to capture each initiative's relations within the food system; the social contract that rewards participating interviewees, aiming to sustain access; the operational chain from scouting to interviews, including their uploading, transcription, translation, quality control and curation; the provenance rules (originals are immutable, every transformation is logged); and the installation of equipment, personnel and processes, including ethics and GDPR compliance. In its first phase (2023-2026) the pipeline produced 686 documented cases from 31 countries: some 1,430 hours of recordings, about 450,000 speech turns, and 12.6 million words of transcript. We report costs, metrics, lessons learned and limitations, so that other teams can reuse, adapt, and improve the Socioscope methodology.
Read the full abstract
Combinatorics
An independent proof of the even-dimensional S-matrix inequality
Harwit and Sloane conjectured that every nonsingular entrywise-nonnegative matrix $A\in\mathbb R^{n\times n}$ satisfies $\|A^{-1}\|_F\ge 2n(n+1)^{-1}\|A\|_{\max}^{-1}$, with equality precisely for positive multiples of $S$-matrices. Zhang has given a complete proof of this conjecture by a centered pseudoinverse and spectral variance method. We present an independently obtained, structurally different proof of the strict even-dimensional inequality. Starting from the structural identities of Frankel and Urschel, we derive an exact global defect budget and combine binary rounding, fixed intersections, and Gram projection. A ten-row obstruction handles every even $n\ge66$; a finite exact calculation handles $4\le n\le64$, $n\ne6$; and a multi-column energy argument treats $n=6$. The order-two case is elementary. The even-dimensional argument is formalized in Lean 4, conditional on Frankel–Urschel Lemma 2.1 as an explicit external mathematical input. The finite evaluations use Lean's native evaluator; their trust boundary and exact certificates are documented. Together with Cheng's odd-dimensional theorem, the argument recovers the full S-matrix theorem and its equality characterization.
Read the full abstract
Robotics
DriftingVLA: Native One-Step Vision-Language-Action Generation via Per-Dimension Temporal Drifting
Conventional flow-based vision-language-action (VLA) models support expressive continuous action generation but rely on multi-step refinement to produce each action chunk, increasing latency in online robot control. To address this issue, we introduce DriftingVLA, a native one-step VLA that generates a complete action chunk with a single action-expert forward pass. Rather than learning a flow field that requires iterative integration at inference, DriftingVLA uses a distribution-drifting objective to learn a direct noise-to-action-chunk mapping for one-step deployment. Since robot action dimensions carry distinct control semantics and distributional characteristics, we further introduce Per-Dimension Temporal Drifting (PDTD). PDTD treats the complete temporal trajectory of each action dimension as a separate drifting unit, enabling finer-grained modeling and shaping of dimension-specific action distributions. This per-dimension decomposition applies only to the training objective; the shared VLA model still generates the complete action chunk jointly, thereby preserving cross-dimensional dependencies. DriftingVLA achieves 98.32% success on LIBERO, 81.09% on RoboTwin 2.0, and 77.67% across six real-world single- and dual-arm tasks, outperforming the evaluated multi-step flow policy and one-step VLA baselines. Native one-step deployment also delivers a 3.36-fold speedup in action-chunk generation, eliminating iterative refinement without sacrificing control performance.
Read the full abstract
Computation and Language
ReTrace: Rejected-Trajectory Conditioning for Speculative Decoding
Speculative decoding accelerates autoregressive language model inference by having a lightweight draft model propose multiple candidate tokens, which are then verified in parallel by a larger target model. However, after the first rejection, standard prefix-based verification discards the remaining draft suffix, so the computation spent generating and verifying those positions does not contribute to decoding progress. Focusing on DFlash, we show that rejected positions in a rejected suffix may still align with the target continuation, indicating that the draft model can retain useful semantic and structural information despite local token-level errors. Motivated by this observation and inspired by conditional diffusion, we introduce ReTrace, a rejected-trajectory conditioning method that conditions each draft block on the rejected suffix from the previous round rather than generating it from fresh mask placeholders alone. ReTrace retains the hidden representations of the rejected suffixes, aligns them with the next draft block, refines them using target-aware correction signals from the same verification pass, and admits them into the drafter's input embeddings through gated residual fusion. Because rejected tokens are never committed and target-side verification remains unchanged, ReTrace preserves the lossless property of speculative decoding without requiring an additional model forward pass. Experiments with Qwen3 models across mathematical reasoning, code generation, and open-ended dialogue demonstrate that ReTrace consistently improves average acceptance length and end-to-end decoding speed over its DFlash backbone. By introducing cross-round conditioning without modifying within-round proposal generation, ReTrace is largely orthogonal to existing drafting improvements and might be combined with them for further gains.
Read the full abstract
Geometric Topology
Reduced Khovanov-Rozansky homology
We introduce a variant of reduced Khovanov-Rozansky homology defined in terms of the variables alpha_1, ..., alpha_{n-1} that correspond to the regions between the strands. We rigorously reestablish several folklore results in terms of our framework, including the equivalence between Khovanov's and Rasmussen's approaches. Furthermore, we show that Rasmussen's chain complex is a free resolution of the Rouquier chain complex.
Read the full abstract
High Energy Physics (Experiment)
Searching for Extra Dimensions and Copies of the Standard Model with IceCube
The hierarchy problem remains an open question in particle physics. A number of theories that address this problem lower the fundamental scale of gravity, resulting in observable consequences in the neutrino sector. In this work, we place constraints on low-scale gravity scenarios using high-energy neutrinos observed with the IceCube Neutrino Observatory. The analysis is based on 10.7 years of upward-going muon neutrino data in the energy range from 0.5 to 100 TeV. In this energy range, the theories predict characteristic spectral distortions arising from matter effects when neutrinos propagate through Earth. In the context of large extra dimension models, we constrain the compactification radius of the largest extra dimension to $R \lesssim 0.17\,\mu\mathrm{m}$ at $90\%$ confidence level for both normal and inverted neutrino mass ordering. For scenarios with multiple Standard Model copies, we obtain lower limits of up to $N \gtrsim \mathcal{O}(400)$, depending on the value of the lightest neutrino mass. In parts of the parameter space, these results constitute the strongest constraints in the literature to our knowledge, while in other regions they probe previously unexplored parameter space.
Read the full abstract
Cryptography and Security
JITterFlip: Uncovering Fault Attack Surfaces in JIT-Compiled LLM Serving
LLMs are widely deployed through cloud-hosted inference services, where Just-in-Time (JIT) compilation is used to reduce recurring framework and GPU-launch overhead. JIT serving introduces a host-side control plane that selects compiled artifacts and orchestrates their execution on the GPU. Meanwhile, the shared cloud setting has motivated a growing body of bit-flip attacks (BFAs) against LLM/DNN inference. Most existing BFAs target model parameters or weights and require model-specific knowledge. A smaller body of work reduces this dependency by faulting executable code, yet still corrupts code that directly implements model computation, limiting their attack effect to inference depletion. We present JITterFlip, the first BFA targeting the host-side JIT serving control plane of GPU-based LLM inference. By faulting CPU-resident serving decisions rather than model computation, JITterFlip enables both gibberish output generation and a correct-output sponge attack. To identify exploitable targets in a large JIT compiler stack, JITterFlip develops a decision-guided fault-vulnerable code analysis. Across four text and multimodal LLM workloads, the identified vulnerable code faults exhibit cross-model transferability, produce gibberish outputs with PPL ratios of $15.45\times$ to $2.48{\times}10^{6}\times$, and demonstrate correct-output sponge attacks with latency amplification of $2.03\times$ to $181.90\times$. JITterFlip also bypasses recent BFA defenses for LLMs while retaining both attack effects. Last, we demonstrate end-to-end Rowhammer attacks across four LLMs: a single bit flip in CPU-resident branch code propagates across the CPU-GPU boundary to disrupt GPU-executed inference without direct access to GPU memory, reaching up to $7.23{\times}10^{6}\times$ PPL amplification or $124.97\times$ latency amplification while preserving the exact generated output.
Read the full abstract
Solar and Stellar Astrophysics
Type I Solar Radio Bursts Modulated by Solar Flares
Type I solar radio bursts (noise storms) are persistent meter-wave nonthermal emissions above active regions, with their occurrence and proper?ties closely related to the local magnetic configuration and nonthermal electron acceleration. This study examines a type I noise storm on 24 December 2023 and its relation to flare activity. The noise-storm source was co-spatial with active region AR 3529 and showed frequency-dependent spatial dispersion. The associated M2.9 flare strongly modulated the emission, with the storm intensity decreasing at flare onset, recovering afterward, and shifting to higher frequencies. Based on multiwavelength observations, we suggest that pre-flare small-scale reconnection supplied nonthermal electrons to overlying closed magnetic struc?tures and maintained the storm. During the flare, magnetic reconnection above the active region produced bidirectional plasma ejections and type III bursts with bidirectional frequency drifts; the gradually decreasing starting frequency of these bursts may indicate an upward-moving reconnection site. The resulting magnetic reconfiguration disrupted electron trapping and suppressed the storm, whereas post-flare magnetic recovery allowed the emission to resume. These results show that flares can modulate type I noise storms through magnetic restructuring and provide insight into the generation mechanism of noise storms.
Read the full abstract
Instrumentation and Methods for Astrophysics
Soft proton experiments supporting the development of astronomical X-ray instrumentation
Orbital soft protons can severely degrade the performance of astronomical X-ray observatories. On the one hand, they may cause permanent radiation damage to X-ray detectors; on the other hand, they introduce an irreducible background component. Our low-energy grazing-incidence scattering setup provides experimental data for the validation of radiation transport simulations used in the assessment of future X-ray missions. Recent measurements indicate that a significant fraction of protons scattered from X-ray optics undergo charge exchange and therefore cannot be mitigated by magnetic diverters. In addition, we present initial proton-transmission measurements through a thin X-ray filter and compare them qualitatively with TRIM simulations. Quantitative measurements of energy loss and charge-exchange fractions, together with comparisons with TRIM and Geant4, are planned. In this publication, we present the upgraded experimental setup together with commissioning measurements for grazing-incidence scattering and proton transmission through thin X-ray filters.
Read the full abstract
Strongly Correlated Electrons
Emergent Pair Density Wave and Incoherent Metallic State in a Strongly Correlated Doped System
We investigate the dynamical emergence of a state driven by the interplay between antiferromagnetism (AFM) and singlet $d$-wave superconductivity (SC) within a slave-rotor mean-field framework. By decomposing the electron into charge and spin degrees of freedom, the formalism captures strong-correlation effects beyond conventional mean-field approaches. A PDW order is found to emerge dynamically in the coexistence region of AFM and SC. The AFM-SC coexistence region is significantly modified with correlation, leading to a systematic shift of the tetra-critical point. The doping and temperature evolution of the AFM, SC, and PDW order parameters, together with the rotor condensate amplitude $\phi$, which characterizes charge coherence, shows a crossover from a coherent to an incoherent metal with the suppression of coherent quasi-particle spectral weight. Moreover, in the AFM + $(\phi \neq 0)$ region, coherent quasi-particle bands coexist with incoherent Hubbard-like excitations, whereas only incoherent spectral features survive in the AFM + $(\phi = 0)$ regime. The SC phase exhibits nodal quasi-particles consistent with $d$-wave pairing.
Read the full abstract
Number Theory
Wallis-type products with polynomial exponents and the Dirichlet beta function at negative integers
We develop a methodology for designing infinite products of rational blocks whose exponents are polynomials in the index $k$. Matching power sums of the slot constants through order $n$ forces the Type-$N$ product with binomial exponent $\binom{n+k-2}{n-1}$ to converge to a ratio of Vignéras multiple gamma values $\Gamma_n$; an analogue finder lifts any Type-1 evaluation to every higher type, and integer combinations of binomial exponents then realise arbitrary integer-valued polynomial exponents, yielding explicit products with exponents $k$, $k^2$, $k^3$, ... for constants such as $\pi/2$, $\sqrt{2}$, $e^{2K/\pi}$, and rational multiples of $\pi^{M!}$ (Part I). As the main application (Part II) we prove that for every positive integer $n$, a finite multiple-gamma template $\mathcal{S}_n$ with generalised Eulerian weights $T(n,k)$ (OEIS A225118) evaluates the Duke-Imamoğlu expression $\mathcal{D}_n = \beta'(-n) + (\log 4)\,\beta(-n)$. For odd $n$ this yields a convergent Wallis-Eulerian product for $e^{\beta'(-n)}$; for even $n$ the raw product diverges. The proof expands the template through the multiple-gamma functional equation, evaluates the quarter-integer coefficients in closed form, and identifies the resulting Eulerian-binomial sums with Duke's polynomials $P_{n+1,\ell}$.
Read the full abstract
Signal Processing
Identification of $dq$-Asymmetric Impedances as Complex Transfer Functions Using a Single Arbitrary Excitation
Cross-coupling between the $dq$ coordinates makes the identification of asymmetric grid impedances a challenging problem, particularly near the fundamental frequency where the asymmetric coupling is strongest. Existing schemes usually handle it either by perturbing the two coordinates sequentially, which lengthens the measurement, or by using a time-domain method with a global parametric model whose order must be tuned. This paper develops a single-shot active non-parametric frequency-domain method that avoids both. The equivalent impedance is parameterized by a pair of single-input single-output complex transfer functions. Each spectral line is fitted with a local rational model; the leakage and transient contributions are estimated, so that neither periodic steady-state excitation nor repeated excitation cycles are required. We give the exact finite-time discrete Fourier transform relation for the conjugate-coupled complex-signal model, and analyse the distortion that a stationary-frame filter placed ahead of the Park transform imposes on the identified pair. The method is validated on a controller hardware-in-the-loop platform against an analytically derived small-signal model, for a symmetric grid and for the same grid with an added grid-following converter that renders it asymmetric. Both complex transfer functions and all four real transfer functions of the $dq$ impedance are recovered over a wide band from a single one-second record of a random excitation, at 1 Hz resolution.
Read the full abstract
Computer Vision
Drift Calibration in Geometric Eye Tracking Systems
Geometric eye trackers can provide the spatial accuracy required for gaze-based interaction and multimodal studies, but their measurements remain sensitive to residual session-specific calibration error. Research on correcting this error is difficult to compare because methods are typically evaluated with different devices, target layouts, and error definitions. We present a calibration-focused dataset containing 163 trials from 12 participants, with separate 18-point fitting and 32-point test grids, and use it to evaluate global, local, and composite correction functions under a common spatial-extrapolation protocol. We further introduce a lightweight neural refiner that combines ranked predictions from complementary calibrators. On this controlled dataset, post-vendor correction reduces the mean angular error from $1.53^\circ$ to $1.03^\circ$ with the strongest classical composite and to $0.96^\circ$ with the refiner. In a closed-loop gaze task, lower residual error is associated with higher performance across four online correction conditions. These results provide a reproducible data-quality benchmark for using gaze as a behavioral signal in interactive modeling.
Read the full abstract
Computation and Language
Evaluating the Capabilities of LLMs for Persuasive Dialogue
Large language models (LLMs) can generate apparently highly persuasive text, but does sounding persuasive mean arguing well? We introduce Persuasio, a multi-agent dialogue platform grounded in a formal argumentation-based theory of persuasion dialogues that adjudicates logical winners during free-text debates. Using this system, we generated 192 debates on a UK political topic between humans and LLMs, and evaluated 22 interlocutors through both automated adjudication and 9,702 crowdsourced pairwise judgements across 1{,}386 annotation instances. We observed a consistent decoupling between subjective and formal persuasiveness: LLMs dominated the subjective ranking yet performed substantially worse under argumentation-theoretic adjudication, where humans remained competitive. Multi-agent and retrieval-augmented variants further widened this divergence. These findings reveal a systematic gap between rhetorical fluency and formal argumentative strength in LLM-based persuasive dialogues.
Read the full abstract
Cryptography and Security
Reactive Peripheral Modeling for Faithful Firmware Rehosting
Rehosting enables tight control and introspection for firmware testing, but existing approaches largely fail to reach deeper application states and cannot drive embedded protocol stacks beyond early-stage initialization. This limitation reflects a broader weakness in current rehosting techniques: their inability to faithfully model complex peripheral semantics and dependencies. In particular, existing work typically relies on passive approximations of peripheral behavior and overlooks three key aspects: (i) the interplay among interrupts, MMIO, and DMA; (ii) implicit state transitions within peripherals; and (iii) interactions across multiple peripherals. To address this challenge, we propose Reactive Peripheral Modeling (RPM), an abstraction that models hardware peripherals as reactive and stateful systems. RPM captures peripheral behavior using event-condition-action semantics, enabling faithful representation of interrupt, MMIO, and DMA scheduling, implicit state transitions, and cross-peripheral interactions. We implement RPM in Bluezz for BLE firmware rehosting and fuzzing, and show that reactive modeling is necessary to reach deep protocol states. We evaluate Bluezz on representative BLE stacks, including NimBLE, Zephyr, and Nordic SoftDevice, a closed-source commercial stack. Across 18 targets, Bluezz achieves an average basic-block coverage more than 2.6 times that of prior state-of-the-art rehosting approaches. Unlike prior approaches, which remain largely confined to advertising and scanning logic, Bluezz reliably exercises connected BLE states and uncovers five previously unknown vulnerabilities that manifest only after connection establishment. Finally, we show that RPM generalizes beyond BLE to other embedded firmware running on different MCUs.
Read the full abstract
Differential Geometry
Boundary Cases of the $J$-Equation: Divisorial Rigidity and a Global $C^0$ Estimate
We study two boundary cases of the stability condition for the $J$-equation. First, under the $J$-semistable condition, we show that the destabilizing prime divisors form an exceptional family in the sense of Boucksom, with a uniform numerical gap away from them. The related modified nef estimate can remove the $J$-big assumption in Liu's work~\cite{Liu2026Boundary}. Second, under the smooth boundary cone condition, we obtain a uniform global $C^0$ estimate for solutions of the approximating twisted $J$-equations. As a consequence, we construct a bounded-potential Bedford–Taylor solution of the $J$-equation, which is smooth outside the destabilizing prime divisors.
Read the full abstract
Statistical Methodology
A Unified Approach to Interpretable Causal Root Cause Attribution
Understanding why a target metric changes is a fundamental problem in data-driven decision making, beyond anomaly detection alone. We study root cause attribution for metric changes in complex e-commerce systems, focusing on trade-offs between interpretability, efficiency, and causal validity. As a starting point, we extend a metric-decomposition method into a recursive metric-tree framework for multi-level root cause analysis, but this relies on independence and decomposability assumptions that miss complex causal dependencies. In contrast, graphical causal models (GCMs) relax these assumptions and improve causal validity, at the cost of interpretability, higher computational and data demands, and potential attribution target misalignment. Through real-world applications, mathematical proofs, and simulations, we characterize the fundamental sources of these trade-offs. Guided by these insights, we propose a unified, causally informed attribution approach that integrates structural causal information into the metric-tree decomposition framework and corrects key sources of misalignment in GCM-based causal attributions, substantially improving causal validity while preserving interpretability and fast computation. Analytical proofs and simulations demonstrate that the proposed approach produces more accurate root cause attributions, and we also present a real-world application.
Read the full abstract
Quantum Physics
The quantum supremum of the $I_{3322}$ Bell inequality is not attained in finite dimension
In 2010, Pál and Vértesi found a family of finite-dimensional strategies for the $I_{3322}$ Bell inequality whose optimized values appeared to converge as the local Hilbert-space dimension grew. They conjectured that this limit is the supremum over all finite-dimensional quantum strategies, but that no finite-dimensional strategy attains it. We prove both claims. The proof uses the symmetry of the Bell functional to associate every strategy with a finite matrix of probabilities, one for each pair of spectral subspaces of Alice and Bob. This matrix gives an upper bound on the Bell value, and finite-dimensional strategies built from the repeating structure found by Pál and Vértesi approach it as the dimension grows. If the bound were attained exactly in finite dimension, the optimality conditions would then require a state that cannot be normalized. Consequently, the set of finite-dimensional quantum correlations is not closed in the $(3,3,2,2)$ scenario, the smallest Bell scenario where this can happen. Moreover, approaching the supremum requires unbounded local dimension. The core of the proof was formalized in Lean~4.