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

Quantum Physics

Local Gaussian bounds on the non-destructive discrimination of two-mode squeezed states

Typical measurement setups in quantum systems are destructive, meaning that states are irretrievably altered after measurement. In this work, we analyse non-destructive discrimination of two two-mode squeezed vacuum states using local Gaussian measurements. We investigate a tradeoff relation between the success probability of discrimination and the fidelity of the resulting state with the initial state, and construct a protocol given by local Gaussian measurements, which is optimal within our numerically explored class. We also extend to the case where we allow for additional pre-shared entanglement, and show that this regime allows us to exceed the standard local Gaussian bound for the fidelity-success probability tradeoff. Our work provides a natural extension of the tradeoff between information gain and disturbance in entangled-state discrimination, previously established for finite-dimensional quantum systems, to infinite-dimensional continuous-variable systems.
Read the full abstract

All authors Mi-Jung So, James Moran, Youngrong Lim, Mahn-Soo Choi, Hyukjoon Kwon

Commutative Algebra

Integrally closed ideals with $e_{2}(I)=e_{1}(I)-e_{0}(I)+\lambda(A/I)$

Let $(A,\mathfrak{m})$ be a Cohen-Macaulay local ring of dimension $d.$ We introduce and study the notion of the generalized type of $A$ with respect to an $\mathfrak{m}$-primary ideal $I$ denoted by $\operatorname{type}_I(A).$ Let $e_i(I)$ denote $i$th Hilbert coefficients of $A$ w.r.t. $I$. Assuming $I$ is integrally closed and $e_{2}(I)=e_{1}(I)-e_{0}(I)+\lambda(A/I) \neq 0$, we establish a sharp lower bound for $\operatorname{type}_I(A)$ in terms of the multiplicity and certain lengths associated to $I.$ We further show that when this lower bound is attained, the associated graded ring $G(I)$, is Cohen Macaulay. In the case of Buchsbaum local rings of dimension $d$ and depth at least $d-1$, we obtain an optimal lower bound for $e_{2}(\mathfrak{m})$ using the technique of $S_{2}$-fication. Additionally, for an integrally closed $\mathfrak{m}$-primary ideal $I,$ we also study the second extremal case $e_{2}(I)=e_{1}(I)-e_{0}(I)+\lambda(A/I)+1$ and its consequences on $G(I).$ We also investigate bounds on $e_3(I)$ and for $d=3,$ we study the consequences when these bounds are attained for.
Read the full abstract

Algebraic Geometry

Cohomology characters on the incidence correspondence

We investigate the cohomology of line bundles on the incidence correspondence, the partial flag variety parametrizing pairs consisting of a point in projective space and a hyperplane containing it. In characteristic zero, this cohomology is governed by the Borel-Weil-Bott theorem. In characteristic p>0, however, it becomes considerably subtler, and admits an equivalent reformulation in terms of cohomology tables for divided powers of the cotangent bundle on projective space. Our approach to the problem involves passing to infinitesimal thickenings of the incidence correspondence inside the ambient product of projective spaces. This leads to recursive formulas for the cohomology, generalizing earlier work of Donkin, of Liu, and of Gao-Raicu. We obtain generating functions for cohomology characters, expressed using truncated Schur polynomials and symmetric polynomials encoding the higher structure constants of the Verlinde algebras of SU(2) at levels (p-2) and (2p-2). Along the way, we exploit two important connections with multiplication in the graded Green-Han-Monsky representation ring: one relates this ring to cohomology, and another connects to the Verlinde algebras through the work of Coulembier-Etingof-Ostrik.
Read the full abstract

All authors Annet Kyomuhangi, Emanuela Marangone, Claudiu Raicu, Ethan Reed

Computer Vision

Diffusion Based Unpaired Data Learning for Inverse Problems

Data is important in many deep learning-based inverse problem solvers. However, obtaining sufficient paired data in many scenarios remains highly challenging, while unpaired data is cheap. To maximize data utilization, this paper proposes LUD-DIF, a diffusion-based approach for solving inverse problems with unpaired data. Starting from the evidence lower bound (ELBO) of the joint distribution, we decouple it into two independent diffusion processes under the weak-coupling assumption. The method provides theoretical support from a variational inference perspective, derives the loss function, quantitatively analyzes the error bound introduced by the assumption, and offers a theorem-motivated heuristic for hyperparameter selection. Experimental results demonstrate that LUD-DIF achieves outstanding performance on multiple image inverse problems, validating its effectiveness and generalization capability in unpaired inverse problem settings.
Read the full abstract

All authors Chenglong Bao, Yiming Dang, Chenguang Duan, Yuling Jiao, Defeng Sun

Computation and Language

How Correct Is Your Answer? A Semantic Correctness Framework for Open QA Evaluation

