Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Friday 11 September

Software Engineering

A Retrieval-Augmented Automated Stakeholder for Requirements Elicitation Education: A Comparative Study

Developing the skills required for requirements engineering students to conduct effective requirements elicitation interviews is critical yet challenging, as it requires the development of soft skills in addition to technical knowledge. Role-playing is widely adopted in requirements engineering education to support the development of these skills but is often constrained by time and resource limitations. Although recent advances in large language models (LLMs) enable automated and interactive stakeholder simulations for role-playing, their application in requirements engineering education remains limited by hallucinations and inconsistent responses. To address these limitations, this study investigates the use of retrieval-augmented generation (RAG), implemented using the LangChain framework, to support requirements elicitation activities in a requirements engineering course. We conducted controlled experiments with 69 students, comparing cohorts who interacted with non-technical faculty role-players and those who engaged with RAG-based simulated stakeholders. The results indicate that while students perceived invited stakeholders as more realistic and engaging, the RAG-based automated stakeholder produced higher-quality elicitation questions and more complete feature identification.
Read the full abstract

Computation and Language

Calibrated Ambiguity in Multimodal Language Models: Humans reach for cultural references, while models describe the picture

Ambiguity is often treated as a bug for AI systems to resolve—but in human communication and culture, ambiguity can also be a generative resource. From humour to politics to art, people express themselves in words and images that are open enough to invite different interpretations, yet constrained enough to be interpretable. We operationalise this notion of calibrated ambiguity with a task drawn from the parlour game Dixit. We compare differences in clues generated by human vs multimodal language models, based on a novel coding rubric for calibrated ambiguity, and find that models consistently exhibit ambiguity collapse (i.e., their outputs are over-specified, leaving no room for multiple legitimate interpretations). Unlike human clues, AI-generated clues also exhibit cultural flattening; they almost never make reference to culturally-situated knowledge, even when prompted to use allusion and figurative language.
Read the full abstract

All authors Cody Kommers, Mingrui Ye, Evelyn Gius, Daniela Mihai, Hoyt Long, Zheng Yuan, Drew Hemment

Computer Vision

An Ultra-Widefield Swept-Source OCTA Dataset and a Polar-Gated Mamba Network for Retinal Vessel Segmentation

Ultra-widefield (UWF) swept-source optical coherence tomography angiography (SS-OCTA) enables large-area retinal vascular imaging, yet vessel segmentation at this scale lacks dedicated public benchmarks and comprehensive evaluation for quantitative vascular analysis. We introduce WOIVES, to our knowledge the first publicly available UWF SS-OCTA vessel-segmentation dataset, comprising 206 eyes from 152 participants with a 24x20mm^2 field of view. WOIVES spans emmetropia to high myopia and provides soft probability vessel annotations. We further propose PG-Mamba, a visual state space model that enhances conventional directional scans with two complementary polar-coordinate scan orders. An auxiliary Dynamic FOV Gating module performs spatial modulation at the bottleneck. PG-Mamba outperformed seven competitive approaches on broad segmentation metrics under cross-validation. It achieved the lowest median absolute errors for vessel density, fractal dimension, and vessel length density. WOIVES is publicly available on Zenodo (DOI: 10.5281/zenodo.21904672), and the PG-Mamba code is available at https://github.com/syb1234567/PG-Mamba.
Read the full abstract

All authors Yang Liu, Yibing Shen, Keming Zhao, Cenk Jiang, Zhenghang Qian, Zhicheng Du, Chen Xiong, Qidong Shao, Zijun Lin, Yunqi Hu, Jingjing Zhou, Lian Zhang, Peter E. Lobie, Peiwu Qin, Chengming Yang

Combinatorics

Quantum entropy and the Bannai–Ito multiplicity conjecture

We prove that the multiplicities of every symmetric $Q$-polynomial association scheme form a log-concave sequence. This resolves the 1984 unimodality conjecture of Bannai and Ito and establishes both related inequalities conjectured by Stanton. Our proof is a novel application of strong subadditivity and weak monotonicity inequalities for quantum entropy.
Read the full abstract

Game Theory

The Fixed Server Locality Gap of Count Load Assignment Games

