Peer Revenue Equity in science

Papers

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

All of arXiv

Sunday 30 August

Differential Geometry

Sharp monotonicity for closed three-manifolds with positive scalar curvature

We prove two sharp monotonicity formulae for the natural Green's function of a closed three-manifold with positive scalar curvature, analogous to the Munteanu-Wang theorem for non-negative scalar curvature. We also show that both results may be interpreted as the monotonicity of a suitably defined "enclosed mass" of the sublevel sets of Green's function in the corresponding "conformal" blow-up of the manifold.
Read the full abstract

Computer Vision

MariSat: A Maritime Dataset for Instance Segmentation of Objects in Satellite and Aerial Images

Automated maritime surveillance from satellite and aerial imagery requires large, precisely annotated datasets, which remain scarce for the instance-segmentation task, particularly for small vessels in cluttered port environments. We present MariSat, a new benchmark dataset of 1260 aerial and satellite images covering diverse port and coastal scenes, annotated at the pixel level for eight maritime object classes (sailboat, yacht, jet-ski, fishing boat, cruise ship, military vessel, tugboat and cargo ship). The dataset was produced through a semi-automatic annotation pipeline combining the textpromptable segmentation model SAM 3 with a cascade of geometric and colorimetric post-processing filters, followed by a manual correction and quality-control pass performed with the CVAT annotation platform. We describe the image-collection methodology, the annotation and correction process, and the resulting data organization. We also report class-wise statistics for the training, validation, and test splits. MariSat has already been used to fine-tune and benchmark segmentation and detection models (SAM 3 and YOLO11) for real-time maritime monitoring. We report detailed quantitative and per-class results for both tasks. The MariSat dataset is publicly available on GitHub : https://github.com/amirabbes/P2M-Maritime-Segmentation
Read the full abstract

All authors Amir Abbes, Ines Harrabi, Lucas Justin Yirepoa Kinda, Rim Trabelsi, Adnane Cabani, Fatma Abdelkefi

Software Engineering

A Comprehensive Study of Native Code Bugs in Python Applications

The impact of Python applications has been evidenced by their widespread presence in some of the most impactful software domains, such as machine learning frameworks and scientific computing platforms. These applications often integrate native code components written in a lower-level programming language like C. This multilingual construction brings various benefits such as greater performance efficiency and easier interoperability with diverse runtime environments. However, bugs in the native code (i.e., native code bugs), which are usually stealthy, also constitute a major additional challenge to the quality of the Python applications as a whole. Yet despite existing relevant studies, there remains a lack of comprehensive understanding of native code bugs in Python applications. In this paper, we aim to mitigate this knowledge gap through the first in-depth study of such bugs, dissecting their common symptoms, introducing locations, manifestation characteristics, root causes, and fixes. Based on our extensive automated and manual analyses of 216 native code bugs in real-world Python projects on GitHub, we obtained novel findings about and new insights into the occurrence mechanisms and resolution strategies of those bugs.
Read the full abstract

Machine Learning

Designing for the Next Click: Bandits for Real-Time Page Layout

E-commerce platforms increasingly personalize user experiences through machine learning, yet page layout decisions remain dominated by static rules and manual curation. We present a scalable bandit-based system that optimizes product page layouts in real time while preserving human control over design intent. A contextual bandit model dynamically selects the most effective layout for each session using user, item, and category-level features. The system leverages a LinUCB-based policy to balance exploration and exploitation as it learns from live user interactions. The architecture is designed for seamless integration into large-scale web serving stacks, supporting low-latency inference and continuous model updates. The system was first tested on entry product pages. In online A/B deployments on a major retail platform, our approach achieved positive lifts in session-level performance metrics over a strong heuristic baseline. Our results demonstrate that contextual bandits can effectively optimize visual and structural aspects of product discovery for user engagement, providing a scalable path toward learning-to-design the web.
Read the full abstract

All authors Bhavtosh Rath, Harshith Narasimhamurthy, Bob Eisinger, Cole Stiegler, Adnan Awow, Amit Pande

