Statistical Methodology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 28 August
Relational Event Models (REMs) provide valuable insights into the dynamics of longitudinal social networks. Yet, the vast availability of potential predictors for a dyad's event rate poses the risk of selecting irrelevant variables and specifying an overfitted model that does not generalize to new data. Despite the recent popularity of Bayesian regularization methods to address this, there has not been a systematic evaluation of the performance of Exact Bayesian Regularization (EBR) and Approximate Bayesian Regularization (ABR) against standard Maximum Likelihood (ML) procedures commonly used for REMs. To address this, we conduct a simulation study in which directed Relational Event History (REH) data is generated with endogenous and exogenous effects of varying strength and compare the performance of (a) unregularized ML estimation, (b) ABR through normal approximations of the likelihood with Ridge and Horseshoe priors, and (c) EBR with Horseshoe priors. We find that threshold-based criteria applied to ABR and EBR with Horseshoe priors outperform univariate selection using p-values from ML estimation in variable selection accuracy. Regarding predictive performance, ABR with Ridge priors and EBR with Horseshoe priors outperform ML REMs, particularly for small sample sizes. Given only small gains with large computational burdens when using EBR, we therefore advise researchers to use ABR with a suitable prior.
Quantum Physics
Optomechanical inertial reference for atom interferometry
Atom interferometers are among the most sensitive inertial sensors, yet deployment outside the laboratory is limited by vibration noise, conventionally mitigated by external sensors or bulky isolation. Here we demonstrate a hybrid inertial sensor which fuses an optomechanical resonator and an atom interferometer by exploiting the resonator's test mass as the interferometer's reference mirror. This allows for better correlation than with two separate sensors, whose unknown transfer function is replaced by the static response of one mechanical element. The resonator achieves a displacement sensitivity of $8.6\cdot 10^{-15}$ m/$\sqrt{\mathrm{Hz}}$ with suppressed 1/f noise and yields a minimum acceleration sensitivity of $1.1\cdot10^{-6}$ m/s$^2$/$\sqrt{\mathrm{Hz}}$ over a bandwidth extending from sub-Hertz to 2.5 kHz. Under ambient laboratory conditions the integrated system removes vibration-induced phase ambiguity for accelerations up to $50\cdot 10^{-3}$ m/s$^2$ and reaches the interferometer's technical noise limit, which a commercial force-balance accelerometer does not. Because the resonance-tracking readout is largely independent of the mechanical design, the architecture transfers directly to other precision sensing platforms.
Read the full abstract
Nuclear Theory
Implications of relativistic corrections on high-momentum nucleon-transfer reactions
High-momentum components (HMCs) of nuclear wave functions, governed by short-range nucleon-nucleon correlations, provide essential insights into nuclear structure beyond the mean-field picture. High-energy (p, d) reactions offer access to these HMCs, but their theoretical treatment requires relativistic corrections when incident proton energies reach several hundred MeV. Although effects of relativistic kinematic corrections (RKCs) have been studied in several types of direct nuclear reactions, it has not been systematically studied in nucleon transfer reactions. Here, RKCs are incorporated into the adiabatic distorted wave approximation (ADWA) for (p, d) reactions by redefining particle masses in the zero-momentum frame. The approach is validated against proton elastic scattering data on 16O from 135 to 800 MeV using Dirac global optical model potentials, and then applied to (p,d) reactions on 12C, 16O, and 40Ca at incident energies from approximately 50 to 800 MeV. The RKCs yield neutron spectroscopic factors that are significantly more consistent across the entire energy range than those obtained from non-relativistic calculations, which systematically overestimate spectroscopic factors obtained at high incident energies. The present analysis demonstrates that relativistic kinematic corrections are of fundamental importance for the reliable extraction of spectroscopic factors and the accurate description of high-momentum nucleon-transfer reaction data.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Follow-up of SN 2025wny III: Spectroscopic Time-delay Measurements of a Strongly Gravitationally Lensed Superluminous Supernova
We present spatially resolved spectra and infer the time-delays between the multiple images of the strongly gravitationally lensed superluminous supernova (SLSN) 2025wny at z=2.015. SN 2025wny is the first known spatially resolved strongly lensed SLSN and provides a unique opportunity to measure lensing delays through the temporal evolution of supernova spectra. We present a spectroscopic dataset spanning several months, including spatially resolved spectra of images A, B, C, D, and E. We identify and measure the wavelength evolution of spectral features using Gaussian-process modeling. The time delays are inferred by jointly fitting the temporal evolution of the spectral features, yielding $\Delta t_{AB}=-10.3 \pm 2.3$, $\Delta t_{AC}=0.1 \pm 3.6$, $\Delta t_{AD}=-65.7 \pm 3.5$, and $\Delta t_{AE}=3.7 \pm 8.8$ days (68% confidence intervals). These are the among most precise time-delay measurements obtained for a lensed supernova to date, whether from spectroscopic or photometric methods. The longest delay ($\Delta t_{AD}$) is particularly well constrained, with a ~5% precision. Combined with the lens model presented by Mörtsell et al. (2026), the spectroscopic time-delays give a Hubble constant $H_0 = 70.2^{+8.2}_{-6.1}$ km/s/Mpc. Our analysis demonstrates that spectroscopic evolution provides an independent and complementary route to time-delay measurements in lensed supernova systems, avoiding reliance on photometric light curves alone. As future surveys discover larger samples of lensed supernovae, spectroscopic time-delay measurements will provide an important avenue for precision cosmography.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Follow-up of SN 2025wny II: Superluminous Supernova Physics at Cosmic Noon
SN 2025wny is a gravitationally lensed, hydrogen-poor superluminous supernova (SLSN-I) at z = 2.015. To date, it is the most extensively observed high-redshift core-collapse SN and has the most detailed rest-frame UV observations of any SLSN. We present densely sampled rest-frame UV-to-optical photometry and spectroscopy out to +80 d post-peak (rest frame) from several facilities, including JWST, Keck, VLT, Gemini, the Palomar 200-inch, the Fraunhofer Telescope at Wendelstein, and the Liverpool Telescope. Correcting for lensing magnification, SN 2025wny reaches a peak pseudo-bolometric luminosity of $L_{\rm peak}\gtrsim4\times10^{44}$ erg s$^{-1}$ over rest-frame 1500-4230 Å, placing it within the luminosity range of typical SLSNe-I. SN 2025wny exhibits several unusual features, including a continuum excess and sharp spectral features in the FUV from +20-60 d that coincide with an FUV light-curve plateau and higher inferred blackbody temperatures. SN 2025wny's spectra also show little to no UV line blanketing, no obvious O II absorption despite high temperatures, and evidence for C II, H$\alpha$, and possible He I. Light-curve modeling suggests that SN 2025wny may require a hybrid or non-standard power source. This work provides some of the first detailed constraints on high-redshift SLSNe and establishes SN 2025wny as an essential spectral and photometric reference for identifying and interpreting high-redshift SLSNe discovered by Rubin and Roman.
Read the full abstract
Classical Analysis and ODEs
A unified approach via Geronimus transformation to various types of orthogonal polynomials
We present a unified Geronimus-type construction that leads to various orthogonal polynomials including indefinite orthogonal polynomials, exceptional and, more generally, lacunary orthogonal polynomials, and multiple orthogonal polynomials. We use generalized Hermite polynomials to demonstrate the idea and obtain various results for the Geronimus-type transformation such as zero location, recurrence relations, and differential equations.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Follow-up of SN 2025wny I: Space-based Observations of the First Multiply-imaged Superluminous Supernova
We present space-based follow-up observations of the superluminous Type I supernova (SLSN-I) SN 2025wny at redshift $z_{SN}=2.0151$, gravitationally lensed by two galaxies at redshifts $z_{G1}=0.3755$ and $z_{G2}=0.3766$ into five resolved images. SN 2025wny is the first strongly lensed SLSN discovered and the first galaxy-scale lensed supernova for which both photometric and spectroscopic time-delay measurements are feasible. As such, it opens a new observational window for precision cosmology and the study of stellar explosions near the epoch of peak cosmic star formation. Our follow-up observations comprise two epochs of Hubble Space Telescope (HST) imaging, together with near-infrared imaging and spectroscopy obtained with the James Webb Space Telescope (JWST). From these data, we measure precise astrometry and multi-band photometry for the five resolved supernova images, the host galaxy, and the two deflecting galaxies. HST provides accurate relative image positions and rest-frame ultraviolet photometry, while JWST delivers complementary near-infrared imaging and spectroscopy probing the rest-frame optical at high signal-to-noise ratio. Together they yield a detailed characterization of both the lensing configuration and the supernova spectral energy distribution over a broad wavelength range. The data presented here provide the observational foundation for the accompanying analyses of the supernova properties, lens modeling, and time-delay cosmography, including the astrometric, photometric, and spectroscopic information required to measure $H_0$.
Read the full abstract
Cryptography and Security
Exploiting Per-Core Leakage: Electromagnetic Side-Channel Monitoring of Multicore Architectures
Multicore processors are increasingly adopted in embedded systems to meet growing performance demands. However, physical side-channel analysis of multicore architectures remains underexplored, as obtaining usable leakage is inherently challenging. Consequently, side-channel security research on such systems has lagged far behind, leaving a critical security gap. To address this gap, we reveal the electromagnetic leakage mechanisms in multicore architectures and, for the first time, demonstrate per-core leakage exploitation, thereby enabling physical side-channel analysis for these systems. As a practical extension, we present a non-intrusive side-channel monitoring method that achieves per-core granularity. To validate its feasibility and practicality, we implement a prototype on a heterogeneous SoC platform with an RF front-end, and evaluate on a commercial off-the-shelf quad-core embedded system, the Raspberry Pi 4B with ARM Cortex-A72 cores.
Read the full abstract
Cryptography and Security
LongPIBench: A Long-Context Benchmark for Prompt Injection
Prompt injection attacks pose a serious security risk to large language models in real-world applications. However, existing prompt injection benchmarks primarily focus on short-context inputs, leaving the attacks and defenses in long-context settings largely unexplored. This gap leads to a substantial overestimation of the effectiveness of current defenses. In this paper, we bridge the gap by introducing LongPIBench, a long-context benchmark for prompt injection covering 4 realistic application scenarios: paper peer review, resume screening, code review, and email summary. For each scenario, we construct a synthetic dataset and a real-world dataset, with context lengths ranging from thousands to tens of thousands of tokens. The evaluation results on LongPIBench reveal significant vulnerabilities of prompt injection defenses under long-context settings: even simple heuristic prompt injection attacks achieve high success rates and frequently bypass state-of-the-art defenses. We hope LongPIBench can serve as a practical benchmark for systematically evaluating prompt injection defenses in realistic long-context scenarios.
Read the full abstract
Differential Geometry
Mean curvatures and symmetry of convex hypersurfaces
Let $M^n$ be a $C^2$ closed convex hypersurface in Euclidean space, and $\sigma_m$ be its $m$th mean curvature. We show that $M$ is symmetric with respect to a hyperplane orthogonal to a given direction $e$, if $\sigma_m(p)\leq\sigma_m(q)$ whenever $p-q$ is parallel to $e$. For convex hypersurfaces, this settles a conjecture of Li, extends the mean-curvature theorem of Li-Yan-Yao to all $\sigma_m$, and strengthens some earlier results of Li-Nirenberg by removing nondegeneracy assumptions. The proof is based on the theory of mixed volumes, specifically the rigidity of quermassintegrals under Steiner symmetrization.
Read the full abstract
Robotics
Cooperative Risk-Aware Exploration in Heterogeneous Multi-Robot Systems Using Algorithmic Altruism
Multi-robot systems are well-positioned for exploration in hazardous environments, but effective deployment requires deciding not only where robots should gather information, but also how risk should be distributed across heterogeneous team members. This paper develops a game-theoretic framework for cooperative risk-aware exploration based on ecologically inspired altruistic behavior. Each robot selects a finite-horizon trajectory to maximize information gain while penalizing redundant exploration and expected hazard exposure. Heterogeneity is introduced through agent-specific value parameters for encoding altruistic coupling, which is modeled through relatedness weights inspired by Hamilton's rule. We introduce a game-theoretic structure for trajectory planning that defines a Social Nash Equilibrium, which modifies the utility of agent actions according to agent relatedness. This utility shaping causes agents to internalize the effect of their trajectory choices on teammates, encouraging lower-valued robots to accept risk when doing so benefits higher-valued agents and improves team performance. We define an exploration utility for agents that rewards area coverage and uncertainty reduction, while also penalizing redundancy and risk, enabling projected gradient-based waypoint optimization in a receding-horizon planner. Simulations show that altruistic planning reduces redundant exploration, improves inter-robot separation, and reallocates risk according to agent value while maintaining comparable map coverage. We further demonstrate the approach in hardware experiments, where planned waypoints are tracked by wheeled robots using single-integrator controllers and barrier certificates.
Read the full abstract
Machine Learning
SymboLLM-FE: LLM-Accelerated Symbolic Regression for Automated Feature Engineering on Tabular Data
Tabular data, as a core data format in machine learning, often lacks the discriminative power needed for high-performance modeling due to insufficient feature informativeness. Automated Feature Engineering (AutoFE) overcomes this by automating feature generation and selection, ensuring both model performance and operational efficiency. However, traditional AutoFE often yield features with poor interpretability because they rely on blind mathematical transformations, while large language models (LLM)-based AutoFE faces challenges in requiring costly multi-round iterations to generate high-utility features to effectively enhance model performance, compounded by inherent risks of bias and hallucination. In this paper, we combine symbolic regression with LLMs for feature engineering (SymboLLM-FE) to solve these challenges. We extract mathematically expressive formulas strongly correlated with the target via symbolic regression, which can enhance model performance, then refine them by LLMs with rich prior knowledge to ensure interpretability. Empirical results on six real-world datasets and four Kaggle competitions demonstrate that SymboLLM-FE outperforms existing AutoFE. SymboLLM-FE also addresses the dual challenges of poor interpretability and numerous iterations by employing a statistical prior-grounded LLM refinement mechanism and single-digit LLM calls.
Read the full abstract
Computation and Language
A Unified Framework to Elicit Structured Feedback for Interpretable Multi-Trait Essay Scoring
Multi-trait Automated Essay Scoring (AES) requires rubric-grounded reasoning across interdependent traits, rather than isolated score prediction. Existing feedback-enhanced methods often decouple feedback from scoring or assess traits independently, weakening score–feedback consistency and rubric alignment. We propose HiFTS, a unified autoregressive framework that generates hierarchical CoT feedback before predicting trait-level and holistic scores. HiFTS distills rubric-grounded hierarchical CoT feedback from a teacher LLM and trains student models to jointly generate feedback and scores. HiFTS further applies Group Relative Policy Optimization with a composite reward balancing score agreement, calibration, feedback quality, and structural validity. At inference, a lightweight global prior provides holistic guidance to reduce drift during long-form reasoning. We also introduce CFMS-34, a Chinese multi-trait AES dataset with 951 essays annotated with holistic scores and 34 rubric-based traits. Experiments on CFMS-34 and ASAP++ show that HiFTS achieves strong holistic and trait-level scoring while producing coherent, rubric-aligned feedback.
Read the full abstract
Computer Vision
Post-Training VLMs for Video Mistake Detection
Human mistakes are inevitable when following instructions, yet they can lead to severe consequences. As such, there has been an increased interest in developing methods for detecting mistakes in videos, with current methods mostly focusing on closed-set protocols. While successful in controlled settings, the closed-set assumption limits their wider applicability, as any changes to the task require collecting new data and re-training models. Instead, we argue that mistake detection methods should learn the general concept of a mistake, rather than overfitting to step-specific details. To reflect this, we introduce the Mistake Detection Video Question Answering (MD-VQA) protocol and accompanying benchmark. MD-VQA tests whether methods can discern if a step was executed correctly with respect to its description, for both seen and unseen actions. To address this important challenge, we propose the first video-language-model post-training technique for mistake detection. Our method uses a tailored reward function to encourage the model to identify discrepancies between an instruction and the corresponding video. Extensive evaluations demonstrate that this approach outperforms zero-shot, supervised fine-tuning, and post-training baselines. Notably, our method generalizes especially well to unseen procedures, for instance, with an improvement of up to 11.6% over the best-performing baseline on EP-VQA, paving the way toward general mistake detection. We release our code and benchmark at https://github.com/FedeSpu/mstk.
Read the full abstract
Computation and Language
CultureConverse: A Multilingual Multi-turn Simulation Harness for Culturally Grounded Assistance in East and Southeast Asia
Current cultural evaluations for large language models (LLMs) often reduce culture to single-turn factual recall via MCQs, failing to capture a common use case: users seeking practical help over multiple turns in culturally grounded scenarios. We introduce CultureConverse, a scalable, multilingual simulation and evaluation harness for culturally grounded assistant dialogue that covers 10 East and Southeast Asian regions, 58 subgroup identities, and 7 domains. Each simulated and evaluated episode produces a scored interaction where the assistant assists the user and infers cultural constraints from partial information. The resulting CultureConverse-DS dataset contains 14,610 benchmark (evaluation) episodes and 274,295 oracle-guided (gold-mode) dialogues. In our benchmark evaluation of 18 models, GPT-5 mini achieves the highest assistance quality. Human annotation experiments suggest that our evaluation framework is a sufficient proxy for human judgment. Performance gains from fine-tuning on 27,860 high-quality CultureConverse-DS samples improve in-domain assistance and transfer out-of-domain to cultural MCQ and safety classification benchmarks. We release the harness, both splits, and judge prompts to support interactive evaluation of cultural competency.
Read the full abstract
Computer Vision
How Far Can 5,500 Hours of Driving Take You? A Scaling Law Analysis of Video Diffusion Models
Video generation for autonomous driving cannot follow the web-scale route: driving data is expensive to collect, bound by privacy requirements, and cannot be scraped at will, so models must make the most of a fixed corpus. We present a systematic scaling-law study of video diffusion models trained from scratch on driving data: a family of models from 1M to 9B parameters, trained at different exposures on up to 5,500 hours of driving. Validation loss follows consistent power laws in both model size and training exposure, answering the questions that shape a training budget: whether compute is better spent on longer training or on a larger model, and whether more data is needed. Loss improves much faster with training exposure than with model size, making longer training the most effective way to improve a fixed model under limited compute. However, larger models continue to achieve lower asymptotic loss, so compute-optimal scaling still favors increasing model size when sufficient compute and data are available. Guided by these laws, we train a 9B-parameter model, to our knowledge the largest video diffusion model trained from scratch on driving data: it sets a new open-source state of the art for driving video generation, as measured on nuScenes. Our code and pretrained models are available at https://github.com/valeoai/VATIX. NATIX is separately releasing the underlying driving data in stages.
Read the full abstract
Software Engineering
Recovering Software Architecture Intent from Historical Work Items using Generative AI: A Mixed-Methods Industry Case Study
Software architecture is often only partially captured in code, while much of the design intent lives in evolving project artifacts. In agile projects, work items, user stories, and related tracking documents preserve valuable traces of that intent, but they rarely support direct architectural analysis. This work investigates the recovery of C4 architecture diagrams from historical agile work items using an LLM-based pipeline. The semi-automatic five-step workflow employs a prompt chain, bidirectional traceability, and Chain-of-Thought reasoning to transform unstructured Azure DevOps work items into visual artifacts. Evaluated on two industry projects, we use a mixed-methods design combining qualitative expert interviews with a quantitative stability analysis. Practitioners perceive the generated architectural baselines as accurate and highly useful for system comprehension. Strictly bound by their input data, the artifacts mirror the documented intent, thereby surfacing discrepancies and architectural drift when compared to the implemented reality. Quantitatively, the workflow exhibits high stability for architectural entities but lower stability for their relationships, with relative variance compounding across generation steps. The proposed workflow demonstrates the practical viability of LLM-assisted architectural recovery based on development process artifacts.
Read the full abstract
Artificial Intelligence
VERA-8B: Evidence-Grounded Audit Risk Reasoning from SEC Filings
Across audit applications, judgments must be supported by reasonable evidence. However, standard financial language models prioritize fluency over evidence. They are built for general financial reasoning and may produce plausible but ambiguous answers, creating a grounding gap that makes them unsuitable for audit work. We address this gap with VERA-8B, a new end-to-end audit reasoning system that identifies audit risks before enforcement actions occur. Constructing such a model raises several challenges, as no prior machine learning work targets pre-enforcement audit prediction. To our knowledge, we are the first to unify SFT and GRPO for evidence-grounded audit reasoning under one evidence standard, achieving performance that surpasses all evaluated baselines. Because auditing cannot tolerate unsupported claims, we introduce abstention and uncertainty qualification to defer uncertain or evidence-incomplete cases. Finally, we design an AuditBridge to ground model reasoning for practical audit work. It transforms raw filings into verified records and then into reviewer-ready reports, bridging finance and computation with broad generality. Together, these components produce auditable, review-ready outputs suitable for practical audit work.
Read the full abstract
Quantum Physics
Energy Internet Routing using Quantum Optimization Algorithms
The Energy Internet (EI) is a new concept aimed at enhancing the integration of renewable energy sources with the energy grid. Energy-efficient path selection in EI is NP-hard. This research presents an innovative Quadratic Unconstrained Binary Optimization (QUBO) and Ising Hamiltonian formulation for energy routing. The validation and scalability of the proposed formulation were evaluated by applying quantum-inspired annealing and quantum gate optimization to two case studies, a 9-node and a 30-node EI network. A comparative analysis was presented between classical optimization using the Dijkstra algorithm, optimization-based methods, and QAOA using the Qiskit Sampler Primitive, NumpyEigenSolver, and quantum-inspired annealing using the Ocean exact Solver, D-Wave Tabu Sampler, and D-Wave Simulated Annealing. Simulation results based on the proposed formulation agree with the exact solution, while the runtime of classical approaches is less than that of quantum approaches. However, the Simulated Annealing sampler offers the shortest runtime among all quantum methods.
Read the full abstract
Cryptography and Security
When Verified Source Becomes Attack Input: Defending Smart Contracts Against LLM-Based Vulnerability Scanning
Smart contracts are financial programs deployed on blockchains to manage digital assets. To build trust with users and investors, smart contract projects typically publish their source code on blockchain explorers and verify it against the deployed bytecode, making the on-chain program accessible through a human-readable implementation. However, LLM agents are changing the threat model of this disclosure mechanism. By leveraging publicly disclosed source code, recent agent workflows make it increasingly practical to scan contract vulnerabilities for exploits at large scale. In this paper, we propose DeLLMGuard, a smart contract deployment framework that defends against malicious LLM-based vulnerability scanning while preserving public source disclosure and authorized auditing. DeLLMGuard can separate disclosed source code from runtime execution through multiple contract addresses in a real-world blockchain environment. LLM agents must therefore recover additional proxy, delegate, and factory relations before vulnerability analysis. A built-in Verification Layer checks deployment relations, runtime bytecode, source code, and state changes to ensure that the transformation preserves the original business implementation. We evaluate DeLLMGuard on 387 real-world vulnerable contracts with three LLM agents in an environment derived from SCONE-bench. DeLLMGuard reduces overall root-cause correctness from 23.5% to 6.6% and outperforms the closed-source bytecode baseline on the primary non-proxy set. Trace and ablation analyses further show that agents often recover downstream contracts but still fail to identify the vulnerability, indicating that cross-contract recovery remains a major challenge for automated LLM scanning.
Read the full abstract
Artificial Intelligence
RetailAgent: Structured Adverse Timing in Self-Conditioned Multimodal LLM Trading Agents
In financial markets, a sequential policy that reacts systematically to price movements may become predictable to other market participants. This paper studies whether large language model (LLM) agents exhibit such directional structure through RetailAgent, an experimental framework in which an LLM observes anonymized intraday equity price histories and permitted state, then repeatedly chooses long (hold the stock) or flat (stay out) before the subsequent interval return is revealed. We compare returns during long and flat intervals along the same stock's intraday path after removing the overall fraction of long decisions. This exposure-matched measure reveals persistent negative timing across modality, horizon, state, and model family. Shuffling saved action sequences substantially attenuates the effect, showing that alignment between actions and subsequent returns drives the negative score. Feeding self-authored memories into decisions further increases policy persistence, while timing becomes more negative among stock-days on which the agent uses both actions. These results reveal stable, recoverable directional structure in sequential LLM financial decisions and a behavioral signal for studying how another participant could respond to a predictable policy.
Read the full abstract
Mesoscale and Nanoscale Physics
Quantum transport and unified scaling law in graphene with polyadic Cantor electrostatic barriers
We study the quantum transport of Dirac electrons in graphene subjected to a polyadic Cantor-structured electrostatic potential. Using the superperiodic potential formalism, we obtain a closed-form expression for the transmission probability. As the Cantor stage increases, the transmission spectrum evolves from a sparse set of superlattice resonances to a near-transparent regime, with the polyadic order setting the rate of this evolution. The angular response depends on the doping configuration, showing distinct behavior in the $n$–$n$–$n$, $n$–$p$–$n$, and Dirac-point cases. In the near-transparent regime, the transmission follows double-logarithmic scaling laws with respect to four independent control parameters: the Cantor stage, the potential height, the initiator length, and the angle of incidence. By combining these individual scaling relations, we establish a unified scaling law governing quantum transport. These results show that the hierarchical self-similarity of the potential governs the transport properties of such systems.
Read the full abstract
Computational Finance
Market-Informed Valuation of GMMB Riders with Surrender Options under a Heston Stochastic-Local Volatility Model
We develop a market-informed valuation framework for guaranteed minimum maturity benefit (GMMB) riders with rational surrender under the Heston stochastic-local volatility (SLV) model. The guarantee is written on the fee-deducted account value and is considered both in its terminal-only form and in the presence of early surrender rights. The Heston SLV specification combines stochastic volatility with a leverage function calibrated to a prescribed local-volatility surface. The leverage surface is obtained through a forward Markovian-projection equation so that, at the model level, the SLV dynamics are constrained to the same one-dimensional marginals as the corresponding local-volatility (LV) model. The latter is used only as a one-factor benchmark, allowing us to isolate the effect of stochastic volatility on continuation values and surrender decisions while preserving the same option-calibrated local-volatility target. We derive the associated backward pricing equations and propose a hybrid tree/finite-difference algorithm for the SLV model with a calibrated leverage function. Synthetic experiments and a market-informed case study show that SLV and LV valuations are numerically close for terminal-only guarantees, as expected from the common marginal target, whereas materially larger differences can arise once surrender is allowed. These differences are reflected in guarantee values, fair insurance fees and volatility-dependent surrender regions. The results indicate that matching one-date marginals implied by vanilla-option prices does not eliminate model risk for insurance liabilities whose value depends on conditional continuation dynamics and endogenous surrender decisions.
Read the full abstract
Software Engineering
Sustainability of Open-Source Machine Learning Robustness Assessment Tools: A Repository Mining Study
Robustness evaluation is essential for deploying machine-learning (ML) systems in real-world settings, where models may face adversarial perturbations, distribution shifts, and other operational stressors. Many open-source tools, including Adversarial Robustness Toolbox, Foolbox, and Robustness Gym, support robustness testing and evaluation. However, little is known about how these tools are maintained, publicly engaged with, and sustained over time, even though practitioners may rely on them to select evaluation dependencies, reproduce robustness assessments, and provide evidence for AI assurance. We present an empirical study of the open-source robustness tooling ecosystem. Starting from a curated seed set derived from prior work, we systematically searched GitHub and identified 28 robustness-tool repositories. We analyzed repository artifacts to characterize observable community engagement, maintenance activity, and project longevity using established software-engineering metrics. Our results show that engagement and maintenance are unevenly distributed, with sustained activity concentrated in a small subset of repositories. At the data collection date of January 21, 2026, five repositories were classified as active, 22 as inactive, and one as archived. These findings highlight the need to treat robustness tools as evolving software systems.
Read the full abstract
High Energy Astrophysical Phenomena
Astrophysical Sensitivity Projections for the IceCube Upgrade
Embedded in the South Pole's glacial ice, IceCube detects neutrino-induced Cherenkov light using an array of digital optical modules equipped with single photomultiplier tubes (PMTs). The new extension installed in 2025/2026, the IceCube Upgrade, introduces densely instrumented multi-PMT optical modules within the existing infill array known as IceCube DeepCore. It is expected to enhance sensitivity in the GeV regime, with commissioning of the detector expected to be complete by the end of 2026. We present the projected sensitivities of the IceCube Upgrade for three key analyses: neutrino transient searches, steady emission from point sources such as NGC 1068, and diffuse emission from the Milky Way. These case studies represent direct extensions of current IceCube analyses. Using new Monte Carlo datasets, we demonstrate that the IceCube Upgrade achieves order-of-magnitude improvement in sensitivity at low energies ($\lesssim 10$ GeV) for time-dependent sources across short timescales. Conversely, for time-independent searches, the relative impact of the IceCube Upgrade's low-energy data is diluted by the decade-long accumulation of high-energy archival data. Nevertheless, we project significant improvements for soft-spectrum sources especially across the southern sky, driven by the IceCube Upgrade's superior background rejection capabilities. The improved sensitivity at low energies for both transient and steady sources will open up an expanded discovery window for IceCube in the GeV band over the next decade.
Read the full abstract
Cryptography and Security
BEACON: Behavior-Anchored Cross-Source Knowledge Graph Construction for Cyber Threat Intelligence
Cyber threat intelligence (CTI) is foundational to modern cyber defense, yet much of it resides in unstructured reports whose volume and heterogeneity far exceed manual analysis, motivating research on automatically constructing knowledge graphs from CTI reports. However, existing approaches mainly extract partial information within a single report, leaving the cross-source setting unexplored, where the same threat is given unrelated names. Our key insight is that attack behaviors, once mapped to MITRE ATT&CK (a standardized catalog of attack techniques), can anchor the rest of a report. Attack behaviors are the adversarial actions a report describes, while contextual entities (e.g., threat actors, campaigns, and affected products) and Indicators of Compromise (IoCs; e.g., IP addresses) are their participants and traces. Attaching them to these anchors places every per-report graph in one canonical space. We realize this insight in BEACON, an LLM-driven framework for cross-source CTI knowledge graph construction. Its first stage extracts each report into a graph under a propose-then-verify paradigm, grounding candidates in report evidence and official ATT&CK definitions, to suppress LLM misclassification and hallucination. Its second stage merges these graphs with a hierarchical alignment strategy that applies signals in decreasing order of determinism, from character-level and semantic similarity to overlapping technique neighborhoods, iterating as merges pool neighborhoods. No existing benchmark links entities to technique anchors or provides cross-source alignment ground truth. We therefore construct and release two human-annotated datasets from 34 sources: to our knowledge the largest for report-level CTI extraction (8,395 elements) and the first for cross-source consolidation (3,487). On them, BEACON outperforms all baselines by at least 23% and 9%, respectively.
Read the full abstract
Artificial Intelligence
Timing-Aware Repurchase Prediction for Web-Scale E-Commerce: Survival Models for Multi-Surface Grocery Recommendation
Repurchase recommenders in e-commerce are commonly framed as a binary question asking "will this customer buy this item within W days", a formulation that requires a separately trained model for every horizon of interest. We replace this stack with survival models that predict time-to-repurchase directly, and evaluate them on millions of customers from a major grocery e-commerce platform across more than thirty ablation configurations. Our study makes three contributions. First, an empirical hazard analysis reveals a slightly decreasing marginal hazard (k ~ 0.9), differing from the common intuition that grocery items become more likely to be repurchased the longer since the last purchase (increasing hazard, k > 1). Log-Normal achieves the best marginal fit (R^2 = 0.998) and the best ranking, despite Weibull providing the best conditional residual fit, revealing an apparent discrepancy we analyze in detail. Second, a single Accelerated Failure Time (AFT) model replaces three per-horizon binary classifiers, matching or exceeding each at its own horizon while using roughly 3x fewer total trees. Feature importance reshuffles under the survival objective: channel-cadence and recency signals rise while aggregate frequency counts fall. Third, a 4-parameter parametric calibration maps raw survival CDFs to per-horizon probabilities with zero cross-horizon monotonicity violations. Calibration quality varies by an order of magnitude across the AFT family: Exponential AFT (Weibull k=1) achieves expected calibration error (ECE) ~1e-4, roughly 10x lower than Log-Normal, while ranking metrics agree within 0.3% relative. We adopt Exponential AFT for probability-consuming surfaces and Log-Normal for pure ranking, exposing a principled calibration-ranking trade-off within a single AFT family.
Read the full abstract
Analysis of PDEs
Qualitative analysis of energy ground states for magnetic focusing Gross-Pitaevskii equations
We prove the uniqueness, asymptotics, symmetry, and orbital stability of energy ground states for 3D magnetic Gross-Pitaevskii equations under mild conditions on the electric potential and magnetic field. In particular, both the electric potential and the magnetic field are allowed to have singularities, and we cover in a unified approach the physically relevant Aharonov-Bohm magnetic field as well as the constant magnetic field. Since we are in the 3D case, the unique energy ground state (up to a phase factor) is obtained as a local minimizer, rather than a global one, by restricting the kinetic energy of candidate critical points within a suitable range. The qualitative analysis of the energy ground state we carry on is mainly based on a related Pohozaev identity, the implicit function theorem, and variational methods.
Read the full abstract
Logic in Computer Science
Adaptive Strategies for GR(1) Games
We consider two-player GR(1) games on graphs, where the system player Eve must satisfy \[ \Box\Diamond A_1\land\cdots\land\Box\Diamond A_m \;\implies\; \Box\Diamond G_1\land\cdots\land\Box\Diamond G_n \] against the environment player Adam. Here $A_1,\ldots,A_m$ are assumptions on the environment, $G_1,\ldots,G_n$ are guarantees the system must provide, and $\Box\Diamond S$ denotes “always eventually $S$”. Traditional static strategies are overly conservative: they may actively violate assumptions to trivially satisfy the implication, or abandon all guarantees when any assumption is violated. Existing methods to prevent such behaviors incur doubly exponential blowup. We introduce an adaptive framework treating Adam as a non-adversarial agent with unknown objectives. Eve monitors which assumptions Adam actually meets and adapts her strategy at runtime to maximize satisfied guarantees. Central to our approach is a novel algorithm for monitoring liveness properties $\Box\Diamond S$, enabling Eve to maintain real-time likelihood estimates of which assumptions will be fulfilled. Eve pre-computes strategies optimal for different assumption subsets, deploying a probability distribution over them that dynamically adjusts based on monitor outputs. We prove that when assumptions are violated, Eve's randomized adaptive strategy converges asymptotically to the deterministic strategy maximizing guarantees. A prototype demonstrates effectiveness and superior computational performance compared to the state of the art.
Read the full abstract
Quantum Physics
A Single Spin Switches the Steady-State Phase of an Open Quantum System
Changing a many-body system by one constituent is normally expected to produce only a vanishing correction to an intensive observable. Here we show that, above a critical dissipation imbalance, adding or removing one spin at fixed intensive controls switches the steady state of a dissipative collective spin between a phase-averaged ring and a south-polar fixed point. Unlike previous one-spin sensing through dark-state interference, parity here determines whether the Dicke ladder samples an interior zero of the nonlinear jump amplitude. The integer-spin ladder samples this zero, making Dicke states with m<0 transient, whereas the half-integer ladder misses it and remains a single recurrent class. Exact finite-size steady states show that exponential competition between stationary weights amplifies this microscopic connectivity difference, yielding a first-order dissipative phase transition confined to the odd-N sequence. Multisector one-spin loading and state-unresolved removal confirm the switch, while the exponentially increasing switching time reflects the metastable isolation of the competing macroscopic basins. Our results establish representation-lattice sampling as a route to phase control, suggesting parity-based detection of single-spin addition or removal.