Reliable evaluation of open-ended question answering remains a bottleneck for measuring answer correctness of modern LLMs. Unlike multiple-choice tasks, free-form answers may be correct in many surface forms and may fail in qualitatively different ways, including incompleteness, contradiction, overgeneration, and endorsement of false premises. Existing judgment-based and similarity-based metrics often collapse these distinctions. We address this gap with three reusable contributions. First, we introduce a semantic correctness taxonomy that assigns open-ended answers to eight ordered classes, separating verbose-but-correct answers from those contaminated by hallucinated content. Second, we release CAP-Correctness, an 8.8k-example benchmark spanning widely used QA datasets, and CAP-Statements, an 11k-example dataset for converting question-answer pairs into declarative statements for natural language inference (NLI) training and statement-based evaluation. Third, we introduce CAP (Context-Aware Precision), a reference-based metric that scores question-conditioned statements using bidirectional NLI. Under a monotonicity protocol testing whether metrics respect the taxonomy's intended ordering, CAP outperforms established baselines.
Read the full abstract

All authors Elitsa Yotkova, Violeta Kastreva, Petar Velkov, Hristo Boyanov, Dimitar Dimitrov, Ivan Koychev, Preslav Nakov

Computer Vision

Accurate Reconstruction of Gas Turbine Blade Geometry Using 3D/2D Rigid Registration and CT View Optimization

Non-destructive X-ray and computed tomography (CT) testing are essential for ensuring the dimensional accuracy of manufactured components with complex internal structures, such as the cooling channels in gas turbine blades, which directly affect thermal performance and service life. This study presents a multipart 3D-2D rigid registration approach for aligning CAD models with X-ray projections as an alternative to CT reconstruction for part inspection and measurement. A greedy registration algorithm sequentially aligns the blade's exterior before registering its internal components by maximizing the mutual information between simulated and acquired X-ray images. This stepwise approach reduces problem complexity and improves alignment accuracy. View angles are optimized using a greedy method that iteratively selects angles to minimize dimensional measurement errors. The results indicate that a small number of oblique views provides the best accuracy, although a broad range of angles yields acceptable results. The method achieves subpixel registration accuracy, with errors below one-fifth of the magnified detector-pixel pitch. Image noise and defects reduce registration precision, but direct registration in projection space mitigates these effects compared with CT reconstruction. Appropriate view selection can therefore preserve acceptable subpixel accuracy in the presence of image noise and defects.
Read the full abstract

All authors Hristo Valtchanov, Nicolas Piché, Vladimir Brailovski, Justin Byers, Catherine Désrosiers, François Guibault

Group Theory

Common neighbour conjectures for Saxl graphs fail at every base size

For a finite permutation group, a base is a set of points with trivial pointwise stabiliser, and the generalised Saxl graph records which pairs of points lie together in a base of minimum size. Burness and Giudici conjectured that any two vertices of the Saxl graph of a primitive group of base size two have a common neighbour, and Freedman, Huang, Lee and Rekvényi extended this conjecture to arbitrary base size. We disprove both. For each integer $B\ge2$ we construct infinitely many primitive groups of base size $B$ whose generalised Saxl graphs contain two nonadjacent vertices with no common neighbour. At base size two, where this is the usual Saxl graph, we obtain three further infinite families, one each of affine, product and twisted wreath type, so the conjecture fails in three of the five O'Nan–Scott types; in the affine and product type families the Saxl graphs have diameter exactly three. This answers Problem~21.29 in the Kourovka Notebook in the negative. In the positive direction, we prove the Burness–Giudici conjecture for every primitive affine group whose point stabiliser is almost quasisimple of sporadic type, completing work of Lee and Popiel. We conjecture that no base-two counterexample of almost simple or diagonal type exists.
Read the full abstract

Nuclear Theory

Science of Nuclear Fusion: Insights and Ideas

Advances in several physics domains open up novel paths to smaller scale, higher energy density opportunities to advance small systems for nuclear fusion. Here we survey both legacy and several novel “table-top” approaches which attract current interest. We furthermore address a few related practical and challenging nuclear science topics arising in the context of magnetic confinement and inertial confinement fusion. The contents emphasis includes: By example of solar fusion cycles we draw attention to aneutronic fusion reaction chains. Considering the natural isotopic abundances we assess more carefully the meaning of the term “limitless energy” in the context of actual fusion power realizations. We describe achievements in laser-driven proton-boron fusion, and extensions to a self-sustaining and nearly fully aneutronic proton-boron-nitride reaction cycle. We propose another aneutronic option, where the target is a mix of beryllium and light helium isotope; this 3-helium is arguably the most mentioned fusion component in this article. We look in depth at the plasmonic opto-electric field-enhancement for fusion, and at the particle (muon) catalyzed fusion option. We describe problems in harnessing the dt fusion for civilian use. We introduce space travel as forthcoming application of aneutronic fusion.
Read the full abstract

