Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Wednesday 2 September

Computer Vision

Diffusion-Encoding Gaussian Field for Joint k-q dMRI Reconstruction

Diffusion MRI requires repeated k-space acquisitions over multiple diffusion-encoding directions, making acquisition time dependent on both spatial and angular sampling. Existing joint k-q methods either associate directional parameters with fixed voxels or separate spatial reconstruction from angular completion. However, diffusion-weighted images acquired under different directions share the same anatomical organization, while their local signal intensities vary with diffusion encoding. Existing formulations do not fully exploit the complementarity between shared anatomy and direction-dependent signal variation. Consequently, residual spatial errors may be misinterpreted as genuine angular variation and propagated to unobserved directions. We propose a subject-specific spatial-angular Gaussian field for self-supervised joint k-q dMRI reconstruction. Shared 3D Gaussian primitives provide local spatial support, with each primitive carrying a continuous q-conditioned tensor-residual response. The signal at each location is synthesized from multiple overlapping primitive responses, coupling neighboring spatial regions and diffusion directions. The field is progressively optimized from undersampled k-space measurements of observed directions, without fully sampled targets or held-out-direction supervision. Experiments on three HCP diffusion shells under multiple acceleration settings demonstrated consistent improvements in missing-direction DWI reconstruction, tensor-derived metrics, and principal diffusion orientation estimation.
Read the full abstract

All authors Zhibo Chen, Yajuan Huang, Yu Guan, Qiuyun Fan, Dong Liang, Qiegen Liu

Materials Science

Vitrification-Devitrification Enables Tunable Photonic and Gas Sorption Properties of Zeolitic Imidazolate Frameworks

Zeolitic imidazolate framework (ZIF) glasses represent an emerging family of melt-quenched glasses, which exhibit immense potential for applications in gas separation, energy storage, and optics. However, their intrinsic porosity remains elusive due to the inherent challenges in resolving their disordered atomistic structures. Here, we systematically investigate the porosity of ZIF-4 and ZIF-62 crystals and their corresponding glasses. CO2 sorption at 195 K enables quantitative assessment of microporosity in both crystalline and glassy states, allowing the accessible micropore volume of the ZIF glasses to be determined. Moreover, establishing a direct relationship between photonic properties and structural porosity in Zn-based ZIF glasses remains challenging. Here we demonstrate striking broadband blue-light emission from ZIF-4 glass annealed under optimized conditions. A pronounced red shift is observed when increasing the annealing temperature above the glass transition temperature. By correlating the evolution of photoluminescence with structural porosity, we reveal the interplay between the photonic and gas sorption properties of ZIF glasses. These findings provide new insights into the structure-property relationships of ZIF glasses and offer a pathway toward the rational design of multifunctional MOF glasses.
Read the full abstract

All authors Zhencai Li, Zihao Wang, Minhyuk Kim, Huotian Zhang, Bozhao Yin, Yong Li, Qi Zhang, Fengming Cao, Xuan Ge, Laurent Calvez, Daniel Irving, Guoping Dong, Feng Gao, Haomiao Zhu, Morten M. Smedskjaer, Hoi R. Moon, Yuanzheng Yue

Machine Learning (Statistics)

From topology learning to graph generation: A unifying perspective

Learning graph structures from data is a fundamental problem that spans a wide range of signal processing and machine learning tasks. While significant effort has been made to tackle the problem, existing research has largely evolved along two parallel directions. The first seeks to infer the topology of an individual graph from observations supported on it, whereas the second seeks to learn a generative distribution from observed graph instances, enabling the sampling of new graphs. This review presents a unified framework that connects these formulations by viewing them as inverse problems of a common generation process for graph data. We review the major methodologies within this framework, highlight their relationships, strengths, and limitations, and identify opportunities for integrating ideas across paradigms. By bridging graph topology learning and graph generation, this review provides a broader cross-disciplinary perspective on the field and outlines promising directions for future research.
Read the full abstract

All authors Xiaowen Dong, Hoi-To Wai, Siheng Chen, Laura Toni, Dorina Thanou

Machine Learning

Entangled Representations Amplify Collateral Damage in Unlearning

