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

Atomic Physics

Experimental Ni II Oscillator Strengths for Transitions from $3d^84d$ to $3d^84p$ Levels Measured Using High-resolution Fourier Transform Spectroscopy

We present the first experimentally measured oscillator strengths for Ni II 3d$^8$4d - 3d$^8$4p transitions. High-resolution Fourier transform spectra were recorded of Ni-He hollow cathode lamps, and intensity calibrated using deuterium standard lamps to determine relative intensities of Ni II emission lines between 200 and 395 nm. Branching fractions were determined for observed lines from 35 3d$^8$4d upper levels in total, and account for at least 95% of the predicted transition probability for 31 of these levels, with sufficient completeness to give reliable branching fractions. Combining our measured branching fractions with four experimental and 27 theoretically calculated energy level lifetimes provided absolute oscillator strengths for 174 lines, for which no previous experimental values exist. We compare the results with three sets of previously published theoretical calculations, illustrating the improvement of laboratory measurements for these atomic data. Please note: The transition probability datasets are withheld from this pre-print to ensure that only the peer-reviewed, definitive versions are released. This approach prevents the propagation of duplicate or inconsistent data across widely used atomic databases and modelling frameworks.
Read the full abstract

All authors Ruijie Chen, Christian P. Clear, Gillian Nave, Juliet C. Pickering

Combinatorics

Fractional revival in complementary prisms of graphs

The complementary prism $G\overline{G}$ of a graph $G$ is obtained from the disjoint union of $G$ and its complement $\overline{G}$ by adding an edge between each vertex $a$ in $G$ and its copy $a'$ in $\overline{G}.$ This paper explores a general framework for studying fractional revival with respect to real symmetric matrices with a block structure. The framework is then used to show that, for a fixed state $\mathbf{u}$ in $G$ orthogonal to the all-one vector, the complementary prism $G\overline{G}$ exhibits fractional revival from the state $[\mathbf{u},\mathbf{0}]^T$ with respect to the adjacency, Laplacian, and signless Laplacian matrices. We further characterize perfect pair state transfer in the complementary prism of a complete graph and establish the existence of perfect pair and plus state transfer in the complementary prism of a complete bipartite graph.
Read the full abstract

Signal Processing

Prism-SQA: An Interpretable and Adaptable Neural Framework for Surface Electromyography Quality Assessment

sEMG is vulnerable to various contaminants that distort signal morphology and spectral content. Accurate signal quality assessment (SQA) is essential for identifying such degradation and ensuring reliable clinical analyses and decisions. Recent neural network-based SQA methods achieve accurate quality estimation by learning complex contamination patterns, yet their black-box nature prevents clinicians from understanding or validating the reported scores and limits adaptability to application-specific quality definitions without retraining. To address these limitations, we propose Prism-SQA, an interpretable and adaptable neural framework that reformulates SQA as a physiology-aware source-separation and verification process. Prism-SQA decomposes each input signal into a clean sEMG component and five contaminant-specific components using a U-Net with bidirectional long short-term memory. Each separated contaminant component is examined by a Contaminant Fingerprint Verifier, which enforces physiological plausibility by comparing its temporal and spectral structure with canonical contaminant signatures. This design allows clinicians to inspect how each contaminant affects signal quality, grounding the assessment in transparent, signal-level evidence rather than opaque latent representations. Quality indices computed from the verified components further enable customization of quality criteria across clinical contexts without retraining. We evaluate Prism-SQA on continuous quality-score estimation using synthesized noisy sEMG from public Ninapro datasets and on binary quality classification using a clinical dysphagia dataset. Results show that Prism-SQA achieves competitive or better performance than contemporary black-box neural methods while providing explicit interpretability and adaptability, advancing toward practical and clinically aligned sEMG SQA.
Read the full abstract

All authors Kuan-Chen Wang, Kai-Chun Liu, Ping-Cheng Yeh, Sheng-Yu Peng, Yu Tsao

Computer Vision

Multimodal Floorplan Encoding: Learning Dense Modality-Invariant Representations

Floorplans arise in many forms, from vector CAD drawings to raster renderings and sensor-derived density maps. This heterogeneity makes it difficult to build learning systems that transfer across modalities and support geometry-centric tasks such as alignment and retrieval. We introduce the Multimodal Floorplan Encoder (MMFE), which maps diverse 2D indoor representations into a shared dense latent grid. MMFE combines a frozen DINOv3 backbone with a trainable Dense Prediction Transformer (DPT) head, and is trained with a per-cell Information Noise-Contrastive Estimation (InfoNCE) objective that aligns spatially corresponding regions across modalities while using all other cells as negatives. To improve robustness to geometric distortions, we incorporate controlled similarity transformations and enforce geometric consistency through feature-grid warping. On Structured3D, a held-out out-of-domain dataset, MMFE improves cross-modal dense matching, enables robust similarity alignment with RANSAC, and yields strong retrieval when paired with learned aggregation.
Read the full abstract