Marginal-contribution pricing makes the social objective an exact potential, but does not ensure that every stable assignment is efficient. We study indivisible clients with heterogeneous workloads, arbitrary nonnegative assignment costs, and private eligibility menus over a fixed number of shared servers and optional local execution. Each server's social cost is its occupancy multiplied by its aggregate workload and a server-specific coefficient. For every fixed server cap $M$, we prove that the price of anarchy over this class is $\Theta_M(\kappa^{1-2^{-M}})$ as the workload-ratio cap $\kappa$ grows. The upper bound applies to every equilibrium and every feasible comparison, without an acyclic-comparison or strongly-connected-component restriction. Its proof combines a common-multiplier certificate, a source-weighted residual inequality and an ordered moment recurrence. A matching chain family has a realization by mobile unmanned aerial vehicle (UAV) clients and fixed ground servers, with positive altitude, positive-width coverage and an explicitly paid wireless baseline. We prove exact waypoint elimination and give an input-computable component refinement. Scheduling and congestion identities delimit which established bounds transfer. Exact enumeration of 2,800 synthetic games identifies inefficient equilibria, while 270 primary-parameterized synthetic instance-budget records evaluate incremental latency relative to a feasible multistart reference. Tightness concerns the heterogeneity exponent for fixed $M$, not matching leading constants or measured frequency of the worst-case configurations.
Read the full abstract

Cryptography and Security

PIA-Bench: Towards Automated Privacy Impact Assessment with Large Language Models

Privacy impact assessment (PIA) is a critical instrument for institutions to proactively identify privacy risks and develop mitigation strategies before system deployment. While mandated across regulatory and institutional contexts, executing PIA requires extensive privacy and technical expertise, posing a particular challenge for teams without access to such resources. Prior work shows the potential of leveraging large language models (LLMs) to assist practitioners' privacy decisions, but little is known about how accurately and reliably LLMs can automate PIA. To this end, we develop PIA-Bench, the first open benchmark for evaluating LLMs on real-world PIAs. We first audited 499 expert-authored PIAs published by US federal agencies and curated 73 structured PIAs, comprising a total of 451 privacy risk and 831 mitigation items, to evaluate LLMs' ability to assess privacy risks and propose mitigations of complex systems. Our results show that off-the-shelf LLMs produce meaningful assessments and identify avenues for future improvement. Finally, we call for improving domain-specific workflows for LLM agents, developing accountable LLM infrastructure, and designing new quality standards for PIAs.
Read the full abstract

All authors Jiamin Zheng, Hao-Ping Lee, Luo Mai, Jingjie Li

Superconductivity

Nonequilibrium Quasiparticle Effects on Domain Wall Dynamics in Superconductors

We study the dynamics of a domain wall (DW) in a type-II superconductor connected to two heat reservoirs. We employ a generalized time-dependent Ginzburg–Landau framework in which the superconducting order parameter and the nonequilibrium quasiparticle distribution are treated as coupled dynamical variables. Within this framework, the effect of the thermal bias is imposed through boundary conditions on the quasiparticle distribution, which are set by the reservoir temperatures. We show, both numerically and within linear response, that the DW moves toward the hotter boundary. From the local momentum-balance relation implied by the model, we identify a viscous force and a force arising from the coupling between the order parameter and the nonequilibrium distribution function. The nonequilibrium distribution separates exactly into a boundary-driven part and a part generated by the motion of the DW itself. The former sets the sign of the DW velocity, whereas the latter renormalizes the relaxation of the order parameter. These results provide a microscopic basis for the phenomenological local-temperature description developed in our previous work.
Read the full abstract

Combinatorics

Rotating-Memory Fibonacci Numbers and Periodic Tilings

We introduce and study the rotating-memory Fibonacci numbers, a periodic variable-order analogue of the Fibonacci sequence in which the number of preceding terms used in the recurrence changes cyclically with the index. Despite this varying memory, the resulting sequences exhibit a remarkably rigid structure. We derive closed forms, rational generating functions, arithmetic properties, and exact growth behavior, and show that the sequence decomposes naturally into geometric subsequences. We also develop combinatorial interpretations in terms of periodically constrained tilings, and restricted compositions, including bijective explanations for the multiplicative structure of the sequence. In addition, the first two nonclassical periods admit natural geometry-driven realizations: the period-2 sequence arises from monomer–dimer tilings of a triangular chain, while the period-3 sequence is related to tilings of a double hexagon strip by single and double hexagons. These connections provide geometric interpretations of the rotating recurrence in which the periodic behavior is induced by the underlying structures themselves, and suggest a broader problem of constructing analogous models for higher periods.
Read the full abstract

High Energy Physics (Phenomenology)

Comprehensive study of spectroscopic properties of $D_{(s)}$ mesons

