Peer Revenue Returns subject to peer review

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Tuesday 1 September

Optimization and Control

Low-Thrust Trajectory Optimization with Quantum Computing and Sequential Convex Programming

Low-thrust trajectory optimization is a central task in interplanetary mission design, but its nonlinear dynamics and operational constraints often lead to challenging non-convex optimal-control problems. Sequential convex programming has emerged as an effective approach to address these problems, while quantum annealing offers a complementary paradigm for solving quadratic unconstrained binary optimization problems. This paper introduces quSCP, a quantum-based sequential convex programming framework that reformulates each convex subproblem as a quadratic unconstrained binary optimization problem suitable for quantum and hybrid quantum–classical solvers. Equality, inequality, and trust-region constraints are embedded through quadratic penalty terms, while an iterative refinement strategy is used to reduce the accuracy loss introduced by binary discretization. The method is assessed on a fuel-optimal Earth–Mars low-thrust transfer by comparing standard sequential convex programming, a continuous quadratic unconstrained formulation, direct quantum processing unit sampling, and D-Wave hybrid solvers. Results show that quSCP produces physically consistent trajectories with propellant consumption and nonlinear constraint violations close to classical benchmarks. Direct quantum annealing is feasible only for small instances because of embedding overhead and hardware connectivity limits, whereas hybrid solvers scale to larger discretizations. Although no computational quantum advantage is demonstrated with current hardware, the results show that quantum and hybrid quantum–classical optimization can already provide competitive solutions for demanding trajectory design problems.
Read the full abstract

Solar and Stellar Astrophysics

On the photospheric abundances of the B-type fast rotator Regulus

A spectroscopic study of Regulus (late B-type rapidly-rotating star) was conducted with an aim of investigating its photospheric chemical abundances (especially for light elements), which has barely been challenged so far because of the considerable difficulty of abundance determination for such a very fast rotator (>~300 km/s). The atmospheric parameters were determined to be T_eff = 12345K (effective temperature) and log g = 3.58 (surface gravity) based on the spectral energy distribution, while the microturbulence was estimated as v_t = 0.5 km/s. The abundances of 14 elements (He, C, N, O, Ne, Mg, Si, S, Ca, Ti, Cr, Mn, Fe, and Ni) were derived by applying the spectrum-fitting technique, where the non-LTE effect was taken into account for lighter elements from He to Ca. The resulting relative-to-the-Sun abundances ([X/H]) revealed a remarkable trend that, while most elements indicate near-solar abundances (within +/-<~0.3dex), only C shows a marked deficiency ([C/H]~ -1.4) which is hard to explain. For example, a simple scenario of C underabundance caused by mixing of CN-cycled product (e.g., due to rapid rotation or binary mass transfer) is unlikely because any N enrichment is not observed. This problem remains yet to be further investigated.
Read the full abstract

Artificial Intelligence

Reinforcement Learning Enhanced LLM Agents for Complex Vehicle Routing Problems

Vehicle Routing Problems (VRPs) are fundamental combinatorial optimization problems with widespread applications in various scenarios. The advanced optimization solvers can effectively solve such problems. However, modeling complex VRP variants for solvers often requires substantial domain expertise, which limits the accessibility of advanced optimization technologies. In this paper, we propose Reinforcement Learning Enhanced LLMAgents(RLEA), a multi-agent framework designed to automate the modeling of complex VRPs. RLEA introduces a lightweight neural Planner trained with Soft Q-learning to efficiently orchestrate the actions of LLM-based agents. In addition, we equip the system with an evolutionary memory module and retrieval-augmented generation, enabling the agent to leverage both accumulated experience and external solver knowledge during program generation and refinement for solving VRPs. We evaluated 48 distinct VRP variants across various solvers. The experimental results demonstrate that RLEA outperforms the previous state-of-the-ar method, achieving a 16.67% higher success rate while significantly reducing runtime errors. These results validate that integrating reinforcement learning with LLM-based reasoning is highly effective for automated optimization modeling. The appendix is available at: https://doi.org/10.5281/zenodo.19134435.
Read the full abstract

All authors Yi Chen, Zikang Yu, Jiahai Wang, Jinbiao Chen, Jianpeng Zhou, Zizhen Zhang

Artificial Intelligence

Verifiable Disaster Storylines and Causal Knowledge Graphs: A Citation-Grounded Pipeline from Heterogeneous Humanitarian Sources

