Peer Revenue Publish or profit

Papers

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

All of arXiv

Friday 4 September

Mesoscale and Nanoscale Physics

Variable Charge State, Magnetic Excitations, and Kondo Effect of Sm/g/Ir(111)

Using low-temperature scanning tunneling microscopy we investigate the charge state, magnetic excitations, and Kondo features of individual Sm adatoms on graphene/Ir(111). Depending on the number and distance of their neighbors, Sm atoms can be in two discrete charge states. At certain distances, a reversible transition between these two states is induced by the electric field of the STM tip leading to concentric charge rings in the images. Only atoms in one of the two charge states exhibit magnetic excitations in d$I$/d$V$ spectra. Two such excitations are located at 35~meV and 54~meV and related to transitions from the $J = 1/2$ ground state doublet to the first crystal field split $J = 3/2$ multiplet. Together with the intra-atomic exchange excitations at higher energy, these observations indicate that Sm transfers one $6s$ electron to the substrate while it retains its gas-phase $4f$ filling. New for lanthanide adatoms, we observe a Kondo resonance. The Zeeman splitting of the Kondo peak reveals that Sm retains its large gas-phase $g$-factor. Comparison of d$I$/d$V$ spectra to cotunneling theory yields the crystal field acting on the $4f$ shell and, consequently, on the $J = 3/2$ quadruplet, confirms Sm$^+$ as the ground state, and identifies Sm$^{2+}$ as being energetically close, thereby rationalizing our observation of variable charge states.
Read the full abstract

All authors Shixuan Shan, Tamara de Ara, Lina Liu, Zhipeng Wang, Marina Pivetta, François Patthey, Tadahiro Komeda, Daria Kývala, Jindřich Kolorenč, Harald Brune

Earth and Planetary Astrophysics

Ion abundances in the plasma tail of 3I/ATLAS show that it is N2-rich

Interstellar objects allow us to compare the early planetary formation process in the Solar System and around other stars. The second and third interstellar objects, 2I/Borisov and 3I/ATLAS, showed visible signs of activity, making it possible to assess their composition via spectroscopic analysis of their gas coma. While neutral volatiles surrounding comets are easily probed by common spectrographs, ion emissions emanate mostly from the tail, making them easier to detect with integral-field units. We present WHT/WEAVE-LIFU observations of 3I/ATLAS, performed post-perihelion on 2025 November 30 and 2025 December 02. We simultaneously detect the ions N2+, CO+, CO2+, H2O+ and CH+ located in an anti-solar tail. Using common fluorescence factors, we determine abundance ratios of these species in the tail. In particular, the N2+/CO+ ratio allows us to constrain the lower-limit N2/CO>0.023+/-0.001, indicating that 3I/ATLAS is N2-rich compared to Solar System comets, a property which can be linked to cold formation conditions. Abundance ratios between other ions cannot directly be used to constrain abundances of neutrals but seem consistent with the fact that 3I/ATLAS is enriched in hypervolatiles. We also investigate whether these ratios vary along the tail, and only detect a marginal decrease of CH+ with cometocentric distance.
Read the full abstract

Materials Science

From Electronic Structure to Environmental Remediation: Adsorption of Ionized Glyphosate on COOH-Modified Carbon Nanotube

Glyphosate is a widely used herbicide whose persistence and toxicity in aquatic and terrestrial environments demand efficient removal strategies. Here we employ GFN2 xTB calculations with implicit ALPB aqueous solvation and automated docking to investigate the adsorption of all five pH dependent ionized forms of glyphosate (G1-G5) on (10,0) single walled carbon nanotubes covalently functionalized with carboxyl groups at 0-25% coverage. Adsorption energies reveal a clear charge dependent trend: the dianionic (G4) and trianionic (G5) species exhibit the most negative binding energies over the entire functionalization range, while the protonated and neutral forms (G1, G2) bind weakly, approaching reversible adsorption at high COOH contents. The deprotonated form G5 strengthens from -2.17 eV on pristine CNT to about -5.7 eV at 10% and 25% functionalization, with a local minimum near 15-20% COOH due to steric and electrostatic crowding of adjacent groups. Decomposition of the solvation free energy shows dominant electrostatic stabilization complemented by increasingly favorable hydrogen bond contributions as carboxyl density grows. All complexes display very small HOMO-LUMO gaps (0.02-0.22 eV), indicating high electronic sensitivity to adsorption and functionalization. Overall, CNT+COOH systems can operate in both strong capture and regenerable regimes depending on glyphosate ionization state, offering a tunable platform for pH responsive remediation.
Read the full abstract

All authors H. T. Silva, L. C. S. Faria, C. Aguiar, T. A. Aversi-Ferreira, I. Camps

Statistical Mechanics

