Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Friday 11 September

Exactly Solvable and Integrable Systems

On the autonomisation of differential equations I: Sundman transformations for Painlevé equations I-IV

We consider the application of Sundman transformations to the first four Painlevé equations $P_I$-$P_{IV}$, with $P_V$ and $P_{VI}$ being left for future work. Since the Painlevé equations are nonautonomous, this requires first of all the construction of an equivalent autonomous system, a process which we discuss in detail, and which we characterize as being inverse to the use of Lie symmetries to obtain a reduction of order of an autonomous system. Secondly, we apply a Sundman transformation to this autonomous system, and identify the resulting equation with a corresponding nonautonomous equation. We give an explicit mapping between solutions of this nonautonomous equation and the original Painlevé equation. Interesting special cases of the nonautonomous equation found by Sundman transformation include, for $P_{II}$, an equation with coefficients expressed via Airy functions, and for $P_{IV}$, an equation with coefficients expressed via Weber-Hermite functions. We also discuss an alternative autonomisation process. Finally, a variety of possible directions for future work are identified, along with interesting open problems.
Read the full abstract

High Energy Physics (Phenomenology)

Minimal Flavoured DFSZ Axion Models: Predictive Yukawa Textures and Flavour Constraints

We study a predictive class of flavoured DFSZ axion models in which the Peccei–Quinn symmetry is fully horizontal and the domain wall number is unity. These Minimal F-DFSZ models simultaneously resolve the strong CP problem and avoid the post-inflationary domain wall problem, while enforcing a predictive set of texture-zero quark mass matrices. Remarkably, the entire quark Yukawa sector can be reconstructed in terms of the measured quark masses and Cabibbo–Kobayashi–Maskawa parameters. We derive analytic expressions for the resulting flavour-violating Higgs and axion couplings, thereby making explicit how the new-physics effects are determined by Standard Model observables. We then analyse the full flavour phenomenology of the framework and obtain bounds on the scale of new physics from precision flavour observables.
Read the full abstract

Robotics

Online Material Estimation for Conditioned Diffusion Policy in Shaping Deformable Linear Objects

Shape control of deformable linear objects (DLOs) is challenging for imitation learning because deformation behavior varies with material properties such as stiffness and elasticity, so a single policy must generate different action sequences for different objects even when the goal shape is identical. We propose a diffusion policy conditioned on material labels that are estimated online during manipulation. A recurrent estimation network predicts the material label of the grasped object from the time series of multi-view images and robot joint states, and the predicted label conditions the diffusion policy at every inference step. We collected 480 real-robot demonstrations covering four DLO materials and three groove-placement tasks, and compared per-material specialist policies, a task-conditioned policy without material labels, a policy conditioned on ground-truth material labels, and the proposed policy. Conditioning on ground-truth material labels improved the average success rate from 45.8% to 60.0% over the task-only policy, and the proposed policy reached 60.8% without any prior material information, matching the policy given ground-truth labels. A post-hoc analysis shows that the estimator extracts material-related information from the manipulation observations and that the diffusion policy responds to the resulting conditioning signal, while the one pronounced failure case is associated with persistent confusion between two similar materials.
Read the full abstract

All authors Ryunosuke Yamada, Tomohiro Motoda, Yukiyasu Domae, Tokuo Tsuji

Quantum Physics

Travelling Dark State Polariton as a Viable Quantum Memory in a Solid-State Medium

We theorize a quantum memory based on the dark-state polariton field, formed by the superposition of atomic and photonic states of a travelling probe laser pulse under the application of standing wave modes of a dominant control laser pulse using a lambda-level scheme Electromagnetically Induced Transparency in a solid medium. We show how an enhancement in the storage time for the pulse is achieved by eliminating pulse broadening due to diffusion. At last, we propose an experiment that can help realize the storage of a probe pulse in the hyperfine levels $^3\text{H}_4 \leftrightarrow ^1\text{D}_2$ of $\text{Pr}^{3+}:\text{Y}_2\text{SiO}_5$, cryogenically cooled at $4.5\text{ K}$. We also discuss multiple applications the storage of the quantum states the probe pulse with a prolonged time interval must have.
Read the full abstract

Probability

Multivariate Ruin in Lévy-driven Insurance Risk Models under Heavy Tails

The paper studies finite-horizon ruin for an insurance company with several lines of business admitting heavy-tailed claims. The claim amount process of the insurance company is modeled as a multivariate increasing Lévy process possibly perturbed with fluctuations. A relevant insolvency event may involve the failure of a single line, of several lines at once, or of groups of lines linked through internal transfers, reinsurance, or a guarantee arrangement. These events have different geometries and need not occur on the same probability scale. Under asymptotic tail independence among claims from different lines, classical regular variation assigns zero limiting probability to a multi-line failure and is therefore unable to identify either the ruin probability or the corresponding solvency capital requirement. Using a multivariate Lévy process to model cumulative claims and regular variation on a nested sequence of subcones of the positive orthant to model dependence across lines, we provide the exact scaling rate of the ruin probability and the limit behavior. Additionally, explicit computations are presented for examples with independent business lines, common arrivals of independent claims, Gaussian copula dependent claims, Marshall-Olkin dependent claims, and bipartite insurance networks. Finally, we use Monte Carlo simulations to support our theoretical findings.
Read the full abstract

