Peer Revenue Equity in science

Papers

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

All of arXiv

Friday 28 August

Statistical Mechanics

The thermodynamic freedom of a thermodynamic computer

Thermodynamic computers are stochastic physical devices designed to perform calculations at the thermal energy scale. Their operation is constrained by the equations of stochastic thermodynamics, among which are a set of bounds, known as speed limits, that relate a thermodynamic computer's run time to its computational progress and the heat it dissipates. Using the Wasserstein speed limit we assess the thermodynamic efficiency of a simulation model of a thermodynamic computer trained to perform a standard machine-learning classification task. On this task the thermodynamic computer is as capable as a simple multilayer perceptron. We show that different inference protocols allow the computer to operate within 40% of the thermodynamic limit of efficiency without loss of accuracy, or to perform inference increasingly rapidly at fixed accuracy and thermodynamic efficiency. These results indicate that a thermodynamic computer designed for a particular task retains considerable freedom in its thermodynamic operation.
Read the full abstract

Representation Theory

Self-Orthogonal $\tau$-Tilting Modules and Tilting Modules II: Annihilator Separation

Let $A$ be an Artin algebra and let $T$ be a self-orthogonal $\tau$-tilting right $A$-module. Set $I=\Ann_A(T)$. We prove that \[ \Hom_A(I,T)=0=\Ext_A^n(I,T)\qquad(n\geq 1). \] It follows that the torsion class generated by $I$ is Hom-orthogonal to $\Sub T$. This separation yields faithfulness criteria expressed through ideal tops, socles, and projective supports. We also prove a finitistic-dimension obstruction: if $B=\End_A(T)^{\rm op}$ has finite little finitistic dimension, then $\Fac T\cap{}^{\perp_{\geq0}}T=\{0\}$. As an application, the self-orthogonal $\tau$-tilting conjecture holds for radical square zero Artin algebras. Finally, the support criteria apply to semisimple-source triangular matrix algebras with arbitrary local terminal blocks.
Read the full abstract

Computational Physics

Accelerated S-NFC for Million-Chaff RCS Computation Using Low-Rank Compression of Concatenated Block Rows

Sparsification via neglecting far-field coupling (S-NFC) enables fast full-wave radar-cross-section analysis of large-scale chaff clouds by retaining only significant local electromagnetic interactions. This letter further accelerates S-NFC by concatenating the retained off-diagonal interaction blocks associated with each receiving chaff element and applying a joint low-rank factorization with a shared receiving-side basis. Exact self interactions are preserved, while repeated chaff templates reuse precomputed lower–upper factorizations of the self-interaction blocks. The compressed formulation reduces retained-coupling storage and matrix–vector multiplication cost and also decreases the number of iterations required by the generalized conjugate residual solver. Numerical tests with 100,000 chaff elements demonstrate sub-$1\%$ complex-far-field error for low-rank approximations in sparse regimes and identify a practical self-only limit at sufficiently large mean spacing. For a one-million-chaff plume, the proposed compressed S-NFC achieves a $6.92\times$ end-to-end speedup over uncompressed S-NFC while storing only $6.60\%$ of the retained coupling, with a complex-far-field error of $0.253\%$.
Read the full abstract

Analysis of PDEs

Global Weighted Gradient Estimates for Double Obstacle Problems with Orlicz Growth

We study an irregular double obstacle problem with Orlicz growth on a bounded nonsmooth domain. The nonlinear operator is assumed to satisfy standard monotonicity and growth conditions, together with a small bounded mean oscillation condition in the spatial variable, while the domain is Reifenberg flat. We establish a global weighted Orlicz estimate for the gradient of the weak solution in terms of the nonhomogeneous datum, the gradients of the two obstacles, and the boundary datum.
Read the full abstract

High Energy Physics (Theory)

Superconformal index of large N and long quivers

We develop a universal framework for computing generating functions in quiver gauge theories in the large $N$ limit. We apply this method to the superconformal index of 4d $\mathcal{N}=2$ gauge theories, as well as to the 0-instanton index of 5d $\mathcal{N}=1$ theories, both for finite quivers of arbitrary shape and in the long quiver limit, including both special unitary and orthosymplectic gauge groups, demonstrating its versatility. In the Hall–Littlewood limit, we show that the series expansion of the resulting index captures the expected Higgs branch chiral ring generators. Our exact expressions in the long quiver limit provide new predictions for the supergravity index of the holographically dual warped AdS$_5$ and AdS$_6$ backgrounds.
Read the full abstract

Human-Computer Interaction

Graphionale: How Graph Visualizations of LLM Rationales Affect Human Decision Making