A long-held intuition in interpretability research is that representational entanglement, the sharing of structure between knowledge domains in a neural network, makes unlearning harder. While the intuition is widespread, it has never been directly tested in a controlled experiment. We present a way to do so: by repurposing Selective Gradient Masking (SGTM), we train a suite of six 254M-parameter language models on English Wikipedia with graded levels of disentanglement between biology and non-biology knowledge. Applying three standard unlearning methods to every model in the suite, we find that more disentangled models consistently achieve better retain-forget trade-offs: at a fixed level of forgetting, the most disentangled models incur roughly $4\times$ lower retain cost under two of the three methods, and $1.3\times$ lower under the third. Because our intervention changes only the model, not the data or the unlearning algorithm, this is direct evidence that representational entanglement is one of the causes of collateral damage in unlearning, as interpretability researchers have long suspected. A similar design could be used to test other structural claims from interpretability.
Read the full abstract

Metric Geometry

The trapezoid comparison inequality in metric spaces with curvature bounded above

Among four points of a CAT(0) space, the planar symmetric trapezoids are configurations on which Ptolemy's and Reshetnyak's inequalities are both equalities. We show that the symmetric trapezoids remain extremal for the entire family of inequalities interpolating between the two, indexed by the nondecreasing convex functions with concave derivative, and that this function class is characterized by this property. The result is qualitatively stronger than the known quadruple inequalities for this class of functions, and recovers them with their optimal constants, which were previously known only for power functions. Moreover, we extend the analysis to CAT($\kappa$) spaces with $\kappa>0$. We derive variants of Reshetnyak's quadrilateral comparison and of Ptolemy's inequality under positive upper curvature bounds, each with the optimal constant. These two inequalities yield the trapezoid comparison inequality in CAT($\kappa$) spaces, where the product of the bases carries an additional constant factor compared to the $\kappa=0$ case. Again the constant is optimal.
Read the full abstract

Combinatorics

The game chromatic number of generalized Mycielski graphs of paths and cycles

The graph coloring game is a two-player game in which the players alternately color an uncolored vertex of a graph $G$. The game chromatic number is the minimum number of colors needed for the first player to guarantee a win. We investigate this parameter for generalized Mycielski graphs $M_k(G)$, where $G$ is a path $P_n$ or a cycle $C_n$ with $n$ vertices. For every $k\geq2$ and $n\geq5$, we establish $4\leq\chi_g\bigl(M_k(P_n)\bigr)\leq5$ and $4\leq\chi_g\bigl(M_k(C_n)\bigr)\leq5$. We also determine the exact values $\chi_g\bigl(M_2(P_5)\bigr)=\chi_g\bigl(M_2(P_6)\bigr)=4$. The proofs of the lower bounds use a configuration in which Bob can create two threats simultaneously, while the four-color upper bounds in the two exact cases are proved using the double-doctor lemma. Thus the number of layers and the order of the base graph may grow, but the game chromatic number remains bounded by five.
Read the full abstract

Computer Vision

RouteGraph-Mona: Confusion-Aware Routing Fine-Tuning for Mineral Image Classification

Mineral image classification is important for geological exploration and resource development, but it remains challenging due to substantial intra-class variations in appearance and high inter-class visual similarity. Multi-cognitive Visual Adapter (Mona) is a vision-oriented parameter-efficient adapter that adapts pre-trained visual models by tuning only a few parameters. However, Mona statically aggregates responses from multiple scales, limiting its ability to accommodate sample-specific scale preferences and model confusion among visually similar mineral categories. To address this issue, we propose RouteGraph-Mona, a lightweight route-space regularization method built on Mona. Specifically, we replace Mona's static multi-scale aggregation with sample-adaptive routing. The resulting branch-selection behavior defines a compact routing space that captures each image's scale preferences. We then regularize the resulting routing signatures with class-wise route anchors and confusion-weighted margins. The route anchors encourage class-consistent routing patterns, while the margins promote greater separation between visually similar categories in the routing space. Experiments on three public mineral image datasets with two visual backbones show that RouteGraph-Mona consistently outperforms Mona in mean accuracy and remains competitive with representative fine-tuning methods and mineral image classification baselines.
Read the full abstract

All authors Jierui Li, Zhiyuan Qi, Hao Zhu, Yufan Liu, Jixian Liu, Shaojie Jiang, Jianda Wang, Yaqi Liu, Xiaotong Li, Wei Wang

Operator Algebras

Disjoint strong transitive operators on Hilbert C*-modules

This paper is about disjoint F-transitive operators on Hilbert C*-modules, where F is a finitely invariant Furstenberg family of subsets of N. We characterize disjoint F-transitivity for generalized bilateral weighted shift operators on the standard Hilbert module over C*-algebra of compact operators on the separable Hilbert space. Then we give a sufficient condition for these operators to be disjoint chaotic and give concrete examples. We also characterize disjoint F-transitivity for generalized translation operators on the non-unitary C*-algebra and provide some applications.
Read the full abstract