Information Theory

Confusion-Erasure Bounds of Error-Bounded Decoders under QAM

6G is expected to push ultra-reliable low-latency communication (URLLC) toward stringent residual-error tar- gets for mission-critical services, where undetected errors and erasures carry fundamentally different costs. Block error rate (BLER) conflates block confusions (undetected errors) and block erasures, which have fundamentally different impacts on system reliability. To characterize the confusion rate analyt- ically, we consider an error-bounded decoder with spherical decision regions. We focus on square quadrature amplitude modulation (QAM) constellations in the finite blocklength (FBL) regime. The confusion rate is governed by the Euclidean distances between modulated codewords, whereas the code structure constrains their Hamming distances. To bridge the two metrics, we introduce a typical distance, which represents the Euclidean distance of a codeword pair at a given Hamming distance on average, and relate it to the Hamming distance through a per-symbol squared-distance coefficient. On this basis, we derive a lower bound on the block confusion rate for random codes and an upper bound for codebooks whose minimum Euclidean distance reaches the typical distance at the non-overlapping threshold. We further characterize how both bounds evolve with the average symbol energy and the block- length. Numerical results, validated by an exact computation for short codes, confirm that as the signal-to-noise ratio (SNR) or redundancy increases, the confusion rate falls many orders of magnitude below the reliability target, leaving detectable erasures as the dominant residual error.
Read the full abstract

Differential Geometry

Bernstein theorem for $3$-dimensional anisotropic minimal graphs with free boundary

In this paper, we continue our recent study on anisotropic minimal surface equation with free boundary condition in Wang-Wei-Xia-Zhang (Arch Ration Mech Anal 250:42, 2026). The first main result solves the corresponding mixed boundary value problem. As an application, we prove the following Bernstein-type theorem: any anisotropic minimal graph over $\mathbb{R}^3_+$ with free boundary must be flat. These extend the classical results of Simon (Indiana Univ Math J 25:821–855, 1976; Math Z 154:265–273, 1977) to an appropriate free boundary setting.
Read the full abstract

All authors Guofang Wang, Wei Wei, Chao Xia, Xuwen Zhang

Audio and Speech Processing

Location-based Training with Complementary Folded Linear Orderings for Multichannel Speech Separation

Location-based training (LBT) effectively resolves the output permutation problem in multichannel speech separation by imposing deterministic spatial orderings. For planar microphone arrays, LBT typically adopts circular azimuth ordering to cover the full spatial range. However, the resulting cyclic topology introduces a discontinuity at the wrap-around point, increasing learning complexity and limiting the effective use of spatial cues. This work investigates this limitation by introducing location-based training with folded linear orderings (LBT-FLOs), which collapse circular azimuths into controlled linear orderings. While individual LBT-FLOs exhibit front-back ambiguity, each provides enhanced spatial discriminability over specific azimuth regions. Exploiting their complementarity, we propose an ensemble-style framework that selects among multiple LBT-FLOs using azimuth-guided scoring. Experiments across planar array geometries and reverberant conditions show modest but consistent improvements over circular-ordering LBT, with robustness to azimuth estimation errors.
Read the full abstract

Functional Analysis

Strongly small-2 sets that are not Riesz sets on compact abelian groups

We prove that every infinite compact abelian group $G$ admits a countably infinite proper set $E\subset\widehat G$ that is strongly small-2 but not Riesz. More precisely, $|\alpha|*|\beta|$ is absolutely continuous for all $\alpha,\beta\in M_E(G)$, whereas $M_E(G)$ contains a singular complex measure of total mass one with exact Fourier support $E$ whose convolution square belongs to $L^2(G)$. When the image of the doubling map on $\widehat G$ is infinite, $E$ may moreover be chosen so that $\#(E\cap(\gamma-E))<\infty$ for every $\gamma$ and $E\cap(-E)=\{0\}$. When that image is finite, we reduce the problem to a nonrectangular construction on the Walsh group, for which $E\cap(E+\gamma)$ is finite at every nonzero shift.
Read the full abstract

Machine Learning

Geometric-to-Semantic Spherical Transfer Learning for Cortical Sulci Labeling