Classical Analysis and ODEs

Littlewood-Paley theory for orthogonal expansions associated with root systems

We introduce the non-symmetric heat and Poisson semigroups associated with the Heckman-Opdam Laplacian in the compact setting. Based on the Poisson semigroup, we study several Littlewood-Paley $g$-functions in the spirit of Stein's work for compact Lie groups and prove their $L^{p}$-boundedness for $1<p\leq 2$ and for some of them also for $1<p<\infty$. As an application, we define associated Riesz transforms and imaginary powers and prove their $L^{p}$-continuity for $1<p<\infty$. Passing to the average with respect to the action of the associated reflection group, we obtain $L^{p}$-boundedness of $g$-functions for the symmetric Poisson semigroup for all $1<p<\infty$. In particular, our framework covers the Littlewood-Paley-Stein theory for Jacobi polynomial expansions and corresponding direct product settings as special cases.
Read the full abstract

Robotics

Improving Imitation Learning Efficiency for Manipulation through Geometric Prior Pretraining

Applying an imitation learning policy to a new manipulation task usually requires collecting new demonstrations and retraining the model, which makes sample efficiency a practical concern. Pretraining on large-scale robot datasets is effective in this respect, but such datasets are costly to collect and train on, while data augmentation techniques typically require a new round of data generation and retraining for each task. A complementary question is what useful prior can be provided to a policy at negligible cost before any task-specific data are collected. In this study, we construct a geometric visual pretraining dataset in which each scene contains only a plane, an object, and a hand, and trajectories are generated automatically. The scenes contain neither textures nor backgrounds; pretraining primarily exposes the policy to the geometric relationship between the hand and the object. Furthermore, representing the hand as a cube avoids tailoring the dataset to a specific robot morphology. We evaluate this geometric prior using ACT on three simulated robots across five manipulation tasks each, as well as on three real-world robot tasks. Across many of these robot–task combinations, fine-tuning from the geometric prior achieves higher success rates in the early stages of training than training from scratch while using only a small number of task demonstrations. These results suggest that even highly simplified geometric scenes can provide a useful initialization that transfers across robots and to real-world tasks when task data are limited.
Read the full abstract

All authors Shogo Iwakata, Tomohiro Motoda, Ryosuke Yamada, Koshi Makihara, Ryoichi Nakajo, Keitaro Tanaka, Masaki Murooka, Roman Mykhailyshyn, Hirokatsu Kataoka, Shigeo Morishima, Yukiyasu Domae

High Energy Physics (Theory)

Conformal defects of general dimensions at finite temperature

We consider defect conformal field theories (DCFTs) at finite temperature, where a $p$-dimensional conformal defect wraps the thermal circle. Extending the previous study of line defects to defects of general dimensions, we determine the general forms of the thermal one-point functions of bulk scalars, conserved currents and the stress tensor by imposing the residual symmetry and the conservation laws. The low temperature expansion of the thermal one-point functions is shown to be reproduced by the bulk-defect operator expansion, allowing us to read off the thermal one-point coefficients of defect operators. We examine the general results in four classes of examples with free bulk theories: the trivial defect, free scalar and fermion theories with a boundary, the free scalar theory with a localized $\phi$ deformation in $d=2\,p+2$ dimensions and the free $\mathrm{O}(N)$ model with a localized $\phi^2$ deformation in $d=p+2-\epsilon$ dimensions. In the last example with $\epsilon = 1$, where the defect becomes an interface, we find that the thermal one-point functions coincide with those of the free scalar theory with the Dirichlet boundary condition, in accordance with the conjectured factorization of an interface CFT into two decoupled boundary CFTs.
Read the full abstract

Classical Analysis and ODEs

Some extremal problem for martingale transforms. III

This paper is a direct continuation of papers arxiv:2401.00053 and arxiv:2507.09332. By this reason, neither the introductory part of the paper nor the bibliography are duplicated here. However, for the reader's convenience, the formulas from the previous papers that are referenced are given in a special addendum at the end of the paper under their original numbers. In this paper, we investigate new local foliations: major and medium pockets and several bilinearity regions. The appearance of such local foliations is illustrated by further analysis of examples with third-degree polynomials. At the end of the paper, a complete overview of possible foliations is given when the boundary values are third-degree polynomials.
Read the full abstract

Artificial Intelligence

When Rubrics Fail: Hallucinations Reveal Blind Spots in Medical AI Evaluation

