Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Monday 31 August

Functional Analysis

The Daugavet property in symmetric operator spaces

Under mild assumptions, the main results of this paper characterize a (real or complex) symmetric operator space affiliated with a semi-finite atomless von Neumann algebra $(\mathcal M, \tau)$ possessing the Daugavet property as $L_1(\mathcal M,\tau)$ or $\mathcal M$ (up to equivalent norms, or even proportional norms). Our results are new even for complex symmetric function spaces, which extend results of \cite{AKM12, KMMW13, AKM15} concerning the Daugavet property for real symmetric function spaces.
Read the full abstract

All authors Jinghao Huang, Yerlan Nessipbayev, Fedor Sukochev, Ran Xu

General Finance

Two Kinds of Nothing: What Insignificant Results in Finance Actually Show

Claims of the form "we find no evidence that X affects Y" appear throughout the applied finance literature, yet whether such a claim contains evidence of absence or absence of evidence depends entirely on its confidence interval. The term "statistically insignificant" is routinely read to mean zero economic effect. However, a more honest description is that zero could not be rejected along with a range of other coefficient effect sizes. The crucial question is whether effect sizes in that range are consequential. This note distinguishes two kinds of insignificant results that are indistinguishable in a standard regression table: bounded null claims where the intervals reject effect sizes of consequence and thus represent a genuine finding, and vacuous null claims where even consequential effects remain unrejected and therefore establish nothing. I propose a minimal reporting standard for regression results in applied finance, where the smallest consequential effect size is stated (in the units of the decision, per a named increment of the regressor) alongside the descriptive statistics and compared with the relevant edges of the confidence intervals of null claims. Using only the reported coefficient and standard error, authors can distinguish bounded (informative) null claims that reject consequential effect sizes from vacuous null claims that establish no information, perhaps due to deficiencies in data or the identification strategy. The symmetric phrase "no effect" conceals, in particular, the frequent split verdict: bounded in one direction, vacuous in the other. In ongoing work, I apply this framework to published null claims in leading finance journals, beginning with my own.
Read the full abstract

High Energy Astrophysical Phenomena

ALMA Observations of DEM L241/LMC P3 in the Large Magellanic Cloud: Evidence for the Formation of Cool Molecular Jets Driven by a Microquasar

We present ALMA observations of DEML 241/LMC P3, the most luminous $\gamma$-ray binary consisting of a compact object and an O star, in CO emission. We have found an one-sided jet-like CO feature of 8 pc length and 1 pc width, which accompanies another weaker CO jet candidate with slightly different orientation. The one-sided CO jet exhibits striking alignment with LMC P3, suggesting that the jet was driven by LMC P3. We have determined kinetic temperature of the CO jet to be significantly high at 33$-$60 K as compared with $\sim$15 K in the nearby non-jet CO cloud whereas no radiative heat source is found. We interpret that the high temperatures are due to shock heating of a microquasar jet driven by the $\gamma$-ray binary, where the compact object has an accretion disk fed by the O star winds. The CO jet matches existing predictions from magneto-hydrodynamical simulations, which show that CO jet can form from the interaction of the microquasar jet and an ambient ISM cloud. These results provide strong evidence that CO jets are a signature sculptured by microquasar jets, lending support for mass accretion in LMC P3 as the $\gamma$-ray origin. The results suggest a second case of CO jets potentially driven by a microquasar along with the CO jets in the microquasar candidate HESS J1023-575 recently identified in the Milky Way. Further, our results suggest the use of sub-mm observations for identifying microquasars, opening a new possible window for their discovery and study.
Read the full abstract

All authors Yasuo Fukui, Bhuvana G. R., Hidetoshi Sano, Kisetsu Tsuge, Rami Z. E. Alsaberi, Rin Yamada, Yuya Asano, Aya Bamba, Miroslav Filipovic, Charles Law, Norikazu Mizuno, Toshikazu Onishi, Paul Plucinsky, Gavin Rowell, Manami Sasaki, Piyush Sharda, Hiromasa Suzuki, Kengo Tachihara, Kazuki Tokuda, Yumiko Yamane

Signal Processing

Leveraging Bayesian Optimization for Array Shape Self-Calibration in Underwater DoA Estimation

Flexible sensing arrays are commonly used in underwater acoustic networks, but suppressed by unpredictable geometric deformations. Existing array shape self-calibration methods often estimate individual element positions separately, leading to a high dimensional optimization problem over long arrays. To address this problem, this paper proposes a Bayesian Optimization-assisted Geometry Estimation (BOGE) strategy operating with a hierarchical optimization process and a physics-informed parametric model for array geometry correction. BOGE formulates array shape self-calibration as an optimization problem, where candidate geometries are evaluated by the noise subspace residual. We perform Bayesian optimization to configure the physics-informed parametric model and then refine the selected geometry through numerical optimization. Empirical results show that BOGE achieves lower mean geometric root mean square error (RMSE) than the benchmark methods across a wide range of noise levels. On the public SWellEx-96 dataset, BOGE achieves a geometric RMSE of $0.659$ meters at $166$ Hz. A lake trial further shows that BOGE provides fixed source localization and moving target tracking performance comparable to the comparison methods.
Read the full abstract