We decode the excited open charm mesons $D$ ($c\bar{q}$, $q=u,d$) and charm strange $D_s$ ($c\bar{s}$) families within a nonrelativistic quark-antiquark potential model based on the Cornell (Coulomb plus linear) potential supplemented by a Gaussian smeared spin-spin interaction. With only seven parameters determined by fitting the ground state masses, the numerically solved Schrödinger equation reproduces the masses of essentially every confirmed $D$ and $D_s$ state to better than $1\%$. The same wave functions are then employed to get a complete decay analysis including pseudoscalar and vector decay constants ($f_D = 231.8$~MeV, $f_{D_s} = 252.2$~MeV, the latter within $0.4\%$ of the world average), leptonic branching fractions reproducing the measured $\mu\nu$ and $\tau\nu$ modes, electromagnetic $E1$/$M1$ widths, and all kinematically open strong channels in heavy quark effective theory (HQET). Going beyond width ratios, we extract the full set of HQET couplings $g_H$, $g_S$, $g_T$, $g_X$, $g_Y$, $g_Z$, and $g_R$ directly from the measured total widths and convert our predictions into absolute widths. The $D$ and $D_s$ sector extractions of each coupling agree ($g_T = 0.42$ vs. $0.39$, $g_X = 0.22$ vs. $0.21$, $g_Y = 0.39$ vs. $0.40$), a nontrivial test of heavy quark flavor symmetry, while the pure $c\bar{s}$ picture demands a $1^3P_0$ width nearly two orders of magnitude above the observed $D_{s0}^*(2317)$ bound demanding it to be of exotic nature. Linear and parallel Regge trajectories in the $(J,M^2)$ and $(n_r,M^2)$ planes, with slopes $\alpha \simeq 0.55-0.65$~GeV$^{-2}$ and $\beta \simeq 0.36 - 0.39$~GeV$^{-2}$, identify the assignments of $D_J(3000)^0$, $D_J^*(3000)^0$, and $D_2^*(3000)^0$ as the $3^1S_0$, $3^3S_1$, and $3^3P_2$ states. Our predictions provide concrete, testable targets for LHCb, BESIII, and Belle~II.
Read the full abstract

All authors Janki. J. Patel, Dhaval Achary, Dhruvesh Maiya, Keval Gandhi, Nakul R. Soni, Jignesh N. Pandya

Probability

A multitype Markovian branching process with one-type population size dependence

Motivated by a within-host framework of immunity-modulated parasitic disease, we formulate a multitype Markovian branching process with reproductive parameters dependent on the number of individuals of a single type only. We impose a soft carrying capacity $K$ with respect to the controlling type, serving as a threshold between subcritical and supercritical dynamics. We prove that extinction occurs almost surely when the offspring batch of each non-controlling type includes an individual of the controlling type with positive probability, with the time to extinction possessing finite moments of all orders. We then construct a sequence of density-dependent processes indexed by $K$ and study scaling limits of the process using the canonical functional law of large numbers (FLLN) and central limit theorem, with a view towards characterising the emergence of metastable behaviour in the vicinity of asymptotically stable equilibria, or stable limit cycles of the FLLN.
Read the full abstract

Classical Analysis and ODEs

Bourgain's Lambda(p) selection theorem: a greedy proof with polynomial failure bounds

We give a self-contained proof of Bourgain's finite $\Lambda(p)$ selection theorem with an explicit probability bound. For every $p>2$ and $N\ge2$, given $N$ pairwise orthogonal functions bounded by one on a probability space, a uniformly chosen subsystem of cardinality $\lceil N^{\frac{2}{p}}\rceil$ satisfies the $\Lambda(p)$ inequality with probability at least $1-\frac{1}{N}$, with a constant depending only on $p$. The inequality holds simultaneously for all complex coefficient vectors. More generally, for every fixed $A>0$, the success probability is at least $1-\frac{1}{N^A}$ with a constant depending only on $p$ and $A$, and independent of $N$. The proof uses a greedy approximation in $L^r$, with $r>2$, whose potential decreases throughout all approximation scales. A single weighted bound on the cumulative number of updates controls a union bound over discrete update histories, and increasing the weight assigned to each history gives the prescribed failure exponent without changing the cardinality exponent.
Read the full abstract

Quantum Physics

Security Implications of Measurement Based Crosstalk on Superconducting Quantum Computers