High Energy Physics (Phenomenology)

Evading Sudakov Dilution in Gluon Tomography

Sudakov broadening and competing azimuthal harmonics from final-state soft radiation limit the precision of gluon tomography. We suppress both effects using fiducial hadronic recoil—the vector sum of all hadronic transverse momenta within a rapidity interval—while a tagged jet fixes the azimuthal axis. Momentum conservation ensures that emissions inside the interval contribute neither to recoil broadening nor to these harmonics, so widening the interval reduces their impact without a soft-radiation veto. As a benchmark, we study the $\cos 2\phi$ modulation probing $h_1^{\perp g}$ in DIS. For rapidity interval $\Delta\eta=3$, fiducial recoil enhances the $h_1^{\perp g}$ contribution by a factor of $4.6$ and suppresses the final-state soft gluon term by a factor of $4.0$ relative to the conventional dijet imbalance. Fiducial recoil thereby enables precision gluon-TMD tomography.
Read the full abstract

Fluid Dynamics

Ventilated Cavitation around a sphere through surface air injection at Re = 10,000

We perform DNS of ventilated cavitation over a sphere at subcritical (Re=10,000). The flow is modeled as a homogeneous mixture of water and air, with the interface tracked using the volume-of-fluid method. Unlike previous numerical investigations, surface tension is explicitly included. Air is injected through a circular strip on the sphere at three locations selected based on the bulk flow dynamics: front (FR025, (18^\circ\leq\theta\leq63^\circ)), mid (MD025, MD050, (75^\circ\leq\theta\leq104^\circ)), and back (BK025, (120^\circ\leq\theta\leq180^\circ)), with (C_q=0.2) and (0.4). The injection location strongly governs cavity inception and stability and alters flow separation in the front- and mid-injection cases. Front injection produces an unsteady bubbly cavity due to vigorous puffing, which fragments the injected air and increases drag by (\sim56%) relative to the single-phase case. In contrast, mid- and back-injection produce stable cavities with distinct leading-edge dynamics. In the mid-injection cases, puffing dominates and, despite delayed flow separation, the cavity detaches from the leading edge of the injection patch. For back injection, the cavity detaches upstream of the injection patch owing to the adverse pressure gradient induced by cavity formation. Kelvin–Helmholtz instabilities and divot formation characterize the back-injection cavity. Stable cavities exhibit strong air entrainment and close through a re-entrant jet. The mid-injection cases achieve (35%) and (25%) drag reduction at (C_q=0.2) and (0.4), respectively, while back injection yields a maximum drag reduction of (46%) relative to the single-phase case.
Read the full abstract

Geometric Topology

Frobenius Alexander quandles, knot colorings, and isogeny classes of abelian varieties over finite fields

We introduce the notion of Frobenius Alexander quandles associated with abelian varieties over finite fields, and study them from both knot-theoretic and arithmetic viewpoints. We determine exactly for which rational primes a knot admits a nonconstant coloring by these quandles, in terms of the resultant of its Alexander polynomial and the Frobenius characteristic polynomial of the abelian variety. This leads to the notion of persistent colorability and its characterization, as well as applications to fibered knots and knots of small genus. We also prove a rigidity result showing that the isomorphism class of a Frobenius Alexander quandle determines the similarity class of the Frobenius endomorphism on the corresponding torsion subgroup. As a consequence, one sufficiently large Frobenius Alexander quandle determines the characteristic polynomial of the Frobenius endomorphism, and hence, determines the isogeny class of the abelian variety over the given finite base field.
Read the full abstract

Sound

Auditory Illusion Benchmark for Large Audio Language Models

Perceptual illusions have long served as crucial probes into human cognition, revealing biases and limitations of perception. In the auditory domain, such illusions provide a unique lens for testing whether Large Audio Language Models (LALMs) replicate human perceptual tendencies. Despite their importance, most benchmarks focus on visual illusions or general audio tasks, leaving auditory illusions underexplored. To this end, we present AIB, the first auditory illusion benchmark for LALMs, covering ten representative illusions across music, sound, and speech, each annotated for the presence of knowledge-based priors. Our methodology pairs model evaluation with controlled human listening studies, enabling direct comparison of responses. Results show systematic differences: while most LALMs remain signal-faithful on low-level acoustic illusions, several exhibit more human-like responses when linguistic or musical priors are involved, although no model matches the human perceptual profile. These findings highlight the current limitations of LALMs as cognitive models. By establishing auditory illusions as a rigorous testbed, our work offers a new perspective for probing neural black-box models and advancing understanding of auditory cognition. AIB is publicly available at https://github.com/gillosae/aib.
Read the full abstract