All authors Xin Gui, Tianang Li, Changjia Wang, Bowen Han, Yunchuan Zhang, Zhengying Li

Machine Learning

Measuring Memory and Generalization as Separable Geometric Channels: The Topo^2 Framework

Deep networks trained on noisy labels simultaneously generalize on clean data and memorize flipped labels. These are usually conflated as pressures on one capacity. We present Topo^2, a measurement framework that makes them causally separable, measurable, and law-governed. Persistent-homology H1 structure of the representation space separates into a within-class manifold channel (a function of the training stopping point) and a cross-class channel (a monotone readout of memorized flipped samples). An intervention, the FM0 prescription (zero loss on flipped samples from epoch 0), reaches each setting's generalization ceiling while memorizing essentially nothing. Within the framework we establish a law set with graded evidence: (L2) FM0 separation prescription (9/9); (L1) the within-channel as a training-position function (mid-rise 6/6; convergence-back CIFAR 3/3, SVHN 2/3); (L3) a ring-construction identity (definitional, not a law); and TLS (memory-generalization topological layering): memory is causally additive, anchored (silencing clean collapses the representation), invertible (stripping memory restores near-ceiling generalization), and quantitatively billable (the memorization cost law, effective slope coefficient C ~ 0.38 at the reference capacity: CIFAR-10 0.3801 / SVHN 0.3806 / CIFAR-100 0.384 / VGG 0.3715, capacity-dependent in general and traced to clean-sample feature displacement). We also publish the framework's boundaries: a falsification ledger of nine dead ends, and an instrument-vindication section that excludes six families of global statistics as explanations of the within-channel. The framework turns "memorization" from an ill-defined capacity into a measurable, separable, invertible topological layer.
Read the full abstract

Classical Analysis and ODEs

The Koornwinder–Kostenko–Teschl Conjecture for Jacobi Polynomials and the Discrete Laguerre Phase Transition

We prove the refined Koornwinder–Kostenko–Teschl conjecture. For the normalized weighted Jacobi function and all $n\in\mathbb N\_0$, $\alpha,\beta\ge0$, and $-1\le x\le1$, $$ |g\_n^{(\alpha,\beta)}(x)| \le \left[ \frac{(n+1)(n+\alpha+\beta+1)} {(n+\alpha+1)(n+\beta+1)} \right]^{1/4}\le1. $$ The proof combines a central contour estimate with Sturm–Sonin localization and an exact inverse moment. It also yields an $n$-uniform extreme-lobe theorem and a sharp canonical-product first-lobe principle. Applied to the discrete Laguerre evolution, the estimate gives the optimal positive-parameter decay. For $-1<\alpha\le0$, a complementary one-sided Jacobi inequality gives the exact norm $\|\mathrm{e}^{-\mathrm{i} tH_\alpha}\|_{\ell^1\to\ell^\infty} =(1+t^2)^{-(1+\alpha)/2}$. Thus the large-time decay exponent is $\min\{1,1+\alpha\}$ for every $\alpha>-1$. Bessel, Laguerre, and Darboux scaling limits show that the temporal and fixed-diagonal exponents are optimal.
Read the full abstract

Computation and Language

Two Centuries of Sexism in British Parliament: A Computational Analysis of Women's Representation in the Hansard Corpus

The language a legislature uses to debate women's rights, even in favour of them, encodes systematic patterns of sexism that persist across two centuries. In this work, we analyse 6,531 speeches over 200 years of UK parliamentary debate (Hansard, 1803-2005) by using large language models to classify a speaker's perspective towards women's suffrage and political representation, as well as analyse sexist speech in parliament from the lens of the Ambivalent Sexism Inventory. We also release this parliamentary dataset, an organized and metadata-enriched version of the publicly available Hansard Corpus optimized for computational social science research, with 6.7 million speeches across 1.2 million debates, with 89% gender-matching for speeches by MPs from the House of Commons. We find that 54% of speeches opposing women's representation contain sexist content, compared to 21% of speeches that are for the cause, and that the two sides use fundamentally different types of sexism: anti-suffrage rhetoric combines hostile and benevolent framing, while pro-suffrage sexism is overwhelmingly benevolent. Female MPs support women's political rights at 93% compared to 70% for male MPs, a gap that closes only after enfranchisement. Our findings are evidence that benevolent and hostile sexism are used in different rhetorical contexts in a manner consistent with the theory of Ambivalent Sexism.
Read the full abstract

Solar and Stellar Astrophysics

Phosphorus abundances and multi-element co-enrichment in nearby FGK stars

The distribution of bio-essential elements is key to assessing the chemical fertility of galactic environments. We analyse phosphorus abundances for 233 nearby FGK stars from the Hypatia Catalog, separating thin- and thick-disk populations. We study [P/Fe] as a function of [Fe/H] and other elemental abundances using non-parametric tests and bootstrap resampling, and we examine residual correlations at fixed [Fe/H] together with molar ratios involving P. We find a [P/Fe]-[Fe/H] trend broadly similar to that of alpha elements, supporting a dominant origin in core-collapse supernovae, while deviations point to additional nucleosynthetic channels. Phosphorus shows strong positive correlations with several CHNOPS, alpha, and Fe-peak elements, especially in the thin disk. These co-enrichment patterns remain significant at fixed [Fe/H], indicating that they are not a trivial consequence of global metallicity. Thin-disk stars are also more enriched than thick-disk stars in many elements. The solar P/Mg and P/Si ratios are representative of the local stellar population, whereas solar P/O is relatively elevated. Overall, phosphorus emerges as a tracer of genuine multi-element co-enrichment and of the chemical fertility of the solar neighbourhood.
Read the full abstract