Crosstalk is one of the major issues for scalability of superconducting quantum processors. But it can also be used by threat actors to intentionally sabotage computations and steal information. This paper analyzes data leakage due to crosstalk during qubit measurement. Prior research yielded an accuracy of 96% in classifying measurement of one qubit in IBM quantum computers. When evaluated on superconducting hardware from VTT, we achieved an accuracy of 71.68% with similar framework. Our extended framework with additional labels yields an accuracy of 76.30% for classifying measurement of one qubit and 53.37% for measurement of two qubits using Support Vector Machine (SVM). Experimental results indicate that measurement operation on a qubit can affect the probability of measuring adjacent qubits. The impact on the target qubit is dependent on the number of neighboring qubits measured and also the measurement outcome.
Read the full abstract

Digital Libraries

Mentorship resources and citation-elite journal publication trajectories after training: Evidence from bioscience mentor-mentee networks

Mentorship provides mentees with knowledge, collaborators, and reputation, but when do these resources support scholarship beyond training? Using 239,931 bioscience mentor-mentee pairs from the Academic Family Tree (1800-2020) linked to OpenAlex metadata, we examine this question through mentees' publication in citation-elite journals, identified by three source-level citation indicators. We distinguish training-period mentor and peer resources from post-graduation topic and coauthorship network continuity. Analyses combine trajectory comparisons, three propensity-score matching designs, PPML, two-part model and non-overlapping landmarks relating continuity in post-graduation years 1-3 to publication outcomes in years 4-10 and 6-20. Citation-elite journal publishing during mentorship is positively associated with later publishing, but correlates differ by career stage. Close mentor collaboration and larger peer group size characterize training-period publishing, whereas both are negatively associated with post-graduation publication probability and intensity. Early topic and network continuity are positively associated with later output in landmark analyses; across extended conventional windows, topic continuity becomes less favorable, consistent with later agenda broadening. Network continuity shows the most stable positive association with publication intensity. The findings suggest a stage-dependent resource-conversion process: training resources may facilitate entry into citation-elite journal publishing, whereas sustained output is associated with how intellectual and relational ties are retained or reconfigured.
Read the full abstract

All authors Hao Zeng, Yi Bu, Qingshan Zhou, Hongkan Chen

Machine Learning

TokenMapper: A Step Toward Interoperable Speech Token Translation

Neural audio codecs discretize speech into token sequences, but the resulting token spaces differ in vocabulary and codebook structure, preventing direct communication across models. This limitation affects applications such as conversational voice agents and speech to speech translation systems where multiple speech models must interact. As a result, transferring information between speech systems typically requires decoding to waveform audio and re-encoding with a second tokenizer, increasing latency and introducing potential information loss. To address these limitations, we present TokenMapper, a direction aware framework for direct token to token translation between heterogeneous speech tokenizers in the discrete domain. TokenMapper supports structurally mismatched token spaces, including mappings between single codebook and multi codebook representations, under a shared effective token rate. Experiments on GLM-4-Voice, MiMi and DualCodec show consistent cross model performance. Specifically, translation WER approaches native reconstructions within 2.5-6.8% absolute WER, human MOS for TokenMapper outputs ranges from 2.29 to 4.39, following the same direction level trends as UTMOS and end to end latency is reduced by 4.8-94.5% relative to waveform bridging, reaching up to 972 ms per utterance. These results provide a practical step toward cross model speech token interoperability without intermediate waveform reconstruction.
Read the full abstract

Functional Analysis

A strictly convex and smooth Banach space with the Daugavet property

We construct equivalent norms on $L_1[0,1]$, arbitrarily close to the usual $L_1$-norm, which are weakly midpoint locally uniformly rotund and Gâteaux smooth, and whose dual norms have the Daugavet property. In particular, we obtain a strictly convex and smooth Banach space with the Daugavet property, thereby solving a longstanding open problem in the area.
Read the full abstract

General Relativity and Quantum Cosmology

Shadows and Polarimetric Signatures of Rotating Simpson-Visser Black Holes with Thick Disk Illumination

In this manuscript, we investigate the shadow and polarization images of a Simpson-Visser rotating black hole surrounded by a ballistic approximation accretion flow model. Solving the numerically geodesic and radiative transfer equations, we discuss the influence of the regularization parameter $g$, spin parameter $a$, and observer inclination angle $\theta_o$ on the resulting images at $230\,\mathrm{GHz}$ with an infalling motion. The results interpret that, a bright circular ring corresponding to higher-order images is observed, accompanied by an inner region of decreased intensity. Both $g$ and $a$ has little influence on the size of the higher-order images, but significantly changes their shape and intensity distribution. Whereas, variation in $\theta_o$ modify the image morphology, producing a crescent-shaped bright region on the left side. Finally, the polarization patterns trace the brightness distribution and vary with both $g$ and $a$, reflecting the spacetime structure. These results demonstrates that the intensity and polarization in thick disk models provide probes of Simpson-Visser rotating black holes and near-horizon accretion physics.
Read the full abstract