Data Structures and Algorithms

The Greedy Superstring Conjecture Is False

In the Shortest Common Superstring problem (SCS), one is given a finite set of strings and is asked to find a shortest string containing every input string as a substring. Since the problem is NP-hard, various approximation algorithms have been proposed for it. The currently best known approximation ratio is $2.466$ due to Englert, Matsakis, and Veselý; a better approximation ratio $2$ has been announced by OpenAI just recently. In 1988, Tarhio and Ukkonen introduced a simple greedy algorithm that iteratively takes two strings with the longest overlap and merges them together. They showed that the greedy algorithm may produce a superstring that is about two times longer than the optimal one and conjectured that this bound is tight. This has become known as the Greedy Superstring Conjecture and has remained open for almost four decades. The best known upper bound on the approximation ratio of the greedy algorithm is $3.396$ due to Englert, Matsakis, and Veselý. In this paper, we present a series of results tightening the bounds of the greedy algorithm, with the main contributions being as follows: 1. We refute the Greedy Conjecture by constructing a family of instances for which a lower bound on the approximation ratio tends to $2.4$. 2. We prove that the greedy algorithm is $3$-approximate. 3. For input strings of fixed length $k$, we prove that the approximation guarantee is exactly $9/5$ for $k=3$ and at least $2$ for all $k \ge 6$.
Read the full abstract

All authors Nikolai Chukhin, Rishikesh Gajjala, Juha Harviainen, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Shibata, Alexander V. Smal

Nuclear Theory

Low-lying states of neutron-rich $N=50$ isotones in multi-reference covariant density functional theory

Predictions for the systematics of low-lying states in neutron-rich $N=50$ isotones from \nuclide[80]{Zn} to \nuclide[70]{Ca}, where experimental information remains scarce, exhibit substantial model dependence. We investigate these nuclei using multi-reference covariant density functional theory based on a relativistic energy density functional, in which nuclear wave functions are constructed as superpositions of symmetry-restored mean-field states with different quadrupole deformations. The low-lying states of \nuclide[78]{Ni} are reasonably reproduced, and a prolate rotational band built on the second $0^+$ state is predicted in addition to a near-spherical ground state. As the proton number decreases toward $Z=20$, the low-energy structure exhibits a nonmonotonic evolution from spherical to strongly deformed and subsequently back to spherical shapes, consistent with valence-space shell-model predictions. In particular, the emergence of deformed ground states in \nuclide[76]{Fe} and \nuclide[74]{Cr} is accompanied by enhanced quadrupole collectivity and stronger shape mixing. The results provide a coherent microscopic description of the structural evolution from the doubly magic \nuclide[78]{Ni} to the neutron-rich $N=50$ isotones.
Read the full abstract

All authors X. Y. Wu, M. L. Mai, D. Q. Zhu, W. H. Liu, Z. M. Liu, J. Xiang

Mesoscale and Nanoscale Physics

Antiresonances of Wannier-Stark ladders in Su-Schrieffer-Heeger lattices

We demonstrate that Wannier-Stark ladders (WSLs) in one-dimensional Su-Schrieffer-Heeger (SSH) chains manifest as antiresonance signatures in the electron transmission. We study the quantum transport in the SSH chain in the presence of a periodic potential profile plus a uniform electric field. By employing the global matrix method with non-trivial matching conditions, we find that these WSL antiresonances correspond to states that are exponentially localized at the potential's incident boundary. These findings provide a robust, unified framework for identifying WSLs across diverse scales, ranging from electronic transport in trans-polyacetylene to classical-wave analogs in phononic crystals and surface water waves.
Read the full abstract

Probability

Double cluster swapping for spin models: Pfaffian relations and sharpness

We introduce and study a new geometric representation for general classical spin models. It consists of two coupled percolation configurations that are the joint FK (random cluster) representation of the Ginibre rotation of two independent copies of the spin model, and can be viewed as an extension of Sheffield's cluster swapping defined in the context of height functions. Our approach combines the advantages of the random current and FK representations of the Ising model: it provides a percolation interpretation for various truncated correlation functions and at the same time satisfies the FKG inequality (for a large subclass of models). We highlight its strength and versatility by establishing two very different results. We first prove the converse of the classical fact that boundary multi-point correlation functions of planar Ising models are given by Pfaffians of the two-point functions. Indeed, we show that if a general spin model on a general graph satisfies the Pfaffian relations, then up to natural local modifications it must actually be an Ising model on a planar graph. In particular, the algebraic Pfaffian relations imply the topological feature of planarity. Our second application is a proof of sharpness of the phase transition for a class of spin models first considered by Ellis, Monroe and Newman, which we do by generalising the celebrated argument of Duminil-Copin and Tassion, replacing the use of the random current with our new representation.
Read the full abstract