Effective humanitarian response depends on the rapid synthesis of heterogeneous, high-volume information sources - a task that routinely exceeds human analytical capacity in the critical early hours of a crisis. We present a pipeline that combines structured disaster records from EM-DAT with unstructured documents from ReliefWeb and the European Media Monitor (EMM) to produce source-grounded disaster storylines and causal knowledge graphs supporting situational awareness for responders and analysts. Using Retrieval-Augmented Generation, the pipeline extracts structured storylines - tabular event profiles covering 17 fields, from severity and key drivers to child-sensitive impact indicators - and constructs causal knowledge graphs where each node and edge is enriched with citation-grounded explanatory narratives, enabling full traceability back to primary sources. We evaluate the system on three diverse crisis use cases through a human evaluation involving 9 domain expert and 9 non-expert evaluators. Results confirm high retrieval precision, strong faithfulness of extracted causal relations, and a clear expert preference for citation-grounded components over ungrounded alternatives. The pipeline is designed to scale to the full EM-DAT catalogue, with the goal of publicly releasing a new collection of disaster stories complementing the EM-DAT database.
Read the full abstract

All authors Ivan Decostanzi, Michele Ronco, Sergio Consoli, Christina Corbane, Lorenzo Bertolini, Indaco Biazzo, Daria Mihaila, Manuel Garcia-Herranz, Felix Schwebel, Yelena Mejova, Kyriaki Kalimeri

Hardware Architecture

LLM Inference on IMC-NoC Architecture with Balanced Dataflow and Fine-Grained Parallelism

LLM inference has become an essential service, yet it imposes unprecedented demands on memory bandwidth, computational density, and communication efficiency. While IMC is a promising solution to the memory wall issue, the heterogeneous data dynamicity of LLM requires complementary resources to handle intermediate data generated during run-time. Furthermore, the massive number of parameters in LLM necessitates scale-up architectures where on-chip data movement is often the primary performance bottleneck. This article presents a hardware-software co-design framework that unifies distributed compute, memory, and communication into a seamless processing-communication fabric. On the hardware side, we propose a scalable architecture, named LEAP, that integrates IMC PE, NMC PE, and INC. This allows each hardware layer to execute specialized tasks: IMC for static weights, NMC for dynamic data, and INC for partial result reduction. On the software side, we introduce a partitioning, mapping, and scheduling framework optimized for key metrics in LLM serving, including throughput and latency. To address the distinct computational intensities of the prefill and decode phases, we present a prefill-decode disaggregation approach that dynamically reconfigures PE organizations to maximize resource utilization. Compared to commercial GPU platforms, the proposed architecture provides a throughput and an energy efficiency improvement of $\geq{}1.52\times$ and $24.91\times$, respectively.
Read the full abstract

Optics

Spatio-temporal coherent molding and retrieval of pulsed signals in optical waveguides

Optical waveguides are key elements for high fidelity, long distance optical communications. Coupled waveguide arrays allow for higher information density, steerting the propagation direction, and for encoding information. However, due to the mixing of relative phases for short pulses containing multiple waveguide-mode frequencies, a process for retrieving an encoded input state once these signals undergo coherent propagation remains elusive. A concept is presented to extract with high fidelity the phase-encrypted input signal from spatio-temporal propagated states. As a realization, an array of coupled waveguides is suggested with the retrieval mechanism being realized by local phase shifts that comply with the identified retrieval concept. Three dimensional full-wave electromagnetic simulations for broadband optical signals in coupled dielectric waveguides confirm the validity of the scheme and the high fidelity of information retrieval pointing to potential applications, for instance in ultrafast coherent coding and decoding of information imprinted on pulse sequences.
Read the full abstract

All authors Nika Durishvili, Ramaz Khomeriki, Vakhtang Jandieri, Douglas H. Werner, Daniel Erni, Jamal Berakdar

Rings and Algebras

Homological aspects of n-trivial extensions of rings

Let $R\ltimes_{n}M$ be the $n$-trivial extension of a ring $R$ by an $R$-bimodule $M$. We first characterize projective, injective, flat and finitely generated modules over $R\ltimes_{n}M$. Then we describe when the ring $R\ltimes_{n}M$ is left perfect (Noetherian, coherent, Artinian, hereditary, Kasch). Finally, we establish some homological formulas of $n$-trivial extensions of rings.
Read the full abstract

Software Engineering

Does Fault Localization Beat a Fresh Attempt? A Placebo-Controlled Study of Test-Guided Code Repair