Hallucinations can undermine clinician trust in LLMs, making it important that evaluation methods capture clinically relevant errors. Rubric-based evaluation has become the leading approach for assessing LLMs in medicine, but it is unclear whether rubric scores reflect such errors. We first study this in a controlled setting using MedHallu, finding that more specific rubrics better distinguish correct from hallucinated responses. To test this systematically, we develop a taxonomy of medical hallucination types and a clinician-validated error-injection pipeline that creates matched correct and error-injected responses. Across HealthBench, HealthBench Professional, and LiveMedBench, our clinically relevant hallucinations are missed by rubrics, often leaving scores unchanged. We find that rubrics are most effective when explicitly checking facts, and are less effective for additional or unexpected errors they do not anticipate. A preliminary retrieval-based factuality check recovers some of the rubric-blind errors, suggesting a complementary approach. These findings reveal systematic blind spots in current medical evaluation of LLMs and suggest that rubric scores alone are insufficient to establish clinical reliability, potentially undermining clinician trust and confidence in clinical deployment.
Read the full abstract

All authors Griffin Farrow, Lily Sijia Li, Jack Johnson, Tingyan Wang, Philip Torr, William Bolton, Fabio J. Fehr

Classical Analysis and ODEs

Asymptotics of the coefficients of polynomials, asymptotic zero distribution and free probability

The asymptotic behavior of the coefficients of a sequence of polynomials is given under the conditions that all the zeros are real and positive and the zeros have an asymptotic zero distribution on $(0,\infty)$. We show how the limit for the coefficients is related to the Stieltjes transform of the asymptotic zero distribution and make a connection with the $S$-transform in free probability. We illustrate with some examples involving orthogonal and multiple orthogonal polynomials.
Read the full abstract

Statistical Methodology

Feedback-Aware Tuning of Recursive Q-Learning

Model choice in backward Q-learning is recursive because a later-stage choice changes the response supplied to an earlier regression and can alter its model-comparison statistic. Separate stagewise criteria do not directly assess the target-stage prediction risk of a completed Q-learning fit. We address this mismatch by treating the entire backward-fitting rule as the unit of comparison and propose feedback-aware soft tuning for sequential multiple assignment randomised trials. Each backward fit uses its own generated responses and is assessed at a common prediction target. The risk criterion retains downstream effects on upstream comparisons, while a separate correction accounts for estimating the final exponential weights from the same observations. For a fixed finite library of smooth recursive maps, we establish an exact risk identity under a Gaussian shift model and an oracle inequality with an explicit adaptation remainder. Under coordinate-representation and moment conditions, these guarantees transfer to prediction risk at any prespecified stage, with the number of stages fixed as sample size increases. A two-stage construction supplies an explicit observable implementation. Numerical studies examine risk estimation and finite-sample performance, and a simulated attention-deficit/hyperactivity-disorder trial illustrates the relation between comparison feedback and treatment recommendations.
Read the full abstract

Logic in Computer Science

Supermartingale Certificates for Parametric MDPs

We consider the problems of formal verification and synthesis in parametric Markov decision processes (MDPs) with general measurable state and action spaces. The heart of our approach is a parameter flattening transformation, which allows us to transform parametric MDPs into semantically equivalent non-parametric MDPs. Building on this transformation, we introduce the novel notion of parametric supermartingale certificates, which generalize the traditional supermartingale certificates—used for non-parametric MDPs—to the parametric setting. We use our parametric supermartingale certificates to design algorithms for verification and approximate synthesis in polynomial arithmetic parametric MDPs. This leads to the first verification and synthesis algorithms for parametric MDPs with general state and action spaces. We implement our algorithms and experimentally evaluate them on several continuous parametric random walk benchmarks.
Read the full abstract

Metric Geometry

Minimal central slices of the regular simplex

We prove that minimal-volume hyperplane sections of the regular simplex through its centroid are parallel to a facet. The proof combines variational methods with Fourier-analytic techniques and zero-diminishing arguments to show that every critical normal vector has at most three distinct non-zero coordinates. Analysis of the two- and three-value cases then yields the sharp lower bound.
Read the full abstract

Materials Science

Inferring Dislocation Microstructures from X-ray Diffraction via Cross-Modal Contrastive Learning

Understanding and inferring dislocation microstructures from diffraction patterns remains an open challenge in materials characterization, as diffraction measurements provide only indirect information about the underlying dislocation structure. In this work, a cross-modal learning framework is developed to enable the prediction of 3D dislocation structures directly from diffraction data. Dislocation density fields generated from discrete dislocation dynamics simulations are paired with corresponding virtual X-ray diffraction patterns and embedded into a shared 2D latent space using contrastive learning. The alignment between structural and diffraction representations of dislocation structures is evaluated directly in the learned latent space using correlations between corresponding latent features. To estimate the role of dataset size for this approach, farthest point sampling is employed to construct representative and diverse training subsets of varying sizes. The results show strong cross-modal alignment and that model performance improves rapidly with increasing dataset size. Near-saturation is achieved with approximately 500 representative observations from a dataset of 10,000 observations, enabling accurate prediction of dislocation density fields from previously unseen diffraction data of the same distribution. Qualitative comparisons confirm that the predicted structures capture the dominant spatial features of the underlying dislocation microstructures. These findings demonstrate an efficient approach for learning structure-diffraction relationships and highlight the potential for inferring structural characteristics of dislocation networks directly from diffraction patterns, providing a pathway toward diffraction-based structural analysis and future extension to experimental data.
Read the full abstract