2608.29850 · 30 Aug · Accepted to The Web Conference 2026 (short paper track), but later withdrawn due to internal prioritization. Subsequently accepted to the Online & Adaptive Recommender Systems Workshop (held in conjunction with the 20th ACM Conference on Recommender Systems, RecSys 2026)

High Energy Physics (Phenomenology)

In-Medium Modification of $\phi$ Meson Mass over Temperature and Momentum

We analyze the in-medium modification of the $\phi$ meson mass below the pseudo-critical temperature $T_\text{c}$ at vanishing baryon chemical potential using QCD sum rules. The sum rules are applied separately to the transverse and longitudinal polarization modes of the $\phi$ meson defined relative to the spatial momentum in the medium rest frame. We map out the temperature and momentum dependence of the mass in each mode and quantify the resulting transverse–longitudinal mass splitting. The splitting develops with increasing temperature and momentum.
Read the full abstract

High Energy Physics (Phenomenology)

Kaon gravitational form factors and mechanical structure in a three-flavor NJL model

We investigate the gravitational form factors (GFFs) of the kaon in a proper-time-regularized three-flavor Nambu–Jona-Lasinio model. We treat the kaon as a light–strange pseudoscalar bound state and evaluate its energy–momentum-tensor matrix element using a dressed quark–graviton vertex. By retaining the interaction-induced contact contribution alongside the quark triangle diagrams, we preserve the gravitational Ward–Takahashi identity and ensure the conservation of the total energy–momentum tensor. We determine the light- and strange-quark contributions to the kaon GFFs, contrast them with the corresponding pion results, and extract the associated pressure and shear-force distributions, together with the Breit-frame and transverse light-front mass radii. Explicit flavor-symmetry breaking dictates that the strange sector carries a larger share of the kaon momentum and mechanical response. Consequently, compared to the pion, the kaon exhibits a less negative $D$-term and more compact mechanical distributions, featuring enhanced central pressure and shear. We further show that a Ward–Takahashi-identity-preserving reduction of the $C$-term projection is essential for maintaining the pion low-energy theorem in proper-time regularization.
Read the full abstract

Computer Vision

ContextBias: Controlled Evaluation of Bias Persistence Under Context Shift in Text-to-Image Models

Text-to-image models learn associations between concepts - in the case of this paper, people's professions, which we refer to as roles - and visual attributes. These associations can underpin many observed forms of stereotypical bias. A key open question in this area is whether these associations are stable or change when visual representations of people in professional roles are placed in different prompted contexts. We introduce ContextBias, a controlled evaluation framework, and ContextBench, a benchmark spanning 92 roles and 1,656 semantically controlled prompts, designed to isolate the effect of contextual variation on role-linked visual representations. Evaluating four state-of-the-art models on 66,240 generated images, we find that placing a role in a semantically unrelated context does not suppress role-linked attributes; instead, cross-role attribute concentration increases (pooled BI $+0.047$). Demographic cues, characteristic garments, and role-specific tools remain highly prevalent across context-free, related, and unrelated conditions, and are robust to semantic prompt reformulation. Scene composition and camera framing show the greatest context-sensitivity. These findings reveal a form of stereotypical persistence that remains largely invisible to context-free evaluations, highlighting the need for controlled contextual variation in bias benchmarking. Code and dataset: https://huggingface.co/datasets/shaghayegh/ContextBias , https://github.com/Sina-Emami/ContextBias
Read the full abstract

All authors Shaghayegh Kolli, Sina Emami, Moreno D'Incà, Pouyan Nejadi, Nicu Sebe, Massimiliano Mancini, Jana Diesner

Computation and Language

Influence-Directed Distillation: Solving the Diversity Bottleneck in Sampled-Token On-Policy Distillation