Fault localization can focus a code model's repair on the statements a failing test implicates, but a targeted edit may succeed merely because it is small, and a second model call may succeed without using the failure at all. We separate these explanations with three arms applied to the same failed candidate: blind whole-solution resampling, spectrum-based localization followed by suspect-span infilling, and same-length infilling at a disjoint random code span. Across three frozen 26-32B models, three benchmarks and 488 failing candidates, plus a separately declared 24B fourth model from a third family, three results follow. First, localization is rarely available: only 9.0% of failing candidates expose a failing public test with a usable spectrum. Second, among the 177 candidates localizable from a strong suite, localized infilling loses decisively to blind resampling at a matched attempt count (3:40, p = 3.0 x 10^-9), opposite to our hypothesis; the loss replicates in a third family at -11.3 points (95% CI [-16.6, -6.8]), and widening the edit does not rescue it. Third, against the random-span placebo localized infilling leads pooled (11:1, Holm-adjusted p = .019), but that lead resolves in no individual model under the analysis our shipped plan designates primary (best Holm p = .087), so we report the location effect as suggestive rather than established. Re-pricing attempts as tokens narrows but does not overturn this: a span attempt spends 21.7 generated tokens against 371.1, yet 16 localized attempts reach 6.8% while one blind attempt already reaches 10.1%. Infilling reproduces the removed span verbatim in 48.9% of attempts, which is why more budget does not help. We restrict every localization conclusion to the 24-32B models tested.
Read the full abstract

Computer Vision

ADGNet: Asymmetric Dual-text Guided Network for Infrared Small Target Detection

InfRared Small Target Detection (IRSTD) is a challenging task. Relying solely on pixel-level information, vision-only methods struggle to distinguish targets from clutter. Current multimodal methods typically describe both targets and backgrounds with a single textual prompt. Such an approach lacks dedicated regional guidance and ignores infrared semantic asymmetry. Consequently, it provides insufficient background suppression information and introduces severe feature optimization conflicts, overwhelming small targets with noise. To address these issues, we propose a novel Asymmetric Dual-text Guided Network (ADGNet). Specifically, accounting for the infrared semantic asymmetry, we first design the Asymmetric Dual-text Prompt (ADP), comprising an image-agnostic abstract target prompt and an image-specific detailed background prompt. To leverage these prompts, we introduce an Asymmetric Dual-Branch Interaction (ADBI) module to separately guide visual features with their respective text priors, protecting targets from noise while suppressing background clutter. Subsequently, we introduce an Adaptive Feature Aggregation (AFA) module to dynamically fuse features from the two branches. Furthermore, we construct a multimodal Asymmetric Image-Text Infrared (AITIR) dataset by providing asymmetric text annotations for three public datasets (IRSTD-1K, NUDT-SIRST, and SIRST). Extensive experiments demonstrate that ADGNet outperforms 21 state-of-the-art (SOTA) methods. Code is available at https://github.com/iLearn-Lab/MM26-ADGNet.
Read the full abstract

All authors Tongtong Wang, Mingzhu Xu, Chenglong Yu, Jing Wang, Xiaohui Lin, Weili Guan

Quantum Physics

Structure-Aware Placement and Routing of Multi-Controlled Toffoli on Bivariate Bicycle Code Architectures

The multi-controlled Toffoli (MCT) gate is a fundamental primitive in quantum circuit design, with applications in quantum arithmetic, cryptanalysis, and algorithmic implementations. Being a high-level logical operation, the efficient decomposition of MCT gates into lower-level netlists has remained a major optimization challenge for decades. While emerging quantum error-correcting codes such as bivariate bicycle (BB) codes drastically reduce fault-tolerance overhead, realizing non-Clifford circuits on modular BB-code architectures introduces complex compilation bottlenecks governed by inter-module routing, factory density, and layout. Consequently, the mapping of MCT gates onto BB-code architectures remains relatively unexplored. In this paper, we overcome these challenges by mapping optimal-Toffoli-depth MCT decompositions (Dutta et al., PRA, 2025) onto BB-code-based fault-tolerant architectures via direct $\lvert \mathrm{CCZ} \rangle$ state injection from an external magic state factory. We introduce a targeted placement strategy that exploits the binary-tree structure of MCT decompositions to co-locate interacting subtrees. This approach reduces inter-module instruction counts by up to $\mathbf{16.02}\%$ compared to a naive sequential first-fit placement. We also evaluate the impact of factory placement across different topologies, demonstrating that grid-based layouts yield up to a $\mathbf{23.7}\%$ reduction in inter-module instructions relative to linear architectures (Yoder et al., arXiv, 2025). Finally, we validate the practical viability of our compiled circuits by analyzing aggregate execution errors and logical failure probabilities using the bicycle-ISA error estimator bicycle_numerics provided by the Qiskit community, https://github.com/qiskit-community/bicycle-architecture-compiler.
Read the full abstract

All authors Anik Basu Bhaumik, Suman Dutta, Siyi Wang, Anupam Chattopadhyay

Nuclear Theory

Hyperonic Softening versus Nucleonic Three-Body Repulsion in Hypernuclear Matter within a microscopic approach