Computation and Language

Investigating Linear Probe Robustness to Linguistic Register, Medical Specialty, and Corpus Shifts in Medical QA

Linear classifiers trained on hidden states of a large language model (LLM), linear probes, can flag factual errors from a single forward pass. Geometrically, that implies that true and false statements separate along a stable direction in hidden state space, i.e., the truth direction. Prior work disagrees on whether this generalises across input shifts, but the disagreement is hard to interpret because cross-dataset probe transfer experiments confound several kinds of input change at once. We isolate three such variables in medical question-answering (QA): writing style (register), domain (medical specialty), and corpus (dataset). We build a benchmark using 500 MedQA entries, each rewritten into four styles (textbook, patient, clinical note, colloquial), annotated with clinical specialty, and grouped with two other exam corpora, MedMCQA and MMLU-medical, for cross-dataset evaluation. Probing four open-weight LLMs (2–8B), we find that the truth direction is largely robust to writing style (mean $\Delta_\text{register} \approx 0.10$ AUROC on held-out facts) and to medical specialty ($\Delta_\text{specialty} \approx 0.03$), but degrades unevenly across corpora: by $0.12$ AUROC on MMLU-medical and by $0.21$ on MedMCQA, roughly twice the register gap. The register result replicates with a second generator and carries over to human-written patient questions. The truth direction is therefore largely stable within the medical domain but breaks under some corpus shifts, and question format does not explain the break, which suggests that the signal a linear probe recovers is partly bound to dataset structure rather than to medical knowledge alone.
Read the full abstract

Artificial Intelligence

EDGE: Error Dependency Graph-Guided Multi-Error Attribution in Multi-Agent LLM Systems

Large language model (LLM) agent failures often contain multiple related errors rather than a single mistake. Existing attribution methods usually identify a responsible agent, step, or root cause, but do not explicitly model dependency between errors. We introduce EDGE, an Error Dependency Graph-guided multi-Error attribution framework. EDGE constructs an error dependency graph from observed error events and validates a reliable causal subset through counterfactual rollout. The inference graph guides a two-stage LLM-as-judge detector for error attribution, and the intervention-validated subgraph provides a more reliable basis for explanation and repair analysis. Experiments on TRAIL and MAST show that EDGE improves category-level multi-error attribution across most evaluated models and settings. Experiments with adapted Who&When-style prompts show that the graph helps across prompting strategies. These results suggest that dependency structure is a useful diagnostic prior for agent failures beyond isolated root-cause prediction.
Read the full abstract

All authors Jun Hou, Priya Pitre, Yi Fang, Xuan Wang

Optics

Shot-noise-limited few-cycle mid-infrared frequency comb with attosecond phase stability

Achieving sub-cycle waveform control with attosecond-level precision while reaching shot-noise-limited amplitude stability in the mid-infrared spectral range remains a central challenge for ultrafast and precision optical science. Here, we demonstrate a fully stabilized, ultra-stable optical frequency comb (OFC) based on a Kerr-lens mode-locked Cr:ZnS laser operating at 2.3 $\mu$m. The oscillator delivers 40 fs pulses at a 25 MHz repetition rate, which are spectrally broadened to cover two octaves and compressed to a 1.4-cycle, 11 fs duration. Pumped by a custom low-noise erbium-doped fiber amplifier, the laser exhibits an integrated relative intensity noise (RIN) of 0.0026% over 10 Hz–1 MHz, while the noise of the few-cycle output is further suppressed to 0.0017% and reaches the shot-noise limit for Fourier frequencies above 5 kHz. It represents the lowest amplitude noise reported to date for any mode-locked laser. This unprecedented amplitude stability enables carrier-envelope phase (CEP) stabilization with a residual integrated phase noise of only 1.5 mrad (10 Hz–12.5 MHz), corresponding to a CEP jitter of 1.8 as, the highest phase stability for any laser system ever reported. The long-term performance of the fully stabilized OFC is measured over 24 hours, with a power stability of 0.01% and a residual CEP noise of 17 mrad. By combining few-cycle mid-infrared pulses with shot-noise-limited intensity noise and attosecond-level phase stability, the reported OFC provides access to new regimes of quantum-limited metrology and control of ultrafast light-matter interactions.
Read the full abstract

All authors Maciej Kowalczyk, Jakub Jaworski, Michał Pietrzak, Karolina Suliga, Paweł Szczypkowski, Paweł Kaczmarek, Alexander Weigel, Jarosław Sotor

Number Theory

Regularized spectral expansion of a Rankin–Selberg period and moments

