Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Tuesday 1 September

Materials Science

Magnetic quantum defects in a uniaxial antiferromagnetic insulator

Point defects have been successfully utilized in various quantum technologies, serving as quantum qubits for quantum computation, single-photon emitters for quantum communication, and nanoscale sensors for quantum metrology. However, their further development faces key challenges, particularly in discovering and exploring suitable defect-host systems that meet the necessary criteria for quantum applications. Here, using polarization-resolved Raman spectroscopy and terahertz absorption spectroscopy, we discover three distinct chromium-vacancy-induced excitations in the uniaxial antiferromagnetic insulator, Cr$_2$O$_3$. These vacancy-induced excitations have an energy scale of a few tens of millielectronvolts and are twofold degenerate, and the lowest one at 64 $cm^{-1}$ is sharp and sensitive to the external magnetic field along the easy-axis direction, particularly close to the spin-flop regime around 6T, where the mode softens from 64 to 27$cm^{-1}$. Based on the defect supercell first-principles calculations, we interpret the mode at 64 $cm^{-1}$ as a local magnetic excitation of the local moment within the chromium vacancy state. Our results establish that the magnetic defect states in Cr$_2$O$_3$ have potential for quantum applications.
Read the full abstract

All authors Shangfei Wu, Laur Peedu, Zhihao Wang, Xuecong Wang, Xianghan Xu, Kai Du, Sang-Wook Cheong, Aleksei Boldin, Joosep Link, Ivo Heinmaa, Raivo Stern, Sai Mu, Urmas Nagel, Toomas Rõõm, Girsh Blumberg

Human-Computer Interaction

No Pixel Left Behind: Filling Gaps in Anime Colorization

Animation production workflows often involve digital colorization of line art, where small unpainted regions ("gaps") frequently occur and remain an underexplored challenge. We conducted a formative study in Japanese animation (anime) pipelines and found that while the paint bucket tool is widely used for base coloring, tiny enclosed areas are frequently overlooked, resulting in time-consuming manual detection and filling. We introduce GapFill, a tool grounded in professional practices that reduces the effort of gap detection, zooming, and color selection. Our deep-learning method suggests appropriate fill colors by referencing surrounding regions, leveraging the flat-color nature of anime-style images. In a user study with 13 professional colorists, our system improved performance and usability in gap-filling tasks over conventional methods. The study also suggested that prediction accuracy alone is not the primary factor for usability, that appropriate colors can be contextually ambiguous, and that GapFill can complement existing tools depending on users' trust in new AI-powered assistance.
Read the full abstract

All authors Masahiro Kono, Akinobu Maejima, Yuki Koyama, Yotam Sechayk, Takeo Igarashi

Theoretical Economics

How outside options are incorporated into payoff distributions

This paper examines how outside options are incorporated into payoff distributions in games with coalition structures. We introduce and characterize the alpha-value, which "fully" incorporates outside options, and provide a new characterization of the Aumann-Dreze value as an allocation rule that does not incorporate outside options. We show that the chi-value (Casajus, 2009) is a component-wise convex combination of these two values and thus incorporates outside options in a discounted form.
Read the full abstract

Computer Vision

Advanced Pixel Diffusion Model with Guided Sparse Global Refinement

Pixel-space diffusion has recently emerged as a promising direction for high-fidelity image generation by modeling images directly in the original pixel domain. However, pixel-space diffusion is computationally demanding due to the extremely high dimensionality of natural images. For efficiency, existing pixel diffusion models either compromise fine details with large-patch tokenization or confine subsequent refinement within individual patches. Such intra-patch refinement inevitably restricts structural continuity across patch boundaries and long-range token interactions, limiting refinement quality. To address these issues, we propose PixSGR, a novel Pixel diffusion framework with Sparse Global Refinement tailored for modeling the distribution of natural images directly in pixel space. PixSGR starts from a supervised low-channel bottleneck to efficiently capture the low-dimensional manifold of natural images. It then progressively expands the channel dimensionality and spatial resolution to recover increasingly fine-grained structures. At the spatial refinement stage, coarse-scale attention maps preselect globally relevant interactions to pre-sparsify fine-scale attention, enabling non-local refinement beyond isolated patches without the quadratic cost of dense attention. Extensive experiments on ImageNet validate the effectiveness of PixSGR. It achieves an FID of 1.51 at 256$\times$256 and maintains performance when scaled to 512$\times$512, attaining an FID of 1.60.
Read the full abstract

All authors Weiyi You, Jinhua Zhang, Xingyu Zhou, Wei Long, Junyu Lou, Shuhang Gu