Deep learning on cortical surfaces faces a dilemma: capturing the complex topology of over 60 nomenclature-dependent sulci per hemisphere requires high-capacity models, yet the extreme scarcity of expert annotations ($N=62$ subjects) inevitably causes overfitting. Standard supervised approaches fail to generalize in this data-scarce regime, particularly for variable and small sulci where topological ambiguity is high. To overcome this limitation, we introduce a Geometric-to-Semantic Spherical Transfer Learning framework. First, we leverage massive unlabeled data (UK Biobank, $\approx$30,000 subjects) to pre-train a spherical encoder using a locally-optimized strategy. By relying solely on continuous surface features (curvature and depth), the relevance of this pre-training is confirmed by the model's ability to detect localized and rare topological traits, such as sulcal interruptions. The downstream labeling task, however, introduces extracted sulcal fundi (lines) as an explicit semantic input. To bridge this dimensional domain gap (from purely geometric to semantic) without causing catastrophic forgetting, these anatomical lines are integrated into the pre-trained backbone via a soft-initialized Topological Prior Injector. Our experiments demonstrate that this approach outperforms fully supervised baselines trained from scratch, achieving a mean Dice of 0.77. Crucially, a local analysis reveals that the self-supervised geometric priors yield the largest performance gains on variable and tertiary sulci (up to 14.8%), confirming that learning the cortex shape is highly beneficial for identifying its rarest parts.
Read the full abstract

All authors Saeb Tounsi, Joël Chavas, Pietro Gori, Vincent Frouin, Denis Rivière, Jean-François Mangin

Materials Science

Direct observation of reversible ionic polarization at a buried solid-state battery interface

Electric fields control ionic distributions at solid-solid interfaces. However, whether buried interfaces possess an intrinsic ionic reversibility has remained experimentally unresolved. Here, we directly observe reversible ionic polarization at the buried amorphous LiCoO2/Li1.5Al0.5Ge1.5P3O12 electrolyte interface. By combining the Elastic Recoil Detection Analysis (ERDA) method, utilizing time-of-flight (ToF) measurements and nanometer-scale resolution, with the Neutron Depth Profiling (NDP) method for the absolute quantification of lithium, we show that an applied bias of +-1 V results in a reversible redistribution of approximately 9.3% of lithium in the interface region, while conserving its total content. Upon polarity reversal, the lithium redistribution is completely reversed, indicating reversible interfacial ionic polarization rather than irreversible lithium loss or permanent interphase formation. These results demonstrate that buried interfaces in solidelectrolyte systems can behave as electrically reconfigurable ionic regions with an intrinsic reversible freedom for ion motion, thereby providing direct microscopic insight into the physics of space-charge formation and low-voltage interfacial response in solid-state electrochemical systems.
Read the full abstract

All authors Giovanni Ceccio, Romana Miksova, Jiri Vacik, Zoltan Szaraz, Josef Dobrovodsky, Pavlina Zavadilová, Pavol Noga, Ivan Mastronardo

Metric Geometry

A converse bound for dGH vs. dH for Euclidean space and Riemannian manifolds

We prove for the Euclidean space $\left(\mathbb{R}^n, \|.\|_2\right)$ the existence of subsets $A^n \subseteq \mathbb{R}^n$ with $d_H(\mathbb{R}^n, A^n)$ arbitrarily small, such that $d_{GH}(\mathbb{R}^n, A^n) = \sqrt{\frac{n+1}{2n}}d_{H}(\mathbb{R}^n, A^n)$, showing that the lower bound $d_{GH}(\mathbb{R}^n, A^n) \geq \sqrt{\frac{n+1}{2n}}d_H(\mathbb{R}^n, A^n)$ proved in arXiv:2607.18447 is tight for sets that are arbitrarily dense in the surrounding space. We also prove a similar statement for Riemannian manifolds and sufficiently dense subsets as a converse to arXiv:2309.16648.
Read the full abstract

Cryptography and Security

Subgroup Packing for Batched PASTA Transciphering

With transciphering, a server converts symmetrically encrypted records into homomorphic ciphertexts without learning the records or the symmetric key. For the PASTA cipher, this conversion involves dense linear maps whose implementation depends on how record words are arranged in the ciphertext. We ask whether rearranging a fixed batch can reduce its conversion cost. Instead of storing each record's words in a contiguous block, our layout interleaves records so that cyclic word shifts preserve each record's positions, which form a coset of a cyclic subgroup. For direct evaluation as a sum of masked translations, we characterize the required displacements and relate their counts, 255 for the contiguous layout and 128 for the subgroup layout, to a prior transversal-difference invariant. We implement three equally batched schedules for complete PASTA-3 conversion and subsequent public subset-sum queries in HElib. Across twelve paired corpora under six homomorphic keys, all 24 direct and subgroup conversions and all 48 subsequent queries return the expected values and required zeroes. The median paired ratio of direct to subgroup server cost is 1.60, including fresh public generation, conversion and two queries. The reduction comes with less remaining noise capacity. These results establish a packing-dependent cost–noise tradeoff.
Read the full abstract