We establish a regularized spectral decomposition of the squared magnitude of a maximal degenerate Eisenstein series as a Schwartz distribution on $\mathrm{GL}_n$. Although the original problem is on $\mathrm{GL}_n$, its spectral components are described entirely by the automorphic spectrum of $\mathrm{GL}_2$. As an application, we prove a partial reciprocity formula relating the second moment of $\mathrm{GL}_n\times\mathrm{GL}_n$ Rankin–Selberg central $L$-values and a mixed moment of $L$-values of $\mathrm{GL}_2$. We also prove, assuming the generalized Ramanujan conjecture, an asymptotic formula for the second moment of the above Rankin–Selberg $L$-functions over a conductor-aspect family with an error term of square-root-cancellation strength.
Read the full abstract

Genomics

PopPert: Population-level Joint-Distribution Modeling for Single-Cell Perturbation Prediction

Predicting transcriptional responses to specific perturbations is critical for understanding cellular regulatory mechanisms and accelerating drug discovery. Single-cell RNA sequencing destroys each measured cell, yielding only unpaired populations of control and perturbed cells. However, existing methods typically model perturbation prediction at the single-cell level and assume cell-to-cell correspondence, which conflicts with the unpaired nature of the observed data. To address this challenge, we propose PopPert, a framework that explicitly parameterizes population-level joint gene expression distributions for collective transcriptional state modeling. Given a control population distribution and a perturbation condition, PopPert predicts perturbation-induced changes in distribution parameters, eliminating the need for cell-level correspondence and reducing sensitivity to single-cell noise. To effectively capture gene co-expression patterns, PopPert leverages a low-rank Gaussian Copula to model cross-gene statistical dependencies and construct the joint gene expression distribution, additionally allowing sampling of synthetic perturbed single-cell profiles. Across multiple single-cell benchmarks spanning both genetic and chemical perturbations, PopPert achieves superior overall performance in differential expression recovery, perturbation effect estimation, and population-level distribution matching. These results establish population-level joint distribution learning as an effective paradigm for predicting transcriptional responses from unpaired single-cell populations. Code for PopPert is publicly available at https://github.com/whd1125/PopPert.
Read the full abstract

All authors Handong Wang, Jiaxin Qi, Haochen Feng, Baisheng Lai

Computation and Language

Separating Syntax from Language: A Mechanistic Account of Translation in Multilingual LLMs

Multilingual large language models (mLLMs) achieve strong performance in machine translation, yet our understanding of the mechanisms by which they transform representations from one language to another remains incomplete. Prior work suggests that translation decomposes into separable processes within an mLLM, where conceptual content is first represented independently, followed by a production into language-specific form. In this work, we show that translation is even more modular than previously assumed and that the output language production in translation processes is actually further separable into a syntax and a surface language process. We construct controlled multilingual datasets that isolate cross-linguistic differences in word-order and use causal interventions and probing to track how representations are transformed during translation. We find that models first construct target-side word-order before realizing the target language surface form. We identify individual attention heads that are selectively sensitive to syntactic transformations while remaining largely invariant to language identity. These results establish the commitment to a syntactic structure as an independent stage in translation, extending prior decompositions and showing how translation is implemented by functionally different components within mLLMs.
Read the full abstract

All authors Mikhail Sonkin, Tanja Baeumel, Daniil Gurgurov, Josef van Genabith, Simon Ostermann

Systems and Control

Exact Risk-Complexity Laws for Projective Boundaries in Scenario Optimization and Distribution-Free Certification

Scenario optimization, conformal prediction, and related distribution-free certification methods use finite samples to construct decisions or prediction sets with violation-risk guarantees for fresh observations. In several classical settings, the conditional violation risk follows an exact beta law, whose tail has a beta-binomial representation and whose parameter is a support, calibration, or compression dimension. This paper identifies the deterministic boundary mechanism behind these formulas and derives the corresponding law when the observed boundary size is random. A decision rule is represented by an acceptance set for future observations, together with a boundary map selecting the sample points responsible for that set. The resulting pair is called a proper projective boundary scheme when held-out samples are accepted precisely if the full-sample boundary is retained, and accepted non-boundary samples can be deleted without changing that boundary. For every such scheme, the conditional law of the violation risk given the observed boundary size is determined by the boundary's cross-sample complexity profile. A stable profile yields the usual beta law, whereas a varying profile produces an exact profile correction. The framework covers scalar order-statistic calibration, support-reconstructive scenario programs, cascaded support-removal certificates, coordinatewise envelopes, and Pareto-frontier calibration with vector scores. It also yields conditional probabilistic certificates and a no-go result explaining why observed complexity alone is insufficient.
Read the full abstract

Computation and Language

Where the Verifier Fails: A Category-Level Audit of Reward Signals in RLVR