All authors Bing-Bing Chen, Deyou Chen, Yu-Kang Wang, Muhammad Israr Aslam, Rabia Saleem, Nazek Alessa

Statistical Mechanics

Persistence of BKT phase transition in the 2D nonanalytic XY model

We study the two-dimensional XY model with the nonanalytic pair potential $2[(1-\cos\delta)/2]^{p}$, whose small-angle law $\propto|\delta|^{2p}$ carries a cusp for $p<1$ and a flat bottom for $p>1$, invalidating the harmonic spin-wave expansion. Two questions arise: the nature of the low-temperature ($T$) phase and of the phase transition. A naive energetic argument would predict genuine long-range order and an enhanced transition temperature for $p<1$, and no transition at all for $p>1$. Large-scale Monte Carlo simulations contradict both: for every $p>0$ the \dengrevxxi{low-$T$ phase} is quasi-long-range ordered, with anomalous dimension $\eta(T)\propto T^{1/p}$, and terminates at a Berezinskii–Kosterlitz–Thouless transition. Using a vortex-free noncompact lattice-field description and utilizing a duality transformation, we show that coarse-graining drives the height-difference distribution onto a single Gaussian fixed point, renormalizing the cusp and flatness into a finite harmonic stiffness that restores the spin-wave description and the BKT scenario for all $p>0$.
Read the full abstract

All authors Sihan Hu, Xianzhi Pan, Kun Chen, Yi Jiang, Youjin Deng

Computer Vision

KAD-Net: Kinematics-Aware Decoupled Learning for Robust 3D Hand Pose Estimation from a Single Depth Image

Due to the complexity of hand kinematics and self-occlusion, existing 3D hand pose estimation methods based on single depth images struggle to comprehensively model the topological dependencies among hand joints. Furthermore, traditional hierarchical multitask architectures enforce a shared feature space for both 2D joint localization and depth estimation, which can induce mutual interference. To address these challenges, we propose a Kinematics-Aware Decoupled Learning Network (KAD-Net) for robust 3D hand pose estimation. Specifically, we first design a Finger Topology Constraint (FTC) module to enhance the representation of distal joints. This module utilizes three consecutive finger joints to construct a local kinematic representation to impose topological constraints, which supplements the kinematic features of the distal joints. The FTC module leverages the structural context from visible joints to assist in locating occluded distal joints, thereby improving robustness to occlusion. Additionally, we propose a task-decoupled hierarchical multitask framework. This framework separates 2D joint localization from depth estimation and incorporates a dedicated multitask learning strategy for depth regression, effectively isolating the UV and depth features to mitigate mutual interference and negative transfer. Extensive experiments demonstrate that KAD-Net outperforms existing methods on several benchmark datasets (ICVL, NYU, and MSRA), achieving state-of-the-art accuracy in 3D hand pose estimation. Potential applications of KAD-Net include human-computer interaction, virtual reality and gesture-based control systems.
Read the full abstract

All authors Jun Lu, Zhenming Chen, Lin Chen, Kanlun Tan, Xiaoling Li, Qiao Liu

Theoretical Economics

School Choice Problems with Priority Adjustments

This paper studies school choice when each school has an original priority order and an adjusted priority order reflecting policies such as affirmative action. We introduce a weak notion of stability that permits justified envy under one priority order only when the opposite priority relation is supported by the other. We characterize weakly stable matchings as stable matchings under the intersection of the two priority profiles. Using the efficiency-adjusted deferred acceptance algorithm, we obtain a weakly stable matching that cannot be Pareto improved upon, within the set of weakly stable matchings, for any group containing all improved students by the adjustment. We also show that any Pareto improvement over this outcome necessarily creates justified envy under both priority profiles. Finally, our mechanism is responsive to stronger priority adjustments: the outcome under a stronger affirmative action policy is not Pareto dominated by that under a weaker policy for any group containing all students improved by the stronger adjustment.
Read the full abstract

Computer Vision

DRS-VPT: Directly Relocalizing in a Scan with Vision Point Transformers