Large Language Models (LLMs) are increasingly equipped with augmented reasoning capabilities to generate rationales that support human decision-making. Yet these text-dense rationales often impose substantial cognitive burdens. Building on a formative co-design study that identified user preferences for non-linear reasoning representations, we developed Graphionale as a testbed for empirically studying argument-map-style rationale visualization. This system transforms linear LLM rationales into interactive, multi-level graphs. It explicitly structures logical relationships (e.g., conclusions, premises, support, and objections), while further extracting entities and relations within each statement to construct condensed node-link representations. We conduct a large-scale online user study (N = 204) to examine when graphical rationales are more effective than textual ones, across varying task modality (verbal vs. visual reasoning), rationale format (textual vs. graphical), and question difficulty (easy vs. hard). Our results show that graphical rationales do not help uniformly: they improve trust calibration for verbal reasoning yet feel more cognitively demanding and less satisfying; for visual reasoning, they impair calibration yet feel more engaging and helpful. In each modality, the format that better supports calibrated decisions is not the one users prefer, highlighting that matching rationale format to task modality is key to effective AI explanation design. Our findings contribute empirical design knowledge about when and how graphical rationales support human decision making, and inform the next-generation reasoning-aware AI interfaces.
Read the full abstract

All authors Xinru Wang, Zhexuan Ma, Ming Yin, Shuai Ma, Thomas W Malone

Machine Learning

TI$^2$PS: A Topology-Informed Inverse Design Framework for Stochastic Multicellular Pattern Formation

This study proposes a novel framework to estimate parameters for reproducing target multicellular patterns using an agent-based model (ABM). Two major challenges in multicellular ABMs are estimating cell-level parameters (agent-specific variables) and quantitatively evaluating the topological characteristics of multicellular arrangements under stochastic cell proliferation and death. To address these challenges, we integrate two approaches: Betti vectors and inverse surrogate modeling. The Betti vectors obtained through topological data analysis can consistently represent features of a wide range of multicellular spatial configurations. The inverse surrogate modeling enables direct inference of the corresponding ABM parameters from the target patterns. We validated the proposed framework using zebrafish pigment pattern formation, a representative model of pattern formation driven by multicellular interactions. The results demonstrate that our framework successfully estimates ABM parameters and outperforms conventional methods such as PointNet++. Notably, the proposed method, which used only 10% of the training data, outperformed PointNet++, which used 100% of the data, across all evaluation metrics.
Read the full abstract

All authors Kenji Komiya, Andrew Kailiang Jin, Ryo Nishikimi, Kunio Kashino

Soft Condensed Matter

Steady shear rheology of a granular crystal containing a single dislocation

Monodisperse granular particles can form crystals whose yielding behavior is strongly affected by dislocations and differs markedly from that of conventional amorphous granular materials. Yet the rate dependence of their post-yield steady rheology remains unclear. We use the discrete element method to study steady shear in a granular crystal containing a single dislocation. We find that the steady shear-to-normal stress ratio $\mu_b$ is organized by the scaled dislocation velocity $v_d/v_s$, rather than by the conventional inertial number $I$. Here, $v_d$ is related to the imposed shear rate through Orowan kinematics, and $v_s$ is a characteristic Hertzian elastic-wave speed. At low $v_d/v_s$, the stress ratio approaches a small plateau associated with the elastic lattice barrier and interparticle friction. At intermediate values of $v_d/v_s$, contact damping strongly affects the approximately linear increase of the stress ratio above the plateau. As $v_d/v_s$ approaches unity, the stress develops a stronger nonlinear velocity dependence. At still higher velocities, the coordination deficit rises sharply, marking the breakdown of crystalline order and the end of the single-dislocation description. These results identify the scaled dislocation velocity as the relevant rate variable for the steady rheology of dislocation-mediated granular flow and clarify the distinct roles of interparticle friction and contact damping in the low- and intermediate-velocity regimes, respectively.
Read the full abstract

Computer Vision

Training-Free Temporal Abstraction for General Video Understanding

Videos are expensive to analyze frame by frame, yet many video understanding tasks depend on knowing where relevant moments occur. A system may need to find when an action changes, locate the segment described by a sentence, or choose a few frames for a vision-language model. Existing methods often solve these problems separately, using task-specific training data or specialized architectures. We study whether a pretrained video-text model can provide enough temporal structure to support several of these tasks at once. We present STITCH, a training-free method that divides a video into semantically meaningful temporal chunks. STITCH embeds short video windows with a frozen video-text backbone and detects changes in the resulting embedding sequence. These chunks are computed once per video and reused across tasks. We evaluate STITCH on generic event boundary detection, language-based moment retrieval, and frame selection for long-video VLM reasoning. Across all three settings, STITCH remains competitive with more specialized methods while requiring no task-specific training, with especially clear gains when only a small number of frames or tokens can be processed. These results suggest that reusable temporal abstraction is a promising direction for general video understanding, allowing dense video streams to be converted once into semantic units that can be localized, retrieved, sampled, or reasoned over by downstream systems.
Read the full abstract