Sampled-token on-policy distillation (OPD) efficiently transfers capabilities from teacher to student using student-generated tokens, requiring teacher probabilities only for sampled tokens. Yet it frequently suffers from diversity distillation failure: the student's pass@1 improves while its pass@$k$ plateaus, failing to inherit the teacher's diversity. To explain this, we introduce First-Order Local Entropy Influence, a signed first-order proxy that decouples each update's entropy effect into the teacher–student log-probability gap and the student's local probability structure, and empirically links entropy contraction to negative-influence positions. Motivated by this, we propose Influence-Directed Adaptive On-Policy Distillation (IDA-OPD): rather than relying on costly full-vocabulary Forward-KL objectives, it preserves entropy-expanding updates while replacing entropy-contracting ones with divergence-adaptive advantage shrinkage, using only the teacher's sampled-token log-probability. Experiments on reasoning-oriented distillation show IDA-OPD consistently improves pass@$k$, inheriting the teacher's diversity through distillation, matches the strongest teacher-informed methods at strictly lower cost, and broadly maintains vanilla OPD's pass@1, all without full-vocabulary teacher information.
Read the full abstract

All authors Run Yang, Runpeng Dai, Jie Sun, Jielei Zhang, Fan Zhou, Hongtu Zhu, Peiyi Li, Longwen Gao

Signal Processing

From Identification to Authentication for Micro-CSI RF Fingerprinting in OFDM Systems

We consider a scenario where a legitimate user (Alice) authenticates itself to an authenticator (Bob) by transmitting orthogonal frequency division multiplexing (OFDM) pilots, from which the authenticator extracts the Micro-CSI (M-CSI) fingerprint and compares it against a stored reference via a likelihood test (LT)-based test. We introduce a new spoofing attack, where two adversarial devices collude to first jointly estimate the M-CSI fingerprints of Alice and Bob and then construct a forged signal able to break the authentication mechanism with high probability, limited only by noise effects on the estimates. We derive approximate closed-form distributions of the authentication test statistic under both the legitimate and spoofing hypotheses, enabling the derivation of false alarm and misdetection probabilities in closed-form. We then validate our analytical results against M-CSI fingerprints extracted from experimental data. The results reveal that, given sufficient pilot observations or an equivalent noise statistic between Bob and the attackers, the latter can always drive the test statistics to a random classifier, vanishing the security of M-CSI-based authentication.
Read the full abstract

High Energy Physics (Phenomenology)

Debye screening mass in hot QCD at three loops: Canonical form of the integrand

The Debye screening mass is a fundamental parameter characterizing the screening of chromo-electric fields in a hot quark-gluon plasma. It plays an important role in thermal field theory, entering the description of screening lengths, transport phenomena, heavy-particle interactions in the early Universe, and the dimensional reduction program that connects thermal QCD to effective three-dimensional theories. In this contribution, we revisit the reduction strategy that serves to organize the large number of terms that contribute to the screening mass at the three-loop level, applying recent advances based on canonical forms of thermal (sum-) integrands. We emphasize the role of integration variable shifts, and discuss how canonical representations of thermal integrands may simplify future high-order calculations in hot QCD.
Read the full abstract

General Economics

The Price of Intelligence: A Quality-Adjusted Price Index for AI Services

How fast AI inference prices have fallen depends on how an index holds quality constant. We build quality-adjusted price indices for text and code inference sold through APIs, joining 21,024 posted prices to a capability scale fitted to 4,605 benchmark scores. From January 2025 to July 2026, matched-model methods record an annual fall of 0.07 in log price per token. Our pre-specified hedonic index falls at 0.51 a year in logs (95% interval 0.11 to 0.89), entirely through the rising capability of the models on sale. Across three treatments of measurement error and two anchor sets it runs from 0.34 to 0.89. Excluding six anchors flagged for possible contamination leaves model rankings intact (rank correlation 0.998) yet lowers the rate by 0.40 to 0.51 under two treatments. Agreement on rankings therefore does not license claims about levels or increments. Per completed task, the data do not establish a quality-adjusted decline.
Read the full abstract

2608.29843 · 30 Aug · 50 pages, 9 figures. v2 ends the headline window in July 2026, adds three treatments of measurement error and withdraws the per-task result of v1. Accepted (poster), NeurIPS 2026 EconML workshop, non-archival. Data and code: https://doi.org/10.5281/zenodo.22177190; pre-registration: https://doi.org/10.17605/OSF.IO/5UQJ2

Superconductivity

Superheating Field of Extreme Type-II Superconductors Calculated from the Eliashberg Theory