High Energy Physics (Theory)

Carroll Limit of $\mathcal{O}(F^2)$ $\text{D}_p$-branes from Kaluza–Klein-like Null reduction in the Polyakov Formulation

We construct the electric and magnetic Carroll limits of the $\mathcal{O}(F^2)$-truncated $\text{D}_p$-brane via the Polyakov–KK route, which combines a single-mode Kaluza–Klein-like reduction at fixed light-cone momentum with a Dirac classification that keeps the auxiliary worldvolume frame. Unlike the $U(1)$-free ILST string, for $p\geq2$ the Carrollian D$_{p}$-brane cannot be treated as a consistent fixed-frame constrained system after the Dirac classification. In the electric family the obstruction is directly produced by the worldvolume $U(1)$ matter sector, while in the magnetic family the frame retention is forced by the scalar kinetic's density-weight structure rather than by the $U(1)$ currents. The frame must therefore be retained through the classification and eliminated afterwards by Dirac brackets. Freezing it beforehand is not a legitimate step in the Dirac procedure. The embedding scalar sector inherits the Carroll–Weyl $\chi$ structure at the level of the ILST kinetic density, which is $\chi$-invariant, whereas the full scalar action is only $\chi$-covariant. The local extension of $\chi$ to the full matter sector is obstructed by the $U(1)$ sector through the Gauss, circle and $A_-$-gradient brackets. The electric family keeps the global rescaling as a weak symmetry, while the magnetic family fails even for a global parameter. For $P_{-}\neq0$ the electric and magnetic families have $d-2$ and $d-3$ degrees of freedom, and the restored local circle at $P_{-}=0$ removes one further degree of freedom in each family. These features identify the resulting theories as constrained systems distinct from both the null string and the parent $\mathcal{O}(F^2)$ DBI theory, and we also discuss their on-shell interpretation and relation to tensionless/null strings.
Read the full abstract

Computation and Language

SFAD: Speculative Factuality-Aware Decoding

As one of the most critical challenges in large language models, contextual faithfulness directly determines their reliability in knowledge-intensive applications. This task is particularly challenging as it requires balancing factual consistency with generation efficiency. Contrastive decoding methods require dual forward passes (with and without context) to compare model outputs, doubling inference computational overhead, while post-training alignment demands extensive reinforcement learning with substantial computational overhead. To address this challenge, we present SFAD, a speculative decoding framework that enhances contextual faithfulness without inference degradation. We first construct ConFide, a preference dataset with fine-grained atomic perturbations, to train a context-faithful draft model via Direct Preference Optimization. During inference, Epistemic Friction detects potential hallucinations by quantifying distributional tension weighted by specialist certainty. When friction exceeds the threshold, Asymmetric Logit Steering refines the target distribution through residual-based logit injection; otherwise, standard speculation proceeds. Extensive experiments demonstrate that SFAD substantially improves faithfulness while achieving $2.48\times$ speedup, offering a practical solution for efficient LLMs.
Read the full abstract

Materials Science

Agentic programs: an emerging form of scientific software in computational materials science

Computational materials science has traditionally delegated algorithmic tasks to computers while leaving scientific judgments to humans. We argue that recent LLM-based agent harnesses enable an emerging form of scientific software, agentic programs, that combine deterministic algorithms with bounded LLM-based judgment, task-specific verification, episodic maturation, and complete delegation in production. We illustrate this concept with DeMARS, an agentic program for constructing atomistic models from experimentally measured disordered crystal structures.
Read the full abstract

All authors Yunsung Lim, Haekwan Jeon, Jaesun Kim, Jisu Kim, Seungwu Han

Functional Analysis

On operators whose adjoints or second adjoints attain their norms

A long-standing open problem asks whether there exists an infinite-dimensional Banach space on which every bounded linear operator attains its norm. With $\mathrm{NA}_1(X,Y)$ and $\mathrm{NA}_2(X,Y)$ denoting the classes of operators whose adjoints and second adjoints, respectively, attain their norms, we prove that \[ \mathrm{NA}_2(c_0,c_0)=\mathcal{L}(c_0,c_0) \qquad\text{and}\qquad \mathrm{NA}_2(\ell_1,\ell_1)=\mathcal{L}(\ell_1,\ell_1), \] providing, to the best of our knowledge, the first known infinite-dimensional spaces on which every operator has a norm-attaining second adjoint. Building on the result for $c_0$, we undertake a systematic study of this equality within a natural family of $\ell_1$-preduals given by hyperplanes of $c$, obtaining a complete characterization in this setting. In particular, we prove that \[ \mathrm{NA}_2(c,c)\neq \mathcal{L}(c,c), \qquad\text{whereas}\qquad \mathrm{NA}_3(c,c)=\mathcal{L}(c,c). \] We also establish Holub–Mujica-type theorems for the classes $\mathrm{NA}_1$ and $\mathrm{NA}_2$. More precisely, under suitable separability and approximation property assumptions, the identity $\mathcal L(X,Y)=\mathrm{NA}_1(X,Y)$ forces every operator from $X$ into $Y$ to be compact, whereas $\mathcal L(X,Y)=\mathrm{NA}_2(X,Y)$ forces every weakly compact operator from $X$ into $Y$ to be compact. Finally, strengthening a construction of Ostrovskii, we show that every infinite-dimensional Banach space admits an equivalent norm and a projection whose second adjoint does not attain its norm.
Read the full abstract