We present DRS-VPT, a feed-forward transformer architecture for foundational image-to-scan registration. Given query images and a reference 3D point cloud, the model predicts the scan pose and point map alongside the poses and point maps of each camera, all expressed in the first camera's frame. It additionally predicts a coarse-to- fine pyramid of per-point and per-pixel features for direct reprojective alignment of the scan to the first image. This formulation unifies downstream tasks such as camera-LiDAR calibration in autonomous driving and indoor camera-to-map relocalization. A single DRS-VPT model achieves state-of-the-art performance for image-to-LiDAR registration in autonomous driving, competitive indoor relocalization without training map-specific weights, and strong zero-shot transfer to unseen environments. We also show qualitatively that the model learns complex scan-to-image projection properties such as occlusion of back-facing points. Code and models are available at https://github.com/ori-drs/drs-vpt.
Read the full abstract

Information Retrieval

Preference-Drift-Aware Subsequence Learning and Hierarchical Context Fusion for Long-Sequence Generative Recommendation

Long-sequence generative recommendation methods autoregressively model the user's interaction sequence to generate the next-item representation. Existing methods generally fall into two categories: efficient full-sequence modeling and target-aware context retrieval. Our experiments reveal that as the sequence length increases, the former incurs steadily growing computational cost while its accuracy gains quickly saturate and even degrade due to noise; the latter, though shortening the input sequence, is susceptible to noise that is semantically consistent yet preference-inconsistent, as well as to incomplete contexts. Both paradigms ignore the dynamic changes of user preferences and the cross-subsequence dependencies when handling historical information, thereby limiting accuracy and efficiency. To address these issues, we propose a preference-drift-aware subsequence learning and hierarchical context fusion for long-sequence generative recommendation. Specifically, we learn differentiable soft subsequence boundaries using multidimensional preference-drift information and aggregate items within each subsequence into preference-coherent representations via linear attention with soft assignment weights, thereby circumventing the expense of full-sequence attention. A cross-attention mechanism is then employed to capture dependencies between recent interactions and relevant subsequence contexts, mitigating noise in learning recent-item representations. Finally, a gated fusion mechanism adaptively combines the recent-item representation with the global subsequence context, allowing the resulting target representation to encode both recent and long-term preferences. Extensive experiments demonstrate that our method consistently outperforms existing baselines in both recommendation accuracy and computational efficiency.
Read the full abstract

All authors Fei Li, Qingyun Gao, Jianzhe Zhao, Guibing Guo, Beibei Kong, Lei Cheng, Chengxiang Zhuo, Zang Li

Soft Condensed Matter

Interfacial Packing of DNA Nanostars Regulates Dynamics on Synthetic Cell Membranes

DNA nanostructures are emerging as programmable components for engineering synthetic cell membranes, yet how their collective packing and deformability regulate molecular dynamics at membrane interfaces remains poorly understood. Here, we investigate the packing and mobility of DNA nanostars with tunable stiffness on lipid-coated droplets. The negatively charged nanostars spontaneously adsorb onto cationic membranes, and their interfacial packing is changed by the bulk DNA concentration and droplet size, which together determine the number of encapsulated nanostars. Combining fluorescence recovery after photobleaching experiments with coarse-grained simulations, we reveal distinct packing-dynamics relationships for rigid and soft nanostars. For rigid nanostars, diffusion first decreases gradually and then drops sharply with increasing interfacial packing, approaching a dynamically arrested state consistent with jamming-like behavior. In contrast, at equivalent experimental conditions, soft nanostars systematically reach lower interfacial packing fractions and show a weaker decrease in apparent mobility. This behavior is consistent with their weaker membrane affinity, which facilitates adsorption-desorption with the bulk. When this exchange is suppressed in simulations, crowding reduces the lateral diffusion of both nanostar types, but produces distinct dense configurations: soft nanostars become strongly deformed, whereas rigid nanostars largely retain their shape and form interlocked, gear-like arrangements. Nanostar adsorption also impedes lipid diffusion, while differences in membrane affinity result in distinct lipid mobile fractions. These findings reveal how the interplay between nanostar packing and deformability regulates molecular transport at membrane interfaces, providing a physical design principle for tuning lateral fluidity and crowding in artificial cells.
Read the full abstract

All authors Kazutoshi Masuda, Takahiro Yokoyama, Miho Yanagisawa, Arash Nikoubashman

Cryptography and Security

Omniscience for the Masses: New Threats in the Metaverse's Democratized World Creation