Artificial Intelligence

SteerDuplex: Steerable Duplex Speech Dialogue Models

Full-duplex spoken dialogue models support low-latency turn taking, interruption handling, and backchanneling, yet a key capability remains underexplored: steerability, the ability to reliably shift conversational behavior along attributes such as tone, persona, speaking rate, and voice style in response to user instructions. We introduce a taxonomy of text- and audio-based steerability that identifies substantial gaps in current full-duplex models. To address this gap, we introduce SteerDuplex, a Moshi-based full-duplex speech model fine-tuned on natural conversations and synthetic dialogues targeting instruction following, vocal delivery, reasoning, and duplex interaction. We further apply two-stage reinforcement learning (RL) with hybrid rewards, combining verifiable interaction checks and judge-based semantic feedback to improve timing and response continuity. To evaluate full-duplex spoken steerability, we introduce SteerBench, a benchmark with 390 spoken prompts and 1,067 human-authored binary audio and text rubrics spanning tone, persona, style/accent, and speed/length. On SteerBench, supervised training improves audio-steering average pass rate by 44.5 percentage points over the strongest evaluated open baseline. On Audio MultiChallenge, task average pass rate improves by 7 points over its strongest evaluated open baseline. RL further raises source-clean interruption response from 72.5% to 82.5% and reduces synthetic pause barge-in from 26.5% to 9%. Steering and aggregate task scores remain comparable or higher, while reward probes reveal reward hacking through incomplete responses. Our model and benchmark support systematic research on spoken steerability, with reward analysis showing why timing gains must be evaluated alongside response completeness.
Read the full abstract

All authors Utkarsh Tyagi, Ramaneswaran Selvakumar, Advait Gosai, Sonal Kumar, Nikhil Barhate, Isabell Sagar, Steven Li, Miheer Bavare, Daniel Quigley, Fabiola Tapia Carrillo, Jose M Patron E, Diego Macías Gutiérrez, Paul Song, Ramani Duraiswami, Dinesh Manocha, Yunzhong He

Computer Vision

RA-SOD: Reliability-Aware RGB-T Salient Object Detection under Modality Degradation

RGB-Thermal (RGB-T) salient object detection leverages complementary cues from visible and thermal modalities to improve robustness in challenging environments. However, in real-world scenarios, the reliability of each modality is inherently unstable: RGB images degrade under low illumination, motion blur, and noise, while thermal imagery often suffers from contrast compression and sensor artifacts. Such degradation introduces unreliable perceptual evidence that can mislead cross-modal fusion and significantly deteriorate detection performance. To address this challenge, we propose RA-SOD, a reliability-aware RGB-T salient object detection framework that explicitly models modality reliability and integrates it into feature learning and cross-modal fusion. First, we introduce a reliability-conditioned representation that adaptively compensates degraded modality features while preserving structural cues. Second, an uncertainty-guided dual-stream refinement strategy progressively corrects cross-modal representations while suppressing unreliable evidence. Finally, we propose a pixel-wise modality competition mechanism that dynamically selects modality cues according to spatial reliability for fine-grained fusion. Extensive experiments on four benchmarks (VT821, VT1000, VT5000, and VT-IMAG) demonstrate that RA-SOD achieves state-of-the-art performance and exhibits strong robustness under severe modality degradation. Code and models are available at https://github.com/zaoxienian/RA-SOD.
Read the full abstract

All authors Hongbo Gao, Zhengyu Li, Xueru Nie, Dihao Zhu, Lijun Zhao, Yunke Wang, Chang Xu

Game Theory

Universally truthful mechanisms for scheduling

We consider universally truthful randomized mechanisms for the problem of scheduling $m$ jobs on $n$ unrelated machines. We prove a lower bound on the expected approximation ratio of every such mechanism whose probability distribution has discrete support. We show that no universally truthful randomized mechanism in this class can achieve approximation ratio smaller than $n/12 - o(n)$ with respect to the optimal makespan. We match this, up to a constant factor, by a mechanism with approximation ratio $n/2 + o(n)$.
Read the full abstract

All authors Georgios Anastasiadis, George Christodoulou, Elias Koutsoupias, Annamaria Kovacs, Conrad Schecker

Machine Learning

Correlation-Guided Fast Machine Unlearning via Hessian Analysis