Reinforcement learning with verifiable rewards (RLVR) and standard benchmark evaluation both rely on an automatic verifier that turns a free text answer into a binary reward. Prior work reports that one evaluation harness accepts only about 94% of its own ground truth answers, blaming LaTeX parsing. That is an aggregate: it does not say which answer forms consume the error budget. We supply the decomposition. We apply metamorphic testing to the verifier rather than the model, generating certified equivalent answer variants, that is, rewrites that preserve mathematical meaning by construction, so that any rejection is a provable false negative needing no human adjudication. We then measure rejection per answer category across four widely used verifiers over 307,420 verdicts. We find three things. (1) Self validation ranges from 53.8% to 95.2% on identical inputs, a spread of 41.3 points. The published figure describes one implementation, not the task; two configurations of the same library disagree on 49.9% of pairs. (2) The residual is not spread across parsing categories but concentrated in whitespace and punctuation, which account for 93.0% of in contract failures for the default LaTeX configuration. A trailing period or newline dominates the budget. (3) Separating rejection from execution failure shows that verifiers with similar aggregate error fail for opposite reasons, and that a reference numeric cascade accepts off by one wrong answers as a step function of magnitude, from 0% below 10^4 to 100% at or above, because its relative tolerance is scale invariant.
Read the full abstract

Artificial Intelligence

SymFold: Synergizing Evolutionary and Structural Priors for Accurate Protein Inverse Folding

Protein inverse folding aims to recover amino acid sequences for a given 3D protein structure, underpinning broad applications such as enzyme engineering and drug discovery.Current methods often follow a serial pipeline, in which a structure encoder predicts a coarse sequence, which is then refined by protein language models (PLMs). However, because PLMs only perform post-hoc sequence edits, the refinement is bounded by the quality of upstream predictions.Thanks to recent multimodal protein language models (MPLMs), we could directly encode structure to generate sequences with pretrained structural knowledge, but we observe that they are not effective for inverse folding. Therefore, we introduce a symmetric dual-path architecture that both leverages PLMs for pretrained sequence evolution knowledge and MPLMs for pretrained structural knowledge to iteratively guide protein sequence generation.Through extensive experiments across standard protein inverse folding benchmarks, our method achieves state-of-the-art performance, surpassing prior approaches, and ablation studies validate the rationale of our symmetric design, revealing a promising direction for the community.
Read the full abstract

All authors Handong Wang, Jiaxin Qi, Baisheng Lai, Jianqiang Huang

Computation and Language

CHARM: Character Hallucination for Multicultural Role Play Benchmark