Machine Learning

InRTL: Effective Intra-Inter Interaction Learning for Relational Tables

Relational table learning has recently emerged as an important research direction for modeling multiple tables connected through primary key-foreign key (PK-FK) relationships. Despite recent advances, a principled modeling framework tailored to this task remains underexplored. In this paper, we propose Intra-Inter Relational Table Learning (InRTL), a unified framework that explicitly models dependencies both within and across relational tables. Specifically, InRTL formalizes two complementary interaction patterns: intra-table interactions, describing associations among rows within the same table, and inter-table interactions, describing dependencies between rows across PK-FK-linked tables. To model these dependencies, we develop a column-aware table encoder to generate initial row representations, followed by Transformer-based self-attention and cross-attention modules for intra-table and inter-table learning, respectively. To further improve scalability, InRTL incorporates linearized attention and heterogeneous graph neural networks to simplify the self-attention and cross-attention operations. Extensive experiments on ten datasets covering 24 real-world tasks demonstrate the effectiveness of our approach. Code is available at https://github.com/W1nterFloW/InRTL.
Read the full abstract

All authors Weichen Li, Ken Zhong, Zheng Wang, Li Pan, Jianhua Li

Astrophysics of Galaxies

Identification of Cosmic Chronometers in the GAMA Survey

We present a pure sample of 231 massive, passively evolving elliptical galaxies as cosmic chronometer candidates selected from the Galaxy and Mass Assembly (GAMA) survey between $0.03<z<0.4$. The goal of this work is to increase the pool of high-purity cosmic chronometer candidates available in the literature and assess the effect of purity on statistical uncertainty to make $H(z)$ and $H_0$ calculations more robust in future studies. We use traditional selection criteria to identify cosmic chronometers using photometry and spectroscopy in conjunction with modelled parameters such as stellar mass and velocity dispersion. We use an NUVrJ photometric selection to identify quiescent galaxies and identify a number of spectral features, including H$\alpha$, [OII] and H$\delta$ to use as tracers for ongoing or recently halted star formation. Additionally, as part of the selection, we calculate the ratio between the Ca II H and K lines to determine whether a galaxy's stellar population is dominated by older or younger stars. We confirm CC candidacy by selecting only the most massive galaxies and perform a visual inspection of the spectra and images of CC candidates. We provide an analysis of the parent sample in comparison to the CC sample and confirm CCs have much lower sSFR, with a median sSFR of $10^{-12}~\text{Myr}^{-1}$. Additionally, we find their median ages are $\sim2~\text{Gyr}$ older than the parent sample.
Read the full abstract

Quantitative Methods

Perturbational Validity for Foundation Models of Brain Dynamics: A Controlled Proof-of-Principle Simulation

Foundation models for human brain recordings are usually evaluated by signal reconstruction, future-state prediction, and transfer to downstream tasks. However, these benchmarks do not establish whether a transferred model remains valid when the system is actively perturbed. We define perturbational validity as the preservation, after limited system-specific adaptation, of the conditional distribution of future trajectories given the current state and a controlled input, and we evaluate it at three levels: time-series accuracy, dynamical-structure similarity, and responses to perturbations excluded from calibration. We demonstrate the framework in an oracle-drift simulation of stochastic bistable systems. Two otherwise identical multilayer perceptrons were trained on drift evaluations from passive or input-driven trajectories. Next, for each held-out system the shared weights were frozen and only a three-dimensional embedding was adapted, with a correctly specified cubic model fitted from scratch as comparator. With two to five system-specific evaluations, perturbational pretraining yielded lower errors in recovering controlled flow, landscape geometry, finite-run occupancy, response distributions, and dose-transition curves. The advantage was reproduced across five independent runs, persisted under full-network adaptation of the passive model, and was attributable to input excitation rather than transition-state coverage: excitation alone lowered controlled-flow error 1.94-fold relative to coverage alone, in five of five runs. The cubic model became competitive as calibration grew, showing that the benefit is specific to few-shot transfer. This controlled demonstration does not test recovery of dynamics from noisy or partially observed brain recordings. It shows why passive prediction should be complemented by prospective evaluation under controlled inputs.
Read the full abstract