We calculate the superheating field $H_s$ of a type-II superconductor with a large Ginzburg-Landau parameter from the isotropic Eliashberg theory. It is shown that the temperature dependencies of $H_s(T)$ can be obtained from a thermodynamic approach for different scattering parameters $p=\hbar/2\pi\tau_Nk_BT_c$ in a wide range of the nonmagnetic impurity scattering times $\tau_N$ ranging from the clean $(p\ll 1)$ to the dirty $(p\gg 1)$ limits. Specific calculations were done for Nb and Nb$_3$Sn using their electron-phonon spectral functions extracted from tunneling measurements. We show that the ratio $H_s(T,p)/H_c(T)$ calculated from the Eliashberg theory exceeds that of the weak coupling BCS model, where $H_c$ is the thermodynamic magnetic field. We also show that, even though nonmagnetic impurities are pairbreakers in the current-carrying state, $H_s(0,p)$ for Nb$_3$Sn at $T=0$ has a maximum at $p\approx 0.2$ at which the ratio $H_s/H_c$ is about $6\%$ higher than that in the BCS clean limit.
Read the full abstract

Computation and Language

SkillForge: Compositional Skill Synthesis with Verification-in-the-Loop for Generating Formally Verified Dafny Programs

Generating formally verified programs from natural language remains challenging: existing approaches either produce code in a single pass without recourse when verification fails, or rely on open-ended agentic reasoning that is non-deterministic and opaque. We introduce SKILLFORGE, a framework that decomposes formal code synthesis into a library of atomic, reusable skills, each targeting a specific subtask such as specification inference, body synthesis, invariant generation, error diagnosis, or targeted repair, and defined by a prompt template, tool binding, and decidable success criterion. A verification-driven harness orchestrates these skills: it submits candidates to the Dafny verifier, diagnoses failures into structured categories, deterministically routes to the appropriate repair skill, and iterates until formal correctness is proved or a budget is exhausted. On a curated benchmark of natural language to Dafny specification pairs, SKILLFORGE substantially outperforms both state-of-the-art agentic approaches (including ReAct-style agents, MCTS-based repair, and RL-guided verification) and traditional iterative baselines, while requiring fewer tokens and lower latency. Ablation studies confirm that every skill contributes measurably, and the harness converges rapidly with the majority of programs verified on the first attempt.
Read the full abstract

All authors Yanming Liu, Xinyue Peng, Jiannan Cao, Xinyi Wang, Jinbo Su

Theoretical Economics

On the Complexity of Bayesian Signal Processing

We develop a computational framework for Bayesian decision-making. We show that as long as no action is optimal in every state, Bayes-optimal choice is intractable. This hardness need not arise from large action, state, or signal spaces, nor from a complicated represented utility function: extracting enough information from a hard-to-interpret signal to act optimally can itself be computationally hard. We also characterize tractability across approximation notions and identify their sources of difficulty. Under the probably approximately correct criterion, sample-based Bayesian learning is tractable if and only if the signal support is bounded. Our results provide justifications for bounded rationality, costly Bayesian inference, and sample-based Bayesian learning.
Read the full abstract

Quantum Physics

Ancilla-mediated fixed-point quantum search using Grover iterations

Grover's quantum search algorithm provides a fundamental quadratic speedup for unstructured datasets, reducing query complexity from $\mathcal{O}(N)$ to $\mathcal{O}(\sqrt{N})$. However, the algorithm's reliance on precise iteration counts leads to the “soufflé problem,” where over-rotation results in a sharp decline in success probability. This limitation is particularly restrictive when the number of solution states, $M$, is unknown. In this work, we present an ancilla-mediated fixed-point quantum search algorithm that achieves robust convergence by mapping the solution amplitude to a dedicated ancilla qubit. Unlike existing phase-matching fixed-point methods, our approach utilizes Grover's real-plane reflections, thereby maintaining the intuitive geometric architecture of the original algorithm. We demonstrate that this method achieves a success probability of at least $92.6\%$ with a query complexity of approximately $\mathcal{O}(\sqrt{N/M})$, effectively bridging the gap between standard amplitude amplification and robust fixed-point convergence.
Read the full abstract