Non-reciprocally interacting Ornstein-Uhlenbeck processes: Exceptional points, Anomalous relaxation, Pseudo-equilibrium and Boundary refrigeration

Non-reciprocal interactions are ubiquitous in active, biological, and disordered systems, generically driving them out of equilibrium. Here, we introduce a hierarchy of non-reciprocally interacting Ornstein-Uhlenbeck (NROU) models governed by a tunable non-reciprocity parameter $g$. At a special point $g=g^*$, the drift matrix becomes non-diagonalizable, realizing exceptional points (EP's) of different orders, where eigenvalues and eigenvectors simultaneously coalesce. The hierarchy encompasses non-reciprocally coupled dimers, their disordered counterparts, and a many-body chain exactly mapping onto the paradigmatic Hatano-Nelson model in the arena of non-Hermitian quantum systems. For the disordered model, we show that the distribution of the EP location $g^*$ across disorder realizations develops a universal edge singularity precisely at the clean-system EP, and is manifestly non-self-averaging. Across all models, we find that at the EP, the usual exponential relaxation of the autocorrelation and covariance functions is dressed by a polynomial-in-time prefactor whose degree is set by the order of the EP and whose detailed structure encodes the spatial architecture of the chain. At complete asymmetry, the many-body chain exhibits “pseudo-equilibrium”: its steady-state distribution factorizes into equilibrium-like single-particle measures despite a nonzero steady-state current. Moreover, the $N$-particle interacting system decomposes into $N/2$ independent complex OU processes. Finally, using the Harada-Sasa relation, we obtain a closed-form expression for the total steady-state heat dissipation and uncover a boundary refrigeration effect, in which the boundary particles switch from acting as a hot to a cold reservoir as the non-reciprocity is tuned.
Read the full abstract

Signal Processing

Energy-Efficient Waveform Design for ISAC Systems: An Ambiguity-Domain QoS Perspective

Integrated sensing and communication (ISAC) requires transmit waveforms that simultaneously preserve communication quality, provide reliable sensing, and remain compatible with practical radio-frequency front ends. This paper considers a discrete-time ISAC waveform design problem that minimizes transmit power from the perspective of a novel metric termed the ambiguity-domain sensing signal-to-interference-plus-noise ratio (AF-SINR). The proposed AF-SINR quantifies the ratio between the desired ambiguity-function mainlobe power and the weighted aggregate sidelobe leakage plus noise within a local delay-Doppler region of interest, thereby providing a localized and noise-aware sensing-QoS measure. To enable ISAC operation, the waveform is further required to satisfy per-user effective communication-SINR constraints, while a peak-to-average power ratio (PAPR) constraint is imposed to facilitate practical implementation. The resulting energy-minimization problem is nonconvex due to the fractional QoS expressions, quartic ambiguity terms, and waveform-dependent PAPR constraint. To address this challenge, we propose a fractional-programming successive-convex-approximation (FP-SCA) algorithm. Simulation results verify that the proposed method satisfies all requirements while preserving localized ambiguity suppression over the local delay-Doppler region.
Read the full abstract

Computer Vision

Think-Verify-Revise: Neuro-Symbolic Visual Reasoning with Vision-Language Models and Dynamic Logic Tensor Networks

Visual reasoning tasks require a system to jointly perceive visual content and apply formal relational constraints—a combination that neither pure neural nor purely symbolic approaches handle well in isolation. This paper proposes a Neuro-Symbolic (NeSy) framework that closes this gap by tightly coupling a Vision-Language Model (VLM) for automatic First-Order Logic (FOL) rule induction with a Dynamic Logic Tensor Network (D-LTN) for differentiable rule verification, in a closed iterative feedback loop. The VLM receives a small set of labelled visual examples and proposes candidate FOL rules conforming to a strict grammar (Think); the D-LTN is automatically assembled from these rules at runtime and evaluates them grounding on CNN-produced visual embeddings (Verify); and verification failures are fed back to guide the VLM's next hypothesis (Revise). Evaluated on the ViSudo-PC benchmark across four visual domains (MNIST, EMNIST, KMNIST, FMNIST), the system induces valid Sudoku constraint rules using only three training examples as visual context. The proposed method achieves AUC scores matching or outperforming previous methods (NeuPSL, LTN), showing the potential for automatic rule discovery through VLM. Code is available at https://github.com/homayoun-afshari/nesy.
Read the full abstract

All authors Homayoun Afshari, Pietro Basci, Alessandro Russo, Lia Morra

Quantum Physics

A photonic source with half-a-GHz single-photon flux

Advanced optical quantum technologies demands high quality quantum light generation at very high rates. Here, we report on a deterministic single-photon source that simultaneously combines high excitation rates with high system efficiency to reach over 500 MHz of in-fibre single-photon flux. The source delivers optical power of over 100 pW, as is measured with an off-the-shelf powermeter, enabling a simple and direct way of determining the single-photon source fiber efficiency.
Read the full abstract

All authors P. Zahalka, S. Huijser, A. Pancaldi, S. Kruger, X. Zhao, Z. Liu, I. Suleiman, R. Jensen, L. Stefan, A. Ludwig, V. Remesh, J. C. Loredo, P. Lodahl

Commutative Algebra

The coordinate ring of the k-fold iterated commutator locus for 2x2 matrices

For $2 \times 2$ matrices $A_1,\dots,A_k$, write $[A_1,\dots,A_k]$ for the left-normed iterated commutator $[\dots[[A_1,A_2],A_3],\dots,A_k]$, and $I_k$ for the ideal, in the $3k$-variable reduced-coordinate polynomial ring $R_k$, cutting out its vanishing locus. We prove, for every $k \geq 2$ over any field of characteristic $\neq 2$, and as four independently-established results rather than one bundled claim: $I_k$ has codimension 2; $I_k$ has exactly 3 minimal generators; $R_k / I_k$ is Cohen-Macaulay; and $I_k$ is radical. The last of these, together with an explicit component count resting on a non-containment argument, assembles into the Primary Decomposition Theorem: $I_k = P_2 \cap \cdots \cap P_k$ is an irredundant primary decomposition into exactly $k-1$ primes, following an explicit recursive block-involvement pattern. The proof identifies $I_k$ as the ideal of $2 \times 2$ minors of an explicit $2 \times 3$ matrix (a determinantal ideal, not merely one that looks determinantal), and invokes classical determinantal-ideal theory (Bruns-Vetter) and an explicit rank-2 Jacobian witness on every component (Serre's criterion) for the algebraic and radicality halves respectively.
Read the full abstract

Artificial Intelligence

Necessary or Sufficient? Evaluating LLM Explanations With Behavioural Evidence

LLM decision components that can operate within agent workflows often produce action-relevant recommendations or judgements together with explanations. Operators may use the named factors to monitor a system, diagnose errors, or decide when to escalate an output. Such use assumes that the explanations agree with the component's observable decision behaviour. We test two interpretations of the named factors: necessity, meaning that changing a factor would change the output, and sufficiency, meaning that retaining it while removing other changeable information would preserve the output. We evaluate these interpretations in two synthetic use cases: recommending advisors to clients and judging prompts for harmfulness or risk. Models return an output and the top three factors that most influenced it. Controlled black-box interventions estimate a necessity score for each factor by measuring how often changing it changes the output, and a sufficiency score by measuring how often retaining it preserves the output. Across eight models from the Claude, GPT, and Gemini families, the mean Spearman correlations between the cited ranking and the necessity and sufficiency scores are 0.349 and 0.354 for advisor recommendation, and 0.431 and 0.580 for prompt monitoring. Furthermore, an uncited factor scores above the lowest-scoring cited factor in 57.6% of advisor responses under necessity and 58.1% under sufficiency; the corresponding prompt-monitoring rates are 25.8% and 8.9%. The cited top three contain useful information but do not reliably identify the three factors with the strongest measured influence under necessity or sufficiency. The framework provides a black-box reliability check for explanations used in agent oversight while remaining scoped to individual LLM decisions.
Read the full abstract

All authors Urja Pawar, Rajitha Ramanayake, Nabeel Kemal, Ashwin Kandath, Owen O'Neill, Guillaume Bourgeon, Houssem Chatbri, Christopher Martin, Vadim Pertsovskiy

Combinatorics

Counting sets with given doubling via dimension

We determine, up to a factor of $2^{o(k)}$, the number of $k$-sets $A \subset \{1, \ldots, n\}$ such that $|A + A| \leq m$, where $k = \Theta(\log n)$ and $m \leq k^{1 + \alpha}$, for small $\alpha > 0$, answering a question of Green and Morris.

Materials Science

Customized spin spirals in ferromagnetic thin films

The advancement of spintronic nanoscale devices hinges on the ability to flexibly engineer magnetic spin structures in thin-film stacks with precision and control. Meeting this demand remains a challenge for stable non-collinear spin configurations and, more specifically, vertical spin spirals in thin films. Innovative methods are required for their fabrication, stabilization and control. Here, we use oblique-incidence deposition to design and stabilize vertical spin spirals at room temperature and without an external field in magnetic thin films. We induce two crossed uniaxial magnetic anisotropies at the thin film boundaries. These anisotropies are tunable in direction and strength, thus providing control over the angular range and depth profile of the resulting spin spiral. The combination of polarized neutron reflectometry and nuclear resonant scattering enables precise and direct determination of the depth-dependent spin configurations. Our results establish a single-film design approach, in which the surface anisotropies independently serve as controllable design parameters for tailoring the vertical spin-spiral profile. Potential applications include nanoscale energy-storage devices, magnetic sensors, and ferromagnetic-resonance filters, advancing all-spin-based device engineering in general.
Read the full abstract

All authors Anjali Panchwanee, Kai Schlage, Dieter Lott, Sven Velten, Thomas Saerbeck, David L. Cortie, Sakshath Sadashivaiah, Ilya Sergeev, Guido Meier, Lars Bocklage, Ralf Röhlsberger

Computer Vision

Reflection-aware Generative Novel View Synthesis

We propose Ref-GeNVS, a training-free, reflection-aware method for generative novel view synthesis (NVS) in mirror scenes. Existing multi-view diffusion models often fail to recognize the mirror in the scene and cannot exploit reflected content for scene generation. To fix this issue without additional training, our key idea is to treat a mirror image as two complementary views. From input images, we estimate the mirror plane and reflect camera poses to form virtual views. Based on this virtual view setup, we propose a two-stage generation method consisting of Mirror-gated attention and Reflection injection, which enables reflection-consistent NVS by explicitly leveraging reflection relationships in a multi-view diffusion model. Ref-GeNVS inherits the strong generalizability of the multi-view diffusion backbone, while it does not require finetuning. On synthetic and real scenes including mirrors, Ref-GeNVS outperforms recent generative NVS methods by generating reflection-consistent and contextually coherent novel views, revealing scene structure visible only through mirrors. Project page: https://kim-geonu.github.io/Ref-GeNVS/
Read the full abstract

Artificial Intelligence

Molecular Déjà Vu: Digit-Level Retrieval of Molecular Properties in Frontier Language Models

Large language models (LLMs) are increasingly employed to predict molecular properties. However, prediction error alone cannot distinguish prediction from retrieval of published values. We audit 22 frontier models on 12 molecular regression datasets in a zero-shot setting, assessed against a molecule-blind reference derived from each dataset's labels. Significant retrieval is concentrated on 5 datasets, with isolated flagged LLMs elsewhere. Increasing the reasoning setting raises the number of flagged model–dataset combinations from 47 to 89 of 264. An in-context blinding experiment reduces retrieval but leaves a quarter of the combinations flagged. Blinding changes model rankings and increases errors. Because blinding also removes chemically interpretable structure, the error increase can only be partially attributed to reduced retrieval.
Read the full abstract

All authors Matthias Busch, Marius Tacke, Sviatlana V. Lamaka, Mikhail L. Zheludkevich, Christian J. Cyron, Roland C. Aydin, Christian Feiler

Cryptography and Security

Propagation Model for SSC attacks: Why SBOM (tools) don't tell the whole truth

Ensuring security of software supply chains (SSC) is indispensable in today's world of modern software practices. SBOM (tools) have been introduced as relevant building blocks to ensure the transparency of SSCs. However they have serious limitations in practices as their vulnerability detection and interpretation capacity is not sufficient to explain exploitability effects that can propagte through the whole chain. To address this gap, we propose a propagation-centred approach to SSC security and introduce a four-stage propagation model. We empirically evaluate four open-source SBOM tools against each stage using three projects and Log4j vulnerability as our test case. Our results show that current SBOM tools systematically support only Stage 1 (Structural Exposure) and Stage 2 (Vulnerability Class Presence) while Stage 3 (Code Reachability) and Stage 4 (Taint Path Analysis) require capabilities absent from the SBOM ecosystem. We argue that putting propagation effects at the centre of SSC security research is essential to prevent cyber risk evolving into systemic risks. Our research findings contribute to a future research and design of modern SSC security tools.
Read the full abstract

Quantum Physics

Coincidence-based spectral engineering for spectral matching in cascaded downconversion

Three-photon states generated via cascaded spontaneous parametric downconversion provide a direct route to multipartite entanglement. However, current implementations require careful spectral matching between successive nonlinear stages, which constrains the choice of downconversion sources. In this work, we show that coincidence-based spectral filtering relaxes this requirement by conditionally tailoring the spectrum of the pump photon entering the second stage. By filtering the herald photon, we conditionally tailor the spectrum of its partner to match the acceptance bandwidth of the secondary nonlinear process, enabling efficient coupling between broadband and narrowband stages without altering the sources themselves. Using an electro-optically gated spectrometer, we directly measure the conditional spectra that govern the cascaded process, allowing us to quantitatively predict the enhancement in second-stage conversion probability per detected herald. We then verify this prediction through photon-triplet measurements, demonstrating improved performance at fixed heralding rates. Our results establish coincidence-based spectral engineering as a practical tool for optimizing cascaded downconversion, particularly in regimes limited by detector saturation or spectral incompatibility.
Read the full abstract

All authors Mohammed Charafi, Alexandre Z. Leger, Samridhi Gambhir, Deny R. Hamel

Signal Processing

Full-field laser-Doppler-vibrometry FRF dataset for a four-bolt aluminum plate under bolt-torque variation

The dataset described in this article was constructed using the results of laser Doppler vibrometry experiments conducted on an aluminum plate having four bolts. The database captures the variation in the vibration characteristics of the plate as a function of changes in tightening torque on the bolts. In total, there were 18 different states for the tightening torque, ranging from a situation where all bolts are tightened to all bolts being loose. Other possible combinations include states with varying torque applied to just one bolt, and those involving multiple loose bolts. Data consist of 1,836 files exported from Polytec PSV-500, categorized as amplitude and phase data, for frequency ranges spanning 1 Hz to 51,200 Hz at intervals of 1 Hz. The identified zones were analyzed at 51 scan points for all states of torque. Supporting documents included specifications of the test plate, scan point and torque state information, selected resonance peaks tables, measured frequencies for seven resonance groups, correlation values for all FRF, visualizations, and code scripts.
Read the full abstract

Classical Analysis and ODEs

The weak-type (1,1) bound for the Hardy–Littlewood maximal function is $O(\sqrt{n} \log n)$

We prove a weak-type $(1,1)$ estimate for the centered Hardy–Littlewood maximal function with respect to Euclidean balls with dimensional dependence $O(\sqrt{n} \log n)$. This improves the order of growth in the classical $O(n)$ estimate of Stein and Strömberg. The proof goes through a pointwise bound of the Hardy–Littlewood maximal operator by the heat maximal operator with $\sqrt{n}$ loss. The key technical aspect of our result is an improvement of the weak-type bound for the heat maximal operator from $O(\sqrt{n})$ to $O(\log n)$.
Read the full abstract

Robotics

What Matters, When? Diagnosing and Improving Conditional Visual Grounding in Visuomotor Imitation Policies

Visuomotor imitation policies can achieve high performance under in-distribution visual conditions yet fail when visually similar objects or receptacles are introduced. We study this behavior as a problem of conditional visual grounding: the visual target required for successful control changes with the manipulation phase and, in more complex tasks, with the observed task state. Using Action Chunking with Transformers (ACT), we systematically introduce distractor objects and receptacles with controlled color and shape similarity and localize failures to picking and placement. We find that distractor sensitivity is specific to both the type of visual similarity and the manipulation stage. Guided by this diagnosis, we evaluate distractor augmentation, phase-dependent attention regularization, and appearance-based visual prompting as complementary interventions for improving target selection while preserving spatial information required for control. These interventions substantially improve robustness in simulation and on a physical UR3e. We further examine the same failure pattern in a pretrained vision-language-action policy on a state-conditioned instrument-handling task, where the observed state of a medical instrument determines the correct destination. Together, the results show that visual distractors can cause incorrect object or destination selection even when the underlying manipulation skill remains intact, and that explicitly improving target selection can substantially recover performance across distinct visuomotor policy-learning regimes.
Read the full abstract

All authors Vivek Chavan, Pengtao Xie, Yahuan Shi, Oliver Heimann, Kevin Haninger, Jörg Krüger

General Relativity and Quantum Cosmology

Fast Bayesian Inference for Long-Duration Gravitational-Wave Signals in 3G detectors

Third-generation (3G) gravitational-wave detectors will observe binary-neutron-star inspirals for nearly a day, so Earth's rotation becomes part of the signal rather than a negligible correction. This destroys the usual separation between intrinsic and extrinsic parameters and creates a major computational bottleneck for Bayesian inference. We show that the exact five-harmonic Jaranowski-Krolak-Schutz (JKS) decomposition restores the separation of the rotating antenna amplitude response from the computationally expensive intrinsic waveform calculations. By sampling the intrinsic waveform on a frequency grid set by its phase curvature and then applying error-controlled relative binning, likelihood evaluations for a 21.3-h signal are accelerated by O(10^4), making day-long 3G signal inference practical.
Read the full abstract

Artificial Intelligence

CUA-Universe: A Scalable and Dynamic Environment for Hybrid GUI+CLI Agents

Computer-use agents have advanced on benchmarks like OSWorld and AndroidWorld, but still act mostly through the GUI, often producing inefficient trajectories. Real-world computer work is hybrid, combining visual-state inspection with precise, high-throughput command-line operations, so capable agents must coordinate both modalities over shared application state. Yet scalable hybrid environments remain scarce because supporting both GUI and CLI over real applications typically requires substantial manual engineering for each application. Existing agents also struggle to use the two interfaces complementarily: CLI-native agents lack visual perception for tasks involving interface state or layout, while GUI-native agents are inefficient for operations better executed through commands. We introduce CUA-Universe, a scalable environment-to-data pipeline that turns real desktop software into hybrid GUI+CLI environments. App-Forge adapts applications into reproducible VMs and command-line surfaces it discovers, wraps, or generates, scaling to 16 applications; Task-Weave synthesizes diverse hybrid tasks of controllable difficulty from reusable operations over seed files; and Path-Steer steers rollouts along efficient hybrid paths and harvests verified trajectories for post-training. Training on this data shifts behavior from inefficient GUI interaction and brittle CLI scripting toward effective GUI+CLI orchestration. Our 9B model improves both success and efficiency on CUA-Verse (Score +39.3 pts; -37% steps, -60% tokens), OSWorld (SR +16.8 pts; -57% steps, -44% tokens), and OSWorld-MCP (Score +7.84 pts; -27% steps, -30% tokens). CUA-Universe provides a scalable path toward more capable and efficient computer-use agents.
Read the full abstract

All authors Haoting Shi, Wenhao Wang, Weicheng Fang, Yaozhong Liang, Tian Jin, Pengxiang Zhao, Guangyi Liu, Siheng Chen, Yanfeng Wang

Soft Condensed Matter

Molecular interfacial rheology: Lipid membrane shear viscosity

We develop a method to extract the shear viscosity of a lipid membrane from equilibrium molecular dynamics simulations. The method characterizes the rheology of general interfacial systems embedded in three-dimensional media; we term it molecular interfacial rheology. In our simulations the planar bilayer and surrounding water are confined between solid, parallel walls. Following Onsager's regression hypothesis, membrane and water fluctuations are assumed to relax according to the coupled continuum-mechanical equations governing the confined system—which predict that the membrane transverse velocity autocorrelation function (TVACF) decays exponentially, at a rate set by the membrane and water viscosities. The measured TVACF, however, exhibits damped oscillations followed by a slowly decaying tail. We reconcile these behaviors using the Mori–Zwanzig formalism, and extract the wavevector-dependent membrane viscosity from the time-integral of the TVACF. Results from theory and simulations agree over a decade of wavevectors, and extrapolating to long wavelengths yields shear viscosities ranging from 0.064 to 0.18 pN*us/nm across two representative single-component, fluid-phase bilayers. Our results are corroborated by nonequilibrium simulations where a spatially varying in-plane body force is applied to lipid molecules, thus validating the framework of molecular interfacial rheology.
Read the full abstract

Econometrics

Does p-Hacking Mitigate or Exacerbate the Effects of Publication Bias?

This paper studies the effects of p-hacking on the bias of published estimates when papers with statistically significant results are selectively published. We show that fast p-hacking—actions that lead to large changes in p-values—always exacerbates the bias from selective publication. On the other hand, slow p-hacking—actions that lead to small changes in p-values—exacerbates bias when selection is weak, but mitigates it when selection is strong. In a model featuring both types of p-hacking, we show that a normality assumption identifies the true distribution of effects as well as the counterfactual mean that would obtain under selective publication without p-hacking. Applying the model to meta-analyses on the effects of behavioral nudges and development aid, we find suggestive evidence that both mitigation and exacerbation can arise in practice.
Read the full abstract

Number Theory

Short arithmetic terms for the cardinality of elliptic curves over rings of remainder classes and over finite fields

Arithmetic terms are fixed finite compositions of addition, truncated subtraction, multiplication, integer division and exponentiation on natural numbers. We construct such terms for the number of affine solutions of $ y^2 = x^3 + Ax + B $. For arbitrary moduli $ n \geq 1 $, a specialization of Prunescu's general construction reduces the number of monomial contributions from fourty-nine to fifteen and the size of the packed integer from approximately $ 2n^{11} $ to approximately $ 2n^5 $ binary digits. For prime moduli $ p \geq 17 $, the Hasse invariant and the trace of Frobenius give a term of about thirty operations. For curves defined over $ \mathbb F_p $, a further term counts the points over $ \mathbb F_{p^k} $ with $ k $ as a variable. For primes $ p \geq 5 $, we also obtain arithmetic terms for the counts over $ \mathbb Z / p^k \mathbb Z $ with $ k $ variable, covering good reduction, nodes and cusps, including non-minimal equations and zero discriminant.
Read the full abstract

Cryptography and Security

When LLM Decompilers Recompile More and Preserve Less

Decompilation recovers high-level source from compiled machine code and serves as a foundation for security tasks such as vulnerability detection and malware analysis. Traditional decompilers like Ghidra and Hex-Rays expose whatever they cannot resolve as visible placeholders and often emit pseudocode that will not compile or execute; LLM-based decompilers produce clean, idiomatic C and are now judged almost entirely by recompilability and re-executability: whether the output builds and passes its shipped input/output tests. We show that these metrics can reward the wrong path: a function may recompile and pass every shipped test yet diverge on other legitimate inputs, and a disclosed vulnerability may disappear from the recompiled code with no visible trace of the crash. Neither failure is caught by existing suites. To address this gap, we propose Decompile-Diverge, a behavioral comparison oracle not relying on fixed or hand-crafted tests: for each function it synthesizes a driver, grows a fuzzing corpus from the reference, and reruns the decompiled code on the same inputs to detect changes in the function's behavior. Across eight systems in nine configurations on established LLM decompilation corpora, candidates that pass every shipped test still diverge from the original on our input corpus: 4.9% overall, and as many as 13% for a single system. On 300 real GitHub library functions and 287 CVE-grounded functions, recompilability and behavioral agreement can come apart: the strongest refinement LLM lifts Ghidra's build rate from 75% to 90%, while its Matched rate falls from 74% to 62%; on disclosed vulnerabilities, up to one tenth exhibit Crash Absence in its output. Source-level analysis traces this divergence to introduced fields, types, callees, and guards that replace the visible unknowns traditional tools leave behind.
Read the full abstract

Robotics

Towards Neuro-Symbolic Procedural Reasoning for Long-Horizon Vision-Language-Action Manipulation

Vision-language-action (VLA) models can execute short manipulation skills, but remain brittle in long-horizon procedures requiring persistent task state, dependency-aware reasoning, conditional decisions, and reliable grounding. We investigate a neuro-symbolic framework that combines learned VLA control with explicit task graphs and multimodal procedural memory. Task graphs encode action dependencies, valid transitions, and branch conditions, while memory maintains the active step, completed actions, textual context, and task-relevant visual evidence. Together, these structures guide object selection, destination grounding, subgoal dispatch, and verification of expected state transitions. Human demonstrations provide additional spatial and temporal guidance through gaze or saliency cues. To isolate their effect on policy learning, our initial study bypasses cross-view gaze transfer and directly annotates pseudo-gaze in robot-view teleoperation videos. The resulting guidance is used during VLA fine-tuning and inference. We study two long-horizon manipulation domains, workspace clearing and surgical-instrument handling, which require ordered execution, visually grounded decisions, and conditional branching. We evaluate correct-object and destination selection, subtask completion, task progress, step-order consistency, complete-task success, and procedural or execution mistakes. This work positions structured symbolic reasoning and demonstration-derived visual guidance as complementary mechanisms for reliable long-horizon VLA manipulation.
Read the full abstract

All authors Vivek Chavan, Yahuan Shi, Oliver Heimann, Kevin Haninger, Jörg Krüger

Combinatorics

Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs

In the uniform sparsest cut problem we are asked to find a vertex set that cuts few edges relative to the number of vertex pairs it separates. The Goemans-Linial SDP coupled with the Arora-Rao-Vazirani rounding gives an $\mathcal{O}(\sqrt{\log n})$ approximation on arbitrary graphs on $n$ vertices. We study this relaxation on finite Abelian Cayley graphs. First we show that when the second normalized Laplacian eigenvalue of $G= \mathrm{Cayley}(\Gamma, S)$ is realized by a Fourier character with image size at most four then $\lambda_2(G)=\mathrm{SDP}_{\mathrm{GL}}(G)=\psi(G)$. Geometrically, a character maps the vertices onto a regular polygon where the squared chord distance satisfies the triangle inequalities exactly when the polygon has at most four vertices. Grouping equal character fibers gives a cyclic quotient where the optimal cut can be found exactly and so the relaxation is exact on finite Abelian Cayley graphs on groups of exponent at most four. Second, we replace each generator $s$ of $S$ by a uniformly random element of its cyclic subgroup (including identity). If $r_s$ is the order of $s$, we let $\alpha(r_s)$ to be the average number of $\pm s$ steps needed to simulate such a move, and let $\rho(S)=\max_{s\in S}\alpha(r_s)$ be its worst case. Full cyclic averaging eliminates character phases and choosing a nontrivial character $\chi^*$ minimizing the auxiliary eigenvalue and taking $K=\mathrm{ker}\chi^*$ gives \[ \psi(G)\leq\psi_G(K)\leq\frac{q^*}{q^*-1} \cdot\rho(S)\cdot\mathrm{SDP}_{\mathrm{GL}}(G)\leq 2\rho(S)\cdot\mathrm{SDP}_{\mathrm{GL}}(G), \] where $q^*=|\chi^*(\Gamma)|$. If all generator orders are at most $R$, this is an $R/2$ approximation. Finally, we construct an infinite family of finite Abelian Cayley graphs with Goemans-Linial integrality gap exactly $16/15$.
Read the full abstract

Algebraic Topology

Stability Patterns for Spherical and Projective Braid Groups

McDuff and Segal proved homological stability for unordered configuration spaces of connected manifolds with non-empty boundary. Later, Church proved representation stability for ordered configuration spaces on compact manifolds. These stability patterns extend to surface braid groups and pure surface braid groups, respectively, whenever the associated configuration space is an Eilenberg–Maclane space. However, these results do not apply to braid groups and pure braid groups on $S^2$ and $\RP^2$ since ordered and unordered configuration spaces on these surfaces are not Eilenberg–Maclane spaces. This paper will use results by Cohen–Pakianathan and the theory of $\FI$-homology to extend known stability patterns to these unknown cases. This is a special case of a more general result proven in this paper: the equivariant homology of ordered and unordered configuration spaces exhibit representation stability and stable periodicity respectively.
Read the full abstract

Earth and Planetary Astrophysics

Dust Substructures and Line Perturbations driven by a Forming Planet in J16120

Hints of planet formation have been independently reported within the gap of the disc around 2MASS J16120668-301027 from millimetre continuum, infrared, and H-alpha observations. In this work, we present new evidence for ongoing planet formation based on Atacama Large Millimeter/submillimeter Array (ALMA) Band 7 observations, detecting 0.87 mm dust continuum emission together with 12CO (J=3-2) and 13CO (J=3-2) line emission. Visibility modelling of the continuum data reveals an inner disc and two dust rings peaking at 23 and 75 au. The continuum morphology is better reproduced by an eccentric disc model (e approximately 0.1) than by an axisymmetric disc. We further investigate the gas kinematics through modelling of the 12CO channel maps. The residual line-width map shows a localised increase in velocity dispersion at the position of a previously reported circumplanetary disc candidate (deprojected radius approximately 32 au, position angle approximately 170 degrees) and along its orbit. This signal is spatially coincident with kink-like features and a transition from sub-Keplerian to super-Keplerian velocities. In addition, the velocity residual map exhibits an arc-like structure extending outward from the planet candidate, while the gas kinematics, despite substantial uncertainties, is consistent with inflow towards the candidate's orbital radius. The observed increase in velocity dispersion agrees with predictions from planet-disc interaction simulations, which produce enhanced turbulence both at the planet location and along its orbital path. Taken together, the continuum morphology and gas kinematic signatures provide compelling new evidence for ongoing planet formation within the disc gap.
Read the full abstract

All authors Anibal Sierra, Andrés F. Izquierdo, Paola Pinilla, Kan Chen, Myriam Benisty, Laura Pérez, Teresa Paneque-Carreño, Carolina Agurto-Gangas, Jaehan Bae, John Carpenter, Luca Cieza, Dingshan Deng, Stefano Facchini, Camilo González-Ruilova, Nicolás Kurtovic, Aleksandra Kuznetsova, Carlo F. Manara, James Miley, Álvaro Ribas, Giovanni Rosotti, Miguel Vioque

Materials Science

Remote epitaxy beyond polarity

Remote epitaxy through a monolayer two-dimensional material-covered substrate establishes a crystallographic registry across the van der Waals (vdW) surface that enables the epitaxial growth, lift-off and transfer of single-crystalline films. A central belief in remote epitaxy is that the substrate facilitating the phenomenon must be a material with strong ionicity, as the interatomic electrostatic potential fluctuation in covalent and metallic materials is substantially attenuated by two-dimensional materials. Here, we show remote epitaxy is possible when the substrate is a metallic or covalently bonded material and experimentally demonstrate non-polar remote homo- and heteroepitaxy across a wide range of material systems, including both metals and semiconductors. The achieved non-polar remote interactions are designed and engineered by harnessing substrate conductivity and vicinal surface step-edge density. These findings indicate that remote epitaxy is universal and applicable to ionic, metallic, and covalent materials, expanding its capabilities and stimulating a plethora of new fundamental scientific questions about the mechanism of remote epitaxy.
Read the full abstract

All authors Ching-Tai Fu, Pei-Jan Hung, Xudong Li, Xiaolong Zhu, Yu Han, Sayantan Mahapatra, Zhiheng Zhao, Qingsong Fan, Xubing Wu, Qizhang Li, Chenxi Sui, Zirui Zhou, Ting-Hsuan Chen, Cheng-Hao Lei, Ivan Kuzmenko, Xiaobing Zuo, Byeongdu Lee, Alexander S. Filatov, Jeffrey R. Guest, Fengyuan Shi, Yuzi Liu, Hua Zhou, Yunfeng Shi, Po-Chun Hsu