All authors José C. Garcí Alanis, Sarah Alizadeh, Marco Rothermel, Bita Shariatpanahi, Mina Kheirkhah, Stefan G. Hofmann, Tim Hahn, Hamidreza Jamalabadi

High Energy Physics (Theory)

The Jackiw-Rebbi model. Bose/Fermi one-loop Kink mass shifts

Scalar and spinor Kink fluctuations are summarized in the Jackiw-Rebbi model. Canonical quantization is conventionally achieved by promoting the coefficients of the scalar and spinor field expansions to bosonic/fermionic creation/annihilation operators. One-particle states for bosons, respectively for fermions, are supplied by the scalar eigenfunctions of the Schr$\ddot{\rm o}$dinger, respectively, the eigenspinors of the Dirac Hamiltonian, evaluated either on the ground state or the Kink background. One-loop kink mass shifts are computed induced either by bosons or fermions. Both bound and scattering states contribute when the quanta are trapped by or scattered off the Kink. Zero modes of Kink fluctuations bosonic and fermionic do not modify the Kink mass at one-loop order. The Dashed-Hasslacher-Neveu prescription, derived in the canonical quantization framework, is generalized to the fermionic realm. Alternatively, quantization à la Feynman of the Jackiw-Rebbi model in the spaces of Kink scalar and spinor fluctuations is developed. It is ensured that Berezin integration over the Grassmann coefficients of the Kink spinor fluctuations leads to identical scenario as that revealed by including Fermi statistics in the DHN paradigm, at least with respect to the computation of the Kink Casimir energy.
Read the full abstract

Software Engineering

What is the Difference Between Me and You? Benchmarking the Quality Gap Between Human-Written and AI-Generated Code

AI coding assistants are becoming co-authors of production software, yet their evaluation centers on functional correctness, leaving open whether their code differs from human code in the quality dimensions dominating lifecycle cost. We compare human-written and AI-generated code at scale: 787,562 function pairs across Python, Java, and C, each human function mined from open-source repositories paired with implementations generated from its docstring by three AI assistants (OpenAI GPT models, DeepSeek-Coder, Qwen2.5-Coder). We characterize structural complexity and statistical naturalness, and map static-analysis findings onto Orthogonal Defect Classification for defects and the Common Weakness Enumeration for vulnerabilities, making authors and languages directly comparable. AI-generated code is structurally compressed and stylistically templated: roughly half the size and branching of human code, clustering apart at the style level. Defect profiles differ in kind: human code concentrates issues of mature codebases, AI code repetitive boilerplate; security is language-dependent, with LLMs producing more, and more severe, findings in Python and Java but fewer high-severity memory-safety findings than humans in C. Once size is controlled for, complexity metrics carry little signal, while naturalness separates authors. Finally, we release CQBench, a benchmark of 27,346 issue-prone tasks with baselines and an evaluation pipeline for quality assurance and security testing.
Read the full abstract

Statistics Theory

Efficiency Optimality without Pathwise Differentiability: A Variational Theory for Marginal-Integral Functionals

In this work, we provide a new perspective on semiparametric efficiency theory. In particular, we reformulate the questions of optimal efficiency and its attainment as a variational problem: minimize variance over estimating functions subject to robust unbiasedness constraints. We develop this theory for marginal-integral functionals without requiring pathwise differentiability. We study estimating functions whose expectations remain equal to the target when any one specified nuisance component is misspecified and the others are correct. We characterize the infimum of their variances through conditional variance minimization. For maxima of affine functions of treatment-specific conditional means, we obtain explicit optimal weights and construct cross-fitted estimators that attain the bound under conditions on nuisance estimation and the probability of near ties. For analogous maxima based on jointly observed quantities, the optimal weights use the full conditional covariance matrix. We also identify conditions under which the variance bound agrees with a classical convolution bound for parametric perturbations that preserve ties to first order. Examples include optimal policy values, $L^1$ calibration error, Balke–Pearl bounds, and mediation parameters. In an application to the National Longitudinal Survey of Young Men, covariance weighting reduces the median estimated variance of the cross-fitted estimating function relative to equal weighting by 12.9% for the lower Balke–Pearl endpoint and 16.5% for the upper, with improvements in all 20 repeated cross-fitting splits.
Read the full abstract

Quantum Algebra

Odd-rank maximal ideals at collapsing levels of type $D$

We determine the defining ideal of the simple affine vertex algebra $L_{2-\ell}(\mathfrak{so}_{2\ell})$ for every odd $\ell\ge5$. Perše's quadratic singular vector alone generates the maximal ideal of the universal affine vertex algebra at this level. Together with the established even-rank presentation, this gives a complete parity-dependent description of this type-$D$ collapsing family at $k=2-\ell$: one quadratic generator in odd rank, and a quadratic generator together with two Pfaffian generators in even rank. The proof establishes a rank reduction for the quadratic quotients under minimal Drinfeld–Sokolov reduction, valid in both parities. Nonvanishing of reduction on nonzero graded subquotients then lifts simplicity along the odd-rank chain from the known base case $D_3\cong A_3$ at level $-1$.
Read the full abstract