Mathematical Physics

Heat transfer problem of a dense gas described by the Enskog equation with a modification of the Enskog factor

Heat transfer in a dense gas between two parallel plates is studied for assessing the quantitative difference of two variants of the Enskog equation, i.e., the original Enskog equation and the Enskog equation with a modified Enskog factor recently proposed in Phys. Rev. E 111, 065108 (2025). The main advantage of the latter is that the H theorem, which the former lacks, has been established. The influence of the modification is assessed by comparing the macroscopic quantities in detail. It is found that the impact of this modification is quite limited and the two variants reasonably agree as a whole.
Read the full abstract

Computation and Language

Do Large Language Models Capture the Diversity in their Training Data?

Large language models are trained to model conditional distributions over text, yet it remains inadequately understood whether they capture the full diversity of plausible outputs present in their training data. We study this question through an information-theoretic lens by comparing the conditional entropy of model-generated outputs with that of the corresponding training data. Given paired input-output samples, we use conditional entropy and its matrix-based analogue based on von Neumann entropy to measure output variability beyond what is explained by the conditioning input, without requiring multiple reference outputs for the same prompt. Across LLM families with publicly available training data, including OLMo, Pythia, and GPT-Neo, we consistently find that model-generated outputs exhibit lower conditional entropy than their training data, across different model scales, sequence lengths, and decoding strategies. We observe a similar conditional diversity gap beyond language modeling, including class-conditioned ImageNet generators and text-conditioned models trained on MS-COCO. To address this gap, we propose a post-hoc correction mechanism that generates multiple outputs for each input and reweights them through a matrix-entropy projection, increasing conditional diversity while remaining close to the original model distribution. We prove the concavity of the matrix-based conditional entropy functional, which makes the resulting entropy-constrained projection a convex optimization problem, and develop a scalable mirror-descent algorithm for its implementation. Our results reveal a systematic conditional diversity gap between modern generative models and their training data, and provide an information-theoretic framework for measuring and mitigating this gap.
Read the full abstract

Geometric Topology

A topological version of Huber's theorem

Let $X$ be a closed hyperbolic surface. We prove that the number of topological types of primitive closed geodesics of length at most $L$ is asymptotic to \[ \frac{1}{|\Isom(X)|}\frac{e^L}{2L}. \] as $L$ grows. Thus Huber's asymptotic remains unchanged after quotienting by topological type, up to the finite symmetry factor coming from the isometry group of $X$.
Read the full abstract

Artificial Intelligence

CoMerge: Conflict-Driven Preference Optimization for Multi-Task Model Merging

Model merging provides an efficient paradigm for constructing multi-task large language models (LLMs) without full model retraining, yet it remains challenged by parameter interference. While existing methods aim to preserve the capabilities of individual expert models and mitigate interference, they generally do not directly learn from the potentially degraded behaviors exposed by naive merging. In this paper, we propose a conflict-driven preference optimization framework for model merging (CoMerge), which reformulates model merging as a preference optimization problem. The approach utilizes a self-supervised, conflict-driven strategy that leverages the defects of naive merging methods (e.g., task arithmetic) as hard negative samples to construct preference pairs without external annotations. By applying preference optimization to refine lightweight, tensor-wise merging coefficients, CoMerge enables the model to mitigate parameter-space conflicts while preserving task-specific capabilities. Extensive experiments show that CoMerge achieves an average normalized performance of 0.9968 on MergeBench, outperforming all evaluated data-free and data-driven model-merging baselines. Furthermore, on Llama-3.1-8B-Instruct, CoMerge yields marked improvements on conflict-sensitive tasks such as instruction following and safety, while remaining highly competitive with full-parameter fine-tuning despite optimizing only 1,445 scalar coefficients.
Read the full abstract

All authors Mingjie Zheng, Zihao Chen, Wenqing Chen, Weile Yuan, Zhixuan Chu, Jianxing Yu, Zibin Zheng

Computation and Language

PaperCompiler: Faithful Paper-to-Code Generation via Repository-Level Specification Compilation

