Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Friday 11 September

Neural and Evolutionary Computing

MAAPO:an innovative membrane algorithm based on artificial protozoa optimizer for multilevel threshold image segmentation

This paper proposes a novel membrane algorithm based on artificial protozoa optimizer (MAAPO) for global optimization problems. The artificial protozoa optimizer (APO) is adopted as the base meta-heuristic algorithm due to its novelty and competitive performance. MAAPO integrates two key innovations:(1) a membrane computing (MC) framework that introduces a parallel distributed paradigm to improve population diversity and search dynamics, and (2) an enhanced autotrophic model within APO that uses a roulette-based fitness-distance balance (RFDB) mechanism for adaptive reference point selection. These strategies collectively enhance the algorithm's exploration-exploitation balance and global search capabilities. To validate its performance, MAAPO is tested against 12 advanced algorithms on the CEC2017 test suite, and further applied to the multilevel thresholding image segmentation problem using Otsu and Kapur entropy as objective functions. The quality of segmented images is assessed using peak signal-to-noise ratio (PSNR), structural similarity index (SSIM), and feature similarity index (FSIM) metrics. Experimental results demonstrate that MAAPO outperforms its counterparts, delivering superior segmentation quality. This research on MAAPO contributes an effective enhancement strategy to meta-heuristic algorithms and introduces a novel, highly applicable approach for complex image segmentation tasks.
Read the full abstract

All authors Xiaopeng Wang, Vaclav Snasel, Seyedali Mirjalili, Jeng-Shyang Pan

Analysis of PDEs

Cumulative angular cancellation in Maz'ya's endpoint inequalities

We establish domain criteria for critical homogeneous potential inequalities in the plane. Assuming signed plane cancellation, uniform absolute summability of frozen annular moments at each boundary centre implies the nonlinear endpoint estimate on arbitrary bounded open sets. For the Newton kernel and trace-free quadratic integrands, uniform boundedness of signed cumulative moments over all source centres and truncation radii is necessary and sufficient; testing all translates and dilates of one fixed radial unit-mass mollifier suffices. Tangent-cone cancellation on finitely cornered Dini domains follows as a geometric corollary. On one explicit strictly convex, non-Dini $C^1$ domain, the estimate holds for $2\xi_1\xi_2$ and fails for $\xi_1^2-\xi_2^2$ with $\log\log(1/\varepsilon)$ divergence. A Laplacian-measure extension transfers density estimates to PDE inequalities on the Dini class and on strictly convex $C^1$ domains. We also classify quadratic cancellation on polygons. The signed necessary-and-sufficient criterion is restricted to quadratic integrands.
Read the full abstract

2609.12755 · 11 Sep · 38 pages, 2 figures. Substantially revised and retitled. Added a boundary atomic-sum sufficient criterion and an exact quadratic cumulative criterion on arbitrary bounded planar open sets, together with contrasting endpoint estimates on one strictly convex non-Dini $C^1$ domain. Extended the Laplacian-measure construction to strictly convex $C^1$ domains

Information Retrieval

Learning the Lake: Reliable Experience for Adaptive Data Product Discovery

Data-product discovery searches a full lake even when workloads revisit related products and regions. Repetition permits contracted search, but similarity cannot justify a route because one omitted asset invalidates a conjunctive product. We study when serving experience can safely reduce this work. Evolving Discovery Memory records source-labelled query–product–region evidence above a fixed regional index. SafeLake separates operational familiarity, which determines how much to search, from independently calibrated product evidence, which determines where to search. The fixed-probe comparison holds the adaptive budget constant between SafeLake and Familiarity-only. On TAT-QA, product steering raises Product Recall by 0.072; ConvFinQA shows no resolved map gain, while the HybridQA sensitivity favors Familiarity-only in Full R@100. Trace-only, missing, and false feedback expose boundaries on map steering, while scope-audit agreement cannot certify the source. Across clean confirmed-feedback streams under the frozen transductive protocol, the formal controller saves 49.5–82.7% of cumulative asset exposure. Experience determines when to contract; reliable evidence determines where to contract.
Read the full abstract

All authors Yixi Zhou, Fan Zhang, Sikun Wang, Yingfan Xu, Haipeng Zhang

Physics Education

A Framework for Characterizing Learning Contributions Across the Initial Achievement Spectrum

Conceptual assessments are widely used in physics education research to evaluate changes in student understanding, yet class average measures can obscure how those changes are distributed across students with different levels of initial achievement. We introduce a Learning Contribution Framework that characterizes this distribution through the Learning Contribution Curve (LCC) and Learning Contribution Profile (LCP). For a general contribution measure G, the LCC represents cumulative contribution across students ranked by initial achievement, whereas the LCP describes the local mean contribution relative to the population mean of the individual G values. We apply the framework to the individual Hake normalized gain and develop a statistical model linking LCC and LCP behavior to the joint structure of pretest and posttest scores. Under the central assumption that the conditional mean of the subsequent score is linear in the initial score, we identify a score structure parameter $\beta$ and a critical score structure parameter $\beta_c$. Whether $\beta$ is greater than, less than, or equal to $\beta_c$ determines whether the expected LCP increases, decreases, or remains constant across initial achievement. Given the pretest distribution, the model further yields analytical predictions for the complete LCP and LCC that closely reproduce simulation results. Application to classroom concept-assessment data illustrates how the framework reveals local and cumulative patterns of learning contribution that are not evident from an overall class average revealed by the traditional Hake's normalized gain.
Read the full abstract