Cryptography and Security

GraftyVul: Synthesising Insecure Programs Through Real-World Vulnerability Grafting

Vulnerability datasets underpin a wide range of security research, including vulnerability detection, automated remediation, and secure code generation. However, existing datasets sacrifice at least one of three desirable properties: diversity (of language or vulnerability type), reproducibility/executability, or realism. We therefore present GraftyVul, a system that constructs vulnerable programs by grafting real-world vulnerabilities into open-source projects. This grounds the dataset in vulnerabilities observed in real-world contexts while harnessing known good build and test environments, enabling exploit-verification scripts to guarantee that an introduced vulnerability successfully alters a program's behaviour. Using GraftyVul, we generate 212 verified and exploitable vulnerable programs spanning five programming languages (Python, TypeScript, Java, Go, and C#) across 23 CWE categories. To evaluate fidelity, we introduce a language- and context-agnostic semantic embedding that compares vulnerabilities by sink, mechanism and host-feature rather than surface code. This approach outperforms standard code embeddings on cross-language clone and CWE classification. These embeddings demonstrate that GraftyVul samples retain a strong semantic signature to their source vulnerability. We additionally compare GraftyVul against 13 widely used datasets, where it attains competitive diversity while being the only reproducible-exploit dataset with broad language and CWE coverage. Finally, we illustrate GraftyVul's practical utility through an industrial case study evaluating a production vulnerability remediation system.
Read the full abstract

All authors Omri Ram, Mitchell Horner, Ron Van der Meyden, Alsharif Abuadbba, Hammond Pearce

Software Engineering

Antipatterns in AI-assisted Qualitative Data Analysis: A Catalog of Temptations and Pitfalls for Software Engineering Researchers

AI-assisted qualitative data analysis (QDA) offers unprecedented opportunities to streamline software engineering (SE) research, yet uncritical use risks compromising analytical rigor and flooding the field with accelerated production of low-quality research. While tactical best practices will naturally evolve over time, SE researchers currently lack strategic guidance to identify and mitigate methodological risks when attempting AI-assisted QDA. Based on our decades of qualitative SE research expertise and experience combined with an understanding of the emerging landscape of AI-assisted QDA, this paper presents a catalog of antipatterns in AI-assisted QDA - a set of assumptions and practices that initially appear advantageous but ultimately undermine analytical rigor and validity. The antipatterns are grouped into three categories reflecting escalating impact: Dangerous Drivers, Operational Missteps, and Analytical Failures. As more SE researchers attempt AI-assisted QDA, these antipatterns will help them identify and avoid common temptations and pitfalls, while reviewers can be equipped with the vocabulary and criteria to call out problematic and failed practice. Ultimately, this catalog of antipatterns can serve as a stepping stone in our responsible methodological evolution toward principled and meaningful human-AI collaboration in qualitative research.
Read the full abstract

All authors Rashina Hoda, Carolyn Seaman, Victoria Gomes, Rodrigo Spinola

Numerical Analysis

Optimal error estimates for the half-way bounce-back lattice Boltzmann method for the Stokes equations

We give a mathematical proof of the optimal convergence rates for the D2Q9 BGK lattice Boltzmann method with the half-way bounce-back rule for the incompressible Stokes equations in a flat channel. The convergence rates are second-order for the velocity and first-order for the pressure as the lattice spacing $h$ tends to zero, in agreement with formal analyses and numerical experiments, whereas the available rigorous convergence theorems only yield an $O(h^{1/2})$ bound for the velocity error. A key step in the proof is a decomposition of the leading boundary consistency error into macroscopic and kinetic components. These components are absorbed by suitably constructed Stokes and discrete Knudsen layer correctors, respectively. Incorporating these correctors into the prediction function used in previous rigorous analyses, we obtain a refined prediction function with consistency errors of sufficiently high order. Combined with the known weighted $L^2$-stability estimate, this gives the optimal convergence rates.
Read the full abstract

Computation and Language

Entity-Memory Graph Retrieval Improves Evidence Coverage in Long-Conversation Question Answering

Entity-Memory graph retrieval keeps dialogue turns as verbatim Memory nodes, links repeated mentions through shared Entities, and connects adjacent Memories with directed chronological edges. At query time the retriever moves from Entity gating through semantic fusion and one-hop chronological recovery to dense backfill. The path can keep a neighboring Memory that dense cosine ranking would otherwise omit. A matched dense control shares the Memory and query vectors, context budget, requested answer protocol, and evaluator, isolating graph structure from changes to the reader. On 1,986 questions from ten LoCoMo conversations, graph retrieval raises official evidence recall at top-k 25 from 79.7468% to 84.4842%. The recall advantage is supported from top-k 5 to 50, while no matched cutoff supports an overall final-answer F1 difference. Four paper-eligible requested configurations support empirical robustness across the tested GPT-3.5 and DeepSeek extractors on both outcomes. Embedding robustness is mixed: F1 has no supported contrast, but recall is sensitive to the embedding artifact. The comparison isolates a retrieval-coverage gain from graph structure. It does not establish a final-answer F1 gain, model or embedding equivalence, or cross-dataset generalization.
Read the full abstract