The increasing adoption of machine learning in network and distributed security systems has created an urgent need for mechanisms that can selectively and efficiently remove the influence of specific training data to eliminate compromised or adversarial data points from production models. Privacy regulations such as GDPR's right to be forgotten also pose similar requirements. However, existing approximate unlearning techniques remain computationally prohibitive for deployment in real-world security systems, as they require repeated expensive Hessian-inverse-vector computations for each data point removal, creating a bottleneck when processing multiple related requests in scenarios such as intrusion detection systems, spam filters, and threat intelligence platforms. Thus, we introduce a computationally efficient unlearning framework that identifies correlated data points in the training set and applies a theoretically derived closed-form parameter update rule, achieving an $82\times$ wall-clock speedup over standard influence function unlearning while preserving model utility with a $10^{-2}$ improvement in accuracy over state-of-the-art baselines. Our method establishes theoretical guarantees and ensures numerical stability through Hessian damping. Our evaluation across seven diverse dataset architecture combinations, including large-scale CIFAR-100 with ResNet-50, demonstrates superior forgetting effectiveness, with membership inference attack success rates of 0.660 and tug-of-war scores of 0.950.
Read the full abstract

All authors Ayushi Thakur, Ruchir Gupta, Amit Kumar Jaiswal, Prayag Tiwari

Astrophysics of Galaxies

Heavy Seed Black Hole Growth in Metal-Enriched Halos through Disk-Induced Stellar Disruptions: A Semi-Analytical Modelling

Recent simulations suggest that heavy seed black holes may form in weakly metal-enriched atomic cooling halos, where the supermassive-star progenitor and small-scale stellar fragments emerge nearly coevally. In this picture, the newly born heavy seed is naturally embedded in a metal-enriched Pop~I/II nuclear star cluster rather than in an isolated pristine environment. We investigate whether disk-induced tidal disruption events (TDEs) from these Pop~I/II stars can provide an efficient and sustained growth channel for heavy seed black holes. We construct a semi-analytical model for stellar orbital damping, disk capture, migration, and tidal disruption around a heavy seed black hole, and incorporate the resulting disk-induced TDE contribution into cosmological merger trees with baryonic and metallicity evolution. Heavy seed host halos are selected from atomic cooling halos with $Z\lesssim10^{-3}Z_\odot$ that satisfy either a rapid gas-inflow criterion or a strong Lyman–Werner radiation criterion. We find that disk-induced Pop~I/II TDEs can dominate the early growth of heavy seeds: the median black hole mass grows from $\sim10^4\,M_\odot$ to $\sim10^5\,M_\odot$ within the first $\sim0.1$ Gyr after seed formation, and reaches several $10^5\,M_\odot$ by $\sim0.2$ Gyr. The cumulative mass supplied by TDEs initially exceeds that from gas accretion and remains comparable over the first $\sim200$ Myr. Including disk-induced TDEs shifts the black hole population toward higher masses, increases the abundance of massive black holes at $z\sim9$–10, and produces larger black hole-to-stellar mass ratios. This channel helps alleviate, but does not fully remove, the tension between heavy-seed models and the most extreme high-redshift black hole candidates, suggesting that additional growth mechanisms may still be required.
Read the full abstract

All authors Zijian Wang, Zhili Wang, Yiqiu Ma, Boyuan Liu, Zheng Cai, Mengye Wang, Qingwen Wu

High Energy Astrophysical Phenomena

Optical Follow-Up of Two Spider Pulsar Candidates: An Irradiated Redback and a Possible Double Giant Impostor

Compact binary millisecond pulsars (nicknamed "spiders") are a growing class of neutron stars: more than 100 systems are known in the Galactic field, including more than 30 candidates where pulsations have not been detected. Here we report the results of an optical follow-up of two spider pulsar candidates: 2FGL J0846.0+2820 (J0846, a huntsman candidate in an 8.1 d orbit) and 4FGL J0935.3+0901 (J0935, with a 2.4 h orbital period and proposed as a spider of either the transitional, black widow or redback sub-class). We also analyzed their multi-wavelength properties (infrared, X-ray and $\gamma$-ray bands), in order to assess their nature and current state. The optical orbital light curves of J0846 change from double-peaked in 2023 to single-peaked in 2024, but we argue they are not consistent with either irradiation-driven or ellipsoidal orbital modulation. Its spectral energy distribution shows evidence for two blackbody-like components with similar temperatures ($T$) and radii ($R$), which dominate the optical ($T_2\simeq6000$ K, $R_2\simeq1.8$ R$_\odot$) and infrared ($T_1\simeq3400$ K, $R_1\simeq5.2$ R$_\odot$) bands. Based on this, we argue that J0846 is not a bona fide pulsar candidate and propose an alternative identification: a detached double red giant. In J0935, we find a light curve with one flux maximum around superior conjunction of the companion, where the colors and inferred temperature increase, suggesting prominent irradiation from the pulsar. We place constraints on its companion base temperature ($4000\!-\!4600$ K), which support one of the three classifications proposed for J0935: a redback spider in the pulsar state.
Read the full abstract

All authors Bettina Due, Jundile Bridziute, Manuel Linares, Marco Turchetta, Maksat Satybaldiev

Discrete Mathematics

Fault-tolerant Hamiltonian connectivity of Johnson graphs