Signal Processing

KDGen-BF: A Generative Site-Specific Multi-User Beamforming Approach

This paper proposes knowledge-distilled generative beamforming (KDGen-BF) framework for site-specific multi-user beamforming. KDGen-BF generates a multi-user beamforming weights from low-dimensional reference signal received power (RSRP) observations without acquiring instantaneous channel state information (CSI). To address the ambiguity caused by limited RSRP observations and interference coupling, KDGen-BF formulates multi-user beamforming as a conditional generation problem and directly outputs beamforming weights beyond a finite codebook. A diffusion transformer is trained through knowledge-distillation and exponential-moving-average (KD-EMA) guidance, and multi-candidate strategy is used for online deployment. Numerical results on multiple DeepMIMO scenarios demonstrate that: 1) under limited probing budgets, KDGen-BF outperforms all baselines; 2) with larger probing budgets, KDGen-BF achieves performance comparable to exhaustive search over the discrete Fourier transform (DFT) codebook and outperforms all other baselines; and 3) under noisy RSRP observations, KDGen-BF remains robust and outperforms all compared baselines.
Read the full abstract

Optics

Controlling the Coupling Strengths in Nanophotonic Networks using Modified Yagi-Uda Nanoplasmonic Antennas

On-chip communication in optical neural networks is commonly done via waveguides which results in large system footprints. A compact alternative is to broadcast light signals between nano-optoelectronic components in free space and tailor the light field distribution using sub-wavelength nanophotonics. We propose and simulate nanoplasmonic metal structures in combination with III-V nanowire emitters and receivers to create an optical network in which the shape and position of these nanostructures create varying weights between the nano-optoelectronic nodes. Using Finite Difference Time Domain modelling, we investigate systems of experimentally verified nanowire optoelectronics combined with nanoplasmonic structures that can be made in the same fabrication step as electrical contacts powering the nanowires. We investigate both individual nanowire/antenna devices as well as networks corresponding to two layers in a neural network. We show that directed communication from a nanowire node can be significantly altered using Yagi-Uda antennas. Modifying the antenna with an asymmetric director component enables the directing of light several different angular directions simultaneously. We find that highly variable complex weight distribution between the connections in two seven node layers can be achieved depending on the combined geometry of the antenna components. The possible weight distributions in compact layers of nanowire nodes could be used for creating a variety of neural networks with complex connectivity. The concepts can be generalized to other types of nanoscale emitter/receiver systems.
Read the full abstract

Number Theory

The arithmetic of critical values II: critical elliptic curves

In this second chapter of the $\textit{Arithmetic of critical values}$ series (ACV), we study certain double covers $E_f\to\mathbb{P}^1$ whose branch locus coincides with that of a quartic polynomial $f$. We give a direct proof of the fact, already shown non-constructively in ACV I, that the elliptic curves $E_f$ admit a $3$-isogeny. Our methods are Galois-theoretic, and lead us to a thorough analysis of the Galois closure of $f:\mathbb{P}^1\to\mathbb{P}^1$. We exploit its rich geometry to prove a Selmer companionship theorem for the family $E_f$, allowing us to exhibit elements in certain Tate-Shafarevich groups which are visible in an abelian surface. We also give some dynamical and Diophantine applications of our constructions, as well as new examples of Jacobians isogenous to a power of an elliptic curve.
Read the full abstract

Computation and Language

EVAR: Evidence-Validated Hypothesis Admission for Budget-Aware Narrative Reasoning

Large language models (LLMs) often produce fluent but weakly grounded conclusions when reasoning over non-interactive, long-form narratives. A central failure mode is that unsupported intermediate hypotheses can enter the reasoning trajectory and contaminate subsequent inference, especially when evidence is scattered across distant parts of the story. To address this problem, we propose EVAR, an evidence-validated hypothesis admission framework for budget-aware narrative reasoning. EVAR first compiles the narrative into an immutable evidence store of source-linked atomic claims and assigns an instance-specific inference budget from unresolved gaps and uncertainty signals. During refinement, EVAR directly proposes candidate hypotheses for unresolved gaps, constructs hypothesis-conditioned validation challenges, and verifies each candidate against the locked store before admission: supported hypotheses enter the answer-supporting state, unverifiable ones are quarantined, and contradictory ones are discarded. A sufficiency-based stopping mechanism further avoids unnecessary refinement. Experiments on NarraCrime and multiple public reasoning benchmarks show that EVAR improves both task performance and evidence faithfulness while maintaining controllable inference cost.
Read the full abstract