Faithfully translating research papers into repository-level implementations remains challenging because papers often describe methods at a high level, leave implementation assumptions implicit, and require generated repositories to preserve method logic, evaluation protocols, and cross-file consistency. Despite recent advances in paper-to-code agents, their intermediate outputs are often presented as free-form plans or summaries that downstream coding agents may ignore, reinterpret, or compress, leading to algorithmic simplification and inconsistent repository structure. To address these challenges, we introduce PaperCompiler, a paper-to-code generation framework that compiles paper-grounded evidence into explicit repository-level implementation specifications. PaperCompiler grounds implementation-relevant evidence while preserving source provenance and distinguishing paper-supported, inferred, externally delegated, and unresolved information. The resulting specifications encode non-degradation requirements, ownership assignments, cross-file dependencies, and file-level constraints. Repository generation proceeds under these compiled specifications while retaining flexibility over local engineering choices not fixed by the paper. PaperCompiler outperforms strong baselines on Paper2CodeBench, achieving a 13.8% relative improvement in reference-based fidelity (from 3.64 to 4.15) and reducing high-severity evaluator critiques (from 13.2% to 6.1%).
Read the full abstract

Dynamical Systems

Lyapunov graphs of Non-singular Morse-Smale flows on $S^1 \times S^2$

Following B. Yu's work on Lyapunov graphs of non-singular Smale flows on $S^1\times S^2$, we characterize the Lyapunov graphs of non-singular Morse-Smale flows on $S^1 \times S^2$ by using filtrating neighborhoods as the local data attached to the vertices. More precisely, we determine which oriented graphs with vertices labeled by filtrating neighborhoods can be realized as such Lyapunov graphs.
Read the full abstract

Robotics

CrashDiffuser: VLM-Guided Collision Intent Reasoning for Fine-Grained Safety-Critical Traffic Scenario Generation

Generating safety-critical scenarios is essential for evaluating autonomous driving systems. However, existing generators primarily focus on inducing collisions and offer limited control over where contact occurs on the target vehicle. In this paper, we study fine-grained safety-critical scenario generation, where success requires both a target collision and a specified head, rear, or side contact region. We propose CrashDiffuser, a closed-loop VLM-guided diffusion framework that decouples semantic collision reasoning from continuous trajectory synthesis through a hierarchical collision-intent interface derived from the requested target contact region. At initialization, the VLM extracts reusable scene-level context; at each replanning step, it predicts a structured action tuple describing speed change, turning behavior, and collision stage. This intent conditions a diffusion model to generate executable adversarial trajectories, while collision-guided sampling, candidate selection, and short-horizon replanning adapt generation to the target vehicle's evolving behavior. On WOMD-derived closed-loop scenarios, CrashDiffuser achieves a target-collision rate of 50.33% in a single attempt and 67.98% after three attempts, together with a contact-region control success rate of 40.05% and competitive trajectory naturalness. Component ablations further support the proposed design.
Read the full abstract

All authors Shucheng Zhang, Yuang Zhang, Bingzhang Wang, Muhammad Monjurul Karim, Kehua Chen, Yinhai Wang

Earth and Planetary Astrophysics

The NC-CC dichotomy in ruthenium isotopes: Implications for the origin of the late veneer

High-precision mass-independent Ru isotope data for iron meteorites reveal that in three-isotope diagrams including the p-process Ru nuclides 96Ru or 98Ru, non-carbonaceous (NC) meteorites plot along an s-process mixing line, while the carbonaceous (CC) type irons plot as a cluster off the NC-line. As previously observed for Mo, this offset can be accounted for by an r-process excess in CC over NC materials. As a highly siderophile element, Ru in the bulk silicate Earth (BSE) is thought to predominantly derive from the late veneer, making the Ru isotope dichotomy a powerful genetic tracer of Earth's late accretionary epoch. The BSE and the isotopically anomalous Itsaq Gneiss Complex as defined in prior studies plot on the NC-line defined in this study, suggesting a predominantly NC late veneer that may have evolved over time from more s-process-enriched to more s-process-depleted compositions. However, more precise 96Ru and 98Ru measurements of the BSE's composition are needed to more reliably determine the genetic heritage of the late veneer and to quantify as to whether it contains CC material.
Read the full abstract

Cryptography and Security

Retrosynthesis of Synthetic Media for Explainable AI Provenance Forensics