Computation and Language

What Makes Agent Memory Useful for Reliable Unanswerable Question Handling?

Reliable handling of unanswerable questions (UAQs) is critical for trustworthy LLM-based agents. Although memory is widely used in agent systems, its role in reliable UAQ handling remains unclear. We present a systematic study of agent memory for UAQ handling under a unified agentic RAG framework, evaluating four representative memory methods across three UAQ-related datasets and two base models. We find that memory can improve UAQ performance in some settings, but such gains are selective rather than universal and remain fragile under dataset shift. Interestingly, cross-model memory reuse is often more feasible than cross-dataset transfer, suggesting that shifts in answerability patterns pose a greater challenge to memory reuse than changes in the base model itself. We further find that UAQ gains are more strongly preserved through decision guidance than through trajectory shaping, and that memory effectiveness depends strongly on representation. In particular, procedural and rule-based memories often provide the most reliable support for UAQ handling, while memory composition is most effective when procedural guidance is combined with complementary behavioral signals. Overall, our findings suggest that reliable UAQ memory depends less on storing larger amounts of experience and more on preserving transferable behavioral guidance.
Read the full abstract

All authors Chuanyuan Tan, Junjie Yu, Yuxin Wang, Yining Zheng, Xipeng Qiu, Wenliang Chen

Computer Vision

PCBnet: A Dataset and Automatic Construction of SPICE Netlists from Schematic Images

Printed circuit boards (PCBs) are fundamental to modern electronic systems, yet AI-driven PCB design automation remains constrained by the lack of large-scale paired schematic-netlist datasets. PCB schematics are particularly challenging due to diverse component types, complex wiring topologies, and noisy textual annotations. To address this gap, we present PCBnet, a large-scale PCB schematic dataset comprising over 300 real-world designs with annotated pins and paired SPICE netlists. It contains more than 50,000 component instances, 150,000 wires, 100,000 text regions, and 400,000 characters. We further develop an automated schematic-to-netlist pipeline that combines visual recognition, topology construction, and domain-knowledge-guided multi-agent correction. The proposed method achieves 94.54% component detection mAP, 98.57% text recognition accuracy, and 84.47% end-to-end connectivity accuracy. PCBnet provides a benchmark and data foundation for future AI-driven PCB design automation.
Read the full abstract

All authors Zhen Huang, Yuhao Gao, Yuzhi Liu, Daian Cheng, Chengyuan Shao, Yucheng Chen, Yongjian Jia, Futing Zhang, Yichen Shi, Wenhao Wang, Zuyan He, Yangbo Wei, Zhanfei Chen, Jinlong Yan, Yu Zhang, Haoying Wu, Ting-Jung Lin, Lei He

Computer Vision

DensityKV: Density-Guided KV Cache Compression for Long Video Generation

Autoregressive video diffusion models enable streaming generation through sliding-window attention, but each generated block is conditioned on previously generated content, causing appearance and motion errors to propagate recursively over time. Historical key-value (KV) memory preserves earlier subject and scene states and helps maintain long-horizon consistency. However, retaining every generated state creates a historical archive that grows continuously with the rollout, while recurrent states repeatedly add redundant coverage. To address this problem, we propose DensityKV, a training-free historical KV bank management strategy. DensityKV maintains a separate token-level KV bank for each attention head and measures local redundancy among the post-RoPE keys that directly parameterize attention routing using Soft-Riesz density. By constraining neighborhood-density growth after states enter the bank, DensityKV limits repeated historical accumulation while preserving coherent states from each completed generation block. Experiments across three autoregressive video generation backbones and multiple generation lengths show that, at the same upper bound on historical KV capacity, DensityKV improves long-horizon consistency and generation stability while keeping persistent historical storage bounded independently of rollout length.
Read the full abstract

All authors Wenqu Zhao, Xuemin Chi, Xin Zhang, Guoqing Ma, Baorun Li, Jianjie Fang, Peizhi Tang, Chen Gao, Wei Wu

Algebraic Geometry

Syzygies of Polarized Abelian Surfaces: A Reider-Type Criterion