Computation and Language

You Know What I Mean: A Benchmark for Agentic Conversational Reference Grounding

Collaborative conversations frequently contain references whose targets are indirect rather than named: resolving "this looks like the fix discussed yesterday" requires combining conversational context with evidence from the surrounding workspace which is accessible through APIs or user interfaces. We formalize this problem as Conversational Reference Grounding (CoRG): using a given set of tools to resolve a reference in conversation to the unique external item intended by the speaker. CoRG is challenging because it combines lexical, semantic, and temporal cues distributed across the conversation and the external workspace. Agents must translate these heterogeneous signals into effective tool use: formulating strategies, discovering plausible candidates, inspecting their metadata and content, and ruling out close alternatives. We study CoRG through RepoRef, a benchmark of 400 developer-chat segments grounded in GitHub issues, pull requests, and commits across 92 repositories. Unlike single-shot retrieval tasks, RepoRef often requires multi-step tool use. Our results show that CoRG remains challenging for current agents, even the best agent reaches only 67.0% success rate, leaving one third of references unresolved. These findings position CoRG as a concrete benchmark for studying how agents search, inspect, and verify information in realistic multi-tool environments.
Read the full abstract

Materials Science

Floquet Topological Spin-Valley-Layertronics on a Layered Dice Lattice

The recent discovery of long-sought dice flat band in layered YCl electride has opened up rich possibilities of correlation and topological physics in dice lattice systems [Nature Communications 17, 2213 (2026), arXiv:2509.05958]. Here, we reveal a plethora of distinctive correlated topological phases in a generic layered dice lattice system at band filling of $\nu =4$ under on-site Hubbard interactions: (i) the system is an intrinsic sublattice anti-ferromagnetic (AFM) quantum spin-valley Hall insulator; (ii) a circularly polarized light (CPL) drives the AFM spin-valley insulator into a Floquet odd-parity $f$-wave altermagnet(AM) insulator; (iii) a vertical displacement field turns the Floquet $f$-wave AM insulator into a spin-valley-layer-polarized Chern insulator, with the sign of spin, valley and Chern number all controlled by the direction of the displacement field. Our results not only establish the layered dice lattice as a versatile platform for electrically switchable magnetic and topological phases, but also provide an all-electrical scheme for integrated spin-valley-layertronics for non-volatile information storage and processing.
Read the full abstract

All authors Jianqi Zhong, Teng-Fei Ying, Jinyu Zou, Benjamin T. Zhou

Optics

Magneto-optical intensity effect in a transparent perforated all-dielectric metasurface with an anapole state

We numerically study a perforated all-dielectric metasurface based on the magnetic semiconductor GaMnAs. Near the anapole state, the structure combines high transmittance with a moderate magneto-optical intensity effect. The absolute transmission modulation is enhanced by about a factor of five compared with a smooth film, while the metasurface transmittance reaches 81%. The enhancement is associated with strong field localization in the magneto-optically active material and suppression of the electric-dipole radiation channel in the anapole regime.
Read the full abstract

All authors Polina V. Zorina, Andrey N. Kalish, Vladimir I. Belotelov, Venu Gopal Achanta, Daria O. Ignatyeva

Computation and Language

A^2Agent: Action-Aware Reinforcement Learning for Repository-Level Code Localization Agents

Localizing issue-relevant code regions is a critical step in automated software engineering. However, due to their reliance on sparse trajectory-level signals, existing methods cannot identify which per-turn actions are effective and often discover correct code regions during exploration but fail to commit them. To address these limitations, we propose an action-aware reinforcement learning method that combines a per-turn reward sequence rewarding both the discovery and commitment of gold code regions with an action-level advantage estimation scheme that isolates each action's credit by grouping turns sharing the same exploration context. Extensive evaluations show that our method improves the average F1 over the state-of-the-art (SOTA) by 1.58% on SWE-Bench Verified and 8.55% on SWE-Bench Pro, with our 4B model outperforming baselines up to 8x larger. Our code is available at https://github.com/donian00/A2Agent.
Read the full abstract