With the rapid proliferation of generative models on Machine Learning as a Service (MLaaS) platforms, reliably tracing the provenance of synthetic media without modifying generator architectures or parameters remains a major challenge. In this work, we propose a self-referential retrosynthesis framework for explainable AI provenance forensics under a fixed-generator setting. The framework leverages a jointly optimized encoder-decoder pair to implement a self-embedding mechanism that enables round-trip consistency verification. During inference, client inputs are first encoded and then processed by the generator to produce outputs with high visual fidelity. For forensic verification, the consistency between the resynthesized image and the query image is analyzed to determine whether the image originates from the target generative model. Our approach eliminates the need for watermark embedding or modifications to the generation process. Experimental results show that images generated from encoded inputs maintain visual quality comparable to original generator outputs, while decoded images reliably trace back to their corresponding source inputs. Furthermore, the framework provides interpretable evidence for generative content provenance, establishing a practical tool for explainable generative AI forensics.
Read the full abstract

All authors Yijie Lin, Ching-Chun Chang, Isao Echizen, Hui Li, Chin-Chen Chang

Differential Geometry

Locally Conformally Flat Manifolds with Positive Scalar Curvature: Kleinian Groups, Moduli Spaces, and Euclidean Rigidity

We study locally conformally flat (LCF) Riemannian manifolds with nonnegative or positive scalar curvature (PSC), using the conformal boundary of the developing image. For closed oriented LCF $n$-manifolds with PSC and infinite fundamental group, $n\ge5$, we bound the macroscopic dimension of their Riemannian universal covers by $\lfloor(n-1)/2\rfloor$, establish the existence of a nontrivial homotopy group above the middle dimension, and, under mild additional hypotheses, bound the Hausdorff dimension of the limit sets of their Kleinian groups in the interval $(1,(n-2)/2)$. In particular, no closed aspherical manifold admits an LCF metric with PSC. If the scalar curvature is at least $n(n-1)$ and the manifold is not isometric to the round sphere, then every smooth nonzero-degree map to the sphere expands somewhere when its Kleinian group is elementary, while the developing map expands somewhere whenever the fundamental group is infinite. We prove that the space of LCF metrics with PSC and its moduli space are contractible in dimension three for finite fundamental group and for $S^2\times S^1$, and that the moduli space is empty or contractible for smooth manifolds homeomorphic to spherical space forms but not diffeomorphic to $S^n$ in dimensions $n\ge4$. For complete open simply connected LCF manifolds of nonnegative scalar curvature, we obtain Euclidean rigidity under additional topological hypotheses at infinity (and, in dimension three, from vanishing second homology alone). We also show that, in dimensions $n\ge4$, the Euclidean conclusion can fail when neither of the two additional topological hypotheses is assumed: we construct complete contractible examples of PSC that are not homeomorphic to $\mathbb{R}^n$.
Read the full abstract

Computer Vision

MAOL: Morphology-Aware Ordinal Learning for Fine-Grained Industrial Defect Severity Grading

Fine-grained defect severity grading is essential for industrial inspection, yet remains challenging due to the ordinal nature of severity labels, the strong dependence on morphology-related cues, and the train-test discrepancy between clean annotated instances and noisy predicted instances in two-stage pipelines. We propose MAOL, a Morphology-Aware Ordinal Learning framework for fine-grained industrial defect severity grading. MAOL formulates severity grading as an instance-level ordinal learning task, incorporates explicit morphological features to enhance representation learning, introduces class-conditional adaptive ordinal thresholds to model defect-specific grading boundaries, and employs prediction-aware training via localization perturbation to improve robustness to imperfect predicted instances. Extensive experiments under both clean-ROI and predicted-instance settings demonstrate that MAOL consistently outperforms rule-based methods, nominal classification models, and existing ordinal baselines, especially in the predicted-instance setting. The proposed approach ranked third in the IDA 2026 Challenge on Fine-Grained Severity Grading for High-Precision Manufacturing.
Read the full abstract

All authors Zhaoyang Wang, Haiyong Chen, Binyi Su, Kun Liu, Kun Wang, Xianen Zhou, Atik Shahariar

Machine Learning

CAPTURE: Disentangling Preference Drift from Memory Poisoning in Personalized LLM Agents

Personalized language agents use persistent memory to adapt to users over time, but the same mechanism creates an attack surface. When new information conflicts with stored preferences, an agent must distinguish genuine preference drift from temporary context shifts, ambiguity, or adversarial memory poisoning. We formulate this problem as a continuous-time partially observable decision process over a latent user state and show why rules based only on recency and provenance are insufficient. CAPTURE addresses this ambiguity with a neural differential-equation belief tracker, a multi-timescale memory ledger, uncertainty-triggered clarification, and counterfactual auditing of cited memories. On 480 held-out episodes from 96 users, CAPTURE achieves a 71.5% win rate, compared with 69.3% for an identically supervised baseline and 66.1% for the strongest heuristic baseline. It limits fixed-policy poisoning success to 11.5% while accepting 83.5% of genuine preference updates. Under an adaptive attacker with access to the released weights, attack success rises to 24.7%, exposing a real adaptation-security tradeoff. We further evaluate the frozen system zero-shot on an independently constructed benchmark and replay longitudinal interaction histories from 40 users collected over two to three weeks. These results suggest that modeling preference authenticity explicitly can improve both personalization and robustness in memory-augmented LLM agents.
Read the full abstract