Role-playing large language models (LLMs) are expected to adopt a character's style while also respecting that character's knowledge boundaries. Prior evaluations detect character hallucination but rarely distinguish whether errors arise from failure to recognize a boundary or from failure to comply despite recognition. We introduce CHARM, a multicultural benchmark of 40 real and fictional characters drawn from five cultural-linguistic regions, and validated by native reviewers. It probes two boundary types, Temporal (historical vs. modern) and Cross-Universe (entities outside a character's narrative or historical universe), using abstention-enabled multiple-choice questions. We propose a two-stage evaluation that separates Boundary-Awareness (explicit recognition that a query is out of scope) from Boundary-Compliance (abstention when answering concrete questions). Evaluations across six LLMs show that hallucination is driven predominantly by compliance failures. Models frequently acknowledge that a query lies outside the character's knowledge yet still provide factual, out-of-character answers. By re-posing the same questions to the target character, we confirm that a large fraction of these cases are verified parametric overrides; the model stores the relevant fact but fails to suppress it. We also observe systematic cultural variation in these failures, consistent with imbalances in how characters from different regions are represented in model knowledge.
Read the full abstract

All authors Sunkyung Han, Nahyeon Park, Gaeun Seo, Seunghyun Yoon, JinYeong Bak

Robotics

Scalable Rao-Blackwellized Online Planning for High-Dimensional POMDPs

Online planning under uncertainty remains a fundamental challenge for robotic systems operating in partially observable environments with high-dimensional state spaces. While sampling-based POMDP solvers enable approximate decision-making in large or continuous domains, their performance degrades as belief dimensionality increases due to the high variance inherent in Monte Carlo-based estimation. In this work, we extend the Rao-Blackwellized online POMDP (RB-POMDP) framework to improve its generalizability in high-dimensional settings through hybrid continuous-discrete belief representations. By analytically propagating uncertainty associated with marginalized state components during tree-based planning, the proposed approach reduces sampling-induced variance in value estimation. We demonstrate the effectiveness of this framework in a robotic search-and-rescue task by integrating it with FastSLAM 2.0. Experimental results show that the proposed planner achieves higher cumulative rewards using significantly fewer particles and planning simulations than purely sampling-based methods under equivalent computational budgets. These results suggest that structured high-dimensional robotic problems admitting tractable sufficient statistics can be effectively leveraged within the RB-POMDP framework for computationally feasible online decision-making.
Read the full abstract

All authors Jiho Lee, Nisar Ahmed, Kyle Hollins Wray, Zachary Sunberg

Number Theory

New classes of trace-form permutation polynomials and their compositional inverses

We construct permutation polynomials of the form x + \gamma Tr^{q^2}_q(h(x)) over the finite field F_{q^2}. More precisely, we present two families ofpermutation polynomials whose coefficients range over all elements of the field rather than being restricted to a proper subfield. We also compute the compositional inverses of both families. Our techniques involve the evaluation of certain Kloosterman sums together with the analysis of some equations over finite fields, and we believe these can be of independent interest.
Read the full abstract

Systems and Control

Constructive Port-Hamiltonian Energy Shaping Design of Dispatchable Virtual Oscillators in Grid-Forming Converters

Port-Hamiltonian (PH) theory offers a passivity-based framework for grid-forming control, yet conventional dispatchable virtual oscillator control (dVOC) does not naturally admit a dissipative PH realization, since its amplitude egulation, synchronization, and power dispatch are inherently coupled without a unified energy interpretation. This paper formulates the outer-loop dynamics as a dissipative PH system, thereby unifying amplitude regulation, synchronization, and power dispatch within one energy structure. The formulation rests on the key property that logistic-type radial regulation, characterized by an inherent saturation-like nonlinearity, permits an exact gradient decomposition compatible with the quadratic energy storage. On this basis, a unified shaped Hamiltonian is constructed, which encapsulates both amplitude restoration and power dispatch. Radial gain matching derived from this Hamiltonian yields explicit closed-form arameter inequalities that guarantee almost-global asymptotic stability and local exponential convergence. Moreover, tuning the power-error weighting coefficient actively shapes the energy landscape, thereby eliminating the undesirable low-voltage power-flow solution from the stationary set and ensuring convergence to the desired high-voltage equilibrium point. The Hessian singularity condition further provides the critical weight threshold that guarantees uniqueness of the high-voltage equilibrium. Numerical simulations validate the proposed method.
Read the full abstract

All authors Lu Gao, Lihui Yang, Feng Ji, Dong Liu, Longze Kou

Emerging Technologies

Collision-based logic in Lenia and its composition boundary

Continuous cellular automata such as Lenia spontaneously produce lifelike, self-propelling patterns, including the Orbium glider, which travels in a straight line while pulsing through a fixed breathing cycle. Collision-based logic, where moving patterns compute by colliding, is established in discrete cellular automata and continuous physical media. Within continuous cellular automata, computation has so far been trained into the rule rather than emerging from collisions, and whether a fixed-rule automaton like Lenia can support general collision-based computation remains open. This paper constructs an INHIBIT gate from collisions of the Orbium glider. Of the patterns searched across four continuous-CA rule types, the Orbium glider is the only one shown to survive a collision with both copies intact. A control glider deflects a signal glider off its output line, so the output carries a signal only when no control is present. The gate blocks across all twenty-four phases of the breathing cycle and nine integer offsets of the control. Two such gates in series, with one signal line and two controls, compose into an AND-NOT chain, correct on all eight input combinations. By contrast, routing a signal beyond that single chain is undemonstrated. A deflected signal is not restored to a fixed landing position, and no reusable absorber for the surviving gliders was found. The immediate open question for collision-based computation in Lenia therefore narrows from whether a gate exists to whether a deflected signal can be delivered to a downstream gate, the next requirement for composing the gate beyond a single straight chain.
Read the full abstract

High Energy Astrophysical Phenomena

Reconstruction of anomalous air showers with SKA-Low

Double-bump showers are a surprising class of extensive air showers (EAS) predicted by Monte Carlo simulations, which, so far, no experiment has been able to directly detect. They occur when a high-energy secondary particle, the leading particle, travels significantly farther than the rest, creating a distinct double-peaked longitudinal profile. The unique radio footprint of double-bump showers, characterized by multiple pulses in the signals and interference patterns in the frequency spectra, enables reconstruction of longitudinal profiles from radio observations. With its dense antenna array and broad frequency range, SKA-Low will be the first observatory capable of detecting these features, offering a new opportunity to probe hadronic interactions and use the distinctive signatures of elements to provide new mass composition measurements. The goal of this analysis is to take the first steps toward using these radio signatures to reconstruct the relevant parameters of the longitudinal profile of a double-bump shower. We will start by explaining the radio signal of double-bump}showers compared to that of average showers. Then we will create a simple 2-point emission model to explain the interference patterns in the frequency spectra, which can be inverted to obtain rudimentary estimates of atmospheric depth of both peaks. Lastly, we implement a brute-force approach to reconstruct multiple parameters of the double bump.
Read the full abstract