Mathematical Physics

Blow-Up, Asymptotics, and Improbability of Collision Singularities in the n-Body Problem

We study finite-time singularities in $n$-body systems with pair potentials that are homogeneous of degree $-\alpha$, where $0<\alpha<2$, that are not necessarily attractive and with bounded time-dependent external forces. We develop a systematic method to analyse a colliding subsystem in the presence of simultaneous collision or non-collision singularities elsewhere in the system. We extend classical results of von Zeipel and Painlevé to such subsystems, establish bounds on their internal energy near total collision, and implement a McGehee blow-up that remains effective without conservation of energy. The blow-up yields the asymptotics of the cluster size, and in the case of attractive potentials, the convergence towards the set of central configurations and asymptotics of relative position, relative velocities, and internal angular momentum. As an application of the asymptotic results, we construct a simplified proof that the initial conditions leading to collision form a set of measure zero.
Read the full abstract

Sound

MADS: A Multiview Acoustic Descriptor Set Beyond Standard Spectral Summaries

Dominant audio classification pipelines rely either on compact handcrafted summaries or on fixed time-frequency frontends such as log-mel representations prior to deep modeling. While highly successful, these representations do not explicitly expose the physical dynamics of the underlying sound-generating event. We introduce MADS (Multi-view Acoustic Descriptor Set), a compact 19-dimensional physics-informed descriptor set de- signed to capture complementary spectral, temporal, mechanical, and stochastic structure in audio signals. Rather than treating sound only as a spectral pattern, MADS encodes properties related to excitation, damping, periodicity, impulsiveness, and structural consistency within a unified multi-view representation. We evaluate MADS using standard classical machine learning models on ESC-10, ESC-50, and MSoS, and compare it against two conventional handcrafted baselines: a compact 26D MFCC- based baseline and an expanded 38D spectral-summary baseline. Across ESC-10 and ESC-50, MADS achieves the strongest peak results overall, reaching 81.00% and 52.78%, respectively, while using roughly half the dimensionality of the 38D baseline. On MSoS, MADS again delivers the strongest top-end performance, reaching 67.48%. These results establish MADS not merely as a competitive standalone descriptor set, but as the foundational descriptor layer of a broader acoustically grounded representation program for future frame-level and deep-learning-compatible audio modeling.
Read the full abstract

Computation and Language

Instella-MoE Technical Report

In this work, we introduce Instella-MoE, a fully open Mixture-of-Experts (MoE) language model with 16 billion total parameters and 2.8 billion active parameters per token, trained entirely from scratch on AMD Instinct MI300X and MI325X GPUs. Instella-MoE combines a sparsely activated MoE design with architectural and system-level innovations, including Gated Multi-head Latent Attention (Gated MLA) and FarSkip-Collective connectivity, enabling efficient large-scale training and inference. The model is developed through a multi-stage pipeline comprising pre-training, mid-training, long-context extension, supervised fine-tuning with feedback-driven data curation, direct preference optimization, and reinforcement learning with Multi-Teacher On-Policy Distillation. Instella-MoE achieves an average score of 76.7 across standard pre-training benchmarks, outperforming prior fully open models including OLMo-3-7B, SmolLM3-3B, and OLMoE-1B-7B, while remaining competitive with open-weight MoE and dense baselines at comparable active-parameter scales, including Moonlight-16B-A3B and Qwen3.5-4B. After post-training, our final Think checkpoint achieves an average score of 73.2 across instruction-following, reasoning, math, coding, and chat benchmarks, outperforming both fully open and open-weight models with comparable or larger active parameter counts in our evaluation. To support transparent and reproducible research, we release the complete Instella-MoE model flow, including model weights, training configurations, data mixtures, and training code. Together, these contributions establish Instella-MoE a strong, fully open foundation for efficient, high-performing MoE models and reproducible research.
Read the full abstract