We investigate cold homogeneous matter composed of neutrons, protons, and $\Lambda$ hyperons within our hyperonic extension of the lowest-order constrained variational (LOCV) method, hereafter denoted LOCVY. Our earlier LOCVY calculation, based on two-baryon interactions, is extended by supplementing the Argonne $v_{18}$ nucleonic interaction with the Urbana IX three-nucleon force, reduced within the variational framework to a correlation-weighted density-dependent effective two-nucleon interaction. The $N\Lambda$ and $\Lambda\Lambda$ interactions are kept unchanged, allowing the present calculation to isolate the competition between hyperon-induced softening and nucleonic three-body repulsion. The energy per baryon is calculated for fixed $\Lambda$ fractions $Y_{\Lambda}=0$, $0.1$, and $0.2$ in matter with a symmetric nucleonic component and in the proton-free neutron–$\Lambda$ limit. Direct differences between calculations with and without the three-body force quantify its density-dependent contribution, while a complementary decomposition into $NN$, $N\Lambda$, and $\Lambda\Lambda$ terms identifies the microscopic origin of the stiffening. The Urbana contribution becomes increasingly repulsive with density and opposes, but does not generically remove, the softening associated with a finite $\Lambda$ content. We further investigate the saturation properties for several prescribed $\Lambda$ fractions, with and without the nucleonic three-body force, to clarify how strangeness and many-body interactions modify the saturation point and the agreement with empirical nuclear-matter properties.
Read the full abstract

Fluid Dynamics

Assessment of Numerical Lift Coefficient Data for a Circular Cylinder with Application to Bladeless Turbines

We assess computed lift coefficient data for flow past a circular cylinder to evaluate their suitability for practical applications. Specifically, we consider lift coefficient data for a circular cylinder over Reynolds numbers from 120 to 8000. The results are obtained from two-dimensional finite element simulations of the incompressible Navier-Stokes equations using pressure robust discretizations. We compare the computed lift coefficients with published experimental and numerical results, finding good agreement in some cases but significant disagreement in others. Because lift fluctuations are central to vortex-induced vibration concepts, these data therefore provide input for the analysis and preliminary design of bladeless turbines.
Read the full abstract

Soft Condensed Matter

Optimizing diffusion-limited transport, with applications to electrochemical systems

Transport in certain systems fails when diffusion cannot replenish or remove material from a boundary rapidly enough, causing the boundary concentration to reach a critical minimum or maximum. Motivated by experiments in electrochemical systems that demonstrate this diffusion-limited failure of charge transport, we determine dynamic current protocols that maximize charge transfer subject to a prescribed concentration constraint. The optimal protocol has a "bang-ride" structure: the maximum feasible current is used until the boundary concentration reaches its critical value, after which the current is progressively reduced to maintain that value. For semi-infinite domains, we derive the optimal currents analytically and obtain system-independent upper bounds on their improvement over constant-current operation. We also extend the framework to finite and multilayer domains and show that the same formulation applies to both charging and discharging.
Read the full abstract

Quantum Physics

Ontic and epistemic states in the theory of spacetime-local beables

Bell's theorem rules out developing a locally causal theory to describe quantum phenomena. Many take this to imply that any model of quantum entanglement must employ variables (called beables by Bell) which follow nonlocal rules, even though signaling is local. The alternative is to adopt an all-at-once (block universe) approach, with beables which may depend on both past and future inputs, even though signaling is causal. Within this lenient-causality approach (a.k.a. retrocausal), simple cases of entanglement have been successfully described by locally mediated stochastic toy models, i.e.,~toy models which are local in a sense which generalizes Bell's local causality. Developing a widely applicable reformulation of quantum mechanics along these lines is a grand challenge. This work presents a general framework for such models and theories, and identifies the corresponding ontic and epistemic states. The epistemic state is closely analogous to the quantum state, yielding an explanation for the collapse of the wavefunction. In the case of the models of the framework, it is clear what the information is about. The expression for the empirically verifiable predictions of the models in terms of the ontic and epistemic states displays remarkable parallels to the Born rule. A toy-model example is discussed.
Read the full abstract

Atmospheric and Oceanic Physics

A Checklist to assess the energy and carbon impacts of ML/AI applications in Earth System Modeling

As machine learning and artificial intelligence find their way into nearly every aspect of climate, weather, and Earth system modeling, it is worth pausing to consider what our design decisions imply for the science and for the computational resources we consume. A growing body of literature addresses the ethical and sustainable development of ML/AI, yet translating these principles into day-to-day research practice remains a challenge as most of best practices are dispersed across multiple studies and commentaries. Here, we distill these discussions into a practical checklist that ML/AI and Earth system science practitioners can use to assess and reduce the environmental footprint of their own applications, organised around the successive stages of the model development pipeline. We complement the checklist with a selection of metrics drawn from the literature for estimating the energy consumption and carbon footprint of a project. For each question, we point to concrete examples and actionable suggestions from recent literature, aiming to bridge the gap between aspirational principles and the decisions researchers face at every stage of the development cycle.
Read the full abstract