All authors Dario Esposito, Giovanni Covone, Donato Giovannelli, Paola Manini, Christian Magliano, Laura Inno, Luca Cacciapuoti, Víctor M. Rivilla, Vito Saggese, Leonardo Testi, Emanuele Cristiano, Luca Tonietti

Commutative Algebra

Approximating DVRs by elements of bounded ramification

Let $V$ be a DVR with quotient field $K$ and perfect residue field, $v$ be the valuation on $K$ associated with $V$, $\widehat K$ be the completion of $K$, and $\mathbb{K}$ be the completion of an algebraic closure $\overline{\widehat{K}}$ of $\widehat K$. We show that a DVR of the rational function field $K(X)$ which is a residually algebraic extension of $V$ is necessarily of the form $V_{\alpha}=\{\phi\in K(X)\mid v(\phi(\alpha))\geq0\}$, for an element $\alpha$ of $\mathbb{K}$ transcendental over $K$, and that $\alpha$ is algebraic over $\widehat K$ if and only if the residue field extension is finite. Not every such $V_{\alpha}$ is a DVR, however, and we characterize the $\alpha \in\mathbb{K}$ for which $V_{\alpha}$ is a DVR: they are the elements which can be approximated by algebraic elements in $\overline{\widehat{K}}$ with bounded ramification indexes. Combining the two results, we obtain a complete description of the extensions of $V$ to $K(X)$ which are DVRs and residually algebraic over $V$, together with a criterion for each of the two cases to occur. The proofs rest on a bound for the ramification index in a compositum, valid with no tameness assumption and under a separability hypothesis on one residue field extension only; we show that the inequality cannot be improved to a divisibility and that this hypothesis cannot be dropped. We also show that the hypothesis of discreteness cannot be omitted. Furthermore, we show that the set of $\alpha\in\mathbb K$ for which $V_{\alpha}$ is a DVR is a subfield of $\mathbb K$, which sits properly between $\overline{\widehat{K}}$ and $\mathbb K$, and corresponds to those elements $\alpha$ for which the value group of $\widehat K(\alpha)$ is discrete.
Read the full abstract

Chemical Physics

Accelerated Quantum-Assisted Selected Configuration Interaction via Fast-Annealing-Based Determinant Selection

Full configuration interaction (FCI) provides exact electronic structure within a given atomic basis, but its computational cost grows exponentially with the number of spin orbitals. Selected configuration interaction (SCI) methods alleviate this limitation by retaining only the most important Slater determinants. However, the repeated identification of important determinants remains a major computational bottleneck. We present a quantum assisted selected configuration interaction (QASCI) method that combines SCI with graph based block diagonalization (GBBD) of FCI Hamiltonian. The GBBD method partitions FCI Hamiltonian into independent blocks, within which determinant selection problem is formulated as a quadratic unconstrained binary optimization (QUBO) problem. The QUBO problems for selecting determinants to construct SCI space are iteratively solved using a fast annealing approach. We benchmark method on H8-H18 hydrogen chains and Li2S in STO3G basis. For Hn chains, chemical accuracy is achieved while retaining only a small fraction of Slater determinants, and this fraction decreases with increasing n, despite the exponential growth of the FCI Hilbert space. For Li2S, QASCI results remain within chemical accuracy while retaining substantially fewer determinants than the full FCI space. We apply QASCI to N2 using the 631G basis, considering both active orbital and full orbital treatments. The full orbital QASCI calculation, using 50000 determinants, yields a lower ground state energy than an FCI calculation within an active space comprising 12 spin orbitals and 12 electrons. These results demonstrate that the combination of QASCI and the GBBD approach can substantially reduce computational cost of determinant selection while maintaining the accuracy of FCI based electronic structure calculations, thereby enabling accurate calculations in larger orbital spaces.
Read the full abstract

Combinatorics

The Multicolour Size–Ramsey Number of an Even Cycle

We determine the $k$-colour size–Ramsey number of even cycles up to absolute constant factors. For every $k\ge2$ and every even $n\ge100\log k$, \[ \widehat R_k(C_n)=\Theta(k^2\log k)n. \] The lower bound follows from the corresponding result of Beke, Li and Sahasrabudhe for paths, while our upper bound improves the previous best estimate $O(k^{34}n)$ of Javadi, Kohayakawa and Miralaei.
Read the full abstract

Computer Vision

VisER: Visual Evidence and Reliance for Object Hallucination Detection in LVLMs