All authors Jiang Liu, Sudhanshu Ranjan, Prakamya Mishra, Yonatan Dukler, Gowtham Ramesh, Jialian Wu, Ximeng Sun, Wen Xie, Chaojun Hou, Vikram Appia, Zhenyu Gu, Zicheng Liu, Emad Barsoum

Cryptography and Security

RISA: Response Inspection and Selective Actions for Refusal Calibration in Large Language Models

Reliable refusal behavior requires Large Language Models (LLMs) to reject harmful prompts with only answering benign ones. Incorrect refusal behavior can either expose users to harmful responses or prevent users from obtaining useful answers. Training-time alignment improves refusal behavior by updating model parameters with safety data, but requires additional computation and training. In contrast, inference-time alignment aims to modify LLM behavior during inference without updating the underlying model parameters. Existing inference-time methods mainly rely on in-context safety prompting, activation steering, or decoding control. However, most of them intervene without first determining whether the initial response is already appropriate, potentially altering a correct refusal or a useful answer. Effective selective intervention therefore requires identifying prompt intent beyond sensitive keywords, covering semantic variations that fixed rules may miss, and adapting the verifier to different base models. To address these challenges, we propose Response Inspection and Selective Actions (RISA), an inference-time framework that inspects the initial response and selectively corrects refusal errors without updating the base model. RISA first uses fixed contextual rules to assign refusal scores to clear cases. For unmatched cases, it derives a refusal score from the final-layer prompt hidden state using a calibrated linear probe. To adapt to different base models, RISA separately calibrates the probe score, representation-support boundary, and action thresholds. At runtime, RISA combines the prompt score with the initial refusal status and applies an action policy to intervene only when necessary. Experimental results demonstrate that RISA improves refusal reliability while largely preserving model utility, offering a practical solution for response-aware refusal calibration in LLMs.
Read the full abstract

All authors Wenhan Chang, Tianqing Zhu, Ping Xiong, Shiyi Liao, Wanlei Zhou

Machine Learning

Subspace Levenberg Marquardt Algorithms in Training Neural Networks

The Levenberg-Marquardt (LM) algorithm is a well-known second-order method for rapid convergence and strong robustness when training small- to medium-sized neural networks (NNs). However, its computational and memory costs increase significantly as the number of parameters in an NN grows. To address this limitation, subspace methods have been proposed, such as the Krylov subspace LM (KSLM) and the hybrid subspace LM (HSLM), making second-order algorithms more efficient. In this work, we evaluate the subspace Levenberg-Marquardt algorithms for regression and classification tasks in neural networks. We compare the performance of subspace LM variants with the classical LM method, as well as other popular first-order algorithms, such as stochastic gradient descent (SGD) and Adam.
Read the full abstract

Computer Vision

Forbid Your Attention: Fooling Multimodal Large Language Models by Selectively Removing Intrinsic Focus in Spectral Domain

Multimodal large language models (MLLMs) have extended the capability of large language models (LLMs) to process more contextual multimodal information, showing remarkable progress in diverse realistic multimodal applications. Despite their strong perception and reasoning abilities, recent studies reveal that MLLMs remain highly vulnerable to adversarial inputs, especially those targeting visual components. However, existing attacks mainly focus on global perturbations, lacking an understanding of how MLLMs internally interpret visual structures. In this paper, we make the attempt to investigate the intrinsic focus of MLLMs in the frequency domain and discover that their predictions are particularly sensitive to phase information, which encodes essential structural and semantic cues. Based on this observation, we propose a novel phase-aware adversarial attack framework that explicitly restricts adversarial perturbations to structure-relevant phase regions to suppress the MLLMs' focus for effective and imperceptible attacks. To further amplify the structural influence, we also introduce an auxiliary adversarial prompt learning module to guide multimodal misalignment around phase-sensitive regions, misleading the MLLM's attention toward targeted structural patterns. Extensive experiments on multiple representative MLLM models and datasets demonstrate the superior effectiveness of our method compared to existing attacks.
Read the full abstract

All authors Daizong Liu, Junhao Dong, Zhiyuan Ma, Xiaoye Qu, Xiang Fang, Runwei Guan, Keke Tang, Jianfeng Dong, Yew-Soon Ong

Artificial Intelligence

StudyBench: Can Self-Evolution Squeeze Textbooks for Olympiad Capability?