All authors Filippo Dainelli, Amirpasha Mozaffari, Marina Castaño, Aina Gaya i Àvila, Lluís Palma Garcia, Alessio Melli, Oscar Dimdore Miles, Amanda Duarte

Computer Vision

An Intelligent Decision Support System for Emotion Monitoring using Microscopic Fixational Dynamics

The rising prevalence of psychological disorders necessitates effective emotion monitoring, yet current methods relying on facial or physiological signals often suffer from intrusiveness and privacy issues. This paper proposes an intelligent decision support system and pervasive edge-computing framework that leverages smart glasses and a companion smartphone to infer emotional states from microscopic visual fixation patterns. Moving beyond traditional macroscopic gaze metrics, the proposed system extracts and decomposes three distinct neurophysiological micro-movements: microsaccades, ocular drifts, and ocular microtremors. We introduce an interpretable hybrid artificial intelligence pipeline combining a multi-head attention mechanism, extreme gradient boosting, and a support vector machine to extract deep temporal features, quantify their physiological importance, and perform efficient on-device classification. Through an extensive evaluation involving 60 volunteers, we rigorously validate the framework under a strict leave-one-subject-out cross-validation protocol across both controlled and naturalistic mobile scenarios. Ablation studies unequivocally demonstrate that these fixational micro-movements are substantially more discriminative for emotion inference than traditional macroscopic features. Furthermore, aligned with contemporary affective science, the system incorporates a few-shot personalization mechanism to bridge universal physiological baselines with individual emotional heterogeneity, achieving a highly robust personalized F1-score of 83.6%. This work establishes a physiologically interpretable, unobtrusive, and deployable paradigm for continuous real-time emotion monitoring.
Read the full abstract

All authors Xiangyu Shen, Feiyang Deng, Zijian Dai, Aibin Chen, Jizheng Yi, Jie Li, Hongbo Jiang

Artificial Intelligence

Towards Generalizable Visually Grounded Exploration of Household Devices

Recent advancements in Vision-Language Models (VLMs) have demonstrated impressive capabilities in static visual recognition and high-level semantic reasoning. However, current embodied exploration paradigms still heavily rely on imitation learning from human-annotated trajectories, which severely limits agents' generalization ability. The key bottleneck of realizing general autonomous embodied agents lies in Generalizable Visually Grounded Exploration: the ability to operate novel devices without manuals or specific training by actively grounding abstract world knowledge into fine-grained visual affordances. Yet, existing benchmarks fail to evaluate this capability: they generally rely on explicit documents and annotated trajectories, neglecting the dynamic Hypothesis-Interaction-Refinement process essential for functional device operation. To bridge this gap, we introduce VGEBench, a comprehensive benchmark designed to evaluate the generalizable visually grounded exploration capabilities of VLMs. Unlike static datasets, we construct a Logic-Driven State Machine framework. This framework simulates multi-turn interaction loops, compelling agents to achieve goals by active visual perception and feedback-driven correction. Experimental results demonstrate that existing VLMs face significant challenges in translating semantic knowledge into physical execution and maintaining long-horizon state tracking.
Read the full abstract

All authors Linhao Zheng, Zeming Liu, Wangke Chen, Li Zeng, Wanxiang Che, Heyan Huang, Yuhang Guo

Computation and Language

Staged Linguistic Seeding: Grounded Query Expansion for Verified-Unit QA in AI Contact Centers

Customer-service QA in an AI contact center (AICC) runs under deployment constraints that benchmark QA misses: tight voice-hotline latency and a high cost for unsupported or wrong automatic answers. We deploy a system that answers only from a closed set of verified QA units: it returns a retrieved unit verbatim, or routes to clarify, abstain, or handoff. The index is enriched offline by staged linguistic seeding (SLS): a human authors a per-unit world-grounded slot recipe, gpt-4.1-mini renders it into variants, and a light human gate filters them. One methodology is reused across both domains, so inference stays a single retrieval pass with no query-time generation. On held-out query variants from two industrial domains, SLS lifts hybrid R@1 to 0.881/0.930 (+0.27/+0.34), with gains across all five retrievers tested. At the same gpt-4.1-mini generation budget, SLS beats doc2query by +0.20/+0.32, while cross-provenance evaluation provides additional evidence of transfer across generated-query distributions. Verified-unit answering also removes free-form generation's unsupported-content surface (7-13% versus approximately 0%). We report this as an application study, including negative results.
Read the full abstract

Distributed Computing

Shared-Memory Range-Tiled CDF Sort for Small-Range Integer Keys on GPUs