Object hallucination remains a persistent reliability issue in large vision-language models, where generated object mentions may sound plausible but lack visual grounding. Recent training-free detectors use internal signals such as token likelihood, attention, visual confidence, or image-text similarity to identify hallucinated objects. These signals are useful, but they are often source-confounded. They measure how strongly an object is supported inside the model without distinguishing whether that support comes from object-specific visual evidence or the generated text prefix. In difficult cases, a hallucinated object can still receive high internal support because it fits the scene, is associated with nearby visual cues, or follows naturally from the generated text prefix. We propose VisER, a training-free two-sided metric for object-level hallucination detection. VisER evaluates each generated object mention from two complementary views. Visual Evidence measures whether object-context compatibility is backed by object-specific evidence from image tokens. Visual Reliance measures whether the object is supported more by the image than by the generated prefix. Combining these views gives a more source-aware grounding score, while avoiding additional object-level verification generations. Across multiple LVLMs and benchmarks, VisER improves AUROC and AUPR over a range of baselines.
Read the full abstract

All authors Afsaneh Hasanebrahimi, Hanxun Huang, Christopher Leckie, Sarah Erfani

Information Retrieval

HF-SID: High-Fidelity Semantic IDs for Generative Retrieval in Location-Based Services

Generative retrieval has attracted increasing attention in Location-Based Services (LBS), where each Point-of-Interest (POI) is represented as a Semantic ID (SID). As the SID is the only channel through which POI information reaches the generative model, whatever it fails to preserve is irrecoverable at decoding time, and LBS retrieval is especially sensitive to the fine-grained differences that existing SIDs blur. Specifically, (1) LLMs embed continuous coordinates discontinuously, so their numeric differences do not reflect true geographic distance; (2) dynamic numerical attributes differ vastly in scale, so an identical gap may be decisive for one attribute yet negligible for another; and (3) short text cannot convey hierarchical affiliation, as text-similar POIs may belong to different hierarchies. We therefore propose HF-SID, which restores geographic, numerical, and structural fidelity at the representation stage, before any information is committed to a discrete code. It transforms coordinates into a continuous 3D Cartesian form and encodes each numerical value as a single unit, consolidated inside the LLM by Geo-CPT and Num-CPT with type-aware embeddings; a Structure-based Contrastive Learning objective, applied only to the last-layer residual, then separates co-located POIs that share a coarse tag but differ at the fine level. Because these mechanisms enrich the representation rather than lengthen the identifier, HF-SID uses a 3-token SID at no extra decoding cost. On a large-scale industrial
Read the full abstract

All authors Haowen Lin, Jing Li, Zhibin Hao, Fangye Wang, Lihui Su, Song Yang, Xiaojiang Zhou, Pengjie Wang

Computation and Language

Agents in the Large: Perception-Centered Architecture for Persistent Agents

Cognitive language agents have achieved substantial progress by equipping language models with memory, tools, and decision-making procedures, enabling agents to reason and act in interactive environments. Existing frameworks largely cast these agents as systems for solving user-specified, bounded tasks. An increasingly important goal is for language agents to provide persistent assistance in long-lived settings where user needs, context, and service procedures persist and change, and to remain useful across the broad range of tasks that arise over time. Yet we still lack a framework to characterize persistent AI agents, organize existing work, and guide future development. To this end, we propose a Perception-Centered Architecture for Persistent Agents (Pera). Pera describes a persistent agent organized around perception and control components that continually perceive service-relevant signals from episodic task executions, internal context, and changes in the surrounding environment, and use these signals to construct lifecycle tasks. These tasks drive the ongoing operation and adaptation of the agent's service procedures. We use Pera to retrospectively organize recent work, examine a detailed case study, and offer forward-looking insights for building more capable persistent agents. Just as software engineering moved from programming in the small to programming in the large, Pera frames the evolution of language agents as an analogous architectural transition toward long-lived, adaptive intelligence systems.
Read the full abstract

All authors Shihan Dou, Haoxiang Jia, Shichun Liu, Feng Chen, Chenhao Huang, Yujiong Shen, Shaofan Liu, Jiayi Chen, Jiahang Lin, Honglin Guo, Qianyu He, Minghao Guo, Ziyi Ye, Pluto Zhou, Tao Gui, Qi Zhang, Xuanjing Huang

High Energy Astrophysical Phenomena

SNAD: enabling discovery in the era of big data

In the era of wide-field surveys and big data in astronomy, the SNAD team is exploiting the potential of modern datasets for discovering new, unforeseen, or rare astrophysical objects and phenomena with machine learning (ML). The SNAD pipeline was built under the hypothesis that, although automatic ML algorithms have a crucial role to play in this task, the scientific discovery is only completely realized when such systems are designed to boost the impact of domain knowledge experts. Our key contributions include the development of the Coniferest Python library, which offers implementations of two active learning algorithms with an “expert in loop”, and the creation of the SNAD Transient Miner, facilitating the search for specific types of transients. We have also developed the SNAD Viewer, a web portal that provides a centralized view of individual objects from the Zwicky Transient Facility's (ZTF) data releases, making the analysis of potential anomalies more efficient. Finally, when applied to ZTF data, our approach has resulted in more than a hundred new supernova (SN) candidates, along with a few other non-catalogued objects, such as red dwarf flares, superluminous SNe, RS CVn type variables, and young stellar objects.
Read the full abstract