All authors Doyeon Kim, Suyoung Bae, Yumin Lee, Jee-Hyong Lee

Superconductivity

Ballistic-to-Localized Dynamics as Signature of Quantum Phase Transition in Josephson Junction

Using state-of-the-art numerical techniques, we investigate how quantum phase fluctuations and quasiparticle tunneling shape the behavior of a small-capacitance Josephson junction across Ohmic, sub-Ohmic, and super-Ohmic dissipation regimes. We show that increasing the Ohmic dissipation strength drives a Berezinskii-Kosterlitz-Thouless quantum phase transition at thermodynamic equilibrium. Deviations from Ohmic behavior profoundly alter this scenario: the super-Ohmic regime exhibits no phase transition, whereas the sub-Ohmic regime displays a continuous second-order transition, consistent with the universality classes of the spin-boson model. Within the Ohmic regime, real-frequency linear-response calculations reveal that the phase particle does not undergo the commonly assumed diffusive-to-localized crossover. Instead, finite resistance progressively suppresses the singular zero-frequency response, producing a ballistic-to-localized change in the dynamics. At finite frequencies, coupling to the environment generates a long-lived excitation in the charge response, which evolves into a resonance as the subgap and shunt resistances are reduced.
Read the full abstract

All authors F. G. Capone, A. de Candia, G. Di Bello, V. Cataudella, R. Fazio, N. Nagaosa, C. A. Perroni, G. De Filippis

Rings and Algebras

Deformations and the controlling $L_{\infty}$-structure of extended Rota-Baxter Lie algebras

In this paper, we introduce the controlling $L_{\infty}[1]$-algebra of extended Rota-Baxter Lie algebras. As applications, we obtain the cohomology of extended Rota-Baxter Lie algebras. We also study abelian extensions and formal deformations by the lower cohomology group. Lastly, we get the notion of homotopy extended Rota-Baxter Lie algebras. Specifically, we present the controlling $L_{\infty}[1]$-algebra of modified Rota-Baxter Lie algebras and of Rota-Baxter Lie algebras with weight.
Read the full abstract

Systems and Control

SymVD: Symmetric Vision Language Action Distillation for Robot Manipulation

While pretrained Vision-Language-Action (VLA) models offer broad generalization capabilities in robotic manipulation tasks, adapting them to real-world environments or handling task shifts often requires substantial additional data and retraining. To address this, we propose Symmetric VLA Distillation (SymVD), a distillation framework that transfers knowledge from a large VLA teacher to a compact student policy by explicitly exploiting geometric symmetries in manipulation tasks, such as rotational and reflectional invariance. SymVD employs an equivariant actor-critic architecture and trains the student using a symmetry-aware objective that aligns with teacher actions under group-invariant properties. We demonstrate that by enforcing the policy to respect equivariance, SymVD reduces redundant exploration across configurations related by group transformations and improves sample efficiency during distillation. To further stabilize and improve distillation, SymVD introduces an adaptive weighting scheme that dynamically balances the distillation objective and reinforcement learning updates based on training progress, enabling robust transfer even when the teacher signal is imperfect or misaligned. Experimental results on robotic manipulation tasks demonstrate that SymVD consistently improves over standard distillation and also outperforms SAC in terms of sample efficiency and generalization to previously unseen symmetric transformations of the environment.
Read the full abstract

Algebraic Geometry

Weil's Theorem for Logarithmic Connections on Irreducible Nodal Curves