Computer Vision

ExpertHTR: Unified Handwritten Text Recognition with Multi-Task Learning and Sparse Mixture-of-Experts

Handwritten text recognition resources are often small and distributed across collections that differ in language, script, document structure, and annotation format, making joint page-level training difficult. We propose ExpertHTR, a unified vision-language framework that addresses this problem through complementary supervision and conditional model capacity. Structural annotations from heterogeneous datasets are first organized through a common Page-Region-Line representation and used to construct four related training tasks for complete transcription, physical-line coverage, text localization, and localized recognition, without requiring additional manual labels. Building on a jointly trained dense model, ExpertHTR introduces a sparse Mixture-of-Experts architecture with an always-active shared branch and conditionally routed full-MLP experts. Sparsegen allows the number of active routed experts to vary with the hidden representation, while routing regularization reduces persistent concentration on a small subset of experts. Experiments on seven heterogeneous handwriting benchmarks show that complementary supervision consistently improves training with page transcription alone, while joint multi-source training provides further gains on most datasets. The proposed sparse expert model further improves the dense baseline on six of the seven sources. The final unified model also substantially outperforms the evaluated general-purpose OCR and vision-language systems on most benchmarks and achieves state-of-the-art performance on the IAM paragraph-level benchmark, while specialized HTR systems remain stronger on several challenging collections.
Read the full abstract

All authors Dang Hoai Nam, Nguyen Duy Hieu, Quang Huu Hieu, Vo Nguyen Le Duy

Artificial Intelligence

Implicit Personality Representations in Humans and LLMs

A century of psychology has found that the trait words people use to describe one another vary, but the relational structure among those traits, which ones go together and which oppose, is strikingly consistent across raters and cultures. We test whether the LLM (Qwen 2.5-7B-Instruct) reproduces this structure in its internal trait representations. From millions of crowd-sourced personality ratings of fictional characters, we build a human implicit-personality matrix over hundreds of traits; from contrastive model activations, we build a matching matrix over the same traits. The two relational structures align strongly (Mantel r = 0.77), and the agreement holds trait by trait as well as in aggregate. Two dominant axes of the model's trait representations recover the social and intellectual dimensions long known to organize human personality impressions, social warmth and intellectual competence. On held-out dialogue, projecting model activations onto these directions yields personality profiles that agree with human ratings. This work establishes a framework that enables comprehensive, human-grounded comparison between internal model trait geometry and the shared structure of human personality impressions.
Read the full abstract

All authors Yilin Geng, Omri Abend, Eduard Hovy, Lea Frermann

Analysis of PDEs

Fractional very fast diffusion equations in Lebesgue spaces: uniqueness and smoothing effects

We investigate forward and backward smoothing effects in Lebesgue spaces $L^p$ and $\mathcal{M}^p:=L^{p,\infty}$ for the Cauchy problem associated to the nonlinear and nonlocal fractional diffusion equation $\partial_t u+(-\Delta)^{\frac\sigma2}|u|^{m-1}u=0$ in $\mathbb{R}^N$, $0<\sigma<2$, in the very fast range $0<m\le m_c:=\frac{N-\sigma}{N}$. We prove that very weak solutions have an $\mathcal{M}^p$–$L^\infty$ smoothing effect if $p>p^*:=\frac{N}{\sigma}(1-m)$, and we construct counterexamples showing the failure of any $L^p$–$\mathcal{M}^q$ forward ($q>p$) smoothing effect if $1< p< p^*$, $m<m_c$ or $L^1$–$\mathcal{M}^q$ ($q>1$) if $m=m_c$. We also prove a backward $\mathcal{M}^p$–$L^1$ smoothing effect whenever $1\le p<p^*$, $m<m_c$, and we construct counterexamples showing that there is no $L^p$–$\mathcal{M}^q$ backward ($q<p$) smoothing effect if $p> p^*$. Regarding the threshold value $p=p^*$, we prove that all solutions starting in $\mathcal{M}^{p^*}$ become extinct in finite time, and show the failure of any $\mathcal{M}^{p^*}$–$\mathcal{M}^q$ smoothing before extinction for any $q\neq p^*$. The construction of counterexamples is based on new uniqueness and comparison results for very weak solutions, combined with the existence of self-similar solutions with suitable properties. The same approach yields new counterexamples for both forward and backward smoothing effects also in the local case $\sigma=2$.
Read the full abstract