All authors Maria Pruzhinskaya, Emille E. O. Ishida, Konstantin Malanchev, Anastasia Lavrukhina, Etienne Russeil, Timofey Semenikhin, Sreevarsha Sreejith, Emmanuel Gangler, Matwey Kornilov, Vladimir Korolev, Alina Volnova

Category Theory

A note on coextensivity of bounded hoops

The main aim of this note is to provide a characterisation of coextensive morphisms in the category of bounded hoops. This characterisation is then used to show that several categories of bounded hoops are coextensive as categories. Among these are the variety of bounded Wajsberg hoops, or more generally the variety of bounded $\vee$-hoops. Our characterisation also yields the coextensivity of the category $\mathbf{Heyt}$ of Heyting algebras and recovers the known coextensivity of the category $\mathbf{MV}$ of MV-algebras.
Read the full abstract

Computation and Language

ImageEval 2026: Culturally Grounded Arabic Multimodal Evaluation

We present an overview of the ImageEval 2026 shared task on culturally grounded Arabic multimodal evaluation. It includes two tasks: (i) AynVQA, covering spoken visual question answering and image-grounded hallucination detection in English and Modern Standard Arabic (MSA), and (ii) CRAI-Bench, evaluating the cultural accuracy of text-to-image generation. A total of 14 teams participated in the test phase, with 12 teams submitting system description papers. Participating systems used a range of approaches, including zero-shot prompting, fine-tuning of vision-language models, speech-recognition pipelines, ensembling, and score calibration. We describe the task setup, datasets, evaluation procedure, and participating systems, and summarize the main results across the different tracks. All datasets and evaluation scripts from the shared task are released to the research community. The shared task highlights the challenges of culturally grounded multimodal evaluation, particularly for Arabic speech and image-text reasoning.
Read the full abstract

All authors Samir Abdaljalil, Hunzalah Hassan Bhatti, Ahlam Bashiti, Farina Amir, Md Arid Hasan, Basel Mousi, Nadir Durrani, Fahim Dalvi, Zien Sheikh Ali, Erchin Serpedin, Hasan Kurban, Mustafa Jarrar, Shammur Absar Chowdhury, Firoj Alam

Combinatorics

Fast robbers on abelian Cayley graphs and digraphs

We study the fast-robber version of the Cops and Robbers game on finite strongly connected abelian Cayley digraphs, including undirected Cayley graphs as the symmetric case. For bounded out-degree $D$, we show that $c_{1,\infty}\left(\Gamma\right)=O_D\left(n^{1-\frac{1}{D}}\right)$; in the undirected case with $D\ge2$, this improves to the optimal exponent $1-\frac{1}{\left\lfloor \frac{D}{2}\right\rfloor}$. We also establish the degree-independent bound $c_{1,\infty}\left(\Gamma\right)=O\!\left(\frac{n\left(\log\log n\right)^2}{\log n}\right)$. These estimates follow from an optimized character-theoretic cyclic sweep over subgroup quotients.
Read the full abstract

Statistics Theory

Bounds on the Posterior-to-Prior Ratios for Inclusion Belief under Bounded Differential Privacy

Differential privacy has become the standard for generating privacy-protected data releases. However, differential privacy does not translate intuitively to disclosure risk. In particular, it remains unclear how much an adversary's belief about an individual's inclusion in a dataset can change after observing a protected release. To address this question, we derive upper and lower bounds on the posterior-to-prior ratios of inclusion beliefs under bounded probabilistic and approximate differential privacy. By assuming a worst-case adversary with all-but-one auxiliary information, i.e., knowledge of all except for one of the participants in a dataset, we obtain bounds that apply to any adversary. Because these bounds may fail with non-zero probability, we study the corresponding failure probability for the Gaussian mechanism. We derive a theoretical upper limit on this probability and compare it with Monte Carlo estimates across a wide range of parameter settings. The observed failure rate is several orders of magnitude smaller than its theoretical upper limit, indicating that the latter is highly conservative. These findings suggest that the inferential privacy guarantees provided by differentially private mechanisms may be substantially stronger in practice than what is implied by the theoretical upper limit.
Read the full abstract

All authors Jan Reiter Sørensen, Heidi Søgaard Christensen, Rasmus Rask Kragh Jørgensen, Martin Bøgsted

Machine Learning

ToxLens: A Reproducible Graph-Learning Framework for Leakage-Aware, Uncertainty-Calibrated Molecular Toxicity Prediction