Artificial Intelligence

Codebook Agent: Amortized Topology Design for LLM Multi-Agent Systems

Adapting the communication topology of an LLM multi-agent system to each query improves both accuracy and efficiency, yet current designers treat this as conditional graph generation: a variational, autoregressive, or diffusion decoder searches the $N \times N$ adjacency space, and a graph-network proxy trained on utility and a structural cost such as edge count ranks the sampled candidates. We argue that this formulation is misaligned with the problem. Empirically, topologies that survive a reward filter collapse to about six distinct graphs even when the codebook capacity grows from 8 to 64; edge count is negatively correlated with measured token consumption (Pearson $r \approx -0.4$), so sparsifying the graph makes inference more expensive; and a message-passing scorer over agent-profile nodes is adjacency-invariant whenever agents share a profile—the default configuration of published benchmarks—so it cannot rank candidates at all in that regime. These three facts motivate Codebook Agent: a vector-quantized autoencoder compresses successful topologies into a query-independent 16-entry codebook; a reward-weighted MLP maps the query embedding to a distribution over codes; and an MLP proxy that reads the flattened adjacency, regressed on measured utility and per-task normalized token cost, reranks the top decoded candidates in a single batched forward pass. With no iterative search and no message passing at test time, Codebook Agent is the most accurate method on all six benchmarks we compare (84.6 average against 83.0 for the strongest prior designer), emits a topology in 2.4 ms, and uses 21.9–33.2% fewer LLM tokens.
Read the full abstract

All authors Jinxi Yu, Yubei Li, Eric Hanchen Jiang, Zhi Zhang, Dong Liu, Wenxiao Zhao, Levina Li, Kai-Wei Chang, Ying Nian Wu

Superconductivity

Anomalous Superfluid Response in Altermagnetic Superconductors

We report on the emergence of the anomalous (paramagnetic) superfluid response in altermagnetic superconductors at arbitrary impurity concentrations. Due to anisotropic gapless superconductivity, altermagnetic superconductors with an out-of-plane Zeeman field display an anisotropic paramagnetic Meissner effect. The effect is strongest for parallel altermagnetic and Zeeman exchange field vectors and in the clean sample. The presence of nonmagnetic impurities leads to isotropisation and, consequently, weakens the effect; however, the paramagnetic response sustains intermediate amounts of impurities in the system. As demonstrated in recent experiments, microwave superfluid stiffness measurements can serve as a sensitive probe of gapless superconductivity.
Read the full abstract

All authors Christian Wiedemann, Danilo Nikolić, Matthias Eschrig, Wolfgang Belzig

Social and Information Networks

From Detection to Characterization: A Large-Scale Study of Ragebait on Japanese X

Ragebait refers to online content intentionally designed to provoke anger or outrage and thereby increase attention and engagement. However, reliable large-scale detection and systematic analysis of ragebait remain limited, hindering efforts to understand its prevalence, impact, and mitigation. This study aims to develop an effective ragebait detection framework and to clarify the characteristics of ragebait at scale, providing a basis for understanding and mitigating emotionally provocative content online. We constructed a labeled dataset with the assistance of a large language model (LLM) and trained several Japanese language models for ragebait detection. The resulting ensemble classifier was then applied to a large-scale dataset of Japanese-language posts on X. Our analysis shows that ragebait is more prevalent in politically and socially contentious topics, including politics, discrimination, public health, and interpersonal conflict. Ragebait posts also spread faster and receive more negative reactions than non-ragebait posts, particularly anger, fear, disgust, sadness, and surprise. These findings demonstrate the utility of the proposed detector and provide a large-scale characterization of ragebait in Japanese online discourse.
Read the full abstract

All authors Zhiyang Qi, Kazuhiro Ito, Jinghui Chen, Hibiki Nakamura, Zhangxuan Chen, Erina Murata, Masaki Chujyo, Fujio Toriumi

Analysis of PDEs

Quantization and process