Machine Learning

Optimizing for the decision not the prediction: an exploration of Smooth Net Benefit as a training objective

Objective Prediction models are commonly trained using objectives such as Bernoulli negative log-likelihood (NLL), although downstream clinical decisions may depend on specific risk thresholds. We introduce Smooth Net Benefit ($\sigma$NB), a differentiable approximation of Net Benefit designed to align model training with threshold-specific clinical utility. Materials and Methods We evaluated $\sigma$NB as a training objective for logistic regression, generalized additive models (GAMs), and XGBoost with three Hessian implementations. Experiments used the Framingham cardiovascular risk dataset and 44 TabZilla datasets comprising 72 dataset-threshold combinations. Results $\sigma$NB training did not consistently improve Net Benefit in Framingham. Across the TabZilla benchmark, mean standardized Net Benefit for logistic regression increased from 0.5669 with NLL to 0.5765 with $\sigma$NB (mean difference 0.0096, 95% CI -0.0001 to 0.0193). For GAMs, mean standardized Net Benefit decreased from 0.5921 to 0.5625 (mean difference -0.0296, 95% CI -0.0721 to 0.0129). For XGBoost, NLL achieved 0.6745 compared with 0.6723–0.6735 across $\sigma$NB implementations. In logistic regression, $\sigma$NB gains were positively associated with the performance advantage of XGBoost over NLL-trained logistic regression. Discussion The effect of $\sigma$NB was context dependent, with modest gains concentrated in logistic regression and little benefit for more flexible model classes. This suggests that decision-focused optimization may be most useful when limited model flexibility leaves greater scope for improvement. Conclusion Our results do not support $\sigma$NB as a general replacement for NLL training, but support further investigation of decision-focused objectives in settings where conventional likelihood-based training may not adequately capture decision-relevant structure.
Read the full abstract

All authors Koen M.F. Gorgels, Lasai Barreñada, Maarten van Smeden, Ben Van Calster, Ewout W. Steyerberg, Wouter A.C. van Amsterdam

High Energy Physics (Phenomenology)

Comparision of modeling of prompt photon production in proton-proton collisions at energies NICA $\sqrt{s}$ =10 GeV in PYTHIA and calculations using FeynCalc

The process of prompt photon production in proton-proton collisions at energies of $\sqrt{s}$=10 GeV at the NICA accelerator complex, modulated using PYTHIA 8.316 and calculated in FeynCalc. The main focus is on three main subprocesses: Compton scattering of a quark-gluon $qg \rightarrow q\gamma$, annihilation of a quark-antiquark pair $q\bar{q} \rightarrow g\gamma$ and bremsstrahlung of quarks $qq \rightarrow qq\gamma$. Main statistical parameters: number of produced prompt photon on photon energy, rapidity and invariant mass photon pairs are determined. The distribution of the number of produced photons by energy$ E_{\gamma } $ and rapidity photons can be mathematically described by the logarithmic-normal and normal law, correspondingly. The analysis shows that Compton scattering of a quark-gluon $qg \rightarrow q\gamma$ makes a dominant contribution to the total cross section of the process, accounting for 51.27%, while the contributions of annihilation of quark-antiquark pair $q\bar{q} \rightarrow g\gamma$ and bremsstrahlung of quarks $qq \rightarrow qq\gamma$, correspondingly are is 47.22% and 0.003%. The difference between the results obtained from the PYTHIA modeling and those calculated by FeynCalc is explained. The use of modern modeling tools such as PYTHIA not only improves the accuracy of experimental predictions, but also plays a key role in the development of new technologies for particle detection and data analysis.
Read the full abstract

All authors Mohsun R.Alizada, Azar I.Akhmedov, Sarhaddin K.Abdullayev, Mejid Sh.Gojayev, Mammed R.Rajabov

High Energy Physics (Theory)

Superstrip Algebras and Nonperturbative Spectra in Fermionic Theories