Molecular toxicity prediction is increasingly used to prioritise compounds before experimental testing, but conventional benchmark performance can overstate practical utility when structurally related molecules occur across training and test folds. We introduce ToxLens, a reproducible multi-task graph-learning framework for 11 toxicity endpoints spanning Ames mutagenicity, acute oral toxicity, hERG inhibition, and Tox21 nuclear-receptor and stress-response assays. The workflow combines conservative chemical curation, sphere-exclusion filtering, a leakage-aware UMAP-HDBSCAN split, parallel graph and global-feature encoders joined by late concatenation, temperature-scaled Monte Carlo dropout with conformal-style prediction sets, applicability-domain analysis, and SHAP-guided toxicophore discovery with occlusion controls. On the leakage-controlled test fold, a five-seed soft-voting ensemble achieved a Matthews correlation coefficient score of 0.44, an area under the receiver operating characteristic curve score of 0.83, and an area under the precision-recall curve score of 0.58. It exceeded four ECFP4-based shallow baselines on all 11 endpoints under the same split and validation-based threshold-selection protocol. Controlled ablations showed that the global pathway was important, whereas late concatenation outperformed the tested gated and feature-wise linear modulation fusion variants. Conformal-style prediction sets revealed substantial endpoint-specific variation in set efficiency, and discrimination and calibration improved with similarity to the training domain. Retraining on fixed published Tox21 Challenge and TDA folds produced competitive, but not uniformly state-of-the-art, performance. SHAP-guided occlusion and consensus subgraph mining yielded model-derived structural hypotheses, 44 of which contained at least one occurrence that passed the predefined counterfactual criteria.
Read the full abstract

Computer Vision

HorizonNet for visual terrain navigation

This paper investigates the problem of position estimation of unmanned surface vessels (USVs) operating in coastal areas or in the archipelago. We propose a position estimation method where the horizon line is extracted in a 360 degree panoramic image around the USV. We design a CNN architecture to determine an approximate horizon line in the image and implicitly determine the camera orientation (the pitch and roll angles). The panoramic image is warped to compensate for the camera orientation and to generate an image from an approximately level camera. A second CNN architecture is designed to extract the pixelwise horizon line in the warped image. The extracted horizon line is correlated with digital elevation model (DEM) data in the Fourier domain using a MOSSE correlation filter. Finally, we determine the location of the maximum correlation score over the search area to estimate the position of the USV. Comprehensive experiments are performed in a field trial in the archipelago. Our approach provides promising results by achieving position estimates with GPS-level accuracy.
Read the full abstract

All authors Bertil Grelsson, Andreas Robinson, Michael Felsberg, Fahad Shahbaz Khan

Numerical Analysis

A Barrier-Regularized Symmetric Nitsche Method for the Signorini Problem

We introduce and analyze a barrier-regularized symmetric Nitsche method for the scalar Signorini problem. Applying a logarithmic barrier to the nonnegative slack variable in an augmented Lagrangian and then eliminating that variable yields a smooth positive-part operator and the perturbed complementarity relation on a primal-dual central path, with barrier parameter $\mu=\gamma s$. For every $s>0$, the discrete problem is continuously differentiable, uniquely solvable, and has a symmetric positive definite Newton matrix when the Nitsche parameter is sufficiently large. Under a mild barrier-feasibility condition, the continuous logarithmic energy has a unique minimizer $u_\mu$ for every $\mu>0$, its gap is positive almost everywhere, and $\|u-u_\mu\|_{H^1(\Omega)}\lesssim\mu^{1/2}$. Under the Sobolev regularity used for finite element approximation, this minimizer satisfies the \(L^2\) central-path boundary law. If the obstacle is locally the trace of an $H^2$-function, we also prove a uniform local $H^2$ bound in the interior of each planar contact face, on neighborhoods that may contain a free-boundary point of the limiting Signorini solution. The method is exactly consistent and quasi-optimal relative to $u_\mu$, with constants independent of $s$. If $u_\mu$ is uniformly bounded in $H^r(\Omega)$, $3/2<r\leq k+1$, then $\|u-u_h\|_{H^1(\Omega)}\lesssim h^{r-1}\|u_\mu\|_{H^r(\Omega)}+\mu^{1/2}$; hence the sufficient balance $s\lesssim h^{2r-1}$ preserves the available energy-norm rate. We also derive rates for discrete penetration and the complementarity residual. Numerical experiments with $P_1$ and $P_2$ elements on structured and unstructured meshes support the predicted rates and the local Newton theory, while showing that a rate-preserving smoothing may still resolve the contact set poorly.
Read the full abstract

Soft Condensed Matter

A multi-scale study to unravel the dehydration mechanism of hydrated salts

Understanding the dehydration mechanism of hydrated salts remains fundamentally important in solid state chemistry, as their behavior affect fields ranging from heat storage to heritage conservation and pharmaceutical crystallization. Combining Raman confocal microscopy, dynamic weight loss measurements, SEM, and micro CT, we show that dehydration kinetics of sodium sulfate decahydrate (mirabilite) unfold through two regimes: an initial nucleation controlled phase, where atomic rearrangement drives two dimensional lateral growth following an exponential law, and a subsequent phase boundary controlled regime, where growth advances into the crystal depth, limited by water vacancy formation at the hydrated dehydrated interface. The resulting thenardite product shows around 35 percent shrinkage and forms a porous, layered dual porosity nanocrystalline structure, with relative humidity directly governing crystal size. Extending this analysis to other sulfate hydrates reveals that crystallographic symmetry changes between hydrate and anhydrous phases dictate surface morphology, linking microstructure to mechanism. This multiscale framework uncovers dynamics hidden from bulk measurements and suggests structural indicators could predict dehydration pathways in other hydrated salt families, and opening route toward designing thermal energy storage materials without exhaustive experimental screening.
Read the full abstract

All authors A. C. Claude, H. Derluyn, J. van de Groep, N. Shahidzadeh

Computation and Language