Let $(X,L)$ be a polarized complex abelian surface with $L^2=2d$. We establish a Reider-type criterion for Property $N_p$. If $d\geq7$, then $L$ satisfies Property $N_0$ if and only if there is no elliptic curve $E\subseteq X$ with $L\cdot E\leq2$, with one explicitly described exception. If $p\geq1$ and $d\geq(p+2)^2+1$, then $L$ satisfies Property $N_p$ if and only if there is no elliptic curve $E\subseteq X$ with $L\cdot E\leq p+2$. The numerical bounds on $d$ are optimal for $p=0,1$. These results improve upon earlier work of Küronya–Lozovanu, Ito, and Rojas. We also construct a polarized abelian surface whose basepoint-freeness threshold is irrational.
Read the full abstract

Classical Analysis and ODEs

Notices on a new functional identity and allied series transformations

In this paper, we establish an elementary functional identity \begin{align*}\sum_{k=1}^{n}\bigg(\frac{f(a,d_k)}{f(a,x)}\bigg)^{n-1}\prod_{i=1,i \neq k}^{n} \frac{g(x,d_i)}{g(d_k,d_i)}=1\end{align*} based on a pair of functions $f(x, y)$ and $g(x,y)$ satisfying $$f(x, a) g(b, c)+f(x, b) g(c, a)+f(x, c) g(a, b)=0.$$ The latter may serve as a prototype for the classical Weierstrass theta identity. As a direct application, we establish a general transformation formula for finite sums. Some special algebraic, triangular and elliptic series transformations are also presented.
Read the full abstract

Artificial Intelligence

From Documents to Reasoning: A Validated Synthetic Data Pipeline and Semantic-Aware Fine-Tuning for Financial Numerical Reasoning

Financial question answering (QA) has emerged as a key benchmark for evaluating the performance of Large Language Models (LLMs) on domain-specific tasks involving complex data formats such as tables, charts, and rich textual narratives. While recent advancements have enabled models to reason across modalities and perform multi-step arithmetic operations, limitations remain in performance consistency, and evaluation reliability. In particular, standard evaluation metrics like Exact Match (EM) often fail to account for minor variations such as differences in units or formats, misleading performance assessments. In this work, we propose a comprehensive pipeline for improving financial QA systems through high-quality synthetic data generation and fine-tuning of smaller language models (SLMs) using Quantized Low-Rank Adaptation (QLoRA). Our pipeline includes aggressive data validation for synthetic question answer generation to ensure the relevance and correctness of synthetic question-answer pairs. We introduce a novel evaluation metric that matches answers computed from arithmetic expressions rather than ground-truth answers; providing a more accurate reflection of model reasoning capability. Furthermore, we propose a modified loss function that aligns predicted and reference expressions using semantic similarity, our novel evaluation metric and standard cross-entropy, resulting in improved performance. Experimental results on benchmark datasets, ConvFinQA demonstrate significant gains in QA accuracy after fine-tuning using synthetic dataset and proposed loss function.
Read the full abstract

All authors Lokendra Birla, Milind Savagaonkar, Visnu Srinivasan, Sowmya Rasipuram, Shubhashis Sengupta

Computational Physics

Higher-Order Topological Phase in the Two-Dimensional Type-IV Magnet MgCr$_2$O$_4$

Type-IV two-dimensional (2D) magnetism-a newly classified collinear magnetic phase featuring nonrelativistic spin degeneracy and spin-orbit-coupling-induced momentum-dependent spin splitting-extends the symmetry classification of collinear magnets, opening new opportunities for unconventional topological quantum states. Here, we reveal that the recently proposed two-dimensional type-IV 2D magnet MgCr$_2$O$_4$ hosts an intrinsic higher-order topological insulating phase, featuring $\mathcal{C}_{3z}$-protected corner states and a nontrivial rotational topological invariant of $\chi^{(3)}$ = $\{-2,4\}$ with a quantized fractional corner charge of $4e/3$. Spin-orbit coupling breaks the spin-degeneracy-enforcing symmetry $[C_{2}||M_z]$ while preserving the crystalline $\mathcal{C}_{3z}$ rotational symmetry that protects the higher-order topological phase, thereby enabling spin splitting to coexist with the nontrivial topology. Furthermore, the higher-order topological phase remains intact throughout a wide range of biaxial strains without band-gap closing and topological phase transition, demonstrating the robustness of the symmetry-protected topological state against external perturbations. Our work establishes a direct connection between type-IV magnetic system and higher-order topology, providing a new route for symmetry-engineered magnetic topological quantum states.
Read the full abstract

All authors Xiaorong Zou, Hyeon Suk Shin, Yanmei Zang, Ying Dai, Chengwang Niu, Chang-Jong Kang, Chang Woo Myung

Strongly Correlated Electrons

Orbital-Selective Coexistence of Interlayer Spin-Singlet Formation and SDW Order with Anomalous Spin Reconfiguration in Bilayer Nickelate La$_{3}$Ni$_{2}$O$_{7}$ Revealed by $^{17}$O-NMR