This is an extended version of arXiv:2511.22129. We develop a general construction of the superstrip algebra $\mathbf{sStr}_{\mathscr C}(\mathcal M)$, the fermionic counterpart of the strip algebra, for a gapped $(1+1)$-dimensional system with a fermionic superfusion category $\mathscr C$ and the vacuum structure described by the supermodule category $\mathcal M$. As illustrations, we work out the superstrip algebra for two simple examples: the fermionic variant of the Fibonacci fusion category and the q-type $\mathbb{Z}_2$ symmetry. We then apply the framework to the gapped IR phases of the $\mathcal N=2$ and $\mathcal N=1$ superconformal minimal models deformed by their least relevant operator and compute the Witten indices. We explain how the particle and soliton spectra, together with their fermion parity, are organized into representations of the corresponding superstrip algebras. A mixed 't Hooft anomaly between the spontaneously broken symmetry and the unbroken fermion parity $(-1)^F$ further forces each $\mathcal N =2$ soliton to carry a fractional fermion number. Finally, we set up the boundary SymTFT for fermionic systems and reproduce the results in several examples studied in this paper.
Read the full abstract

All authors Jin Chen, Zhihao Duan, Qiang Jia, Sungjay Lee

Artificial Intelligence

SCQ: Stabilizing Conservative Q-Learning with Sigmoid-Bounded Entropy

Offline-to-online reinforcement learning reduces interaction cost for real-world robot learning but suffers from persistent value estimation instability. Existing methods address this through pessimistic regularization, lower-bound calibration, and architectural normalization, but an overlooked source of instability lies in the entropy formulation: the standard log-entropy term can become negative, destabilizing policy updates. We introduce SCQ (Sigmoid-Bounded Conservative Q-Learning), which replaces this term with a sigmoid-bounded formulation that stays strictly positive. SCQ retains conservative Q regularization and return-based lower-bound calibration, stabilizing policy optimization without sacrificing exploration. We evaluate SCQ on D4RL (Minari) benchmarks under both single-demonstration and standard dataset settings, as well as on simulation and real-world visual tasks. SCQ matches or exceeds baseline performance while exhibiting more stable training dynamics across state-based and visual benchmarks, and transfers to four real-robot platforms including manipulation, wheeled, quadruped, and humanoid systems. A direct clipping intervention that removes negative log-probability contributions, together with gradient-matched positive-score controls, indicates that positivity rather than a particular score shape alone drives much of the improvement. Project website: https://scq-rl.github.io.
Read the full abstract

All authors Xiefeng Wu, Shu Zhang, Zhaojie Chu, Mingyu Hu

Multiagent Systems

The Mechanics of a Swarm: A Reproducible External Reconstruction of an Unintended Agent-Coordination Episode on a Third-Party Wiki

Between 24 May and 2 July 2026, autonomous language-model agents running inside a timed research-question evaluation wrote to a third party's public, world-writable wiki. OpenAI acknowledged the incident; independent researchers reconstructed it and published the wiki's archived revision history. We analyse that history (14,591 revisions, 3,103 names, 4,579 pages) as a behavioural record, attributing text to the revision that added it. Under an explicit identity model we reconstruct 907 cohorts and estimate about 876 episodes (95% interval 784-1008). Coordination formats converged within a day, and heterogeneous schedules over one question chain created large opportunities for information asymmetry: the first report of an item preceded a later cohort's own arrival by a median of 3.4 h. Across the 510 cohorts with an observable progress trace we find no robust positive association between measured coordination and documented progress. This version adds a source the export lacks: the wiki operator's own request log, 5,157,202 records over four months. It holds roughly 2.66M content requests and 1.58M searches, and 7,254 acting names against the export's 3,103; 2,578 names neither save nor open an edit form. Content requests before writing are observed for 1,034 of 1,140 coordinating names, and the first coordination page is requested 17 s after its creation. These records establish requests, not delivery or causal use. Among newcomers without a marker on their first written page, prior requests to other marker-bearing pages occur for 40.2% of marker adopters and 31.7% of non-adopters. The association remains, but our first-pass reading of it as transmission is withdrawn: page choice, shared behaviour and action-dependent nameability prevent causal identification. We list the claims from our earlier analyses that re-examination overturned, including one from this version's own first pass
Read the full abstract

Artificial Intelligence

Assisted Spatial Cognition Through Vision-Language Models

Multimodal AI, powered by Large Language Models (LLMs) and Vision-Language Models (VLMs), is transforming assistive technologies by enabling simultaneous processing of visual and textual data. This advancement holds significant promise for over 43 million visually impaired and neuro-divergent individuals worldwide who face persistent challenges in navigating indoor and outdoor environments due to limited spatial awareness and insufficient environmental cues. Existing navigation aids often lack comprehensive 3D scene understanding, relying on constrained route-based strategies that hinder user autonomy. In this paper, we introduce a novel end-to-end framework that integrates LLMs, VLMs and digital twin technologies to deliver a spatially cognitive navigation support for visually impaired and neuro-divergent users. Our system captures video input via standard mobile phone cameras, and employs SLAM3R to generate dense 3D point clouds from monocular RGB sequences in real-time. Our custom post-processing algorithm ensures accurate point cloud alignment across multiple viewpoints without requiring predefined reference points. This enhances the capabilities of SpatialLM to produce structured 3D representations, including architectural elements and oriented object bounding boxes. The enriched spatial data is then processed by a locally deployed LLM, which interprets 3D contexts to generate detailed scene descriptions and precise distance measurements between users and surrounding objects. We evaluated our approach across diverse video scenarios featuring various perspectives, looped walking views and captured in multiple environments. The evaluation results demonstrate consistent accuracy in 3D scene interpretation and object localisation, underscoring the potential of our system as a transformative assistive navigation solution that combines advanced visual perception with spatial reasoning
Read the full abstract