Hi-Q: Hierarchical Evidence-guided Query Refinement for Multi-Hop Question Answering

A central bottleneck in multi-hop Question Answering (QA) is that the granularity at which a question is expressed often differs from the granularity at which corpus evidence is retrievable. Existing methods address this mismatch by imposing fixed graph structures over the corpus, by iteratively reformulating the query, or by executing a generated program over it, but these strategies do not explicitly decide when a query unit is already supported by evidence and when it should be refined. We formulate this bottleneck as retrievable granularity discovery and introduce Hi-Q, an evidence-conditioned framework for hierarchical query refinement. At each query node, a resolution operator tests whether retrieved evidence supports the current query unit; resolved nodes terminate, while unresolved nodes are expanded by a dependency-preserving binary operator and checked by a semantic coverage verifier. Hi-Q therefore grows a query tree whose topology is determined by corpus support signals rather than by a fixed decomposition template or a pre-built graph. We evaluate Hi-Q on three multi-hop QA benchmarks, primarily under full-corpus retrieval, where dependent evidence must be located among open-domain distractors rather than within a small annotated pool. In this setting Hi-Q reaches 52.3 EM and 64.0 F1 averaged over the three benchmarks, ahead of the iterative retrieval baseline IRCoT by 15.1 EM / 18.2 F1 on that same average, and ahead of the graph-based RAG baseline PropRAG by 11.5 EM / 12.0 F1 on MuSiQue-full, without corpus-wide graph construction. In the restricted supporting/distractor setting used by prior work, Hi-Q likewise attains the best accuracy, with 57.9 EM and 69.3 F1 on average, ahead of PropRAG by 5.6 EM / 3.9 F1 and IRCoT by 13.7 EM / 15.8 F1. The project page is available at https://hi-q-project.github.io/.
Read the full abstract

Computer Vision

Beyond Accuracy: Quantifying Pulmonary Attribution in Anatomy-Guided Chest X-Ray Classification Under Domain Shift

Deep-learning models can achieve strong chest X-ray (CXR) classification performance without establishing whether their predictions predominantly rely on pulmonary image content. This study evaluates pulmonary attribution containment as an anatomy-related reliability property distinct from diagnostic performance. We propose DBCA-SegNet-MGAP, a multi-task anatomy-guided CNN-Transformer framework that combines complementary feature representations through bidirectional cross-backbone attention, predicts a soft lung mask, and incorporates this anatomical prior directly into classification through Mask-Guided Adaptive Global Average Pooling (MGAP). Pulmonary attribution containment is quantified using the Anatomical Local Energy Ratio (ALR) and high-intensity cumulative ALR (cALR@0.9). Experiments were repeated across three training seeds using the COVID-19 Radiography Database for four-class internal testing and a locked Shenzhen-to-Montgomery protocol for zero-shot external tuberculosis testing. On COVID-19, the proposed model achieved a weighted F1 of $0.9615 \pm 0.0015$ and macro ROC-AUC of $0.9906 \pm 0.0007$. In an architecture-matched dual-bridge comparison, replacing conventional GAP with MGAP increased ALR from $0.3878 \pm 0.0098$ to $0.7086 \pm 0.0104$ and cALR@0.9 from $0.5265 \pm 0.0101$ to $0.9905 \pm 0.0018$, while weighted F1 remained essentially unchanged ($0.9618 \pm 0.0015$ vs. $0.9615 \pm 0.0015$). Under locked external transfer to Montgomery, ROC-AUC remained $0.9080 \pm 0.0043$ and pulmonary ALR remained $0.6466 \pm 0.0081$, whereas weighted F1 decreased to $0.7528 \pm 0.0080$ and ECE increased to $0.1683 \pm 0.0055$. These findings show that diagnostic discrimination, calibration, and pulmonary attribution containment are distinct model properties and support their joint evaluation under internal testing and external domain shift.
Read the full abstract

All authors Abdullah Al Mamun, Md. Nasif Osman Khansur, Md Ashraful Hossen Akash, Md. Kishor Morol, Tze Hui Liew

Artificial Intelligence

CHASE: How Content Ecosystems Are Reshaped When Ranking Is the Only Target

Generative Engine Optimization (GEO) is increasingly used to improve content visibility in LLM-based retrieval systems, yet its population-level effects under repeated optimization remain poorly understood. We introduce Content Homogenization under rAnking Signal Exploitation (CHASE), a controlled simulation framework for studying how content ecosystems are reshaped when creators repeatedly adapt documents to an LLM ranking signal. We use ranking as a proxy for source visibility and validate this abstraction against citations in grounded generated responses, obtaining a rank-citation AUC of 0.853 $\pm$ 0.093 across six domains. CHASE then iterates ranking, feature discrimination, rewriting, and evaluation over 20 rounds across different domains. Quality-ranking alignment decreases in all six domains: from R0 to R20, the change in Spearman's rho ranges from -0.107 to -0.018, with a mean change of -0.068, which means documents closer to the ranking feature profile become less aligned with independently judged document quality over the simulation horizon. A random-target control has shown that it is associated with adaptation toward ranking-derived incentives rather than iterative rewriting alone. The resulting ecosystem dynamics are strongly domain-dependent. Together, these findings show how repeated optimization against a fixed LLM ranking signal can reshape both content populations and the incentives faced by content creators.
Read the full abstract