Machine Learning

Write on Paper and Get the Online Digital Trace: A New Era for Handwriting

Capturing the digital trace of handwriting usually requires a specific stylus and a compatible substrate, be it a capacitive touchscreen, an ElectroMagnetic Resonance (EMR) tablet as used in Wacom systems or special paper. While writing on regular paper offers rich haptics, no latency and is well known for improving information retention, no low-cost and widely accepted, effective solution exists to digitize such a pen trace. The challenge is to accurately track the pen's trajectory without an external reference system while allowing unrestricted freedom of pen movement across a surface. We propose an innovative solution that combines a digital pen, advanced artificial intelligence algorithms, and adaptive AI techniques to reconstruct the digital trace of handwriting. Our approach integrates hardware development, focusing on a sensor-equipped pen, with software innovations to optimize trajectory reconstruction and processing in real time using an embedded AI. This work aims to advance the state-of-the-art in automated trace reconstruction of handwriting, enabling a seamless connection between traditional handwriting on paper and capturing the trace digitally.
Read the full abstract

All authors Florent Imbert, Yann Soullard, Eric Anquetil, Tanja Harbaum, Alexey Serdyuk, Fabian Kress, Tim Hamann, Peter Kampf

Computational Physics

Physics Based Triple Debye Dielectric Modeling and Multi Layer ADE FDTD Simulation of Terahertz Pulse Reflection for Breast Cancer Detection

Terahertz (THz) imaging has emerged as a promising non-ionizing modality for breast cancer assessment owing to its intrinsic sensitivity to tissue hydration. However, existing dielectric descriptions of biological tissue, largely restricted to single- or double-Debye models, fail to capture the multiscale relaxation dynamics governing broadband THz dispersion and absorption, thereby limiting the quantitative interpretation of reflected pulse signatures.Here, a physics based triple Debye dielectric framework is developed to quantitatively predict broadband THz-tissue interactions. The proposed model explicitly incorporates three physically distinct relaxation processes associated with free-water rotational dynamics, bound-water relaxation ({\tau}_2), and ultrafast interfacial/macromolecular polarization ({\tau}_3). Model parameters are obtained by nonlinear least-squares fitting to experimentally measured refractive-index data digitized from published THz time-domain spectroscopy measurements of ex vivo human breast tissue. Compared with conventional Debye formulations, the proposed model substantially improves the fitting accuracy, reducing the root-mean-square error from 0.7773 (single Debye) and 0.2976 (double Debye) to only 0.0199 for the triple-Debye model. Fullwave FDTD ADE simulations of realistic multilayer breast structures further demonstrate that reflected THz pulses encode tissue hydration through reproducible temporal signatures, including increased reflection amplitude, delayed pulse arrival, and enhanced waveform broadening in malignant tissue. Polarization and angle resolved Fresnel analysis further indicates that hydration-dependent pseudo-Brewster minima provide an additional contrast mechanism by selectively suppressing reflections from low hydration normal and adipose tissues.
Read the full abstract

Combinatorics

Exponential tails for factors and the chromatic number of random graphs

The celebrated result of Johansson, Kahn and Vu determined the threshold order for clique factors in random graphs, and subsequent work identified the sharp threshold and the corresponding hitting-time phenomenon. In this paper we study the probability that there is no $K_r$-factor above the threshold and, more generally, the probability that the largest $K_r$-matching covers less than $n-s$ vertices of $G(n,p)$. For every fixed $r\ge3$, throughout the range $$n^{-2/r}(\log n)^{1/\binom r2}\ll p\ll n^{-2/(r+1)},\qquad n-s\in r\mathbb Z,\qquad s=o(n),$$ we prove $$\mathbb P\bigl(\phi_r^s(G(n,p))=0\bigr)=\exp\left(-\Theta_r\!\left((s+1)\frac{\mu_r(n,p)}n\right)\right),$$ where $\phi_r^s(G)$ is the number of $K_r$-matchings covering exactly $n-s$ vertices and $\mu_r(n,p):=\binom nrp^{\binom r2}$. The lower bound is given by $s+1$ vertices which lie in no copy of $K_r$. For the upper bound we develop an iterable one-root version of the Johansson–Kahn–Vu method. As a structural consequence, we show that the remainder of $G(n,p)$ outside every maximal $K_r$-matching has an almost-perfect $K_{r-1}$-matching throughout the sparse clique window. Independently, we prove a central limit theorem for the maximum $K_r$-matching number. Combining these inputs and a structural theorem for $r=2$ from our earlier work, we prove a central limit theorem for the chromatic number of very dense random graphs: for every $r\ge2$ and $n^{-2/r}(\log n)^{1/\binom r2}\ll p\ll n^{-2/(r+1)},$ $$\frac{\chi(G(n,1-p))-\mathbb E\chi(G(n,1-p))}{\sqrt{\mu_{r+1}(n,p)}/r}\xrightarrow{\mathrm d}\mathcal N(0,1),\qquad\operatorname{Var}\bigl(\chi(G(n,1-p))\bigr) \sim\frac{\mu_{r+1}(n,p)}{r^2}.$$ This settles the Surya–Warnke conjecture throughout the interior of every clique window with $r\ge2$, strengthening its concentration prediction to a Gaussian limit with asymptotically exact variance.
Read the full abstract