All authors H. Riaz, J. B. Fernandez, I. Mills, D. Hickey, F. Cleary, M. I. Ali

Artificial Intelligence

What Drives Recovery in Agentic Text-to-Cypher? LAST-CQ: An LLM Agent Self-Refinement Framework

Agentic pipelines for structured-query generation are rapidly expanding, but it is unclear which part of the loop produces the gain. We use LAST-CQ – a five-agent, training-free, execution-grounded Text-to-Cypher framework – as an instrumented testbed, running three counterfactuals over 2,471 live-database queries and six backbones spanning three vendor scale tiers. Removing correction is worth between 3.1% aggregate execution-BLEU against the single-pass system and 12.3% against a no-refinement counterfactual (up to 80.7% for the weakest backbone). Replacing schema-grounded, LLM-synthesised feedback with raw database error strings costs almost nothing (20.9% vs. 19.9% naive exact match; <0.2% end-to-end; equivalent within $\pm 0.075$ set-F1 by two one-sided tests). Spending the same call budget on parallel sampling degrades quality by 10-11%. What works is detecting failure and routing it to a retry, not the feedback sophistication or number of samples. LAST-CQ itself recovers 91.7% of queries that fail under single-pass generation, while a query that succeeds first time still costs exactly one LLM call. We also show that n-gram overlap on serialised results is not a bound in either direction: it over-scores against set equivalence on 65.9% of results while under-scoring against judged semantics. Finally, we calibrate our LLM judge against blind human labels and find it optimistic by 9 points.
Read the full abstract

All authors Ioannis Prokopiou, Athanasios Aidinis, Panagiotis-Christos Kyrmpatsos, Pantelis Vikatos

Databases

How Do Data Collection Strategy and Data Quality Influence the Outcomes of Digital Technology Adoption?

In the era of Industry 4.0 (I4.0), data has become the essential foundation for digital transformation, yet many organizations still struggle to link data practices with digital performance outcomes. This study investigates how data collection strategy and data quality jointly influence the success of digital technology adoption (DTA) in manufacturing firms. Drawing on survey data from 86 firms, the research employs Partial Least Squares Structural Equation Modeling (PLS-SEM) to examine the relationships among data collection strategy, data quality, implementation performance, and operational performance. The results show that both data collection strategy and data quality significantly influence implementation and operational performance. However, the effect of data collection strategy on implementation performance is indirect, fully mediated by data quality. The study also finds that data collection strategy influences data quality. These findings demonstrate that data quality acts as a critical bridge between upstream data practices and downstream digital outcomes. The study contributes to the digital transformation and data management literature by empirically validating the central role of data quality and offering practical insights for managers to design and govern data processes strategically. It also sets a foundation for future research on data governance frameworks that integrate data quality assurance, standardization, and lifecycle management to sustain data-driven and digital transformation.
Read the full abstract

Computer Vision

AquaCubeAI-Powered Monitoring Turbidity on-board {\Phi}sat-2

Timely monitoring of coastal water quality is critical for environmental protection, yet conventional satellite workflows rely on downlink and ground processing, introducing latency that can limit responsiveness to rapidly evolving turbidity events. To address this limitation, we propose AquaCubeAI, a lightweight machine-learning approach for onboard estimation of coastal water turbidity from {\Phi}sat-2 multispectral imagery. By shifting inference from the ground segment to the satellite, AquaCubeAI aims to enable lower-latency, more responsive, and more operationally useful turbidity monitoring under the strict compute and bandwidth constraints of spaceborne platforms. The model is trained on simulated {\Phi}sat-2 acquisitions spatially aligned with Copernicus Marine Service (CMEMS) High-Resolution Ocean Color (HR-OC) turbidity products over selected localized coastal sites spanning four European marine macro-regions. To provide a realistic evaluation of generalization in the presence of spatial correlation, we adopt a spatial block splitting protocol that mitigates data leakage between training and evaluation subsets. The main contributions of this work are: (i) a scalable dataset generation pipeline pairing simulated {\Phi}sat-2 multispectral patches with CMEMS HR-OC turbidity labels across selected localized European coastal sites; (ii) a compact Multi-Layer Perceptron (MLP)-based turbidity regressor trained under a leakage-aware geospatial split and tailored to embedded constraints; and (iii) a reformulation for dense spatial prediction via parameter sharing, enabling turbidity mapping and simple threshold-based anomaly masks for onboard decision logic. Embedded deployment on an Intel Myriad Vision Processing Unit (VPU) further confirms the feasibility of low-power hardware and supports low-latency inference from multispectral inputs.
Read the full abstract