Johnson graphs $J(n,k)$ are a classical family of highly symmetric networks known to be Hamiltonian-connected in the fault-free setting. In this paper, we investigate their Hamiltonian connectivity under three failure models, namely general edge faults, matching faults, and vertex faults. For general edge faults, we prove that $J(n,k)$ remains Hamiltonian-connected after the deletion of any set of at most $k(n-k)-3$ edges for $n\geq4$. Since $J(n,k)$ is $k(n-k)$-regular, this attains the natural degree-based upper bound for Hamiltonian connectivity. We then consider matching faults, which exclude the concentration of multiple faulty links at a single vertex and permit substantially larger fault sets. We show that $J(n,k)$ remains Hamiltonian-connected after the deletion of an arbitrary matching for $n\geq5$, including a perfect matching whenever one exists. For vertex failures, we prove that $J(n,k)$ is $(n-2)$-vertex-fault-tolerant Hamiltonian-connected for $n\geq5$. All three results are constructive and lead to recursive fault-tolerant Hamiltonian routing algorithms. Simulation results on Johnson graphs with up to $12{,}870$ vertices further show that the routing algorithms successfully construct fault-free Hamiltonian paths for all tested source-destination pairs, with measured execution times exhibiting near-linear growth with network size. These results establish a unified fault-tolerant Hamiltonian-connectivity framework for Johnson graphs under different failure patterns.
Read the full abstract

Chemical Physics

Fast and Accurate Excitation Energies from Density Matrix Renormalization Group Calculations Improved by Machine Learning

An estimation of optoelectronic properties is a crucial necessity and an ongoing challenge in modern functional material science. This involves accurate accessing of ground and excited states in systems with complex electronic structure that are often too computationally expensive for accurate many-body methods. Building on our previous work on ground states [J. Phys. Chem. Lett. 2025, 16, 3295-3301], we present an efficient and cost-effective approach for evaluating electronic excitations in functional materials, combining the density matrix renormalization group method as a complete active space solver with machine learning techniques. We demonstrate its performance on {\pi}-electron-correlated systems, namely polycyclic aromatic compounds. The transferability and effectiveness of the derived machine learning model are demonstrated on a number of challenging examples with up to 34 {\pi}-electrons.
Read the full abstract

Numerical Analysis

A parameterized block LU preconditioning for double saddle point problems

We present a biparametric preconditioning technique for large, sparse, non-symmetric, and non-singular double saddle point problems. The preconditioner is induced using a stationary iteration method. It is also based on a two-parameterized block LU factorization of the coefficient matrix. To begin with, some convergence results of the iteration method are derived. Moreover, the spectral features exhibited by the preconditioned matrix are given. Finally, the presented preconditioner is conjuncted with the GMRES method. Numerical results demonstrate the satisfactory performance of the preconditioner.
Read the full abstract

Robotics

ProClosure: Hierarchical Room-Object Assignment using Progressive Boundary Closure from Monocular Video

A 3D scene graph groups objects into rooms. When a robot is asked to fetch an object from the kitchen, that grouping is what tells it where to look. An object recorded in the wrong room is not retrievable by a query naming the correct room. We introduce Progressive Boundary Closure, which recovers room layer from a monocular RGB video. A SLAM front end and an open-vocabulary segmenter supply a structural point cloud, camera trajectory and object tracks. The cloud is rasterised into a top-down map, rooms are recovered from it, and each object takes the room holding most of its extent. The difficulty lies in the map itself. Walls are recorded only where the camera looked, so a gap in the boundary may be a doorway or a stretch of wall that was never observed; nothing distinguishes the two. Prior methods treat both as passages, merging rooms that should remain separate. We observe that both require the same treatment: a room should not extend across either, so both are closed and need not be distinguished. Such an opening closes under a small amount of boundary growth, and few sightlines cross it, so points in different rooms rarely see one another. We use the first to recover rooms and the second to assign objects to them. Rooms are obtained by Progressively thickening the boundary inward and freezing each free-space region once it becomes enclosed, so every opening seals at its own scale rather than at a radius fixed in advance. Camera poses are used as seeds, which removes the sampling heuristic and makes the segmentation deterministic. Over 10 floors of 6 HM3D-Semantics scenes, scored against HOV-SG on identical top-down maps, we recover 74 rooms for 72 annotated regions (HOV-SG: 44), raising room F_1 from 0.741 to 0.890 at IoU 0.25 at some cost in precision, and object-to-room ARI from 0.488 to 0.696 (p=0.002, ahead on every floor).
Read the full abstract

All authors Vinoth Kumar Muthuraj, Soumyadeep Banik, Kushal Sharma, Hardik Jain

Strongly Correlated Electrons

Magnetically activated optical visibility of many-body excitons in NiPS$_3$