All authors Qianwen Gao, Zichang Su, Yiwen Hou, Arlen Kumar, Leanid Palkhouski

Databases

Strengthening LargeRDFBench for Interoperable Federated SPARQL Evaluation

LargeRDFBench is one of the most comprehensive benchmarks for evaluating federated SPARQL query engines, combining real, interlinked datasets with a rich query suite that has made it a reference point for the community. Evaluations of federated engines are published by comparing engine results against the benchmark's expected results, so those expected results must themselves be reproducible. Moreover, several of its data dumps violate the RDF specifications, so only engines that parse RDF leniently can host them, and its expected results are distributed in an ad hoc format. We identify, categorize and repair these data-quality issues with a reproducible cleaning pipeline, producing standards-conformant serializations of every affected dataset. Furthermore, we re-encode the benchmark's expected results in the W3C SPARQL 1.1 Query Results JSON Format and correct their discrepancies. Every dataset now parses under strict RDF parsers, and the expected results are machine-verifiable through a standard format, extending the benchmark's reach to the full range of conformant engines while staying faithful to the original data. Reproducing the expected results end-to-end with an independent implementation uncovers corruption in the published reference, and discrepancies between our results and the original ones, some not trivial to resolve, others open questions. We further perform a preliminary comparison, not previously explored, of ASK- and COUNT-based source selection in the FedX algorithm. This work strengthens an already valuable community resource by aligning its artifacts with the RDF standards, broadening the set of engines that can be fairly and reproducibly compared. We also raise the question of how the results of federated queries under automatic source selection can be made reproducible.
Read the full abstract

Soft Condensed Matter

Viscoelastic interfacial structures in undersaturated calcium solutions under nanoconfinement

Calcium mineralisation underpins processes ranging from biomineralisation to scalable carbon storage, yet the earliest stages of nucleation remain unresolved. Here we investigate calcium-containing solutions under nanoscopic confinement while remaining undersaturated with respect to bulk calcium carbonate precipitation. Using sensitive surface force measurements, we identify a long-range non-DLVO repulsive interaction specific to calcium solutions, which we attribute to hydrated ion networks at mineral interfaces. These interfacial networks exhibit viscoelastic behaviour distinct from the bulk solution, persist across a broad pH range, and can be disrupted by competing ions with strong surface affinity. Our findings provide experimental evidence that stable hydrated ion networks can emerge at mineral interfaces under undersaturated conditions, supporting the possibility that interfaces and confinement stabilise intermediate ion assemblies prior to nucleation. These results bridge classical and nonclassical descriptions of mineral nucleation and highlight the central role of interfaces and confinement in directing crystallisation pathways.
Read the full abstract

All authors Shurui Miao, Timothy S. Groves, Kieran J. Agg, Susan Perkin

Computation and Language

More Capable, Less Faithful: A Multilingual Analysis of Mathematical (Un)Solvability Detection in LLMs

Solvability detection is one of the most challenging aspects of mathematical reasoning for Large Language Models (LLMs). While prior work has studied this capability extensively, these analyses have been limited to English. Consequently, it remains unclear whether multilingual failures arise from differences in internal Solvability Belief or from language-dependent failures to express it. To address this gap, we introduce the first multilingual benchmark of paired solvable and unsolvable mathematical problems, extending ReliableMath to French and Greek. Using this, we train multilingual probes predicting Solvability Belief and analyze the solvability detection capabilities of state-of-the-art LLMs behaviorally, representationally, and in terms of faithfulness. We find that Solvability Belief is encoded as a largely universal, language-agnostic feature, and that higher-resource languages such as English, despite achieving stronger mathematical reasoning performance, exhibit lower solvability-detection faithfulness.
Read the full abstract

Computation and Language

Enhancing Low-Resource Language Reasoning via High-Resource Language Feature Transfer

Large language models exhibit substantial performance variation across languages, even when solving semantically equivalent tasks. Existing analyses often treat this phenomenon as an observational disparity caused by differences in pretraining data, tokenization, or benchmark coverage. We study a complementary hypothesis: high-resource languages (HRLs) may more reliably elicit latent computations useful for task-specific (i.e. mathematical) reasoning, while lower-resource languages (LRLs) may under-activate those computations despite expressing the same task. To test this hypothesis, we introduce a mechanistic intervention framework for identifying and transferring task-relevant sparse latent features across languages. Using sparse autoencoders over residual-stream activations, we isolate features enriched in successful HRL task-specific reasoning while filtering out source-language and generic-generation features. We then construct steering directions from these features and inject them during LRL inference. The resulting interventions test whether the selected features are functionally involved in the observed reasoning gap: suppressing them should impair source-language reasoning, while activating them should partially recover target-language reasoning beyond random and non-task controls. Our framework reframes some cross-lingual reasoning gaps as failures of mechanism elicitation rather than capability absence, and offers a causally testable route to feature-mediated transfer without translation, fine-tuning, or changing the user-facing language.
Read the full abstract

All authors Minju Song, Hyeon Hwang, Junhyun Lee, Jaewoo Kang