All authors Pietro Di Stasio, Francesca Razzano, Elisa Liparulo, Gabriele Meoni, Nicolas Longépé, Deodato Tapete, Paolo Gamba, Gilda Schirinzi, Silvia Liberata Ullo

Earth and Planetary Astrophysics

Limits on a Host Star around a Saturn-mass Free-floating Planet Candidate KMT-2024-BLG-0792/OGLE-2024-BLG-0516

Recent studies found a number of short-timescale microlensing events that are thought to be produced by free-floating or wide-orbit planets. The microlensing event KMT-2024-BLG-0792/OGLE-2024-BLG-0516 is currently the only free-floating planet candidate with a directly measured mass ($0.73^{+0.25}_{-0.15}$ Saturn masses), derived from joint ground-based and Gaia satellite observations. However, it remains unclear whether the lens is truly isolated or bound to a widely separated host star. Here, we report high-angular-resolution interferometric observations of the event obtained with the Very Large Telescope Interferometer/GRAVITY instrument two years after peak magnification. We detect no luminous host star up to a projected separation of 90 au, supporting the hypothesis that the lens is indeed a free-floating planet. We derive a 5 sigma upper limit on the mass of a putative host star of approximately 0.5-0.6 M_solar. This work demonstrates that interferometry provides a powerful method for directly searching for or constraining host stars in short-duration and planetary microlensing events.
Read the full abstract

All authors Przemek Mróz, Klara Piotrowska, Antoine Mérand, Subo Dong, Zexuan Wu

Artificial Intelligence

Skill Issue: Lessons from Optimizing Repository SKILLs for Coding Agents

Coding agents increasingly read repository knowledge from SKILLs — plain .md files versioned alongside the code. Recent work synthesizes these files automatically, by optimizing the document against a benchmark. A bare repository comes with no benchmark, and the synthetic tasks prior work builds are small enough that a capable agent saturates them with no document at all. We mine harder tasks — merged pull requests of the repository, reverted at a single frozen base commit; and score a candidate document by whether the same agent does better with it than without it. On three Kotlin repositories, the documents GEPA finds raise this score by $4.9$pp on average, and the ones SkillOpt finds leave it where it started, $0.1$pp above the seed. The GEPA gain matches what prior work reports with the same optimizer, and at the dataset size a single repository supplies it cannot be separated from the agent's run-to-run variance; settling that would take more tasks than one repository's history yields. The documents themselves read better than the score: a maintainer of one repository found in them knowledge one only gets by working in the project.
Read the full abstract

Probability

A note on the expectation of zeros of random harmonic polynomials: The Kac model

Motivated by the questions posed by W. V. Li and A. Wei and the conjecture of E. Lundberg and A. Thomack, we study the expected number of zeros of random harmonic polynomials $H_{n,m}(z)=p_n(z)+\overline{q_m(z)}$ with independently and identically distributed Gaussian coefficients. In this paper we verify the conjecture of E. Lundberg and A. Thomack that the expectation is $O(n)$ when $\deg p=\alpha\deg q$, where $0\leq\alpha<1$. This result extends the previous estimates when $m$ is a fixed constant or $m=n$ to more general case.
Read the full abstract

Logic

Finite-tower bounds for Skolem functions

We bound the eventual order types of Skolem functions below finite exponential towers. Writing $E_0(u)=u$, $E_{n+1}(u)=2^{E_n(u)}$, and $\omega_0=1$, $\omega_{k+1}=\omega^{\omega_k}$, the argument gives \[ |\Sk_{<E_n(x^m)}|<\omega_{r_n},\qquad r_n=2+\frac{n(n+3)}2\quad(n\ge1,\ m\ge2\text{ fixed}). \] For triple towers we obtain the sharper bound $|\Sk_{<E_3(x^m)}|<\omega_{10}$ for every fixed $m\ge1$. The proof combines comparisons of asymptotic expansions with finite recursive decompositions and ordinal estimates for ordered sums and products. The analytic part is developed in the classical field of logarithmic-exponential series. We prove the required discreteness, support and truncation statements in this setting. The external inputs are the series construction of van den Dries–Macintyre–Marker and the order and ordinal estimates recalled from Berarducci–Mamino. These bounds imply $|\Sk|=\varepsilon_0$.
Read the full abstract

Nuclear Theory

Microscopic description of spin distributions in multinucleon tranfer reactions