We study unstable integer sorting on GPUs for arrays whose elements lie in a known integer range. Focusing on counting-sort-based methods that determine the output interval of each value from its frequency and the prefix sums of the frequencies, we propose and evaluate Range-Tiled CDF sort (RT-CDF), which partitions the possible value range into small intervals, called tiles, that fit in shared memory. For each tile, RT-CDF constructs a histogram, computes its prefix sum as a local CDF, and directly generates the output array from the local CDF. We compare RT-CDF against three baselines: CUB DeviceRadixSort, whose processed bit range is restricted to $[0,\lceil\log_2 R\rceil)$ to exploit the known range size $R$; Ref-H-P sort; and an implementation based on the algorithm of Kolonias et al. Experiments on an NVIDIA GeForce RTX 4090 with range sizes from $R=2^7$ to $2^{18}$, input sizes from $n=10^6$ to $10^9$, and uniformly distributed, normally distributed, and all-equal inputs show that RT-CDF outperforms the baselines over a broad set of conditions for small to medium ranges, achieving a maximum speedup of 4.39 over the fastest baseline. For $R=2^{18}$, however, at least one baseline outperforms RT-CDF for every evaluated input size and input distribution, showing that the cost of histogram construction limits the applicability of RT-CDF to larger ranges.
Read the full abstract

All authors Kento Ando, Kaito Takase, Noriyuki Fujimoto, Koichi Wada

High Energy Physics (Experiment)

Neutrino Experiments at the LHC and the HL-LHC

High energy neutrinos are copiously produced in proton-proton collisions at the Large Hadron Collider (LHC), located at CERN, near Geneva, Switzerland. In particular, a large neutrino flux is expected in the far-forward direction. This flux is concentrated near the beam axis, reaches energies up to the TeV scale, and for electron and tau neutrinos can be dominated by heavy flavour decays at the highest energies. These features open a new experimental window for studying neutrino interactions with dedicated forward detectors, in an energy range beyond the reach of traditional accelerator-based neutrino experiments. The new FASER and SND@LHC experiments reported the first direct observations of neutrino interactions at a hadron collider using the first data from Run 3, which started in 2022. Since then, the programme has advanced to the first measurements, including charged-current neutrino-nucleon cross sections and the detection of different neutrino flavours. This article describes the forward neutrino flux at the LHC, the acceptance and detector concepts of the Run 3 experiments, and summarises the current status of collider neutrino measurements. It also discusses prospects for extending this neutrino programme towards the HL-LHC era. The collected data will also provide constraints on very forward hadron production, and enable searches for feebly interacting particles.
Read the full abstract

Cosmology and Nongalactic Astrophysics

Combining Systematic Effects in CMB Polarization Experiments through map-based simulations: application to LiteBIRD's HWP non-idealities and detectors non-linearity

We quantify the impact of coupled instrumental systematics on next-generation CMB polarization experiments targeting primordial $B$-mode polarization, with a focus on the forthcoming LiteBIRD satellite mission. We study the interplay between the non-linear response of Transition-Edge Sensor (TES) bolometers and Half-Wave Plate (HWP) non-idealities, in particular synchronous signals arising from differential emissivity. We develop a map-based formalism that captures the resulting intensity-to-polarization leakage by explicitly solving the binning map-making equations, avoiding the need for computationally expensive time-ordered data simulations. We apply this framework to LiteBIRD, adopting its baseline scanning strategy and frequency configuration, and perform analyses at both single- and multi-frequency levels, including Galactic foregrounds and blind component separation. We find that while detector non-linearity and HWP non-idealities individually induce negligible bias on the tensor-to-scalar ratio $r$, their coupling can generate non-trivial contamination, driven by large signals such as the solar dipole and amplified in high-frequency channels by foreground leakage. From these results, we derive joint requirements on detector non-linearity and HWP differential emission, and discuss their implications for the instrument design and calibration strategy of LiteBIRD and future CMB polarization missions targeting $r \lesssim 10^{-3}$.
Read the full abstract

All authors Silvia Micheli, Francesco Piacentini, Tommaso Ghigna, Alessandro Carones, Alessandro Novelli, Giampaolo Pisano, Giulia Barbieri Ripamonti, Alessandro Coppolecchia, Paolo de Bernardis, Silvia Masi, Andrea Occhiuzzi, Alessandro Paiella, Simone Stellati

Differential Geometry

Kählerity of complete almost-Kähler gradient shrinking Ricci solitons

In this paper, we prove that any complete, compact or noncompact, almost-Kähler gradient shrinking Ricci soliton is Kähler in arbitrary even dimension. Among other applications, combining our result with the classification of complete gradient shrinking Kähler-Ricci solitons in complex dimension two, we obtain a full classification of complete almost-Kähler gradient shrinking Ricci solitons in real dimension four.
Read the full abstract