Solar and Stellar Astrophysics

Plasmoid-Trapped Condensation Associated with a Transient Thermal-Instability-Like Process in Chromospheric Magnetic Reconnection

We perform high-resolution 2.5D single-fluid magnetohydrodynamic (MHD) simulations to explore the development of cool-dense structures within plasmoids during chromospheric magnetic reconnection. The model incorporates temperature-dependent ionization degrees of hydrogen and helium, resulting in improved diffusivities and viscosity, as well as adequate radiative cooling. The numerical results show that plasma is significantly hot with temperatures reaching several tens of thousands of Kelvin in newly developed plasmoids in the low initial plasma-$\beta$ cases, $\beta_0$ = 0.05. Later, the localized accumulation of plasma and decreasing temperature result in an explosive much stronger radiative cooling process. Radiative cooling peaks over the temperature range 8000 K$-$20,000 K. The co-spatial density enhancement, substantial radiative cooling, shorter radiative cooling timescales, and a significant temperature decrease support the existence of thermal-instability-like condensation within the plasmoids. Similar cool-dense structures are identified in all low-$\beta_0$ cases at different chromospheric altitudes, suggesting that this occurrence is not limited to a single chromospheric layer. In contrast, in the high initial plasma-$\beta$, $\beta_0$ = 0.5 case, the maximum temperature inside the dense plasmoids is only about 8000 K. Therefore, the radiative cooling has never entered into the explosive increasing stage and the thermal-instability-like condensation does not happen. These findings reveal that plasmoid-trapped condensation may develop in chromospheric reconnection once radiative losses become self-amplifying under low-$\beta_0$ conditions.
Read the full abstract

All authors Abdullah Zafar, Lei Ni, Samrat Sen, Yuhao Chen, Mohamed Sedik, Mehdi Yousefzadeh, Jun Lin

Quantum Physics

Extremely Low-Cost Magic State Preparation toward Fault-Tolerant Quantum Computing

Fault-tolerant preparation of non-Clifford resource states is a major contributor to the overhead of quantum computation, motivating protocols that achieve high output fidelity with minimal qubit and circuit costs. We introduce a low-cost magic-state preparation protocol in which the choice of stabilizer generators is co-designed with the flag gadgets, allowing the syndrome-extraction circuit itself to filter correlated faults across a non-Clifford layer. The protocol prepares a logical plus state in the 15-qubit quantum Reed-Muller code, applies a transversal T gate, and gauge-fixes the same register into the seven-qubit Steane code. By reorganizing equivalent Z-type stabilizer generators into jointly flagged measurement groups, the protocol eliminates all accepted logical-error contributions arising from one or two circuit faults under destructive error detection. Under a uniform circuit-level depolarizing noise model, the postselected infidelity is $210.2p^3+O(p^4)$. At $p=10^{-3}$, exact low-order enumeration combined with stratified sampling bounds the infidelity by $2.2\times10^{-7}$ at 99.9% joint confidence, while retaining an acceptance probability of 86.9%. The complete circuit requires only 19 qubits and 82 CNOT gates. These results demonstrate that stabilizer-generator design can substantially reduce the cost of postselected magic-state preparation, although corrected operation and the fidelity of an unmeasured output block require separate analysis.
Read the full abstract

Artificial Intelligence

Enabling and Understanding Personalization in AI-Generated Advertising Imagery

Personalized marketing traditionally matches static products to customers, while dynamic creative optimization focuses mainly on AI-driven text personalization or basic product image modifications. We address this gap by developing and implementing an AI-based framework that generates personalized advertising imagery directly from customer data. We evaluate this framework in a two-stage within-subject study with N=100 participants across four products and three levels of personalization, varied by the amount and specificity of customer data used. Participants rated each image on attitude toward the advertisement, attitude toward the product, and purchase intention. Results show that participants perceive differences across personalization levels and evaluate AI-generated advertising imagery most positively at a moderate level of personalization. High personalization increases perceived personalization, which is positively associated with all three outcome measures, but also increases perceived creepiness, which is negatively associated with the outcomes and dominates the total effect.
Read the full abstract

All authors Victor Kolominsky-Rabas, Leopold Müller, Claudius Budcke, Claas Christian Germelmann, Niklas Kühl