Humans need to study only a handful of well-written textbooks to master a discipline and attempt its hardest problems. We argue that an ideal self-evolution method should share the same property, that is autonomously learning from raw training material for transferable problem-solving capability. However, we still lack a direct measurement for it. We introduce StudyBench, a controlled physics benchmark that directly measures how efficiently a self-evolution method converts training material into capability. We organise the test set into an Application Set, consisting of difficult textbook problems and evaluating absorption ability, and a Transfer Set, consisting of olympiad-level problems and evaluating transfer ability. Benchmarking representative self-evolution methods across three base models, we find that improvements on the Application Set rarely translate to the harder Transfer Set. A guidance ablation exposes a Guidance Gap: even the strongest method closes only a small fraction of what the same material unlocks when supplied as in-context guidance. Besides, every method hits a Compute Plateau, saturating well before exhausting its compute budget. The remaining gap is therefore a method problem rather than a data or compute problem. By offering a clean and controlled benchmark, StudyBench turns self-evolution progress from an open-ended pursuit into a measurable target for future research. Our code is released at https://github.com/thunlp/StudyBench.
Read the full abstract

All authors Yinghao Chen, Zixi Chen, Bingxiang He, Ziqing Qiao, Huan-ang Gao, Yinuo Xu, Yuxin Zuo, Zeyuan Liu, Yuhao Zhan, Chaojun Xiao

Cryptography and Security

MROP: Mask-Region Optimized Purification Against Backdoor Attack in Deep JSCC

Deep joint source and channel coding (JSCC) transmits a source by mapping it directly to channel symbols through an end-to-end deep neural network (DNN) and reconstructing it at the receiver. Taking image transmission as an application, this DNN pipeline behaves as a black box: the receiver cannot readily detect security attacks when the transmitted images are corrupted, thereby introducing a new security vulnerability. In this letter, we study defense against input-patch backdoor attacks on deep JSCC, in which a small trigger patch attached to the input forces the decoder to emit an attacker-chosen target image. Most existing patch-trigger defenses are designed for classification, leaving the reconstruction setting of deep JSCC unaddressed. We adapt the gradient mask defense to this reconstruction setting as a baseline and then propose mask-region optimized purification (MROP), which operates at inference and requires no retraining of the JSCC model. Unlike the baseline, which localizes the trigger from the input–output gradient, MROP instead places a per-pixel mask at the encoder input and optimizes it via a Gumbel-sigmoid relaxation to localize the trigger, then refines the trigger region to reconstruct the pure images better. In numerical results, we evaluate the proposed method on CIFAR-10 and STL-10 datasets along with the DeepJSCC and SwinJSCC models. By doing so, we show that the proposed method substantially lowers the attack success rate (ASR) while preserving the peak signal-to-noise ratio (PSNR) of clean reconstructions.
Read the full abstract

All authors Seongkyu Yang, Hyeonho Noh, Hyun Jong Yang, Jonggyu Jang

Numerical Analysis

Fast computation and convergence analysis of the infinite-product representation of the Schottky–Klein prime function

The Schottky–Klein prime function is a standard tool for boundary-value problems on multiply connected circular domains. Because this function is represented as an infinite product over a Schottky group, numerical evaluation requires truncation to finitely many factors. The standard word-length truncation grows exponentially in cost and becomes inefficient when the boundary circles nearly touch one another or the unit circle. To address this difficulty, we assign to each group element a cross-ratio potential measuring the size of its contribution, and retain only terms below a prescribed threshold. We establish uniform closed-form bounds on the change in this potential when prepending Schottky-group generators, and from these bounds we derive an efficient enumeration algorithm. The resulting relative error decays exponentially with the threshold at a rate determined by the Hausdorff dimension of the limit set of the Schottky group. Numerical experiments demonstrate that the proposed formulation achieves substantial computational speedups over word-length truncation in challenging geometric configurations.
Read the full abstract

Mesoscale and Nanoscale Physics

Anti-higher-order Weyl semimetal

Higher-order topology extends the bulk-boundary correspondence by enabling corner or hinge localized states. Here we identify an anti-higher-order Weyl semimetal, a three dimensional topological phase in which the conventional boundary hierarchy is reversed. Unlike conventional higher-order Weyl semimetals where bulk topology enforces hinge Fermi arcs, this phase hosts anti-hinge states, meaning the bulk topology forces states to vanish at specific hinge orientations. Using a minimal two-band model, we show how Weyl points separate the Brillouin zone into quantum anomalous Hall and anti-higher-order topological insulating regions, with the latter characterized by a band-inversion surface enclosing two distinct high-symmetry points carrying opposite topological charges. Analytical solutions for Weyl points, Berry curvature monopoles, and slice Chern numbers are derived, with numerical simulations confirming the resulting anti-hinge behavior. Our work establishes anti-higher-order topology as a dual counterpart to conventional higher-order phenomena, further extending the exploration of topological phases.
Read the full abstract