NiPS$_3$ is a layered van der Waals magnet that provides a unique platform for exploring the interplay between excitons and magnetic order. In its antiferromagnetic phase, strong many-body interactions give rise to a many-body exciton, which manifests itself as an exceptionally sharp resonance near $1.47 \, \mathrm{eV}$ in optical absorption spectra and photoluminescence. Previous theoretical studies have assigned the local ground state and the many-body exciton to spin-triplet and spin-singlet states, respectively, both with even parity. This picture, however, cannot account for the observed optical visibility of the many-body exciton because one-photon transitions between these states are forbidden by spin and parity selection rules. Here, using group-theoretical analysis and exact diagonalization of single- and two-cluster models, we show that zigzag antiferromagnetic order breaks the relevant symmetries and activates the otherwise forbidden transition. We further find that trigonal distortion of the local ligand environment and the inter-cluster exchange interaction relax additional spatial and spin constraints on the transition, producing an exciton signal in the optical conductivity that is distinguishable from the spectral background. These results provide a microscopic explanation for the optical visibility of the many-body exciton and its connection to antiferromagnetic order in NiPS$_3$.
Read the full abstract

Combinatorics

The saturated spectral radius for complete graphs

A graph is $K_{r+1}$-saturated if it is $K_{r+1}$-free and adding any missing edge creates a copy of $K_{r+1}$. Kim, Kim, Kostochka, and O conjectured that $K_{r-1}\vee(n-r+1)K_1$ minimizes the spectral radius among all $n$-vertex $K_{r+1}$-saturated graphs. They proved the case $r=2$, and the cases $r=3$ and $r\in\{4,5\}$ were subsequently established by Kim, Kostochka, O, Shi, and Wang, and by Wang and Hou, respectively. We settle the conjecture for all $r\ge3$: if $n\ge r+1$ and $G$ is an $n$-vertex $K_{r+1}$-saturated graph, then \[ \rho(G)\ge \frac{r-2+\sqrt{(r-2)^2+4(r-1)(n-r+1)}}{2}, \] with equality if and only if $G\cong K_{r-1}\vee(n-r+1)K_1$. We also prove O's local two-walk conjecture for every $r\ge2$: \[ \sum_{w\in N_G(v)}d_G(w) \ge (r-2)d_G(v)+(r-1)(n-r+1) \qquad(v\in V(G)). \] If $G$ has no universal vertex, the inequality holds with the additional term $(r-1)(r-2)$ on the right-hand side. This constant is best possible uniformly in $n$ for every fixed $r$, and gives a strict improvement when $r\ge3$. A corresponding spectral bound follows.
Read the full abstract

Soft Condensed Matter

Confinement-Induced Pumping of Chiral Active Fluids

Chiral active fluids, composed of continuously rotating active constituents, exhibit a wealth of nonequilibrium phenomena arising from the interplay of activity, hydrodynamic interactions, and broken mirror symmetry. While these systems naturally generate circulating flows and active turbulence, converting their microscopic rotational motion into directed macroscopic transport remains an open challenge. By means of mesoscale hydrodynamic simulations, here we show that channels with an intrinsic asymmetry result in the spontaneous formation of a persistent net flux in the absence of externally imposed pressure gradients or body forces. Our results can be extrapolated to various geometric confinement strategies providing efficient and versatile strategies for transforming chiral activity into autonomous fluid transport, such that they can be utilized as a promising platform for self-powered microfluidic pumping.
Read the full abstract

High Energy Physics (Experiment)

ResoSeg: Resonance Tagger using Transformer and Segment Model

Deep learning has been widely applied across many areas of experimental high-energy physics, yet existing models address only event-level classification or object tagging and therefore still require reconstruction algorithms tailored to each decay channel. We present the first application of segmentation to resonance tagging at BESIII and introduce ResoSeg, a deep learning model that jointly performs particle-level segmentation and event-level classification, enabling a one-pass analysis of resonance to anything decays while precisely reconstructing the relevant resonance properties. We demonstrate the reconstruction of $\eta_c$ with $e^+e^-\to\pi^+\pi^-h_c$, $h_c\to\gamma\eta_c$, $\eta_c\to\text{anything}$. The model is trained on BESIII-$\eta_c$ dataset, which is constructed with per-track true labels obtained via a Truth-Matching Algorithm. Experimental results show that the average combined efficiency of ResoSeg is more than double that of the conventional 16-channel approach across energy points from 4.19 to 4.60\,GeV. The model generalizes to unseen energy points, adapts to other $\eta_c$ production modes through transfer learning, and remains robust against variations in the $\eta_c$ mass, width, and branching fractions, providing a general, resonance-aware model applicable beyond $\eta_c$ and BESIII. The source code is available at https://github.com/oashen/ResoSeg.
Read the full abstract

All authors Chunkai Li, Junhao Yin, Ke Li, Jingde Chen

Robotics

Quantifying Spectral Differences in Vehicle Kinematics Between Production Autonomous and Human-Driven Vehicles Across Driving Scenarios