The spin structure of the spin density wave (SDW) order in the bilayer nickelate La$_3$Ni$_2$O$_7$ has been investigated using site-selective $^{17}$O-NMR measurements on the inner apical O(1), outer apical O(2), and planar O(3,4) sites. Below $T_{\rm SDW}$ (= 150 K), the peak of all planar O(3,4) sites significantly broadens due to the emergence of a finite internal magnetic field, whereas O(2) sites remain with no (or a negligibly small) internal field. These results are consistent with commensurate SDW order with a single spin-spinless (or large-tiny spin) stripe. As for the O(1) sites that bridge the NiO$_2$ planes, the internal field is nearly canceled below $T_{\rm SDW}$, indicating an antiparallel spin configuration between adjacent planes. However, below $T_\text{A}$ ($\sim$ 115 K), the spectrum of the O(1) site disappears even though the in-plane SDW order remains robust, implying that the antiparallel spin configuration through the Ni–O(1)–Ni bond is not particularly stable below $T_{\rm A}$, despite the expected strong interlayer spin coupling between the NiO$_2$ planes. Above all, we emphasize that the local spin susceptibility is extremely small at the O(2) site that has a strong covalency with the $d_{3z^2-r^2}$ orbital, indicating a well-developed interlayer spin-singlet formation in the Ni-$d_{3z^2-r^2}$ orbitals bridging the NiO$_2$ planes. These findings shed new light on the interlayer spin-singlet formation and the anomalous spin reconfiguration through the $\text{Ni--O(1)--Ni}$ bonding orbitals connecting the NiO$_2$ planes, which characterize the orbital-selective nature of the bilayer nickelate La$_3$Ni$_2$O$_7$.
Read the full abstract

All authors H. Lee, M. Yashima, M. Kakoi, T. Ino, Y. Arai, K. Kitagawa, H. Sakurai, Y. Takano, K. Kuroki, H. Mukuda

Systems and Control

Backup Control Barrier Function Synthesis using Sum-of-Squares Reachability

Backup control barrier functions (bCBFs) enforce safety for input-constrained nonlinear systems using a pre-certified backup set and controller, but their performance depends strongly on this prescribed pair. This letter develops a constructive method for synthesizing a less conservative backup pair via finite horizon sum-of-squares (SOS) backward reachability. Starting from an initial backup set, we compute an SOS-certified finite horizon backward reachable set and controller that satisfy safety and input constraints while steering trajectories to the original backup set. We then provide conditions under which this certified set becomes a valid backup set for a piecewise backup controller. The resulting backup pair is integrated into the bCBF framework to certify larger safe sets.
Read the full abstract

All authors Jungbae Chun, Shima Sadat Mousavi, David E. J. van Wijk, Ersin Daş, Aaron D. Ames, Felix Biertümpfel

Classical Analysis and ODEs

A Sharp Capacity Gauge Solution to the Open Problem of Quasisymmetric Composition on $\mathcal{Q}_\alpha(\mathbb R^n)$

The spaces $\mathcal Q_\alpha(\mathbb R^n)$ for the critical index range $\alpha\in(0,\min\{1,n/2\})$ form a scale-invariant family lying strictly between the space of constant functions and $\mathrm{BMO}(\mathbb R^n)$. A long-standing open problem, posed by Essén, Janson, Peng and Xiao in 2000, asks to characterize the quasisymmetric mappings $\varphi:\ \mathbb R^n\to\mathbb R^n$ for which the composition operator $\mathcal C_\varphi(f)=f\circ\varphi^{-1}$ is bounded on $\mathcal Q_\alpha(\mathbb R^n)$. This paper establishes the full intrinsic characterization by introducing a new geometric quantity, the capacity gauge $\|\varphi\|_{\mathscr G_\beta}$, which measures the distortion of $\varphi$ through pullback volume ratios along the dyadic tree. We prove that for any quasisymmetric mapping $\varphi$ (with a mild Muckenhoupt \(A_\infty(\mathbb R)\) assumption on the Jacobian determinants of \(\varphi\) and \(\varphi^{-1}\) when \(n=1\)), the composition operator $\mathcal C_\varphi$ is bounded on $\mathcal Q_\alpha(\mathbb R^n)$ if and only if $\|\varphi\|_{\mathscr G_{1-\frac{2\alpha}{n}}}<\infty,$ with quantitative equivalence $$ \|\mathcal C_\varphi\|_{\mathcal Q_\alpha(\mathbb R^n)\to\mathcal Q_\alpha(\mathbb R^n)}^2 \simeq \|\varphi\|_{\mathscr G_{1-\frac{2\alpha}{n}}}. $$ This sharp, necessary and sufficient characterization refines earlier sufficient criteria of Koskela, Xiao, Zhang and Zhou in 2017, which were formulated in terms of local or global self-similar Minkowski dimension of the exceptional sets of the Jacobian. As applications, we obtain the composition stability of the finite capacity gauge, the invariance of $\mathcal Q_\alpha$-removability under quasisymmetric mappings with finite capacity gauge, and the propagation of $\mathcal Q_\alpha(\mathbb R^n)$-regularity and initial-data stability for transport equations driven by quasisymmetric flows.
Read the full abstract