Computer Vision

Residual Kalman Dynamics for Event-Based UAV Forecasting

We study short- and mid-horizon UAV bounding-box forecasting on the FRED event-camera dataset. We use a constant-velocity Kalman filter over a full center-size box state as a strong physical baseline, and train a residual model to predict acceleration-like corrections from recent box history, filtered state features, and local event representations. This simple residual formulation consistently improves over the Kalman baseline, with event-conditioned models giving the strongest results among the evaluated methods. We further show that part of the residual target is predictable from anchor position and velocity alone, indicating that canonical FRED results can reflect both visual evidence and dataset-specific motion priors. To analyze this effect, we introduce decorrelated subsets as a diagnostic stress test, showing that event-conditioned residual models retain useful predictive signal even when measured position- and velocity-based shortcuts are weakened.
Read the full abstract

Software Engineering

Probabilistic Model Checking of Autoregressive Neural Sequence Models

Test-set accuracy is silent on two issues that matter when deploying autoregressive neural sequence models: how much probability mass the system under test (SUT) places on constraint-violating alternatives that are reachable under sampling and what fraction of the input population satisfies a domain requirement. We answer both with probabilistic model checking. The pipeline extracts a discrete-time Markov chain (DTMC) from the SUT's token-by-token generation, verifies formal PCTL specifications with the PRISM model checker, and aggregates the per-input verdicts into a coverage curve over the input space. A soundness theorem establishes the DTMC as an under-approximation, so every verdict yields a certified interval on the SUT's true reachability probability. The coverage built from those verdicts is, therefore, conservative by construction. A counterexample-guided abstraction refinement (CEGAR) loop adaptively tightens the interval, and a maximum-likelihood algorithm extracts the most probable falsifying trace. Two case studies exercise the pipeline. On a GPT-2 computer-aided process-planning (CAPP) model with 100% test accuracy, the pipeline quantifies the probability mass greedy decoding hides, but that is reachable with sampling; and identifies the smallest training fraction at which an ordering requirement holds population-wide, neither of which test accuracy can report. We then verify the SMILES molecular generator with a 50x larger vocabulary. The only change is an external chemical-validity oracle, and the pipeline identifies the gap between structural completeness and chemical validity.
Read the full abstract

Distributed Computing

Breaking Cycles for Scalable Fair Ordering in Blockchain Systems

In blockchain systems, transaction order directly determines financial outcomes: unfair ordering enables front-running and sandwich attacks that have extracted over \$686M from Ethereum users. Current fair-ordering protocols aggregate pairwise receive-order evidence from replicas. Under contention or adversarial manipulation, however, Condorcet cycles force them into global strongly connected component (SCC) condensation, causing delays, coarse batches, and scaling failures. We present FlashOrder, a deterministic fair-ordering engine that localizes cyclic ambiguity before it propagates across the batch. FlashOrder embeds pairwise preferences into one-dimensional canonical positions, clusters nearby transactions with a partition hypergraph, and performs hierarchical inter- and intra-cluster serialization, replacing batch-wide SCC condensation with localized sorting and aggregation. Evaluated against Themis (CCS '23) and Rashnu (VLDB '24) on a libhotstuff-based prototype, FlashOrder achieves up to 10.5$\times$ higher throughput than Themis and 4.8$\times$ higher than Rashnu, with the latency gap widening as network scales. In controlled adversarial simulation, it reduces maximum rank displacement by 88.7\%, and under Condorcet attacks it sustains 12.0$\times$ and 9.7$\times$ higher throughput than Themis and Rashnu on average. These results show that localizing cyclic ambiguity yields stronger fairness at substantially higher throughput.
Read the full abstract

All authors Jinchun He, Wangjie Qiu, Yizhong Liu, Shengda Zhuo, Kwok-Yan Lam

Nuclear Theory

Neural-Network-Based Variational Method in Nuclear Density Functional Theory: Application to the Kohn–Sham method

We extend the neural-network-based variational method for nuclear density functional theory to the Kohn–Sham scheme, representing the complex spinor components of the single-particle orbitals by multi-layer perceptrons. We show that neural-network optimization of a given energy density functional, combined with an orthonormalization post-processing step, is mathematically equivalent to the variational condition projected onto the tangent space of the wave-function manifold spanned by the network parameters, and that the training optimizes not only the expansion coefficients but also the basis functions themselves. We assess the method from three points of view. In the first place, we examine how the results depend on the number of units, the number of layers, and the arithmetic precision, and find that quantitative accuracy requires both a sufficient width and a sufficient depth, while single-precision arithmetic is sufficient to represent the nuclear density distribution. In the second place, the binding energies and charge radii of several closed-shell nuclei agree with conventional Skyrme–Hartree–Fock results, and the quadrupole deformations of open-shell nuclei are consistent with reference calculations that include pairing and with experiment. In the third place, we confirm that a neural-network single-particle basis can represent the three-dimensional configurations of the fundamental pasta phases: spheres, rods, and slabs. The framework offers a new perspective on computational nuclear theory, well suited to the forthcoming generation of GPU- and AI-oriented high-throughput supercomputers.
Read the full abstract