Databases

Efficient discovery of unique column combinations on disk-resident data with limited memory

The discovery of unique column combinations (UCCs) is a core task in data profiling, describing the key constraints of a table. The existing algorithms cannot deal with large-scale disk-resident data well due to high memory consumption and computational cost. In this paper, a novel DUD algorithm is developed to efficiently discover UCCs on disk-resident data with limited memory, which is inspired by the relationship between UCC discovery and transversal hypergraph. Rather than complete difference set generation of quadratic complexity, DUD only generates partial difference sets for hypergraph construction, followed by minimal hitting set enumeration to generate candidates and a validation process. DUD devises a strategy to generate full useful difference sets by pairwise comparisons of tuples having the same values with respect to some selected attributes. A novel theorem is developed and proved in this paper to report the candidates including the selected attributes as true UCCs directly without validation, which reduces the number of candidates to be validated significantly. A hash-based batch validation strategy is devised to validate a set of candidates on the relation instance, which only needs to maintain a small number of tuples in memory at a time. The extensive experimental results, conducted on synthetic and real-life data sets, show that DUD can discover UCCs on disk-resident data with high efficiency and low memory consumption.
Read the full abstract

Artificial Intelligence

When Features Become Instances: Inverted Contrastive Learning for Unsupervised Feature Selection

Unsupervised feature selection seeks a compact subset of informative features without access to class labels, making feature utility difficult to define. Existing UFS methods therefore rely on indirect structural criteria, such as similarity preservation, locality, sparsity, cluster geometry, or reconstruction quality. In this paper, we instead study UFS through representation consistency and propose Inverted Contrastive Learning for Unsupervised Feature Selection (ICLFS), a feature-wise contrastive framework that reformulates UFS as a representation learning problem over features rather than samples. ICLFS first inverts the data matrix so that each feature is represented by its sample-profile vector, then constructs multiple masked positive views together with a shuffled negative view, and learns projector-space representations that remain consistent across these structured perturbations under an InfoNCE-based objective. Motivated by recent findings that cosine-based and InfoNCE-based training affect embedding norms, we use projector-space embedding magnitude as the saliency signal for ranking features. The resulting norm-based ranking is subsequently refined through Laplacian-Gated Ranking Correction, which suppresses locally redundant candidates while preserving salient ones. Extensive experiments on 12 benchmark datasets show that ICLFS achieves the best clustering accuracy on 10 datasets against both classical and neural baselines under the standard clustering-based UFS evaluation protocol, while remaining competitive on the other two. These results show that feature-wise contrastive representation consistency provides a strong and effective alternative to neighborhood, cluster, and reconstruction-based UFS formulations.
Read the full abstract

Mesoscale and Nanoscale Physics

Anti-higher-order topological insulators

Duality is a fundamental concept in physics that connects complementary opposites like particles and holes. Similarly, while topological states in topological insulators localize at boundaries, the existence and nature of their dual counterparts remain unexplored. Here, we introduce anti-topological states as the dual of topological states, exemplified by anti-higher-order topological insulators. Unlike higher-order topological insulators, where states localize at corners, anti-higher-order topological insulators host states along edges but absent at corners, realizing an inverted distribution of states. We demonstrate this phenomenon in a bilayer Chern insulator with opposite Chern numbers, where the band inversion surfaces enclose distinct high-symmetry points. The topological invariant distinguishing these phases is given by the topological charges enclosed by band inversion surfaces. This work establishes anti-topology as a new paradigm, opening a chapter in topological research.
Read the full abstract

All authors Cheng-Ming Miao, Yu-Hao Wan, Ying-Tao Zhang, Qing-Feng Sun

Information Theory

Coding for Multiple Reverse-Complement and Palindromic Duplications