Cryptography and Security

A User-Centric Context-Aware Permission Governance Framework for Privacy Control in Default Mobile Applications

Mobile operating systems provide runtime permission controls intended to improve user control over sensitive data. However, default or pre-installed applications are deeply integrated into the system, may operate with elevated privileges, and are difficult for users to scrutinize. Existing permission models generally grant persistent or temporary access for an application session without distinguishing among individual features, leaving users uncertain about when and why data are accessed. This paper presents a context-sensitive, user-focused permission governance framework for default mobile applications. It introduces a feature-based authorization option, "Allow When Needed," that restricts access to the functionality requiring the data rather than the entire application session. A weighted scoring system estimates the privacy implications of user choices based on permission sensitivity and authorization type. A web-based simulation platform was developed to model 30 realistic permission-request situations across six commonly used default application types and support controlled early-stage evaluation before native implementation. The exploratory assessment combined a cross-sectional survey of 104 respondents examining permission awareness and behavior with formative usability testing involving eight participants interacting with the prototype. Survey findings indicate that users do not consistently examine default-application permissions and prefer contextual explanations before granting access. The results provide preliminary evidence that context-aware permission governance can improve user understanding and decision clarity. This simulation-based study represents an initial step toward evaluating feature-level authorization and privacy-feedback mechanisms before native mobile deployment.
Read the full abstract

All authors Asmau Yetunde Adeniran, Adeniran Kolade Ademuwagun, Fatimah Adamu-Fika, Samaila Musa Abdullahi, Freeman Bitrus, Fortune Daberechi Ifeanyi

Astrophysics of Galaxies

Dense Cores in the Vicinity of an HII Region

Massive stars strongly influence their surroundings through radiative and mechanical feedback, but its effects on dense gas structures at sub-pc scales remain poorly constrained. We investigate how feedback from a newly formed massive star affects dense cores in the filamentary molecular cloud IRAS 18530+0215. We analyze ALMA Band 6 observations of 1.3 mm dust continuum and DCN, N$_2$D$^+$, and $^{13}$CS line emission, together with VLA K-band continuum and NH$_3$ observations. Dense cores are identified with astrodendro, and their temperatures, masses, velocity dispersions, and virial parameters are derived. The dynamical state of the ultra-compact H II region is examined through energy and pressure estimates. The H II region has a radius of $\sim$0.1 pc and an expansion velocity of $\sim$2.5 km s$^{-1}$, corresponding to a shell dynamical age of $\sim$0.06 Myr. DCN and $^{13}$CS cores are concentrated near the H II region, whereas N$_2$D$^+$ cores preferentially lie farther away. Core temperatures and velocity dispersions decrease with projected distance from the H II region. Virial parameters increase within the inner $\sim$0.3 pc but decline sharply beyond this scale, while core masses show no significant trend with distance. Strong star formation signatures are found at $\sim$0.2 pc, whereas more distant regions still host quiescent, cold dense cores. The compact H II region appears trapped or choked within $\sim$0.1 pc, while its feedback extends to at least $\sim$0.3 pc. Within this region, feedback enhances core velocity dispersions, gas temperatures, and virial parameters, with no evidence that it promotes the formation of more massive dense cores.
Read the full abstract

All authors Ruofei Zhang, Xing Lu, Jingwen Wu, Sihan Jiao, Hauyu Baobab Liu, Guang-Xing Li, Roberto Galván-Madrid, Aiyuan Yang, Siju Zhang, Shanghuo Li, Fengwei Xu, Xindi Tang, Yu Cheng, Weiyuan Zhang, Andrés E. Guzmán, Yuxin Lin, Yuhua Liu, Qizhou Zhang, Patricio Sanhueza, Ke Wang, Siyi Feng, Linjing Feng, Fangyuan Deng, Hao Ruan, Yuanzhen Xiong, Yuxiang Liu

Information Retrieval

ITER: Interaction-Aware Retrieval for Agentic Search