This article is concerned with generalizations of pseudo-differential operators in $L^2(\mathbb{R}^n)$, $n\geq 1$. The definition of the new calculi depends only on bounded measures on the phase space $\mathbb{R}^{2n}$ and each measure gives rise to a specific calculus. Quantizations of anti-Wick, Weyl, classical and Born-Jordan are particular cases of the general calculi. Classes of symbols in this framework are then studied. The Gevrey class of parameter 1/2 is a class of symbol that is common to all the general calculi, that is, a class of symbols independent on the bounded measures parametrizing the quantizations. Precise additional hypotheses on the measures are necessary in the aim to consider the larger class of symbols $L^{\infty}(\mathbb{R}^{2n})$. This result can be applied for anti-Wick but not for Weyl quantization. Concerning Weyl pseudo-differential calculus, we recover the standard class of Sjöstrand and Gröchening. Then, we prove that probability measures of Lévy processes on the phase space $\mathbb{R}^{2n}$ with diffusion larger than 1/4 are natural examples of measures satisfying the latter additional hypotheses in order to consider $L^{\infty}(\mathbb{R}^{2n})$ symbols. This relation is derived using the Lévy-Khintchine formula. Composition laws in that general context are next investigated. In that purpose, we give a formula for the composition of two symbols in some precise class of symbols valid for all general quantizations. General calculi are relying on Wick quantization which is therefore primarily examined for some precise classes of symbols. Additional results in that context are provided, such as Mizrahi series expansions and Banach algebra isomorphisms between operators and symbol classes.
Read the full abstract

Superconductivity

Vortex-core Majorana coupling to a chiral edge in a $p_x+ip_y$ superconductor: Nonmonotonic spectral reorganization and coherent fermion-parity dynamics

We study how vortex–edge coupling reorganizes the low-energy sector of a finite two-dimensional \(p_x+ip_y\) superconducting disk as a function of the vortex–boundary separation \(d\) and examine what this reorganization implies for the parity memory associated with a prescribed vortex-core Majorana wave packet, a resource relevant to Majorana-based quantum operations. Bogoliubov–de Gennes calculations reveal nonmonotonic core–edge reorganization of the lowest positive-energy finite-disk eigenstate, with particularly rapid variation near \(d\simeq7\xi\), where \(\xi\) is the coherence length. To separate this eigenstate reorganization from the spectral representation of a prescribed state, we rigidly translate a centered-vortex core-reference packet to each fixed vortex position, restrict it to the target disk, and project it, without intermediate normalization, onto the particle-hole-complete low-energy subspace. For \(\Delta_0/E_F=0.36\) and disk radius \(R=30\xi\), the resulting retained norm exceeds \(0.98\) at all six sampled separations, \(4.25\leq d/\xi\leq8.25\), while, depending on \(d\), the spectral measure is concentrated near zero energy, fragmented over several low-energy levels, or dominated by finite-energy weight. Correspondingly, the signed parity correlator displays slow temporal variation, rapid coherent dephasing, or sign-changing oscillations, with possible finite-size recurrences at later times. Thus a large retained norm does not by itself imply spectral concentration or persistent parity memory.
Read the full abstract

Numerical Analysis

Scattered data interpolation on the torus by compactly supported multinode Shepard operators

We introduce a compactly supported multinode Shepard operator for the interpolation of scattered data on the torus embedded in $\mathbb{R}^3$. The method combines local polynomial interpolation of total degree $d\in \mathbb{N}$ with compactly supported Shepard-type weights, so that the approximation at each evaluation point depends only on neighbouring stencils of nodes. The torus is treated as an algebraic surface defined by a quartic polynomial, and Gröbner bases are used to construct reduced polynomial spaces on the surface by removing the redundancy induced by the defining equation. This yields local Vandermonde systems adapted to the toroidal geometry. We discuss the metric structure of the torus, show the local equivalence between the periodic parameter distance and the Euclidean distance inherited from $\mathbb{R}^3$, and use this equivalence to motivate the compact support construction. We establish a uniform error estimate in terms of the maximal support radius and the local Lebesgue constants. Under uniform locality and stability assumptions, the method converges with order $d+1$ with respect to the fill distance. Numerical experiments on analytical test functions confirm polynomial reproduction and exhibit an error decay consistent with the theoretical analysis. The approach is also tested on Computational Fluid Dynamics data mapped onto the torus, including the interpolation of the velocity components, the reconstruction of the velocity magnitude from the interpolated components, and the reconstruction of a tangent velocity field through an orthonormal lifting of the interpolated components.
Read the full abstract

All authors F. Dell'Accio, F. Di Tommaso, R. Lammirato, F. Larosa