Reverse-complement (RC) and palindromic (PAL) duplications insert a reversed copy of a length-$k$ block immediately after the block; an RC duplication also applies a fixed involutive complement to the inserted symbols. We study $q$-ary codes correcting $t$ such operations applied in sequence, where later operations may copy inserted symbols. For fixed $q\geq2$ and $k,t\geq1$, we prove that every length-$n$ code $C$ for either channel has redundancy $n-\log_q|C|\geq t\log_q n-O_{q,k,t}(1)$; for fixed $q,k$ and $1\leq t=t(n)=o(n)$ the lower bound is $t\log_q(n/t)-O_{q,k}(t)$. For fixed $k$, known codes for one length-$k$ insertion burst attain redundancy $\log_q n+O_{q,k}(1)$ for a single duplication of either type. For every even $k$ and any involutive complement, we show that the two channels are equivalent for every number of errors: the bijection complementing every other coordinate turns each RC duplication into a PAL duplication. This bijection therefore converts any $t$-error-correcting RC code into a PAL code of the same size, and conversely, with linear-time transfer of encoders and decoders. For every even $k$, we also determine the maximum number of descendants of one word under exactly two errors; by the bijection, it is the same for both channels. For fixed even $k$, a direct count using this maximum proves the existence of two-error-correcting PAL and RC codes with redundancy at most $4\log_q n+O_{q,k}(1)$. A known existence bound for two deletion bursts transfers to insertions with the same leading term as ours and a larger additive constant. For two errors, the converse gives $2\log_q n-O_{q,k}(1)$, a factor of two below these existence bounds.
Read the full abstract

Quantum Physics

High-Rank Encoding Can Improve Approximate Quantum Error Correction

Conventional quantum-code constructions encode pure logical states as pure code states, but this restriction can sacrifice performance. We show that intrinsic encoding randomness can improve optimal entanglement fidelity. We bound the loss from imposing a rank-one encoder and prove it is at most quadratic near perfect recovery after joint optimization. The optimized advantage survives small noise perturbations. An explicit noise family requires higher-rank encoders arbitrarily close to perfect recovery, with every optimal encoder mapping pure inputs to mixed code states.
Read the full abstract

Number Theory

Universal murmuration and Hecke augmentation

Prime coefficients of elliptic curves exhibit murmurations, statistical patterns that support the prediction of arithmetic labels. We conjecture that root number weighted averages of unitary normalized coefficients at primes and prime powers sample the same leading profile when placed at the effective position $p^k/X$, where $X$ is the conductor scale. For weight $2$ newforms of squarefree level in the level aspect, we prove this principle for every fixed $k$ under suitable short-window and growth conditions, extending Zubrilina's prime case and the square-case analysis of Kundu and Müller. Experiments with elliptic curve isogeny class representatives show that the resulting prime power features improve root number prediction and give a smaller gain in distinguishing ranks $0$ and $1$.
Read the full abstract

Computer Vision

Solaris: Towards Interfaces That Are Generated, Not Coded

Digital interfaces are traditionally implemented through intermediate representations such as code, requiring their appearance and behavior to be specified in advance. We introduce Solaris, an interface world model that instead generates an interactive UI directly, frame by frame, in response to user actions. Solaris treats mouse interactions as conditioning signals and autoregressively synthesizes the resulting visual state at interactive speeds. To enable real-time generation while maintaining visual coherence over extended interactions, we combine autoregressive frame generation with few-step distillation and training on the model's own outputs. A language model complements the visual world model by interpreting user intent and specifying how interactions should affect the generated environment, separating high-level reasoning from visual rendering. By generating both the appearance and behavior of an interface dynamically, Solaris enables open-ended interactions that need not be explicitly programmed in advance. We view interface world models as a step toward a new paradigm for software, where interfaces are generated and adapted continuously around user intent rather than implemented as fixed collections of predefined states and
Read the full abstract

All authors Yuval Alaluf, Omri Avrahami, Guy Bukchin Leshem, Michal Geyer, Kfir Goldberg, Elad Richardson, Diego Alarcón, Alejandro Alvarez, Cole Garry, Anastasis Germanidis, Tenaya Goldsen, Corina Gurau, Robin Kahlow, Joel Kwartler, Kathleen Lewis, Alejandro Matamala Ortiz, Eugene McMahon, Thon Prom, Sarah Saltonstall-Wurm, Jamie Umpherson, Hudson Yeo

Computer Vision

VOIM: Training-Free Open-Vocabulary 3D Instance Mapping for RGB-D and Monocular SLAM

Robots that act on everyday language requests need maps that record what each object is and where it is. Existing open-vocabulary 3D mapping systems usually require a depth sensor and commit to each object the first time they see it, when the evidence is weakest. We present VOIM, a training-free system that builds open-vocabulary 3D instance maps from RGB-D or from monocular RGB video alone. VOIM accumulates soft label evidence from frozen, off-the-shelf perception models in every voxel across views, and decides labels and object instances only after that evidence has built up. On ScanNet++, VOIM achieves the highest present-class mIoU among the compared methods, 10 points above the strongest baseline. From monocular video alone, VOIM also exceeds HOV-SG and ConceptGraphs run with depth and ground-truth poses. We also conduct real-robot navigation experiments on a quadruped to show that VOIM maps are usable in the real world.
Read the full abstract