Metaverse platforms increasingly derive their success from user-generated virtual worlds: self-contained social and interactive environments, which can be created by any ordinary user and scale to billions of visits. Platforms such as Roblox, Horizon Worlds, and VRChat now host millions of creator-built worlds that govern how users see, hear, and interact with one another. While this model enables rapid growth and creativity, it fundamentally delegates control over social interactions and world behavior to untrusted users. In this paper, we present the first systematic security and privacy assessment of metaverse world creators. We survey 25 platforms that support user-created worlds and analyze their world-creation capabilities. Guided by this analysis, we design and implement five novel attacks that exploit creator-provided tools to violate spatial, visual, and auditory constraints in immersive environments, enabling covert user surveillance and manipulation without software vulnerabilities or developer-level privileges. We further show that five previously-proposed attacks can be replicated using only standard world-creation features. Finally, we find that existing platform vetting, runtime protections, and creator policies are insufficient to mitigate malicious world-creator behavior, revealing a fundamental mismatch between users' privacy expectations and the powers granted to world creators.
Read the full abstract

All authors Andrea Mengascini, Ryan Aurelio, Jason Polakis, Giancarlo Pellegrino

Analysis of PDEs

On the Large $\Lambda$ Asymptotics of the One Phase Bernoulli Free Boundary Problem

In this paper, we investigate the asymptotic behavior of minimizers $u_\Lambda$ of the Bernoulli functional $\int_D |\nabla v|^2 \, dx +\Lambda|\Omega_v|$ for large $\Lambda$ with a boundary datum $g \ge 0$. In particular, in the case $g>0$, we show graphicality of the free boundary over $\partial D$ and obtain a second order asymptotic expansion in $\Lambda$ of the graph.
Read the full abstract

Computer Vision

RelateAnything: Real-Time Open-Vocabulary Relation Prediction From Any Inputs

Open-vocabulary detection accepts any class list at inference, and promptable segmentation returns regions without class names: the taxonomy has left the model and become an input. Relation prediction has not. Scene-graph models are still trained and evaluated on the 50 or 56 predicates of one annotation style, their relation head conditioned on object labels and so tied to one detector. Three obstacles explain this, none primarily modelling: no relation corpus is both free-text and verified, a label-conditioned architecture cannot accept a vocabulary it was not trained on, and the standard metric rewards agreement with the training corpus, so a larger vocabulary scores as a regression. We present RelateAnything, a 53M-parameter model taking an image and regions from any source and returning scored relations over a predicate vocabulary supplied at inference as strings. Object labels are never an input, so the region source can change without retraining, and the vocabulary is a bank of text embeddings, not a learned classifier. It runs at 20 ms/frame. Training over 19,103 predicates requires positive-unlabeled supervision and a text encoder that separates antonyms, which contrastive encoders embed at cosine 0.95. To supply the supervision we build RA-4M, 474k images and 4.3M relations over 10,102 free-text predicates, generated against numbered box markers and geometrically verified. To measure it we build OV-SGG-Bench, six axes scored across datasets that the priors standard recall rewards cannot satisfy. On three cross-dataset benchmarks and a fourth zero-shot, RelateAnything has 2.3-3.5x the mean recall of the strongest open-vocabulary method of comparable scale, margins that survive a real detector, and leads a 3B-VLM scene-graph model on both metrics at under 2% of its parameters. In-domain measurement overstates transfer gains ~5x. Model, corpus and benchmark are public.
Read the full abstract

Distributed Computing

RoofLang: Enabling AI-Driven Architecting of LLM Inference Systems

AI is beginning to make substantive contributions to LLM inference optimization. Existing AI optimizations are predominantly profiling-based. Profiling-bound feedback confines the search to the capabilities and performance of an existing software stack, preventing a fundamentally better architecture of LLM inference systems from being identified. To enable the AI-driven LLM inference system architecting loop, we argue that a general workload representation, a verifiable mutation space, and an implementation-independent evaluator are required. We present the RoofLang domain-specific language (DSL) that provides these features. In our evaluation, RoofLang reveals that DeepSeek V4-series models could achieve 3.5-39.5$\times$ higher peak decode throughput than other representative models. This gap is disproportionate to their total parameter counts and arises largely from compact KV-cache designs that support larger batches and reduce memory traffic. A persistent optimizer agent further discovered several new architectures that improved both throughput and interactivity of DeepSeek V4 Pro on NVIDIA B300 by 6.23-50.1%.
Read the full abstract

All authors Ziyue Yang, Yuting Jiang, Lei Qu, Peng Cheng