We establish an analogue of André Weil's classical theorem for irreducible nodal curves. Let \(X_0\) be an irreducible projective nodal curve. We prove that an indecomposable vector bundle or torsion-free coherent sheaf \(E\) on \(X_0\) admits a holomorphic logarithmic connection \(\nabla\colon E\to E\otimes\omega_{X_0}\) with respect to the dualizing sheaf if and only if \(\deg E=0\). Moreover, when \(\deg E=0\), such a connection can be chosen so that the induced logarithmic connection on the normalization has scalar residues \(\lambda\cdot I\) at one preimage of the node and \(-\lambda\cdot I\) at the other, for some \(\lambda\in\mathbb{C}\). Explicit one-parameter families of flat connections are constructed on the irreducible rational nodal cubic curve as an illustration.
Read the full abstract

Computational Physics

A wide-range temperature-dependent deep potential for sodium with near-experimental accuracy from melting to the critical point

We construct temperature-dependent deep potentials for sodium using finite-temperature DFT data obtained with the PBE, AM05, and $r^2$SCAN exchange-correlation functionals and investigate the thermophysical properties of sodium from room temperature to the critical region. The predicted critical parameters show a dependence on the exchange-correlation functional. The model based on the $r^2$SCAN functional gives a critical temperature $T_c=2.508(8)$ kK, density $\rho_c=0.203(4)$ g/cm$^{3}$, and pressure $P_c=0.249(6)$ kbar, in close agreement with the recommended values. This model is then used to reconstruct the normal-pressure and critical isobars and to calculate the enthalpy, heat capacities, thermal expansion coefficient, bulk moduli, Grüneisen parameter, and speed of sound. The calculated normal-pressure bcc density differs by only 0.06% from the experimental value. Direct solid-liquid coexistence simulations give a melting temperature of $346(2)$ K, 25 K below the recommended value, consistent with the sensitivity expected from meV/atom free-energy errors. Liquid-vapor coexistence simulations reproduce the binodal and yield a surface tension that approaches zero near the critical point. The calculated self-diffusion coefficient and shear viscosity extend the available transport-property data into the expanded-liquid and near-critical regions, where direct experimental information is sparse. We also demonstrate the thermodynamic consistency of the results by comparing the speed of sound obtained from direct acoustic simulations with that calculated from the equation of state.
Read the full abstract

All authors G. S. Demyanov, D. V. Minakov, V. B. Fokin, P. R. Levashov

Numerical Analysis

Wigner-Eckart Factorization of the Polyatomic Boltzmann Collision Operator

We extend the Wigner-Eckart factorization of the spectral Boltzmann collision operator to polyatomic gases with continuous internal energy. Because internal energies are invariant under spatial rotations, the SO(3) reduction survives the Borgnakke-Larsen energy exchange, and the twelve-dimensional collision integral collapses onto a nine-dimensional kinematic core. The core splits into a sparse geometric tensor, evaluated exactly, and a dense physical tensor, integrated by singularity-resolving Gauss rules with an auxiliary Laplace representation of the fractional energy couplings. The quadrature attains near machine precision at the fractional exponents of real gases. The collision invariants are embedded exactly, preserving the translational-internal energy exchange. The factorization compresses the operator by three to nearly four orders of magnitude and accelerates its evaluation 40-fold over dense formulations. The method is validated against the exact monatomic limit, Landau-Teller relaxation, and an analytic frozen-channel Prandtl number, and it matches a published calibration of the same kernel for N2, CO, and H2.
Read the full abstract

All authors Torsten Keßler, Bas W. T. Gieling, René R. Hiemstra, Michael R. A. Abdelmalik

Analysis of PDEs

Polynomial mixing for stochastic viscous conservation law equation on the whole line

In this paper, we study the long-time behavior of the viscous conservation law equation on the whole real line, subject to a white-in-time force and arbitrarily small damping and viscosity constants. We establish polynomial mixing rates in two settings: (a) a general super-quadratic flux with hyperviscous dissipation, where the growth of the nonlinearity is controlled by the order of hyperviscosity, and the force is sufficiently non-degenerate on a generic L2-basis; and (b) a general quadratic flux with standard second-order dissipation, and the force is non-degenerate on some unconditional basis. Both settings include the classical Burgers-type nonlinearity. The proof is based on an abstract polynomial coupling criterion developed in arXiv:2408.00592 and a Foiaş–Prodi estimate.
Read the full abstract