All authors Vital De Henau, Sjoerd Bouma, Justin Bray, Stijn Buitink, Arthur Corstanje, Edwin Dickinson, Tjibbe Gottmer, Brian Hare, Haoning He, Jörg Hörandel, Tim Huege, Clancy James, Mrinal Jetti, Philipp Laub, Xingyu Li, Marten Lourens, Hermann-Josef Mathes, Katie Mulrey, Anna Nelles, Subhadip Saha, Felix Schlüter, Olaf Scholten, Ralph Spencer, Christopher Sterpka, Sander ter Veen, Karen Terveer, Gia Trinh, Paulina Turekova, Darko Veberič, Keito Watanabe, Marc Waterson, Chao Zhang, Pengfei Zhang, Yi Zhang

Differential Geometry

Singular Rotational Self-Similar Tori for Odd $\sigma_k$-Curvature Flows

For every pair of integers $3\leq k<n$ with $k$ odd, we construct a compact embedded rotational torus in $\mathbb{R}^{n+1}$ whose homothetic dilations satisfy the unnormalised $\sigma_k$-curvature flow in a Sobolev almost-everywhere sense. Its profile curve has Hölder regularity $C^{1,1/k}$ and Sobolev regularity $W^{2,p}$ for every $1\leq p<k/(k-1)$. Away from two singular latitudes the torus is smooth; globally, the flow equation is interpreted using the weak shape operator of the associated Lipschitz boundary. Under rotational symmetry, the self-similar equation $\langle X,\nu\rangle=-\sigma_k$, where $X$ is the position vector and $\nu$ is the unit normal, reduces to a degenerate profile system. We solve this system by combining an odd-power desingularisation, a shooting argument, uniform radial and axial bounds, and a strict gap between the shooting parameters and the cylindrical radius. No classical $C^2$ rotational torus can satisfy the soliton equation, so the loss of regularity is unavoidable within the rotational toroidal class.
Read the full abstract

Artificial Intelligence

Cheap Verifiers, Large Blind Spots: Measuring the Reliability Cost of Cost-Saving Cascades

Inference cascades cut cost by answering most queries with a cheap model and escalating a hard tail to a frontier model that acts as verifier. A natural extension closes the loop: fine-tune the cheap student on the verifier's rejections so the escalation rate, and cost, fall each round. We measure this loop on real LLMs and report four findings. First, the verifier's blind spot, the fraction of the student's wrong answers it accepts, is large and moves adversarially: it grows with student capability ($\beta$ from 0.12 to 0.55 as the student scales 0.5B to 32B) and shrinks with verifier capability, so it is worst in the cheap-student, cheap-verifier regime cascades exist to create. Second, buying it away returns the saving: a frontier verifier drives $\beta$ to about 0.05 but then escalates on 46% of hard-MATH queries against a 39% true error rate, paying the frontier price on nearly half of all traffic. Third, naive corrective fine-tuning on the verifier-rejected tail does not improve the small student but degrades and ultimately collapses it, across every teacher we tried (cross-family and same-family), so at this scale the self-improving loop is self-defeating. Fourth, through all of this the cascade's own dashboard, every metric computed through the verifier, reads a flat 3% error while true delivered error swings up to 32%: the system is blind to its own degradation by construction. We then give the theory that explains the blindness, a two-population conservation law, $\epsilon_\infty \lesssim q_0 \beta_0$, under which every in-loop metric improves while true quality does not, and a synthetic study that validates the mechanism. The practical conclusion: the reliability of a self-improving cascade cannot be read from any metric computed through its own verifier.
Read the full abstract

Computer Vision

ExBind: A Controlled Diagnostic Benchmark for Visual-to-Executable Correspondence

Multimodal coding and editing systems must map a visible or semantic referent to the exact executable object that can be edited. A wrong reference may select a valid but incorrect DOM node, SVG element, graph endpoint, hierarchy member, or table cell, while final execution success alone does not reveal the source of the failure. ExBind isolates this visual-to-executable correspondence layer as a controlled diagnostic benchmark between semantic localization and action execution. It samples representation-independent latent binding instances and compiles them into SVG, DOM, canvas, tree, graph, and table cases with deterministic mappings to executable references. Models output only a strict reference; the evaluator maps predictions back to latent structure and scores structural constraints without requiring reasoning traces. The release contains a 250-case broad suite, a disjoint 240-case targeted suite, and 50 paired latent groups. Qwen2.5-VL-3B achieves 98.4% candidate validity but 76.4% exact accuracy, while Qwen3-VL-4B achieves 100.0% validity and 98.8% exact accuracy. In the targeted table suite, all Qwen2.5-VL-3B residual errors are valid correct-row/wrong-column selections. Candidate-order perturbations change case-level outcomes while preserving this error pattern. ExBind is designed for controlled diagnosis rather than population-scale ranking or end-to-end editing evaluation. Code and benchmark records are available at https://github.com/Daerwang2020/Exbind and https://huggingface.co/datasets/Ziqianwwww/ExBind.
Read the full abstract

All authors Ziqian Wang, Yuxiao Cheng, Tingxiong Xiao, Jinli Suo