Deep-research agents answer complex user questions through an iterative sequence of search steps, where the agent autonomously formulates sub-queries to retrieve the evidence needed at each stage. However, existing retriever training typically relies only on the sub-query and its corresponding search results at the current step as training signals, leaving the information accumulated from previous interactions largely underutilized. We introduce ITER, an agent interaction-aware dense retriever trained using agent trajectory learning signals. ITER represents each query by incorporating not only the current sub-query, but also the main question, the agent's pre-search reasoning, and preceding sub-queries, and is trained using trajectory-relative learning signals derived from the agent's interactions. Across six agent backbones from three model families, ITER consistently outperforms the existing agent-trajectory-trained dense retriever, LRAT, achieving an average relative improvement of 6.9% on InfoSeek-Eval and 15.4% on BrowseComp-Plus. At the matched 4B scale, ITER outperforms AgentIR on InfoSeek-Eval for five of six backbones while achieving a higher visit-to-search recall ratio on BrowseComp-Plus across all six backbones. Ablations further show that structured interaction history and pre-search reasoning provide complementary retrieval context, while previously visited and useful documents, used as redundancy negatives in subsequent searches, provide the strongest trajectory-relative supervision.
Read the full abstract

All authors Haodong Chen, Shuai Wang, Yu Yin, Shengyao Zhuang, Guido Zuccon, Teerapong Leelanupab

Machine Learning

TACIT-Switch: Cost-Aware Model Escalation for LLM Agents from Censored Supervision

Agents with smaller language-model backbones are less expensive but can drift into persistent failure modes, whereas those with larger backbones are generally more reliable but more costly. This reliability-cost trade-off motivates routing methods that decide when to invoke an agent with a larger backbone: before execution, after a fixed trajectory prefix, or locally at individual steps. Our method, TACIT-SWITCH, learns permanent handoff policies from accumulated trajectory evidence and Teacher-Annotated Censored Intervention Times (TACIT). It represents each annotation as an interval-censored observation on a cumulative-risk scale. The resulting mixture-cure threshold model estimates the probability that the paired Strong rollout succeeds and, conditional on success, the handoff threshold; no teacher is required at deployment. In a mechanism-based multi-step simulation, TACIT-SWITCH improves success by 7.4-11.1 percentage points over task-level, step-level, and fixed-prefix routing baselines at comparable cost. Within that controlled simulation, ablations show that task features and cumulative trajectory risk provide complementary information. With operating points selected on development data, TACIT-SWITCH achieves the highest held-out success among learned policies on both ALFWorld (48.5% with 4B Cheap; 45.5% with 9B Cheap) and DABench (73.1%).
Read the full abstract

Artificial Intelligence

AI Alignment through a Game-theoretic Lens: A Survey

As large language models and increasingly capable AI agents are deployed in high-risk settings, aligning them with complex human values has become a central challenge. Existing alignment methods, while effective in improving helpfulness, harmlessness, and controllability, often struggle to capture real-world preferences that are context-dependent, non-transitive, and shaped by dynamic multi-party interactions. This survey reviews AI alignment through a game-theoretic lens. Specifically, it organizes recent progress around key game-theoretic elements and synthesizes the literature along three challenges: preference diversity, alignment priority, and temporal dynamics. This perspective clarifies where current alignment methods genuinely benefit from game-theoretic analysis, where the framework is looser, and what challenges remain in building robust, adaptive, and verifiable AI systems.
Read the full abstract

All authors Yanan Cai, Zhongrui Zhao, Zhigang Lu, Ickjai Lee, Wei Emma Zhang, Minhui Xue, Yihong Zhang, Shuchao Pang, Wei Xiang

Information Theory

Low-Altitude Fluid Antenna Network with Multi-Agent Reinforcement Learning

Low-altitude wireless networks (LAWNs) integrate terrestrial and aerial platforms to provide ubiquitous communication, sensing, and localization services for unmanned aerial vehicles (UAVs) and electric vertical takeoff and landing (eVTOL) aircraft. However, dynamic air-ground and air-air channels, abrupt blockages, and heterogeneous interference hinder the realization of this goal. Nevertheless, fluid antenna (FA), a cutting-edge multiple-input multiple-output (MIMO) technique, overcomes these challenges by reconfiguring antenna positions to unlock additional spatial degrees-of-freedom. In this paper, towards bringing low-altitude FA networks into reality, we study the fast and high-performance FA reconfiguration for low-altitude FA networks with multi-agent reinforcement learning (MARL). Specifically, we present an electromagnetic digital twin (EM-DT)-assisted MARL framework. To fill the sim-to-real gap, we introduce a two-stage transfer learning framework. Our case study shows that joint FA positions and beamforming optimization can enhance the system sum-rate by 118.5%, compared to the fixed position baseline. This gain comes from the dynamic millisecond timescale reconfiguration of FA arrays and the adaptive steering of beams toward aerial users with mobility.
Read the full abstract

All authors Tong Zhang, Yanfei Su, Shuai Wang, Wanli Ni, Chengzhong Xu, Huseyin Arslan