Differences in vehicle kinematic characteristics between production autonomous vehicles (PAVs) and human-driven vehicles (HVs) have been limitedly investigated by empirical studies. Most recent studies rely on simulation-based models, while some further investigate low-level adaptive cruise control (ACC) systems in controlled experiments. These methods commonly adapt some time-domain metrics to characterize PAV-HV differences across limited driving conditions. However, current PAVs equipped with high-level autonomous driving systems generate driving behaviors in a black box using data-driven models. These fundamentally different mechanisms for generating behaviors may produce distinct kinematic characteristics in traffic. More importantly, these time-domain metrics cannot reflect frequency-related traffic dynamics across different driving scenarios. Thus, this study adapted a real-world PAV dataset with four PAV platforms and developed a frequency-domain framework to quantify kinematic differences between PAVs and HVs across diverse driving scenarios, including varying driving states, lighting, weather, and vehicle densities. The framework transforms kinematic signals into the frequency domain and extracts spectral features, and then compares these features between PAVs and HVs based on kernel density estimation and Wasserstein distance. The results reveal clear scenario-dependent PAV-HV spectral differences. Specifically, speed-related differences were consistently smaller during car-following than cruising, while rainy conditions consistently enlarged acceleration-related differences compared with clear conditions. These findings highlight the necessity of multi-scenario evaluations and demonstrate the value of frequency-domain analysis for characterizing PAV-HV kinematic differences under real-world conditions.
Read the full abstract

All authors Peiyi Fang, Xiangyu Li, Yonglin Weng, Ke Ma

Astrophysics of Galaxies

E-INSPIRE - II. Finding relics from wide-sky multi-band surveys: A proof-of-concept machine learning regression algorithm

In this second paper of the E-INSPIRE series, we train a machine-learning-based regression on $\sim430$ nearby ($z<0.5$) ultra-compact massive galaxies (UCMGs) with spectroscopically inferred kinematics, stellar population parameters and a measured “degree of relicness” (DoR). Our goal is to investigate how robustly the spectroscopically inferred DoR can be statistically reconstructed from observable galaxy properties, and to explore the potential applicability of this framework to future wide-area surveys. We test several regression algorithms finding that Support Vector Regression (SVR) provides the best performance. We explore multiple input feature configurations, from a minimal set including only age and metallicity to more comprehensive ones incorporating stellar population parameters, kinematics, structural properties, and the associated uncertainties. All tested models achieve similarly high performance on the training set ($R^2\ge0.81$), except for the minimal configuration ($R^2\sim0.78$). When evaluated on an independent INSPIRE sample of 52 UCMGs, the predictive power remains robust, although with increased model-to-model variation. The DoR distribution shows three regimes, with low (DoR$<0.3$) and high (DoR$>0.6$) values sparsely populated, leading to mild regression shrinkage toward intermediate values. However, this behaviour enables a conservative selection strategy: galaxies with predicted DoR$\ge0.6$ are strongly biased toward genuine extreme relics, making them prime targets for follow-up observations. This proof-of-concept confirms that the spectroscopically inferred DoR is robustly connected to observable stellar population and kinematical properties, and provides a first step toward future relic-candidate selection strategies in large photometric and spectroscopic surveys.
Read the full abstract

All authors Charles Rosen, Chiara Spiniello, John Mills, Alexey Sergeyev, Vladyslav Khramtsov, Anna Ferré-Mateu, Johanna Hartke, Michalina Maksymowicz-Maciata, Malgorzata Siudek, Crescenzo Tortora

Sound

Direct Preference Density Alignment for Conversational Audio Equalization

Large Language Model alignment typically relies on learned proxy reward models, which significantly increase the memory footprint during training and are notoriously prone to instability and reward hacking. While offline methods like Direct Preference Optimization (DPO) bypass the reward model, they lose the ability to perform online exploration. If no optimization constraints are applied, this can lead to format collapse in bounded, continuous spaces. To resolve this, we propose Direct Preference Density Alignment: An alternative framework that removes the need for a learned proxy reward model while strictly preserving the benefits of online reinforcement learning. We leverage large-scale user data (approximately 90,000 samples) to construct non-parametric preference density maps, establishing an empirical reward surface. In addition to removing the reward model, Direct Preference Density Alignment enables the combination of the online structural grounding of Group Relative Policy Optimization (GRPO) with the targeted offline refinement of DPO. We show that this GRPO+DPO combination achieves the highest performance, and in a blind audio equalization listening test, enables a 1.5B-parameter model to achieve perceptual parity with a carefully prompt-engineered GPT-4o mini baseline, using only a fraction of the inference compute.
Read the full abstract

All authors Ioannis Stylianou, Sven Ewan Shepstone, Jon Francombe, Pablo Martinez Nuevo, Zheng-Hua Tan