Chemical Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 12 September
Accurate quantum number assignment for calculated molecular energy levels is a critical bottleneck in generating line broadening parameters for comprehensive line lists for radiative transfer applications. We present an automated pipeline for assigning Air Force Geophysics Laboratory (AFGL) quantum numbers to CO2 calculated rovibrational states lying below 15,000cm$^{-1}$ across all 12 stable isotopologues. A GraphSAGE graph neural network is trained transductively on empirical (MARVEL) energy levels, exploiting inter-isotopologue perturbation chains and intra-isotopologue rotational ladder edges to propagate assignment information to unlabelled calculated states. Physical uniqueness is enforced locally by a Hungarian algorithm solver operating within groups of states sharing the same polyad, rotational quantum number, and parity. A five-generation bootstrap loop iteratively promotes high-confidence predictions into the training set, expanding coverage without additional labelling effort. The pipeline assigns 224,650 previously unlabelled states over 12 isotopologues, accounting for 10.7$\%$ of all available states (including MARVEL-derived levels), with coverage now increased to 97.4$\%$ below 5000cm$^{-1}$. The pipeline includes a novel decision tree method for converting AFGL to Herzberg notation in asymmetric isotopologues, while the architecture and Hungarian uniqueness enforcement are applicable beyond CO2, any molecular system with a conserved polyad-like quantum number and a large body of unlabelled computed states is a natural target for this approach, suggesting a pathway toward automated quantum number annotation for the next generation of large-scale computed line lists.
Databases
Numerical Stability of Linear Algebra Operations over Relational Databases
A large body of work in the database literature develops efficient algorithms for linear algebra and machine learning over matrices defined by relational joins, yet the numerical stability of such computations has so far received no attention. This is a practical concern: a join matrix can be much larger than the input database, and the repeated copies of input values it contains compound the floating-point errors incurred by the numerical operations performed over it. This paper initiates a formal investigation of numerical stability for linear algebra over database joins. We first show that backward stability, the standard yardstick of numerical stability, loses its effectiveness in this setting: join matrices form a structured subspace of the ambient matrix space, so a perturbation explaining a computed result need not correspond to any perturbed input database. This failure already occurs for operations as simple as matrix-vector multiplication. To overcome this limitation, we introduce projected backward stability, a generalization of backward stability from the computation of one function to that of a composition of two functions, and establish its connection to classical backward stability. In our database setting, the two functions are the join query and the numerical operation. We further introduce the database condition number as the square root of the ratio of maximal to minimal number of copies of input data values into the join matrix, and show that it quantifies how a perturbation of the join matrix is amplified into a perturbation of the input database, independently of the computation used. The database condition number coincides with the classical condition number of the expansion matrix that replicates input values into the join matrix.
Read the full abstract
Computational Engineering
Abundance Is an Expenditure Condition: AI Automation, Scarcity Rents, and Access
If AI and automation make reproducible goods cheap, do scarcity rents disappear or migrate? We give a closed general-equilibrium answer that separates a low unit price from economic abundance. Agents consume an automated good, a fixed-supply good, and a numeraire; their purchasing power comes from resource endowments and ownership of scarce assets. The equilibrium of a heterogeneous economy exists, is unique, and is globally stable. Aggregate scarcity rent obeys an exact accounting identity: it rises with automation if and only if real expenditure on the automated good falls. In a symmetric economy this sign is determined by whether the curvature of marginal utility is above or below one. Thus marginal cost converging to zero is insufficient: demand rebound can absorb the released resources. After automated demand is fixed or sufficiently satiated, each agent's access share is an exact convex combination of net purchasing-power and scarce-asset ownership shares. This yields a concentration decomposition with a covariance term, showing why equalizing one asset can increase access inequality when ownership sources were offsetting. A compute extension distinguishes a fixed productive input, whose rent can vanish, from a binding throughput constraint, whose rent persists. Numerical experiments reproduce the sign reversals, ownership effects, and institutional frontiers, and imply eight falsifiable restrictions. The results replace a binary “post-scarcity” claim with a testable condition on expenditure, capacity, and ownership.
Read the full abstract
Artificial Intelligence
Do Not Restart: Residual Completion for Stateful Agent Handoffs
Routing and cascades reduce tool-agent cost by transferring control across models, but stateful handoffs must preserve accepted choices, realized effects, and unfinished obligations. We formulate this as commitment-constrained residual completion and introduce Commitment-Frontier Residual Completion (CFRC). CFRC enforces target-before-proposal, whole-proposal-before-authority, and live-evidence-before-success: it freezes a residual contract from accepted progress, closes the successor continuation into an evidence-linked graph, and admits execution only when the remainder is covered, with live receipts discharging obligations. We establish contract-relative partial correctness, which extends to the original residual request under complete contract construction. Across five environments and two same-provider model pairs, CFRC achieves comparable macro accuracy to strong full-task agents at 22.0% to 34.6% mean per-surface cost, with additional cross-provider results demonstrating broader transfer.
Read the full abstract
Statistical Methodology
First-passage reliability sensitivity analysis of linear systems subjected to non-Gaussian wind excitations by surface decomposition method
This contribution develops a surface decomposition method for first-passage dynamic reliability sensitivity analysis of linear systems exposed to non-Gaussian wind excitations. The first-passage failure probability sensitivity is formulated as a system surface integral over a highly non-smooth and high-dimensional hypersurface. This complex integral is first decomposed into a collection of component surface integrals over the truncated smooth quadratic hypersurfaces. The dominant components are then identified based on the relative magnitudes of the first-order approximations of the component failure probabilities. A nested sampling algorithm is constructed to efficiently estimate the sum of these component surface integrals, in which the number of system limit-state function evaluations equals the number of outer-level samples while remaining independent of the inner-level sample size. A key advantage of the present approach is that the function evaluation results can be reused across different design parameters. Two numerical examples are explored to demonstrate the effectiveness of the proposed method. The results indicate that the number of function evaluations required is typically below 100 to achieve a target coefficient of variation of 0.1.
Read the full abstract
Machine Learning (Statistics)
Resolution-Independent Analysis of Encoder–Decoder Operator Learning via Limiting Kernels
Operator learning is formulated on function spaces, but training data are typically available only through finite-dimensional representations. In encoder–decoder architectures, a matrix-valued kernel on the encoded space induces an operator-valued kernel on the original function spaces, and the corresponding reproducing kernel Hilbert spaces are isometrically isomorphic. As the input and output resolutions increase, the induced kernels converge to a limiting kernel, in the sense of operator-norm convergence of their associated integral operators, allowing regularity assumptions to be stated independently of the encoding resolution. For regularized stochastic gradient descent, we establish upper bounds for decreasing and fixed step sizes, separating the encoding and regularization terms from optimization terms of order \(t^{-\theta}\) and \(T^{-\theta'}\), respectively, for any \(\theta,\theta'\in(0,1)\). We further prove lower bounds showing that these encoding-induced terms are generally unavoidable. The analysis is further extended to encoder–decoder neural networks through the limiting neural tangent kernel (NTK), yielding error bounds with an additional finite-width term and polynomial parameter and sample complexity guarantees when the encoding errors decay algebraically. The framework covers matrix-valued kernels constructed from radial and dot product kernels, NTKs arising from wide encoder–decoder neural networks, and encoder–decoder pairs based on Fourier, Legendre polynomial, wavelet, PCA, or pointwise sampling representations.
Read the full abstract
Chaotic Dynamics
Integrable and Chaotic 4-Dimensional Lotka-Volterra Models and Population Sustainability
We examine a 4-dimensional generalization of predator-prey models describing interactions among four species. We show that these systems exhibit a rich variety of asymptotic behaviors, with solutions that are either integrable, leading to non-sustainable dynamics characterized by unbounded population growth or collapse, or chaotic, where all species coexist over time. Moreover, we review the integrable cases, which are classified into two-parametric families, and examine three-parametric families that behave similarly to the known two-parametric integrable cases. We also analyze chaotic Lotka-Volterra models in terms of their Lyapunov exponents and Poincare' surfaces of section, which turn out to reveal underlying structures that are compatible with what is expected from sustainable dynamics.
Read the full abstract
Complex Variables
Certain families of series involving Hurwitz and Lerch zeta functions
This paper deals with a certain family of series which is derived from generating functions of the Frobenius-Euler and Apostol type polynomials and numbers. When special cases of this series are examined, it is shown that it generates some well-known families of zeta functions, such as the Hurwitz zeta and the Lerch zeta, etc. We also give an open problem for these relation. We give analytic continuation of this function. By using the Cauchy Residue Theorem, We show that this series interpolates the Frobenius-Euler type polynomials at negative integers. Moreover, by applying the Laplace transform to the generating function for these polynomials, we get infinite series representations involving the Lerch zeta function and these polynomials. In addition, We show that this interpolation function can be representation in terms of the Lerch zeta function and the Hurwitz zeta function. Some special values for the results are also given.
Read the full abstract
Networking
Meter-Level Wi-Fi RTT Localization on a Production Enterprise WLAN
Wi-Fi Fine Time Measurement (FTM) promises indoor localization by reusing access points (APs) already deployed for connectivity, but prior evaluations mostly use APs purpose-deployed or calibrated for ranging, leaving it unclear whether a production enterprise WLAN can provide useful localization without localization-specific infrastructure. We evaluate Wi-Fi round-trip time (RTT) localization on IllinoisNet, a live campus WLAN whose APs were placed for coverage and capacity. Using five commodity Android phones at 10 static locations across a 50 m x 30 m office floor spanning LOS, NLOS, and multipath conditions, weighted nonlinear least squares achieves a median error of 1.21 m and a 90th-percentile error of 2.68 m, with no AP replacement, repositioning, or ranging calibration. Residuals vary in magnitude and sign across APs and propagation conditions, suggesting a single global correction is insufficient and motivating AP-aware software calibration rather than new localization-specific infrastructure.
Read the full abstract
Computation and Language
SyRHM: Symbolic-Language-Enhanced Reasoning with Associative Retrieval for Zero-shot Harmful Meme Detection
Detecting harmful memes is critical for maintaining safe online communities. However, harmful intent is often implicit, arising from visual-textual incongruity and cultural stereotypes, which challenges existing multimodal detectors. We propose SyRHM, a framework that decomposes harmful meme detection into meaning-grounded retrieval and symbolic-language-enhanced multi-stage reasoning. SyRHM retrieves semantically related memes by parsing multimodal content into textual elements and descriptions, providing grounded context beyond surface-level similarity. Building on the retrieved context, SyRHM uses a translator stage to convert multimodal inputs into symbolic intermediate representations, and then performs multi-stage reasoning via planner and solver stages, enabling expressive and interpretable analysis of harmful intent. Experiments on FHM, HarM, and MultiOff demonstrate the effectiveness of SyRHM, achieving superior performance on most evaluation settings against multimodal and reasoning-based baselines, while providing reasoning traces for harmful content. The code is available at: https://github.com/Scabbards1500/SyRHM
Read the full abstract
Formal Languages and Automata
Unrestricted 2DFA simulation of 1NFAs: A Quadratic Limitation to a New Lower Bound
A recent result by the present authors established a quadratic lower bound, in the worst case, for the increase in the number of states when a one-way nondeterministic finite automaton is converted to a two-way deterministic finite automaton. Although this simply matched a well-known pre-existing quadratic lower bound by Chrobak, it used a distinct proof method. We show that, much like Chrobak's, this new method is also unable to deliver any lower bound strictly greater than quadratic.
Read the full abstract
Sound
The VoiceMOS Challenge 2026: Evaluating Speech Enhancement, Emotional TTS and Accented TTS Systems
We present the results of the VoiceMOS Challenge 2026, the fifth edition of a scientific challenge on automatic prediction of subjective speech assessments. After expanding the scope to music and general audio in 2025, we refocused the evaluation target on speech and organized three tracks: prediction of absolute and comparative category ratings for enhanced speech, prediction of naturalness and emotion-related tasks for emotional text-to-speech systems, and prediction of speaker and accent similarity for codec-based speech synthesis systems. The challenge attracted a total of 18 teams worldwide, with most teams successfully surpassing the provided baselines. We summarize the challenge results, representative top-performing systems, participant feedback, and directions for future editions.
Read the full abstract
Computer Vision
Restore What Matters: Lessons from Joint Restoration and Recognition
Recognition pipelines typically adopt a restore-then-recognize workflow, yet decades of experience show that generating visually pleasing images seldom translates to improved recognition. We propose a Joint Restoration-for-Recognition (JR$^2$) paradigm: restore only what downstream tasks truly require, with task signals dictating where, how much, and whether restoration is necessary. JR$^2$ rests on three pillars: (i) Physics, employing optics-accurate turbulence simulation, extensible to blur and noise, to ground restoration in real image formation; (ii) Neuroscience, drawing on selective attention and neuroplasticity to direct model capacity toward identity-critical regions and frames while bypassing already-clean inputs; and (iii) Vision & Learning, coupling recognition loss end-to-end through restoration and alignment so that low-level edits maximize high-level identity stability. Evaluations on IARPA-BRIAR show consistent improvements (e.g., TAR@0.01% FAR +0.6; FNIR@1% FPIR -2.5), while a quality gate skips ~70% of clean frames, reducing cost. Ablations confirm physics priors enhance realism, joint training prevents catastrophic forgetting, and selective restoration suffices in many cases. We conclude that better-looking images are neither necessary nor sufficient; restoration modules must be task-driven, selective, and physically aware. Code, pretrained models, and recipes are provided for integration.
Read the full abstract
Quantum Physics
Binary Optimization with Complex Constraints via Quantum Approximate Multi-Objective Optimization
We show that a class of binary optimization problems with complex non-quadratic objectives or constraints can be reformulated as multi-objective quadratic unconstrained binary optimization problems. When the objective and constraints depend on a small number of quadratic features and are monotone with respect to their preferred directions, at least one globally optimal solution lies in the Pareto set of the associated MO-QUBO. This enables the constraints to be evaluated classically on Pareto-optimal candidates rather than encoded as penalties. We demonstrate the approach for binary portfolio optimization under a Conditional Value-at-Risk constraint. Using Quantum Approximate Multi-Objective Optimization on an illustrative 100-asset instance, we approximate the mean-variance Pareto front using an IBM Quantum computer and derive mean-CVaR fronts through classical post-processing. The hardware results recover the overall structure of the classical front and yield near-optimal feasible portfolios for different risk bounds.
Read the full abstract
Machine Learning
PPDL: A Real-world Industrial User Retention Ratio Forecasting Framework Integrating Physical Priors with Deep Learning
In multi-channel paid user acquisition, early and accurate prediction of user retention at the channel level is crucial for optimizing budget allocation. User retention curves display a pronounced temporal pattern: an initial period of high churn transitions into long-term stability. This pattern is further characterized by regular fluctuations attributable to seasonality and exhibits high serial autocorrelation. These intrinsic properties make such curves highly suitable for analysis within a time-series forecasting framework. However, forecasting user retention ratio for large-scale short-video platform faces three major challenges: significant heterogeneity across channels, pronounced global trend of decay followed by saturation, and short look-back windows. To address these challenges, we propose PPDL, a novel forecasting framework that integrates physical priors with deep learning. We first introduce a trend-residual decomposition component. The trend is modeled using the Weibull distribution, whose parameters are learned via a Multilayer Perceptron (MLP). Secondly, for the residual component, we design an auxiliary embedding module on top of a deep learning backbone to maintain the channel identity awareness. Finally, to enhance the model's sensitivity to trends, we design a Multiscale Trend-penalized loss function. The proposed approach PPDL is validated through comprehensive experiments on industrial-scale datasets, covering three applications with an average of 30+ channels each. Experimental results show that PPDL achieves improvements across different backbones and significantly outperforms existing online solutions.
Read the full abstract
Category Theory
Bicategorical Idempotent Completion
In recent years, higher categorical variants of idempotents have become an object of interest. Notably, they appear when categorifying algebraic structures motivated by mathematical physics. Working in the setting of bicategories, we give a rigorous definition of the bicategorical idempotent completion as outlined by Gaiotto and Johnson-Freyd in arXiv:1905.09566. We show that this agrees with the Cauchy completion of a locally idempotent complete bicategory in the sense of Lawvere.
Read the full abstract
Statistical Mechanics
Thermodynamic geometry of inclusion statistics
We investigate the thermodynamic geometry of an ideal quantum gas obeying inclusion statistics, characterized by a negative statistical parameter $g < 0$. In this framework the grand-canonical partition function admits a finite maximum fugacity, and the thermodynamic scalar curvature $R$ is strictly positive for all $g < 0$, reflecting effective attractive statistical interactions analogous to those of a bosonic system. As the fugacity approaches its maximum value, $R$ diverges, signaling a phase transition of the Bose-Einstein condensation type. A key distinction from the ordinary ideal Bose gas is that the condensation temperature is elevated relative to the bosonic case, and finite-temperature condensation occurs even in the dimensional regime $1/2 < D/\sigma \leq 1$ where standard bosons do not condense, while for $D/\sigma \leq 1/2$ the transition temperature vanishes. Three independent criteria; divergence of $R$, the maximum fugacity singularity, and the non-analytic cusp in the specific heat, coincide at the same condensation point, confirming the thermodynamic consistency of the transition.
Read the full abstract
Human-Computer Interaction
What Makes a Great Co-Worker in an AI-Native Workplace?
As knowledge work grows interdependent between humans and AI, we ask what makes a great co-worker in an AI-native workplace. To answer this, we conducted 22 interviews and a large-scale mixed-methods survey of 1,534 knowledge workers at a multinational technology company. We contribute BACI, a framework of 75 co-worker qualities that apply to humans and AI, spanning Benevolence, Ability, Cooperativeness, and Integrity. Comparing priorities for humans and AI identified 11 co-worker archetypes and revealed disagreement over whether AI should have warmth, take initiative, or own outcomes. We also show how priorities for these archetypes varied with workers' individual characteristics. Lastly, we contribute a taxonomy of AI work etiquette capturing the obligations co-workers expect of one another when preparing, sharing, and taking responsibility for AI-supported work. Based on these findings, we derive implications to inform worker-centric AI and workplace design.
Read the full abstract
Artificial Intelligence
Partition Scores Are Not System Scores: Deployment-Fidelity Gaps in Decomposed Algorithm Selection
Oracle-style quantities, including virtual best solvers, selected-portfolio VBS, virtual-best encodings, and best-in-family summaries, are widely reported as upper bounds on what a deployable selector could achieve. In decomposed algorithm selection, an analogous partition-level score grants an oracle choice of the best algorithm within the selected family; once the family selector is fixed, the deployable system must replace that within-family oracle with a learned within-family selector. We define the deployment-fidelity gap G(R) as the difference between partition-level and deployable end-to-end utility and derive two accounting consequences: a per-instance margin-regret stability condition that tells us when a partition-time family choice is deployment-optimal, and a sharp partition-only identification interval that, when it strictly crosses zero, prevents the partition-level report from certifying the deployable winner. Across five public algorithm-selection benchmarks spanning tabular AutoML and combinatorial CSP/SAT, every decomposed pipeline has positive G(R), ranging from 0.012 on TabZilla to 0.13 on PROTEUS-2014. Four of ten decomposed-versus-flat decisions have sign-changing point estimates; on PROTEUS-2014, a 33-point partition advantage shrinks to a 20-point end-to-end advantage. A training-side validation gap-correction diagnostic recovers the point-estimate deployable sign on all four sign-changing cells; it is a reporting aid, not a substitute for direct end-to-end evaluation. Partition and end-to-end scores should be reported side by side.
Read the full abstract
Rings and Algebras
On the Structure of Low-Dimensional Poisson Algebras over Arbitrary Fields
We investigate the structure of Poisson algebras of dimensions at most three over an arbitrary field. Our approach is based on the internal structure of the associated commutative associative and Lie algebras, with particular emphasis on the associative square $P^2$, the derived Lie algebra $[P,P]$, the Lie center, the associative annihilator, idempotents, ideals and decomposability. We obtain a complete classification in dimensions one and two and give a structural classification in dimension three. In dimension two, we prove that the associative and Lie multiplications cannot be simultaneously non-zero. In dimension three, the classification is organized according to the dimension and position of the derived Lie algebra and, in the case of trivial Lie multiplication, according to the dimension of $P^2$. The arbitrary-field setting leads to phenomena which do not occur over the complex field. In particular, quadratic and cubic field extensions appear naturally in the classification, some families depend on equivalence classes of symmetric bilinear forms and on the structure of three-dimensional Lie algebras over the ground field, and characteristic $2$ gives an additional family of Poisson algebras with both multiplications non-zero. Over the complex field, the resulting classification specializes, up to changes of basis and notation, to the known classifications in dimensions at most three.
Read the full abstract
Analysis of PDEs
Ground states to bi-harmonic nonlinear Schrödinger equations with competing dispersion
We study ground-state solutions of the 4th order nonlinear Schrödinger equation with mixed dispersion via the elliptic profile equation $\Delta^2 Q + 2a \Delta Q + bQ - |Q|^\alpha Q=0$, focusing on symmetry breaking of least-action ground states in 2D in the regime $a=1$, $b=1+\epsilon$, $0<\epsilon \ll 1$, where nonradiality was proved by Lenzmann and Weth [26]. We establish a quotient-to-mass relation converting small-$\epsilon$ asymptotics of the Weinstein quotient into mass asymptotics, in any dimension and symmetry class. In 1D we prove the sharp small-$\epsilon$ rate for the quotient for every $\alpha>0$ and deduce the rates for the mass, action and potential norm. In two and higher dimensions the same relation, combined with the quotient asymptotics of Lenzmann-Weth [26] and Mandel-Oliveira e Silva [27], gives the mass rates for the Knapp-type nonradial and the radial ground states. The resulting threshold $\alpha_K(d)=8/(d+1)$ coincides for $d\leq3$ with the existence of normalized minimizers threshold of Fernández-Jeanjean-Mandel-Mariş [16], connecting the least-action and mass-constrained formulations. We complement this with a detailed numerical study. For the cubic nonlinearity we construct a nonradial branch from a Knapp-type example, compare it with radial and angular-mode branches, and verify the predicted rates. For the quartic nonlinearity, turning points and branching are present in the mass-energy diagrams in radial or two- and four-peak nonradial solutions. Here, although least-action ground states are nonradial for small $\epsilon$, the normalized ground states of the same mass appear radial, a consequence of branching. For $\alpha\geq4$ we find only radial ground states, consistent with the conjectured sharp form of the Stein-Tomas inequality on $\mathbb S^1$, equivalent to the radial and nonradial masses having the same leading coefficient.
Read the full abstract
Nuclear Theory
Nuclear mass prediction using bidirectional recurrent neural networks with isotopic and isotonic chain correlations
Nuclear masses are fundamental quantities in nuclear physics, providing essential information for understanding nuclear structure, decay properties, and reaction processes. Here we develop a bidirectional recurrent neural network (Bi-RNN) that naturally incorporates sequential correlations along isotopic and isotonic chains for nuclear mass prediction. The model achieves a root-mean-square (rms) deviation of 78 keV for binding energies of 2339 nuclei with known masses, a 45% improvement over a conventional artificial neural network (ANN) with comparable parameter count. The Bi-RNN also delivers consistent accuracy across different odd-even parity groups and yields an rms of 99 keV for $Q_\beta$ values without explicit training, demonstrating that recurrent correlations encode physically relevant information beyond individual nuclear features. Extrapolation tests on 292 nuclei updated from AME2003 to AME2012 and on 109 nuclei updated from AME2012 to AME2020 reveal that the Bi-RNN maintains stable performance, substantially outperforming WS4, ANN, and earlier AME evaluations. These results demonstrate the power of recurrent architectures in capturing correlations along nuclear chains and suggest Bi-RNN as a robust tool for studying nuclear masses.
Read the full abstract
Cryptography and Security
PQLN: Post-Quantum Security for the Bitcoin Lightning Network's Off-Chain Surfaces
A cryptographically relevant quantum computer will break the elliptic-curve cryptography behind Bitcoin and its Lightning Network, the most widely used payment channel network. Even a post-quantum consensus upgrade of Bitcoin would not cover Lightning's off-chain surfaces, so its gossip, peer transport, invoices, payment onions, and offers need separate protection. An adversary can already record Lightning's encrypted traffic today and decrypt it once such a computer exists. Lightning can therefore move to post-quantum cryptography now, without waiting for Bitcoin, and stop such harvest-now-decrypt-later attacks along with node impersonation, invoice forgery, and payment deanonymization. In this paper, we propose PQLN, a hybrid post-quantum extension of Lightning that protects all of these surfaces with the lattice-based standards ML-DSA and ML-KEM. PQLN distributes post-quantum node identities through Lightning's gossip, hybridizes the transport handshake, adds post-quantum signatures to invoices, commits post-quantum keys in offers, and makes payment onions hybrid. Since post-quantum material is much larger than its elliptic-curve counterpart, we introduce techniques that fit it into Lightning's existing message formats and size limits. We analyze the security of PQLN against a quantum adversary and implement it in rust-lightning, a major Lightning implementation. Our evaluation with real Lightning nodes shows that PQLN nodes interoperate with unmodified nodes. The added cryptographic operations take at most 0.33 milliseconds, and the main cost is communication, since gossip data grows about tenfold with ML-DSA and about fourfold with the smaller Falcon. To our knowledge, PQLN is the first post-quantum design, implementation, and evaluation for Lightning.
Read the full abstract
Logic in Computer Science
Mechanizing Gödel's Incompleteness Theorems and Provability Logic
Robotics
Force-Aware Reinforcement Learning with Hybrid Sensorless Force Estimation for Wheeled-Legged Loco-Manipulation
Force-controlled loco-manipulation requires a whole-body policy to coordinate locomotion and arm motion while regulating end-effector interaction forces. This is challenging under floating-base dynamics and changing support contacts, particularly when end-effector force/torque sensing is unavailable for control. This paper presents a force-aware reinforcement learning approach with hybrid sensorless force estimation for wheeled-legged loco-manipulation. The proposed method provides a structured estimate of the end-effector force as an explicit policy observation, enabling force-guided contact behavior without using an end-effector force/torque sensor for control. The force estimate is obtained by combining generalized momentum observation, contact-constrained wrench projection, and temporal residual learning: the model-based components extract the physically structured part of the whole-body disturbance, while the residual network compensates the remaining motion-dependent bias. The estimated force is integrated into a mode-conditioned whole-body policy with an axis-wise force/position selector, allowing free-space motion, pure force regulation, and hybrid force/position control within one controller. Simulation results demonstrate improved sensorless force estimation and force-control performance. Hardware experiments further validate the proposed controller through quantitative valve-rotation and hybrid wiping evaluations, together with force-guided door opening and zero-force human-guided motion on a real wheeled-legged platform.
Read the full abstract
Computer Vision
GEAR: From Dynamic Encoding to Dynamic Activation in Social Trajectory Prediction
Human trajectory prediction requires modeling both individual motion patterns and social interactions among agents. Existing methods have made substantial progress by using attention mechanisms, graph structures, and temporal encoders to capture dynamic social context. However, most of them primarily focus on how social information is encoded, while paying less explicit attention to how the encoded social context should take effect during future trajectory generation. In this paper, we argue that dynamic social encoding does not necessarily imply dynamic social activation. The same interaction context may require different activation strengths across future horizons and scene densities: social cues should be strengthened when interaction evidence is strong, but suppressed when they are weak or noisy. To address this issue, we propose GEAR, a generation-aware bias activation model for human trajectory prediction. Built upon a bias-decomposed trajectory generation formulation, GEAR dynamically activates the individual-motion and social-resonance bias terms at each future step before final trajectory composition. This allows the model to explicitly control when and how strongly individual and social bias components participate in generation. Experiments on ETH-UCY, SDD, and NBA show that GEAR consistently improves the resonance-based baseline and achieves competitive state-of-the-art performance. Further analyses of activation patterns and density-grouped errors validate the importance of calibrating encoded social context during trajectory generation. Our code is available at https://github.com/11isnotavailable/GEAR.git.
Read the full abstract
Robotics
When Do Learned Priors Help Visual Inertial Estimation? A Controlled Study of Prior Integration, Calibration, Initialization, and Backend Consistency
Learned components are increasingly integrated into geometric visual–inertial estimators to provide motion, depth, bias, uncertainty, or confidence cues. Yet it remains unclear whether gains arise from useful learned priors or from changes in the backend, calibration, initialization, temporal association, or evaluation gauge. We present a controlled framework for learning-augmented visual–inertial estimation that separates fusion gain from the incremental value of a learned prior and evaluates four evidence layers: local motion consistency, global trajectory accuracy, physical-state correctness, and numerical consistency. We instantiate the framework with a MonoViT-based monocular motion prior added as a local relative-motion factor to an unchanged VINS backend. We compare Original VINS and learned-prior VINS under matched sensor streams, timestamps, initialization, frontend/backend settings, and camera–IMU extrinsics, while probing calibration, initialization, state coupling, scale, bundle adjustment, and loop closure. On KITTI, with fixed reference extrinsics, translation APE RMSE is 31.4 m for Original VINS and 31.8 m with the learned prior. Across four recordings, the prior changes mean APE by only -0.2%, while a five-times-higher weight worsens it by 8.2%. Online extrinsic updates increase mean APE by 45.7% and 52.1%, respectively, while mean RPE changes by less than 2%. These results show that fusion performance alone cannot establish the value of learned priors. Reliable evaluation requires same-backend controls and joint analysis of prior compatibility, calibration, initialization, global drift, physical-state error, and backend consistency.
Read the full abstract
Artificial Intelligence
Surprising Effectiveness of Self-Demonstrations in Enhancing Schema-Ontology Mapping with LLMs
Integrating heterogeneous relational databases into a centralized ontology remains a persistent challenge in enterprise knowledge representation, primarily due to semantic heterogeneity, cryptic schema naming, missing metadata, and the abstraction gap between relational schemas and ontological models. Although large language models (LLMs) offer strong semantic reasoning capabilities, we show that directly applying them through one-shot prompting or naive multi-stage pipelines leads to poor performance for schema-ontology mapping. This paper presents a self-demonstration-driven approach that combines a neuro-symbolic task decomposition with a novel mechanism for automatically generating pattern-guided, dependency-aware demonstrations to address this integration challenge. Our approach incorporates two key strategies to achieve substantial accuracy gains over existing LLM-based schema integration methods: (i) a neuro-symbolic decomposition of the task into cascaded sub-tasks, where symbolic constraints structure the search space and LLMs perform semantic reasoning within each focused sub-task, and (ii) self-generated demonstrations guided by domain-agnostic patterns to supervise each sub-task. Experiments on three of the most challenging scenarios from the RODI benchmark show that our approach achieves state-of-the-art performance, substantially outperforming (25 percentage points F1 improvements) both traditional schema-to-ontology mapping techniques and recent LLM-based schema-to-ontology and schema matching approaches. Ablation studies further reveal the significant benefits of pattern-guided self-demonstrations and the complementary benefits of neuro-symbolic task decomposition.
Read the full abstract
General Relativity and Quantum Cosmology
Frequency shift in gravitational lensing by Kerr metric
In this study, we calculate the relative frequency shift ($\Delta \nu / \nu$) caused by gravitational lensing resulting from the transverse motion of a spinning lens described by the Kerr metric \cite{Kerr:1963ud}. While the effect of transverse velocity on the frequency shift has previously been investigated using the Schwarzschild metric \cite{Rahvar_2020,10.1093/mnras/stae1938}, extending this to the Kerr metric provides a new window for measuring the transverse velocity of a lens or its spin parameter, a parameter often subject to degeneracy in gravitational microlensing observations. Recent microlensing observations have revealed black holes as viable lensing candidates \cite{2022ApJ...933...83S}. Since spinning black holes form naturally from stellar evolution, astrophysical black hole lenses are best described by the Kerr metric. Furthermore, recent observations of supermassive black holes at the centers of galaxies provide an ideal laboratory for testing the observational effects of the Kerr metric by measuring the frequency shifts of lensed sources.
Read the full abstract
Systems and Control
From Benchmark to Deployment: Shift-Robust Fabric Recognition for Industrial Textile Onboarding
Automatically recognising a fabric's construction (jersey, twill, satin) is a bottleneck in textile sourcing, where incoming swatches are still typed by hand. Benchmark accuracy suggests the problem is solved, yet rarely survives deployment. On the \numClasses{}-class FabricFlow benchmark we expose three gaps that headline accuracy hides. First, a duplication audit reveals train/test leakage that inflates accuracy; we rebuild leakage-free splits that report the true difficulty. Second, on the clean data the binding failure is acquisition-source shift between catalogues, not the peripheral shortcuts one might fear: on an archive-exclusive hold-out, standard training holds 58.0% Top-1 at a calibration error of 0.158, while a simple, architecture-agnostic central-texture recipe adds 13.5 Top-1 points and restores calibration. Third, because confusing one fabric family for another is costlier than a within-family slip, we optimise a taxonomic-severity cost: a confidence-gated routing policy auto-types confident swatches and refers only the uncertain minority to a human, sharply cutting onboarding cost. Throughout we report honest negatives: hierarchical classification, OCR fusion and zero-shot vision–language models all fail to help, yielding a concrete, calibrated, cost-aware recipe for deployable textile onboarding.