Machine Learning

Quality-Constrained Routing over a Fixed Pool of Quantized Mixture-of-Experts Instances

Quantized Mixture-of-Experts (MoE) services can hold several pre-materialized instances of one base model, but quantization damage varies sharply across requests and bitwidths. Because instance materialization and replica counts consume memory and require slow reconfiguration, we treat them as upstream provisioning decisions and study routing within a fixed resident pool. Within this fixed-pool boundary, we route each request to maximize modeled throughput under a class-level expected quality-degradation budget and measured instance capacities. To predict this request-specific risk, we introduce FWP (Fragility-Weighted Perplexity), computed from prompt tokens on a reference-instance prefill and calibrated to candidate-instance degradation. Underlying FWP is an exact two-expert affinity–fragility decomposition and a conditional multi-layer top-$k$ expansion whose bias, interaction, route-change, separability, and higher-order terms remain explicit. Using these calibrated risks, a window-level linear program yields a signed reduced-reward score that is KKT-consistent with the LP optimum under optimal prices and primal-feasible tie allocation. On 88 extended Qwen prompts, complete W2, W3, and W4 instances quantizing all 6,144 expert blocks incur mean $\Delta$NLL of $0.9437$, $0.1832$, and $0.0513$. Under the same population and $\tau=0.1513$, FWP allocation reaches a $1.284\times$ offline model-based multiplier versus $1.253\times$ for request-agnostic mixing and $1.000\times$ for static W4, an incremental $2.5\%$ relative FWP gain.
Read the full abstract

Robotics

STAR: Sparse Tactile Representation Learning in Vision-Tactile-Language-Action Models for Dexterous Manipulation

Dexterous manipulation requires coordinated multi-finger control and effective tactile feedback, yet learning these capabilities remains challenging due to the lack of large-scale real-world data and the difficulty of extracting effective representations from sparse tactile signals. We build a robot platform and teleoperation system to collect a 200-hour bimanual dexterous manipulation dataset with synchronized visual, tactile, and language annotations, comprising 10,576 trajectories across 65 tasks, 69.5% of which involve dexterous multi-finger manipulation. We further propose STAR, an integrated training recipe for vision-tactile-language-action (VTLA) models that addresses the spatial, temporal, and informational sparsity of tactile signals through visual-tactile joint pre-training, sparse-global tactile token representation, and sparse future tactile prediction. Trained on this dataset, STAR achieves a 61% average success rate across four real-world tasks with 100 post-training trajectories per task, demonstrating dexterous performance under task-specific post-training.
Read the full abstract

All authors Xiangcheng Liu, Tianhao Wu, Le Zheng, Yidong Wang, Bowen Jiang, Mingjie Pan, Xinlin Ren, Yi Liu, Jianlan Luo

Spectral Theory

Residues of weighted dynamical Ihara zeta functions on finite regular graphs

A weighted dynamical version $\mathbf{Z}_f$ of the classical Ihara zeta function is presented on connected finite regular graphs, expressed in terms of weighted periodic orbit data. We establish its meromorphic continuation, with poles given by the resonances of the associated non-backtracking transfer operator acting on a suitable Banach space, and compute its residues. At simple spectral parameters, the residue of $\mathbf{Z}_f$ is identified with the invariant Ruelle distribution on the graph phase space. Combining this result with a relation obtained by Arends-Palmirotta, we further derive Patterson-Sullivan and Wigner residue formulae. This provides a finite-graph analogue of residue formulae for weighted dynamical zeta functions for geodesic flow on rank one locally symmetric spaces, in the spirit of Schütte-Barkhofen-Weich.
Read the full abstract

Quantum Physics

Relative entropy representations via tracial joint spectral measures

We show that for positive semidefinite $A$ and $B$ the relative entropy can be written as $D(A\|B)=2\int a\log(a/b)\,\mathrm{d}\mu_{A,B}(a,b)$, where $\mu_{A,B}$ denotes Heinävaara's tracial joint spectral measure. This allows us to obtain a unified derivation of several known integral representations of relative entropy from scalar equalities. Scalar inequalities can be used in the same way to derive Pinsker-type bounds. We further show that the testing curve $t\mapsto \mathrm{tr}[A-tB]_+$ is piecewise affine exactly when $A$ and $B$ commute, which is equivalent to their testing region being a polygon. This gives a characterization of noncommutativity through the curvature. As further applications, we derive inequalities for relative entropy variance and the loss of relative entropy under positive trace-preserving maps.
Read the full abstract