Materials Science

Metastable defects in III-Nitrides

Metastable states in III-nitrides (AlN, GaN, InN and their alloys) are an important topic across materials science, device physics, and epitaxial growth because these compounds exhibit multiple competing crystal structures, defect configurations, and phase behaviors that strongly affect optical, electrical, and mechanical properties. The paper is a concise, structured review-style summary covering the main concepts, mechanisms, experimental signatures, theoretical approaches, and device implications. Actions that should be proposed to avoid effect of metastable defects in III-Nitride based devices are discussed. Avoiding metastable defect effects in III nitride devices requires preventing their formation (through growth and doping control), stabilizing their electronic configuration (by annealing or optical activation), and designing device architectures that minimize field- or temperature induced transitions. These combined actions ensure consistent carrier density, higher mobility, and superior optical and electrical reliability in GaN , AlGaN , and InGaN based devices.
Read the full abstract

Software Engineering

Replacing Training with Memory: Listwise Selection for Text-to-SQL

Modern Text-to-SQL systems often follow generate-execute-select pipelines, generating multiple candidate queries then selecting the best one. Listwise selection, by jointly comparing multiple candidates, has been widely adopted, but fine-tuning listwise selectors is costly. We thus propose a fine-tuning-free listwise selector. We replace two major fine-tuning objectives with inference-time strategies: (1) learning selection criteria as ordering and (2) mitigating positional bias. First, we build reusable structured memories instead of learning selection behavior as model parameters. Given a question, MaP-SQL retrieves memories distilled from training data that encode how natural language maps to schema elements, SQL operations, and expected outputs. These memories serve as explicit decision criteria for evaluating candidates in a listwise manner. Second, to mitigate ordering bias of listwise selectors, we aggregate rankings across multiple input permutations, with inference cost optimized by execution results and pointwise scoring. Our approach improves selection accuracy while maintaining efficiency and compatibility with existing large language models. Across Text-to-SQL benchmarks, it produces more stable selection without fine-tuning and fewer unnecessary comparisons than existing methods. On BIRD-dev, it outperforms the previous state-of-the-art selector-based method R^3-SQL by 2.02 execution accuracy points on average using the same candidate sets, with 2.92x fewer tokens.
Read the full abstract

All authors Yeonseok Jeong, Soyoung Yoon, Seongjun Lee, Seung-won Hwang

Computation and Language

Dense Process Supervision for Search Agents via Fact Utility Estimation

Reinforcement learning (RL) for search agents typically relies on outcome rewards. However, it often fails to achieve effective credit assignment, due to the unclear value of intermediate steps. It is hard to separate their contributions from the final result. In this paper, we propose a dense process supervision method based on fact utility estimation, which models the reasoning process as the accumulation of discrete evidence facts. We first extract structured facts from raw observations and organize them into an explicit fact store. To support credit assignment, we then cluster semantically equivalent facts and infer the posterior utility of each fact cluster using Bayesian estimation over group rollouts. Finally, we convert the estimated fact utilities into dense step-level rewards to guide RL training. Experiments on seven single-hop and multi-hop QA benchmarks show that our method consistently outperforms existing baselines. Ablation studies validate clear relative improvements on multi-hop QA compared to outcome reward-only training.
Read the full abstract

All authors Rongzhi Zhu, Xiangyu Liu, Yi Liu, Shuo Zhang, Ruirui Zhang, Rui Wu, Tao Jiang, Zequn Sun, Wenhao Xu, Wei Hu

Computation and Language

TWIX: a Two-Stage Approach for End-To-End Named Entity Recognition and Relation Extraction

The exponential growth of scientific publications calls for automatic Information Extraction (IE) systems to support knowledge discovery. In this context, the GutBrainIE benchmark evaluates Named Entity Recognition (NER), Named Entity Recognition and Disambiguation (NERD), and Relation Extraction (RE) systems in the gut-brain axis domain. We propose Two-stage Workflow for Information eXtraction (TWIX), an end-to-end IE pipeline featuring three interconnected modules, each leveraging a two-stage framework to solve all four GutBrainIE subtasks. Evaluation on the development and test sets shows that our method substantially outperforms the baseline by a wide margin, while also ranking first among all participant submissions across all subtasks. These results indicate that the proposed two-stage pipeline effectively improves both precision and recall in practical settings.
Read the full abstract