All authors Sangmin Song, Sarath Kodagoda, Marc G. Carmichael, Karthick Thiyagarajan, Amal Gunatilake, Kelly Prentice, Jodi Martin

Machine Learning (Statistics)

Semi-Supervised Classification with Informative Missing Labels in Weibull Mixture Models

We consider semi-supervised classification from a partially classified sample arising from a two-component Weibull mixture. The feature is observed for all data, whereas some class labels are missing. The probability of a missing label is modelled as a function of classification uncertainty, giving a feature-dependent missing-at-random (MAR) mechanism that shares parameters with the Weibull-mixture classifier. The missing-label indicators can therefore provide information about the classifier in addition to the observed features and available class labels. Under a common Weibull shape, a Bayes' rule has at most one positive decision boundary, which is unique when the rule is nonconstant; under unequal shapes, it can have two. We characterise these decision regions, derive the Fisher information for the classifier after adjustment for nuisance parameters in the missingness model, and obtain a decision-boundary expansion of the expected error rate of the plug-in sample rule relative to the Bayes error. The expansion yields classification-specific asymptotic relative efficiency formulas for the one- and two-boundary cases and shows that a positive-definite increase in Fisher information is sufficient, but not necessary, for a smaller first-order expected error rate. Numerical studies and a semi-synthetic analysis based on hard-drive failure data illustrate potential reductions in expected error rate and improvements in decision-boundary estimation from modelling feature-dependent label missingness.
Read the full abstract

Statistical Methodology

Deep Skew-t Mixture Models

High-dimensional clustering is challenging when component distributions are both heavy-tailed and directionally asymmetric. We propose a deep skew-$t$ mixture model (DStMM), a hierarchical factor-analytic mixture based on the generalised-hyperbolic skew-$t$ normal mean–variance representation. A shared inverse-gamma mixing variable is propagated along each complete latent pathway, allowing heavy tails and directional asymmetry to be modelled jointly while preserving conditional Gaussianity. Each complete pathway therefore admits an exact GHST marginal representation. We formalise the reductions to symmetric deep $t$, Gaussian deep-mixture, and single-layer GHST factor-analytic models, discuss local non-identifiability and the implementation-level parameter-counting convention, and derive the conditional generalised inverse Gaussian law used for estimation. Estimation is carried out by a stochastic/Monte Carlo EM algorithm, with an explicit implementation-based parameter count for BIC architecture comparison. Simulation studies show that DStMM performs similarly to the symmetric robust model when skewness is absent but provides increasing gains as directional asymmetry becomes stronger, particularly under heavier tails; the same qualitative behaviour persists under smaller samples and unequal mixture proportions. Two real-data applications provide complementary evidence. On the UCI handwritten-digit benchmark, DStMM gives the strongest clustering performance under a common deep architecture, while on the Gas Sensor Array Drift data, DStMM improves on both deep Gaussian and deep $t$ alternatives and, under the implemented BIC criterion, selects a non-trivial second mixture layer. Together, these results support the value of propagating skewness and heavy-tail variation through a deep latent mixture while retaining an exact pathway-level likelihood.
Read the full abstract

Quantum Physics

Superconducting Flux Memory for Cryogenic Applications

We report the development of flux memory for use with superconducting circuits. This technology stores persistent currents in superconducting loops on-chip to be used to provide flux biasing for superconducting circuits, like qubits. We developed three types of flux memory and draw comparisons among them for circuit design. We demonstrate the utility of flux memory by using an in-situ flux detector and characterize each approach and further demonstrate that once flux is set in a memory cell, benchtop DC control sources can be powered off, leaving the on-chip flux bias in place. We propose that flux memory can be arranged in a two-dimensional configuration to multiplex control signals and reduce how line counts scale (N^2 devices -> 2N control lines), and our experimental results pave the path to the proposed scalability. We demonstrate the use of flux memory to flux bias a transmon qubit and show the tunability of the qubit state to a target frequency which remained stable on-chip for 20 hours.
Read the full abstract

All authors Gregory R. Boyd, Jeremy Clark, Mark Covington, David G. Ferguson, Aref Fouladi, Keith D. Hillaire, Moe Khalil, John McFarland, Aaron Pesetski, Anthony J. Przybysz, John X. Przybysz, Sambarta Rakshit, Aruna N. Ramanayaka, Brian Sears, Robert Smith, Colin Stack, Robert M. Young, Tony X. Zhou