Background: The generation of spin distributions in fission fragments has attracted substantial interest in recent years and its mechanism is becoming clear alongside the refined description with microscopic theories. In contrast, the microscopic origin of spin distributions in reaction products remain largely unexplored. Methods: Three-dimensional TDHF calculations are performed for multinucleon transfer processes in the $^{40}\text{Ca} + {}^{124}\text{Sn}$ reaction at $E_{\text{c.m.}} \simeq 128.54\,\text{MeV}$ using the Skyrme SLy5 energy density functional. To obtain spin distributions in each transfer channel, the particle-number projection (PNP) and the angular-momentum projection (AMP) are simultaneously achieved for a reaction product. Results: By performing PNP+AMP for TDHF wave functions after collisions, spin-dependent transfer cross sections are calculated for projectile-like fragments (PLFs). From the results, we find that abundant spin distributions can be obtained from the TDHF wave functions. For one-nucleon addition and removal channels, the calculated spin values agree well with those of single-particle states in the $pf$- and $sd$-shell, respectively. Moreover, for a-few-nucleon transfer channels, we show that the obtained spin distributions can be well explained by combinations of total angular momenta of those single-particle states. Furthermore, as the number of transferred nucleons increases, we find that the calculated spin distributions exhibit a smooth singly-peaked shape with a long tail as a function of $J$, which resembles that of empirical spin distributions for thermally equilibrated fragments. An exploratory calculation for induced fission of $^{240}$Pu is also carried out, obtaining similar results as in multinucleon transfer reactions. (shorted due to the arXiv's word limit)
Read the full abstract

Mesoscale and Nanoscale Physics

In-plane anomalous and third-harmonic Hall response in an easy-plane trigonal magnet

We report the emergence of an in-plane anomalous Hall effect (IPAHE) and a pronounced third-harmonic Hall response in an easy-plane trigonal magnetic system achieved via tuning of magnetic anisotropy. Angle-dependent Hall measurements reveal a clear departure from conventional sinusoidal behavior, revealing a strong sin(3{\theta}) component at elevated fields, which increases as the magnetic anisotropy is reduced, accompanied by a finite in-plane Hall signal. Consistently, the observed nonlinear Hall signal exhibits a cubic field dependence, indicative of a leading third-order contribution to the transverse conductivity. The enhancement of the third harmonic reflects the evolution toward coherent in-plane magnetization and symmetry-governed nonlinear transport. These observations support an intrinsic, symmetry-controlled transport mechanism enabled by reduced magnetic anisotropy and establish a direct link between anisotropy, crystal symmetry, and higher-order Hall response.
Read the full abstract

Robotics

Control Architecture for Safe Grasping of Fragile Objects Using a Coarse Position-Controlled Gripper

Robots are increasingly used in unstructured environments. The need for them to safely grasp unknown objects without damaging them becomes crucial. Humans achieve this by sensing and quickly responding by adjusting their grasping force. Similarly, effective grasp acquisition in robots requires compliant interaction strategies that can adapt to uncertain object properties and adjust to any instabilities during manipulation. We present a geometry-aware force/torque-based contact estimation method for a coarse position-controlled gripper, combined with an adaptive admittance controller for safe grasp acquisition. The desired contact forces are estimated online to keep stable contact with objects of unknown properties. This enables compliant and stable grasps while avoiding excessive forces. Experiments with objects of different sizes, shapes, stiffnesses, and weights show that the proposed algorithm not only prevents slippage but also applies minimal force to safely grasp an object without causing excessive deformation.
Read the full abstract

All authors Marko Pavlic, Moritz Geier, Timo Markert, Darius Burschka

Quantum Physics

Synchronized Spin Trajectories under Collective Weak Measurements

We consider locally driven-dissipative quantum spins that undergo a continuous weak measurement of their collective spin. We show that such a system can exhibit full spin-synchronization in trajectories corresponding to the same measurement record. Mathematically, we demonstrate that this is a general consequence of the irreducibility of the quantum Markov semigroup generated by the Lindbladian, in combination with a transitive symmetry, in particular spin-permutation symmetry. When breaking the irreducibility, e.g. in the absence of local dissipation, the system can exhibit a weaker form of partial synchronization. Given the general origin, this measurement-induced phenomenon arises in a broad class of many-body systems.
Read the full abstract

All authors Yiwen Han, Konghao Sun, Wei Yi, Johannes Schachenmayer

Machine Learning

Physics-Guided Synthetic High-Frequency Ultrasound Generation for Skin Layer Segmentation

High-frequency ultrasound (HFUS) enables noninvasive visualization of superficial skin structures, but automated skin-layer analysis is limited by the scarcity of densely annotated data. Existing real HFUS datasets commonly provide annotations for superficial targets such as the epidermis and subepidermal low-echogenic band (SLEB), while dense labels for deeper structures such as dermis, subcutaneous tissue, fascia, and muscle are rarely available. We propose a physics-guided synthetic HFUS generation framework for skin layer segmentation. The framework constructs multilayer acoustic skin phantoms, assigns layer dependent acoustic properties, and uses k-Wave simulation to generate paired synthetic HFUS images, dense layer masks, and simulation metadata. To evaluate whether the generated data provide transferable supervision, we use it for downstream segmentation pretraining and fine-tune the models on real Mendeley HFUS data. Synthetic pretraining followed by real fine-tuning achieved real-domain performance comparable to real-only training and improved mean Dice/IoU in three of four evaluated trainable architectures. These results suggest that physics-guided synthetic HFUS images contain transferable anatomical and textural cues for real-domain skin layer segmentation, although further reduction of the synthetic-real appearance gap is needed to enable greater gains. The code and data are available at: https://github.com/Finn-02/synthetic-hfus-skin-layer-segmentation.
Read the full abstract

Probability

Berry-Esseen Bounds for the Number of Real Zeros of Gaussian Weyl Polynomials

We establish Berry-Esseen bounds for the number of real roots of Gaussian Weyl polynomials $P_n$, where $n$ denotes the degree and is assumed to be sufficiently large. For each fixed $B$ above an absolute threshold, let $I_n=[-\sqrt n+B\sqrt{\log n}, \sqrt n-B\sqrt{\log n}]$. Uniformly over deterministic compact intervals $I\subseteq I_n$ whose length $\ell$ is sufficiently large and depends on $n$, the distribution of the standardized number of real roots in $I$ has Kolmogorov distance at most $C\log\ell/\sqrt\ell$ from the standard Gaussian distribution. Consequently, every such interval sequence with $\ell\to\infty$ satisfies a central limit theorem. In particular, taking $I=I_n$ gives the bound $C\log n/n^{1/4}$. The same bound holds for the distribution of the standardized number of real roots on $\mathbb R$. The key idea is to approximate the polynomial zero count by a sum of locally dependent random variables. We first couple the polynomial to a stationary Gaussian process and then truncate a moving-average representation of that process to obtain finite-range dependence. This strategy provides a route to Berry-Esseen bounds for other random polynomials with Gaussian coefficients whenever such a stationary approximation and quantitative truncation are available.
Read the full abstract

Fluid Dynamics

Diffusion Enhancement and Directional Suppression Induced by Reciprocal Flows

Reciprocal flows repeatedly return fluid elements to their initial positions, producing no net advective transport on time average. Nevertheless, their interplay with diffusion gives rise to nontrivial transport. To describe this phenomenon, we develop a general theory of effective diffusion under two-dimensional linear flows with arbitrary time dependence. By analyzing the advection-diffusion equation, we derive exact expressions for the mean square displacement and the effective diffusion coefficients for extensional, simple shear, and rotational flows within a single framework. We show that the reciprocal flows universally induce diffusion enhancement. The diffusion tensor exhibits pronounced anisotropy, which can result in directional diffusion suppression in spite of the direction-averaged diffusion enhancement. Our results provide a general framework for diffusion control by time-dependent flows and can provide new strategies for transport manipulation in microfluidic and biological systems.
Read the full abstract

Combinatorics

Degreewise Cut-Semigroup Saturation for $K_5$-Minor-Free Graphs and Seymour's Planar Edge-Colouring Conjecture

For every positive integer $k$, we prove that the homogeneous cut semigroup of every $K_5$-minor-free graph is saturated at height $k$ if and only if every planar $k$-graph is $k$-edge-colourable. Here a $k$-graph is a loopless $k$-regular multigraph in which every odd vertex cut has size at least $k$. A triangle expansion of a cubic plane dual converts cut decompositions into perfect-matching decompositions. The converse uses symmetric difference with a fixed perfect matching. The equivalence identifies the normality conjecture for $K_5$-minor-free cut polytopes with Seymour's planar edge-colouring conjecture. In particular, the known cases $k\leq 8$ give saturation through height eight.
Read the full abstract

Computer Vision

GRACE: Adaptive Concept Erasure with Geometry-Guided Retention in Diffusion Models

Text-to-image (T2I) diffusion models inevitably internalize sensitive or non-compliant concepts from large-scale pretraining data, necessitating post-hoc concept erasure. However, existing erasure methods often lack explicit constraints on parameter updates, leading to over-intervention and unintended semantic drift. In addition, many methods rely on manually crafted counterfactual supervision, such as surrogate prompts, which incurs substantial data construction costs that limit scalability to new concepts. To address these limitations, we propose GRACE, a structured concept erasure framework designed to enable localized and selective intervention. Specifically, we introduce a semantically weighted sensitive subspace estimation to precisely lock intervention directions, and employ lightweight subspace-constrained adapters to prevent global semantic disturbance. To eliminate the dependency on manual prompt engineering, we design an automatically decoupled safe-anchor mechanism. To mitigate semantic drift induced by excessive intervention, we introduce an energy-driven dynamic gating mechanism that adaptively controls the timing and strength of intervention at inference. Extensive experiments demonstrate that our method achieves a superior balance between erasure effectiveness and generation fidelity. Compared with the average performance of five state-of-the-art (SOTA) concept erasure methods, our method improves the fine-grained NSFW reduction rate by $17.86\%$, while reducing the macro-averaged target CLIP Score and preservation-oriented Fréchet Inception Distance (FID) by $4.55\%$ and $52.14\%$, indicating stronger concept suppression with substantially improved preservation of the original model's generative utility.
Read the full abstract

All authors Qinghui Gong, Yihuai Liang, Jinshan Lai, Deepak Kumar Jain, Vitomir Štruc, Zhengchun Zhou

Commutative Algebra

On the Hilbert Series and Multiplicity of Generalized Binomial Edge Ideals

In this article, we compute the Hilbert series of the generalized binomial edge ideal associated with the join of two graphs. Consequently, we compute the Hilbert series of complete $r$-partite graphs. Further, we show that if a vertex satisfies a certain degree condition, then some Hilbert coefficients remain unchanged upon its removal. This provides a reduction technique for computing them. As an application, we compute the dimension and multiplicity of several classes of graphs.
Read the full abstract

Number Theory

Zeros of Quasimodular Forms Defined by Iterated Sums

We study the zeros of the quasimodular forms $G_{\{2\}^n}$ defined by iterated sums. We first show that, for every $n>0$, $G_{\{2\}^n}$ has exactly $n$ simple zeros on each of the vertical half-lines $\Real(\tau)=0$ and $\Real(\tau)=1/2$, and that the zeros for consecutive values of $n$ satisfy an interlacing property. The proof is based on an expression of $G_{\{2\}^n}$ in terms of the $n$-th derivative of $\eta^3$ and on the theory of bell-shaped functions, rather than on Rankin–Swinnerton-Dyer method. We also determine the asymptotic behavior of these zeros as $n\to\infty$. In addition, we prove that all zeros of $G_{\{2\}^n}$ are simple and that $G_{\{2\}^n}$ has infinitely many $SL_2(\ZZ)$-inequivalent zeros. We further show that quasimodular forms of maximal depth have no zeros at CM points. In particular, none of the zeros of $G_{\{2\}^n}$ are CM points. Finally, in the special case $G_{2,2}$, we show that each Ford circle contains exactly two distinct simple zeros.
Read the full abstract

Audio and Speech Processing

X-Pred MeanFlow for Streaming Token-to-Mel Speech Decoding

Recent advancements in discrete token-based speech generation have highlighted the importance of efficient token-to-waveform synthesis in streaming and dialogue scenarios. Flow-matching acoustic decoders achieve high-quality token-to-mel generation, but their iterative sampling requires multiple neural function evaluations, limiting low-latency speech synthesis. MeanFlow reduces the sampling budget by modeling the average velocity over a temporal interval, yet maintaining high acoustic quality under extremely few-step token-to-mel generation remains challenging. To address this challenge, we propose X-Pred MeanFlow, a few-step streaming token-to-mel decoder that reparameterizes MeanFlow with mel-space prediction. The decoder predicts a generalized mel field and analytically derives the corresponding average velocity for sampling, thereby preserving the MeanFlow formulation while providing a direct acoustic prediction target. We further introduce layer-selective block-wise attention to enable continuous chunk-wise generation with bounded context. Experiments show that X-Pred MeanFlow improves few-step token-to-mel synthesis over Direct-$u$ MeanFlow and supports stable streaming generation. Speech samples are available.https://renxiaming.github.io/xpred-meanflow-stream-demo
Read the full abstract

All authors Hanke Xie, Xiaming Ren, Qirui Zhan, Jingbin Hu, Wenhao Li, Haoyu Zhang, Ruonan You, Chengyou Wang, Yunxiang Chen, Houdun Liu, Su Feng, Lei Xie

Cryptography and Security

Fresh-Challenge VDF Attestations for Model-Relative Response Latency

Can a finite verifier obtain public, model-relative evidence about response latency for sequential computation? Verifiable delay functions (VDFs) make this possible in principle: evaluation requires T sequential steps, whereas verification is efficient in the security parameter and polylogarithmic in the numerical value of T for standard constructions. Thus a delay can be astronomically large to evaluate yet succinctly represented and feasibly checked. A VDF proof for a chosen message alone is insufficient because it may be precomputed. We specify and analyze Fresh-Challenge VDF Attestations (FCLA), a protocol composition that binds a VDF to an unpredictable public challenge, a message, and independently auditable release and receipt records. Under explicit assumptions about VDF sequentiality, the challenge source, witness logs, and a calibrated upper bound on an adversary's sequential evaluation rate, an accepted FCLA transcript is inconsistent with post-challenge generation by an adversary in that bounded model. The result neither identifies a named claimant nor excludes relaying, outsourcing, or a faster unmodeled machine. A benchmark of the public reference implementation confirms the expected empirical separation between evaluation and verification on one documented machine. Our contribution is a protocol/design analysis and benchmarked reference implementation layer, not a new VDF construction or cryptographic primitive.
Read the full abstract