Peer Revenue Equity in science

Papers

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

All of arXiv

Friday 28 August

Sound

Is Prosody Lost in Translation? Fine-Grained Cross-Lingual Prosody Similarity Across Languages

Prosody plays an important role in speech translation, conveying information such as emphasis, emotion, and intent beyond lexical content. However, despite recent progress in expressive speech-to-speech translation (S2ST), little is known about how prosodic patterns are similar/different across languages. Understanding these cross-lingual similarities and differences is crucial for effectively incorporating prosody into expressive S2ST systems. In this work, we present the first fine-grained cross-lingual analysis of prosody using multilingual dubbing data across English-German, English-Spanish, and English-French language pairs. We analyze the similarity of pitch, energy, and temporal feature patterns between source and target speech and investigate the linguistic and alignment-related factors affecting this similarity. Our analysis reveals inherent cross-lingual correlations in prosodic structure between certain languages. The findings provide important insights into the transferability of prosody across languages and offer empirical guidance for future expressive speech-to-speech translation systems.
Read the full abstract

All authors Haopeng Xie, Ismail Rasim Ulgen, Sofia Son, Berrak Sisman, Philipp Koehn

Artificial Intelligence

Beyond Uncertainty Reduction: Calibrated Planning for Interactive Diagnosis

Interactive medical diagnosis requires an agent to gather patient evidence through sequential questions before committing to a diagnosis. Large language models (LLMs) now make such consultations feasible, and existing approaches typically select questions by how much they reduce uncertainty among candidate diseases. However, this objective is insensitive to the unequal clinical costs of diagnostic errors and omitted severe alternatives, so minimizing uncertainty need not minimize final diagnostic loss. To bridge this gap, we propose CaRDI (Calibrated Risk for Diagnostic Interaction), a planning framework built around a clinical loss combining primary diagnosis error with severity-weighted differential omission. Diagnostic and safety beliefs estimate the two loss components, while conformal residual calibration corrects for underestimation from partial evidence. The calibrated risk then guides question selection and stopping by balancing expected risk reduction against interaction cost. Experiments on multiple medical benchmarks show that CaRDI improves accuracy while requiring fewer questions. Further analysis shows that replacing entropy with clinical risk as the planning objective reduces clinical loss by 21.5% and decreases severe omissions. Our code is available at https://anonymous.4open.science/r/CaRDI-A940/.
Read the full abstract

All authors Yue Zhou, Haiyang Zhou, Jin Zhang, Kong Wang, Zihao Rao, Maolin Wang, Hanwen Du, Youhua Li

Analysis of PDEs

Strichartz estimates to fractional Schrödinger equations

In this paper, we firstly study Strichartz estimates $\|e^{it D^\alpha} u_0\|_{L_t^q(\mathbb{R};L_x^r(\mathbb{R}^d))}\leq C(d,\alpha,q,r,s)\|u_0\|_{\dot{H}^s}.$ We show some counterexamples for $(q,r) = (2,\infty)$. Then we consider the embedding $X^{s,b}_\alpha \hookrightarrow L_t^q(\mathbb{R};L_x^r(\mathbb{R}^d))$, where $\|u\|_{X_\alpha^{s,b}}:=\|\langle\xi\rangle^s\langle \tau-|\xi|^\alpha\rangle^b\hat{u}(\tau,\xi)\|_{L^2_{\tau,\xi}}$. We present the necessary and sufficient conditions for this embedding.
Read the full abstract

Plasma Physics

Reinforcement-learning control of turbulence transition in the modified Hasegawa-Wakatani system

Control of plasma turbulence remains a long-standing challenge in magnetically confined fusion research. Here, we explore a reinforcement-learning (RL) approach for bidirectional control of the turbulence-zonal-flow transition in the modified Hasegawa-Wakatani system, a minimal model of electrostatic drift-wave turbulence. Within our model, a weak zonal drag damps the otherwise long-lived zonal structures, giving them a finite lifetime and restoring the drive-damping balance required for repeatable transitions within finite control episodes; meanwhile, actuation is applied through a spatially distributed Gaussian source field under a time-weighted budget constraint on actuation costs. The plasma model is then coupled to CNN-based soft actor-critic and twin-delayed deterministic policy-gradient agents through a GPU-native JAX solver that is highly optimized for fast online training. In the turbulence-suppression task, the learned budget-aware schedule achieves the lowest time-integrated turbulent flux for a given consumed budget, outperforming both constant and linearly decreasing baselines across all tested unseen initial conditions. In the inverse zonal-break task, the agent discovers an up-down antisymmetric actuation pattern that induces radial $E\times B$ convection, disrupts the zonal structure, and sustains the turbulent state. A physics-informed warm-buffer initialization facilitates this discovery, as random exploration alone struggles to locate the narrow optimal manifold within the vast action space. These results demonstrate reinforcement learning as a practical trajectory optimizer for nonlinear plasma dynamics, such as turbulence control, and highlight the importance of physics guidance in such applications.
Read the full abstract

All authors Luning Sun, Ben Zhu, Xin-Yang Liu, Deepak Akhare, Jian-Xun Wang

Computation and Language

EvoHarmBench: Breaking Content Moderation with Iterative Human-Like Evasion

Existing evaluations of harmful content detection rely predominantly on static benchmarks, which struggle to reflect the interactive adversarial ecosystem of real-world content platforms where users continuously revise their expressions in response to moderation feedback. This mismatch creates a significant performance gap between offline benchmark scores and online deployment effectiveness. To the best of our knowledge, we present EvoHarmBench, the first dynamic adversarial evaluation framework for content moderation systems. The framework employs an iterative optimization loop that evolves evasion strategies at the semantic-cluster level, while simultaneously optimizing for evasion success and human readability. We systematically evaluate LLM-based defense models which are widely used in real world moderation systems. The evaluation covers 229 semantic sub-clusters across five violation categories, derived from 5,002 real-world adversarial samples collected from content platforms. Our experiments reveal substantial vulnerabilities even in leading commercial systems: after twelve optimization iterations, the attack success rate under readability constraints reaches 80.3% within SOTA LLM moderators. We will release the full benchmark data, evaluation framework, and code to encourage a shift from static benchmarking toward dynamic adversarial evaluation in content safety research.
Read the full abstract

All authors Ruijie Jian, Benlei Cui, Ting Ma, Haidong Ding, Kangwei Liu, Ziwen Xu, Longtao Huang, Hui Xue, Ziqiang Zhu, Junjie Li, Haiwen Hong

Computation and Language

Synthetic Linguistic Agency: How an Embodied Mortal Agent Learns Linguistic Affordances through Consequential Social Experience

Contemporary language models can converse fluently and influence human decisions, yet their exchanges do not enter a continuing, vulnerable life of their own. Linguistic-agency theory identifies this missing connection as linguistic agency and characterizes it through embodiment, linguistic participation, and precariousness: a body that acts and bears consequences, interaction that changes both agent and partner, and a future that can be sustained or lost. Two coordinated studies examine how this organization can appear in artificial systems. First, we translate these relations into inspectable criteria for Synthetic Linguistic Agency (SLA) and identify several existing SLA systems. Second, building on Homeostatically Regulated Reinforcement Learning, we develop a mortality-grounded linguistic-reinforcement-learning model and instantiate it in an Embodied Mortal Agent (EMA). The EMA learns how ways of speaking change a partner's willingness to protect it and chooses expressions by considering what those responses mean for its remaining life. Controlled experiments show that linguistic choices depend on the EMA's body and social history, change partner behavior, and adapt through experience with particular partners. When bodily consequences persist, linguistic choices alter the future of the same life; when the body is reset, their social effects remain but no longer shape continued viability. The resulting EMA exhibits SLA under our operational definition. This work motivates further research on synthetic empathy and strategic human-AI interaction: how artificial agents with persistent bodies, histories, and futures might develop and express empathy, and how people might care for, negotiate with, or govern them.
Read the full abstract

Human-Computer Interaction

Guidelines Are Not Rules: Characterizing Terminologies around Visualization Design Guidelines

A common expectation in visualization research is that outcomes recommend how researchers and practitioners take action or make design decisions. We often express these as "guidelines." Yet, the term "guideline" is both ambiguous and loosely defined, and what one researcher considers a guideline may be too broad, too loose, or too strict for another. We take a closer look at a broader set of terms that can express desirable results around visualization research, and untangle how these words are understood in the community in relation to other similar terms. We base our work on an exploratory study with experts, followed by a crowdsourcing study with a separate mapping phase (n=30) and rating phase (n=42) targeting input from the broader visualization community, and an analysis of the use of terminology in 3,877 IEEE VIS papers published from 1990 to 2024. Based on our findings, we call for more nuanced, precise discussions of research outcomes and their communication to the broader community, including practitioners and students.
Read the full abstract

All authors Anna L. Chinni, Md Dilshadur Rahman, Bon Adriel Aseniero, Petra Isenberg, Kushin Mukherjee, Ghulam Jilani Quadri, Paul Rosen, Karen B. Schloss, Daniel Weiskopf

Analysis of PDEs

Fractional and anisotropic Gagliardo–Nirenberg inequalities with applications

In this article, we first investigate the necessary and sufficient conditions on the ranges of $s,s_1,s_2\in R$, $1\leq p_1,p_2,q\leq \infty$, $\theta_1,\theta_2\geq 0$ for the validity of the fractional Gagliardo–Nirenberg inequalities $$\|D^su\|_{L^q(R^d)}\lesssim \|D^{s_1}u\|_{L^{p_1}(R^d)}^{\theta_1}\|D^{s_2}u\|_{L^{p_2}(R^d)}^{\theta_2}.$$ Secondly, we consider the anisotropic Gagliardo–Nirenberg inequalities $$\|u\|_{L^q(R^d)}\lesssim \|u\|_{L^{p_0}(R^d)}^{\theta_0} \prod_{j=1}^n\|D_{x_j}^{s_j}u\|_{L^{p_j}(R^d)}^{\theta_j}.$$ We show the sharp conditions of these inequalities except “one" case. Finally, we establish the profile decomposition associated with the above inequalities when $p_j = 2$, $0\leq j\leq n$. Using these results, we establish existence of extremizers and construct soliton solutions of relevant dispersive equations.
Read the full abstract

Artificial Intelligence

An Empirical Evaluation of Cross-City POI Recommendation on a Large-Scale Benchmark

Cross-city point-of-interest (POI) recommendation is crucial for navigating unfamiliar urban environments, yet its progress has historically been constrained by data limitations. Using the recently proposed large-scale benchmark Trip World, we empirically re-examine whether conclusions drawn on small prior benchmarks still hold under worldwide coverage, low home-destination region overlap, and large, semantically rich POI inventories. Our evaluation surfaces three bottlenecks of representative state-of-the-art methods: (1) hometown-aware models appear to rely more on destination-region priors than on user-specific preference transfer; (2) their accuracy-efficiency trade-off degrades at this scale, where the simplest model is among the strongest; and (3) existing mechanisms for integrating semantic metadata yield little benefit. We further include a diagnostic pilot on agentic methods adapted from next-POI recommendation, finding that naive adaptation trails a simple popularity prior even though the relevant semantic signal is present in the data. These results highlight the need for task-specific designs that support cross-city preference transfer, semantic grounding, and scalable reasoning over unseen destination inventories.
Read the full abstract

All authors Peibo Li, Yang Song, Hao Xue, Maarten de Rijke, Flora D. Salim

Artificial Intelligence

KLOD: Locality-Preserving Knowledge Editing via Non-Target Distribution Preservation

Fine-tuning-based knowledge editing is simple and architecture-agnostic, but standard cross-entropy increases the edited target probability without explicitly constraining changes in the non-target output distribution. In sequential editing, such unconstrained redistribution can accumulate as distributional drift and contribute to locality degradation. We propose KLOD, a bounded and distribution-preserving objective for fine-tuning-based knowledge editing that separates the intended target update from distributions that should remain stable. KLOD stops target amplification once a probability threshold is reached, while preserving the target-excluded non-target distribution at target positions and the full next-token distribution at prefix positions. Experiments on CounterFact and ZsRE with Llama3-8B-Instruct and Qwen2.5-7B-Instruct show that KLOD substantially mitigates locality degradation while maintaining high edit reliability. The target probability threshold further provides a controllable Generalization–Locality trade-off. Ablation, multi-seed, and distributional KL analyses support the interpretation that KLOD's locality gains are associated with preserving output distributions rather than simply weakening the edit. Code is available on GitHub https://github.com/Hostoday/KLOD .
Read the full abstract

Systems and Control

Observability Analysis for Fusion of Doppler Measurements in Multistatic Radar Near the Tx-Rx Baseline

This paper studies multistatic measurement fusion when a target lies within the Tx–Rx (Transmitter-Receiver) baseline ambiguity zone, with particular emphasis on configurations involving two closely spaced stationary Tx–Rx pairs. Such configurations provide overlapping detectable regions and extend the effective detection range compared with sparsely spaced multistatic systems. However, in this region, the accuracy of range and bearing measurements degrades rapidly, and Doppler measurements often remain the only reliable information source. As a result, target trajectory estimation becomes highly challenging, with observability being marginal or even completely lost. To address this problem, the observability of target trajectories is analyzed under various conditions, enabling system designers to assess system performance in advance. A Doppler-only measurement fusion approach is then developed, employing a multiple-initial-point Maximum Likelihood (ML) nonlinear estimator for initial state estimation, followed by dynamic state updates using an Extended Kalman Filter (EKF). Simulation results are presented and shown to be consistent with the observability analysis.
Read the full abstract

Signal Processing

Enabling Secure Wireless Communications for FARIS-Aided Systems

This paper investigates secure downlink transmission assisted by a fluid active reconfigurable intelligent surface (FARIS), which enables both active reflection and dynamic port selection, offering enhanced flexibility for physical-layer security. We formulate a secrecy rate maximization problem that jointly optimizes the transmit beamformer, active reflection coefficients, and fluid port configuration under practical power constraints. To efficiently handle the resulting highly nonconvex problem, we develop a tailored alternating optimization (AO) framework that decomposes the original joint design into tractable subproblems, where each admits an efficient solution while preserving the system constraints, enabling an effective joint optimization of beamforming and FARIS reconfiguration. Numerical results demonstrate that the proposed FARIS-assisted design consistently outperforms the benchmarks. The results further highlight the robustness of FARIS against unfavorable eavesdropping geometries, confirming its potential as a powerful enabler for secure communications in challenging environments.
Read the full abstract

All authors Hong-Bae Jeon, Yonghwi Kim, Hyung-Joo Moon, Kai-Kit Wong

Cryptography and Security

FISGuard: Defending Against Membership Inference via Fixed Input Subspaces

As large language models are increasingly adopted in federated learning, protecting user privacy while performing parameter-efficient fine-tuning on distributed private data has become an important challenge. Although clients only share gradients instead of directly uploading raw data, the shared gradients may still leak membership information about training samples. ProjRes (S&P, 2026) further increases this risk: with less information and without accessing model outputs, an attacker can effectively distinguish members from non-members solely based on the projection residual between a candidate representation and the subspace induced by server-observable gradients. Existing defenses against membership inference mostly rely on gradient perturbation or regularization, which can not only degrade model utility but also fail to effectively defend against the membership inference attack introduced by ProjRes, which exploits the geometric structure of gradients. To address this issue, we propose FISGuard, a lightweight defense. Its key idea is to construct and fix a low-dimensional representation subspace using independent public data, thereby restricting the space through which private representations are exposed via gradients while preserving the primary information required for downstream tasks. This substantially reduces the projection-residual discrepancy between members and non-members. We evaluate FISGuard against five representative defense methods across three NLP datasets, two LLMs, and two fine-tuning strategies, Adapter and LoRA. The results show that FISGuard reduces the ProjRes attack AUC to near the random-guessing level of 0.5 in most settings, while maintaining downstream task performance close to that of the undefended model and introducing only limited computational overhead, thereby achieving a favorable privacy–utility trade-off.
Read the full abstract

Signal Processing

Robust Joint Beamforming and Configuration Design in FARIS-Aided Systems

In this paper, we propose a robust transmission design for multi-user systems assisted by a fluid active reconfigurable intelligent surface (FARIS), which enables both active reflection and dynamic port selection and thereby offers enhanced flexibility, under imperfect channel state information (CSI). We formulate a robust minimum sum-rate maximization problem by jointly optimizing the base station beamformer, the utilized FARIS coefficients, and the active element selection, while explicitly accounting for CSI errors and practical power constraints. The resulting problem is inherently nonconvex due to the coupled optimization variables and discrete port-selection structure. To tackle this challenge, we first reformulate the original problem via a weighted minimum mean square error (WMMSE) approach and then devise an alternating optimization (AO) framework, where each resulting subproblem admits efficient solutions and the overall algorithm converges to a stationary point. Simulation results demonstrate that the proposed robust FARIS scheme consistently outperforms conventional designs, highlighting the effectiveness of jointly leveraging degree-of-freedom (DoF) enhancement and active signal amplification under CSI uncertainty.
Read the full abstract

All authors Hong-Bae Jeon, Yonghwi Kim, Hyung-Joo Moon, Kai-Kit Wong

Algebraic Geometry

On Frobenius rigidity for motivic cohomology

We study how motivic and étale motivic cohomology of a smooth and proper variety changes under extensions of algebraically closed base fields $k$. With finite coefficients, motivic cohomology is independent of $k$, and étale motivic cohomology is independent of $k$ away from the characteristic, but depends on $k$ at the characteristic. We then consider the fiber of $F-1$ for $F$ the Frobenius, on motivic cohomology and étale motivic cohomology for varieties defined over finite fields. We show that this fiber is independent of $k$ with finite coefficients. In addition, we give some results and examples with integral coefficients.
Read the full abstract

Cell Behavior

Hydrodynamic theories of chemotaxis-driven invasion in proliferating cell populations

Biased migration up chemical gradients and proliferation are fundamental drivers of collective invasion in several biological processes ranging from embryonic morphogenesis to cancer. Nonetheless, our understanding of how their interplay yields distinct invasion patterns remains incomplete. In this work, we propose a multiscale framework to systematically derive macroscopic hydrodynamic theories of cell invasion from a mesoscopic description of cells as biased self-propelled, interacting particles that proliferate. Our framework reveals how clump and stream invasion patterns emerge from the same kinetic equation under different asymptotic regimes of cell proliferation. Stream invasion is characteristic of cell populations in which proliferation balances cell motion. In contrast, clump invasion requires a separation of the hydrodynamic timescale of motion and the slower timescale of proliferation. By means of a multiple-scale approach, our analysis reveals that clump invasion is described as a slow evolution through a family of mass-dependent travelling-wave solutions. Overall, our work offers a novel approach to investigate multiscale regulation of cell invasion in systems where cell proliferation and collective invasion evolve on distinct timescales.
Read the full abstract

Operator Algebras

Isometries of Haagerup–Schultz algebras

We establish a version of the classical results concerning descriptions of isometries on $C^*$-algebras and noncommutative $L_p$-spaces due to Kadison (1951) and Yeadon (1981) in the setting of Haagerup–Schultz algebras. Precisely, we show that (not necessarily surjective) isometries on such algebras are necessarily implemented by partial isometries and trace-preserving Jordan $^*$-monomorphisms.
Read the full abstract

All authors Jinghao Huang, Karimbergen Kudaybergenov, Fedor Sukochev, Bing Yan

Artificial Intelligence

RealSWE: A Compositional Evaluation of Coding Agents under Realistic User Requests

Coding agents are now commonly evaluated on the SWE-bench family of benchmarks, whose tasks are built from curated GitHub issues: long, structured, and information-rich. Real user requests, however, are typically far shorter and less structured. To characterize this gap, we define a six-category information taxonomy and four dimensions of linguistic style, and apply them to real user prompts from SWE-chat and problem statements from SWE-bench Verified and Pro. We find that requests carrying only a problem statement, alone or with limited additional context, account for 88% of real prompts but just 7% of benchmark problems. Furthermore, 87% of real prompts are casually written whereas 94% of benchmark problems are formal. Guided by these observations, we introduce RealSWE, 381 multi-variant task families derived from SWE-bench Verified and Pro. Variants within each family share the same underlying task and gold patch while differing only in information composition and linguistic style. Evaluating seven contemporary LLMs with RealSWE, we find that i) realistic inputs reduce resolution rates by 6.4 pp on average and can change model rankings. Controlled analysis further shows that ii) including Desired Behavior and Motivation significantly affects performance, whereas Environment Information and Reproduction Steps merely add tokens without measurable benefit; iii) linguistic style has only small, model-dependent effects. These findings provide actionable guidance for users and agents: explicitly stating the desired behavior and motivation, which most real prompts omit, substantially improves the LLM's software engineering performance.
Read the full abstract

All authors Gyuhyeong Kim, Hyojung Gwon, Jeonghyeon Kim, Kyuhong Shim, Sunjae Lee

Cosmology and Nongalactic Astrophysics

A Unified Tracer Analysis of DESI DR2 Baryon Acoustic Oscillations

We improve upon previous efforts to optimally combine overlapping galaxy samples in the Dark Energy Spectroscopic Instrument (DESI) baryon acoustic oscillation (BAO) analysis. By weighting each galaxy by its linear bias, overlapping galaxies are combined into a single, unified catalog, naturally avoiding double counting of cosmic volume and including all auto- and cross- information at the catalog level. Improvements over the previous effort include the addition of quasars out to $z=1.6$ to account for all overlapping DR2 tracers and redshift-dependent bias treatment to improve reconstruction. We report distance measurements using this unified tracer, and find them to be highly consistent with the baseline DR2 BAO analysis. We also test for tracer-dependent systematics within the DESI data, and find no evidence of tracer-dependent systematics within $0.8<z<1.6$. Finally, we take advantage of the unified tracer to rebin the analysis in redshift in order to more finely resolve the redshift-to-distance relation. Dynamical dark energy results on this finer redshift binning indicate that there is no missed feature in the expansion history in the redshifts $0.8<z<1.6$, and reproduces DESI's preference for an evolving dark energy equation of state.
Read the full abstract

All authors N. Sanders, H. Seo, M. Rashkovetskyi, U. Andrade, D. Valcin, E. Paillas, P. McDonald, J. Aguilar, S. Ahlen, O. Alves, E. Armengaud, A. Aviles, F. Beutler, D. Bianchi, D. Brooks, A. Carnero Rosell, E. Chaussidon, T. Claybaugh, S. Cole, A. Cuceu, A. de la Macorra, Biprateep Dey, Z. Ding, P. Doel, S. Ferraro, A. Font-Ribera, D. Forero-Sánchez, J. E. Forero-Romero, E. Gaztañaga, Satya Gontcho A Gontcho, A. X. Gonzalez-Morales, G. Gutierrez, C. Hahn, H. K. Herrera-Alcantar, K. Honscheid, S. Juneau, T. Karim, D. Kirkby, A. Kremin, O. Lahav, C. Lamman, M. Landriau, L. Le Guillou, M. Manera, A. Meisner, R. Miquel, J. Moustakas, A. Muñoz-Gutiérrez, S. Nadathur, J. A. Newman, H. E. Noriega, N. Palanque-Delabrouille, W. J. Percival, F. Prada, I. Pérez-Ràfols, C. Ravoux, A. J. Ross, G. Rossi, L. Samushia, E. Sanchez, C. Saulder, D. Schlegel, M. Schubnell, J. Silber, M. Siudek, G. Tarlé, M. Vargas-Magaña, B. A. Weaver

Mathematical Physics

Difference equations of average entropies

Exact cumulants of entanglement entropies of random state ensembles have traditionally been studied within the random matrix framework. In this work, we propose an alternative approach based on the intrinsic connection to integrable systems. The central idea is to embed entropic quantities into tau functions satisfying Toda-type lattice equations, which in turn yield linear difference equations for their averages. Directly solving the difference equations recovers exact entropy formulas in the literature. The integrable systems approach bypasses the case-by-case, ensemble-dependent derivations required by random matrix methods. The approach also suggests a possible route towards unified and more efficient higher-order cumulant calculations by exploring integrable hierarchies.
Read the full abstract

All authors Youyi Huang, Linfeng Wei, Lu Wei, Peter J. Forrester

Probability

Scaling limit of the 3D abelian Yang–Mills Langevin dynamics

We study the continuum scaling limit of the Langevin dynamics for three-dimensional U(1) lattice Yang–Mills theory. The model is defined on the discrete 3D torus with a general class of plaquette actions that are suitably normalized, including Wilson, Manton, and Villain actions. Under the weak-coupling scaling and in the DeTurck gauge, we prove that the rescaled logarithmic field converges to the solution of the one-form stochastic heat equation in probability. In particular, the limiting dynamics are universal and do not depend on the higher-order details of the plaquette action.
Read the full abstract

Operator Algebras

Group actions on von Neumann algebras with compact open subgroups

We study strictly outer actions of locally compact groups with a compact open subgroup on von Neumann factors. For amenable groups, we prove 2-cohomology vanishing and obtain classification results using a description of the central sequence algebra and Rohlin-type observations. We also characterize the inclusions of factors associated with group actions, and extend M. Choda's result to this locally compact setting.
Read the full abstract

Information Retrieval

Personalized and Multi-View Representation for Federated Cold-Start Recommendation

Federated recommendation (FedRec) enables personalized modeling without centralizing users' interaction histories, but most existing methods assume a fixed item pool and thus overlook the practical cold-item setting where new items continuously arrive. Under the dual-sided constraint, where the server cannot access clients' interactions while clients cannot access the server's proprietary item attribute features, prior federated cold-start recommendation approaches suffer from three structural limitations: a lack of personalization, compositionality failure caused by forcing heterogeneous semantics into a single embedding space, and training- and communication-inefficiency arising from explicit alignment between separate collaborative and attribute representations. To address these challenges, we propose Personalized and Multi-view Representation for Federated Cold-Start Recommendation (PMFRec). PMFRec learns a personalized representation generator to produce user-specific item representations from attribute features, and introduces a global multi-view encoder with item-adaptive gating and an orthogonality objective to capture complementary semantic views while reducing cross-view redundancy. In addition, PMFRec fuses collaborative and attribute knowledge into a single exchanged item representation, eliminating the need for an explicit client-side regularizer and reducing communication overhead. Extensive experiments on real-world datasets show that PMFRec consistently outperforms strong baselines in cold-item recommendation and further improves user-level fairness, warm-scenario adaptability, and robustness under Local Differential Privacy (LDP).
Read the full abstract

All authors Jaehyung Lim, Wonbin Kweon, Woojoo Kim, Junyoung Kim, Dongha Kim, Hwanjo Yu

Biological Physics

RNA-like Polyelectrolyte in a Viral Capsid: Molecular Dynamics with Explicit Electrostatic Interactions

The organization of RNA genomes within viral capsids is primarily controlled by electrostatic interactions between the negatively charged genome and positively charged N-terminal domains of coat proteins. In theoretical approaches, these interactions are commonly captured by mean-field models that smooth capsid charge over the inner surface and treat ionic screening as a continuum. However, charges are localized at discrete N-terminal binding sites and ionic screening arises from correlated ion distributions. Here we use molecular dynamics simulations with explicit ions, explicit water, and full Coulomb electrostatics to simulate a linear polyelectrolyte confined within a model capsid bearing discrete N-terminal-like charge sites. We first validate our approach by simulating a polyelectrolyte in bulk solution and demonstrating that persistence length decreases with increasing salt, matching experimental measurements for single-stranded RNA. When confined within a capsid, radial density profiles shift systematically inward from the capsid wall with increasing salt concentration, in agreement with mean-field predictions. By independently varying charge magnitude, binding-site density, and N-terminal protrusion length, we show that total electrostatic coupling governs global organization while geometric details modulate local genome-wall contact and angular genome organization near N-terminals (within the T=3 architecture, linear genome topology, and monovalent salt range studied here). Across all simulations, equilibration times increase sevenfold with salt, revealing kinetic effects inaccessible to equilibrium theory. These results validate continuum approximations for radial organization while revealing deviations arising from discrete molecular details and establishing a framework for future investigations of genome secondary structure, capsid geometry, and assembly kinetics.
Read the full abstract

Artificial Intelligence

Evidential-Based Higher-Order Set Argumentation Framework

Evidential argumentation extends Dung's abstract argumentation by requiring arguments and interactions to be backed by chains of evidence rooted in prima-facie elements. However, existing formalisms lack a unified treatment of evidential support, higher-order relations (attacks and supports targeting arbitrary elements), and collective interactions (sources as sets). In this paper, we introduce the Evidential-Based Higher-Order Set Argumentation Framework (EHSAF), which conservatively generalises several existing frameworks within a single expressive setting. We develop two complete semantics for EHSAFs: an adjacent complete labelling semantics that admits multiple truth values (true, false, undecided) for arguments in support cycles, reflecting an open epistemic attitude toward future evidence; and an extension-based complete semantics that follows a strict evidentialist stance, accepting only arguments with well-founded support chains. We show that these two semantics diverge in the presence of support cycles, and prove their equivalence under support-acyclicity. To enable computational reasoning, we provide a normal propositional encoding of EHSAFs and prove that, in three-valued Łukasiewicz logic, its models correspond precisely to the adjacent complete labellings. We further extend this encoding to continuous fuzzy logics (Gödel, Product, and Łukasiewicz), defining a continuous fuzzy normal encoded semantics. We establish that this fuzzy semantics satisfies key properties—continuity, monotonicity, boundary conditions, and solution existence—and that its ternarisation recovers the adjacent complete labellings under natural t-norm conditions. Our framework thus unifies expressive argumentation with principled three-valued and fuzzy semantics, bridging the gap between qualitative and quantitative reasoning about evidence.
Read the full abstract

Mesoscale and Nanoscale Physics

Subcritical bifurcation and on-off bistability in ballistic polariton condensates

Dynamics of exciton-polariton condensates under continuous-wave incoherent Gaussian optical pumping is considered. It is shown that the conventional supercritical Stuart-Landau picture is invalid in a certain domain of the parameter space. For strong polariton repulsion from the reservoir and relatively small pump spots, the dynamics is adequately described by the quintic Stuart-Landau equation. The corresponding subcritical pitchfork bifurcation leads to condensate formation, accompanied by bistability between the trivial and nontrivial states over a finite pump-power range and a one-bit memory. Further increase of the repulsion parameter or decrease of the spot size breaks down the perturbative approach and leads to a peculiar self-trapping regime with complex dynamics. Experimental evidence of the emergence of the proposed behavior is provided. Our findings can be used to design polaritonic setups that exploit the predicted memory effect.
Read the full abstract

All authors Oleg I. Utesov, Soohong Choi, Pavel Kozhevin, Min Park, Daegwang Choi, Hyungdo Lee, Alexey N. Osipov, Alexey V. Yulin, Se Kwon Kim, Yong-Hoon Cho, Igor S. Aranson, Hyoungsoon Choi, Anton V. Nalitov, Sergei V. Koniakhin

Databases

DBRepro: Automated Database Synthesis via a Hybrid Constraint-Solving Approach for Reproducing Slow Queries

Slow queries frequently cause severe performance bottlenecks in database management systems. Diagnosing their root causes online risks exacerbating resource contention, while data privacy regulations often prohibit copying production data to test environments. Synthesizing a proxy database from non-intrusive metadata that induces the query optimizer to generate the same physical execution plans is therefore critical for offline diagnosis. High-fidelity reproduction requires preserving global statistical distributions while enforcing exact local cardinalities. Existing data-driven and workload-aware approaches cannot satisfy both requirements simultaneously. We present DBRepro, an automated end-to-end framework that formulates database generation as a constrained distribution synthesis problem. DBRepro initializes a global distribution from lightweight column statistics, extracts execution constraints from target queries, and progressively adjusts the distribution to satisfy these constraints while preserving the global distribution. Experiments on TPC-H and SSB show that DBRepro reduces cardinality error by up to 20.3% over a data-driven baseline while maintaining identical plan consistency. Compared with a workload-aware baseline, it reproduces 15% more consistent execution plans and reduces latency proportion error by 21.5%. We further validate DBRepro on a nearly 1 TB real-world dataset managed by KingbaseES, where it reproduces the execution performance of complex slow queries with high fidelity.
Read the full abstract

All authors Zhaoyang Zhang, Shuang Liu, Dengfeng Xu, Wei Lu, Jianquan Leng, Sheng Du, Xiaoyong Du

Machine Learning

How do features act in an individual prediction? Separating standalone and interaction effects with a case-based taxonomy

Local explanation methods such as SHAP and LIME summarize each feature with a single attribution score, and interaction indices quantify how strongly features interact. Neither tells a user how a feature acts in a given prediction: whether its effect is the same alone and in context, or whether the other features amplify it, make it unnecessary, switch it off or reverse it. We extend case-based feature importance (CBFI), originally a global method, to individual predictions. Evaluating the model in four hybrid states per background sample decomposes the in-context importance of a feature into a standalone and an interaction effect, and a case taxonomy labels each feature of an instance as inactive, standalone, amplified, redundant, gated or reversed. We compare the method with k-SII, TreeSHAP interaction values and the H-statistic on synthetic functions, and study eight real tabular datasets with six model families. On the true functions, the decomposition recovered interactions exactly (correlation 0.99 with the analytic local interaction). On fitted models, pair recovery was slightly below that of dedicated indices (local precision@k 0.86-0.91 versus 0.91-0.95). Interaction values alone could not distinguish substitution from gating, whereas the taxonomy identified both without knowing the partner (accuracy 0.74-0.76); applied to Shapley interaction values, it performed comparably. On real data, 45-57% of feature pairs with nearly identical SHAP values received different labels, and in a medical-insurance model the method showed that the interaction component of smoking changes sign at a body-mass index of 30. Localized CBFI does not detect interactions more accurately than existing indices; what it adds is a decomposition into standalone and interaction effects and a label stating how each feature acts.
Read the full abstract

Chemical Physics

Resolving Spin-Phonon Relaxation Pathways in Molecular Qubits via Regularized Regression

Designing molecular qubits requires controlling the spin-lattice relaxation pathways that fundamentally limit the coherence time. For spin-1/2 molecular qubits, significant discrepancies remain between theoretical predictions and experimental measurements of spin-phonon relaxation pathways, with theory often overestimating the role of low-frequency vibrational modes. Here, we present an alternative first-principles approach augmented with regularized regression that identifies spin-phonon relaxation pathways in an automated fashion without ad hoc mode selection. Applied to Cu porphyrins spin-1/2 molecular qubits, the method successfully reproduces experimental trends in relaxation times and predicts the curvature in the relaxation-vs-temperature profile. The g-tensor time series reveal distinct system-specific autocorrelation functions and spectral-density profiles despite the qubits' structural similarity. Further, regression between g-tensor time series and mode-projected vibrational-amplitude time series obtained from molecular dynamics yields linear and bilinear mode coupling contributions to each g-tensor component. Because the method is based on atomic displacements sampled directly from molecular dynamics, it naturally incorporates anharmonic effects and does not require the harmonic approximation. This framework puts forward a regression-driven, mode-resolved, and coupling-order-separated spin-phonon analysis as a general strategy for predicting and engineering longer-lived molecular qubits.
Read the full abstract

Databases

ANCHOR: A Vision for Secure Persistent Key-Value Stores in Disaggregated Data Centers

Persistent key-value stores (PKVS) are increasingly deployed in disaggregated settings that split compute, memory, and storage across separate server pools. This shift redraws the trust boundary: data that would remain within a single machine is now transported, cached, and rewritten across multiple hosts, expanding exposure to both network attackers and intra-infrastructure adversaries. This paper presents ANCHOR, a vision for end-to-end integrity and freshness in disaggregated PKVS. ANCHOR proposes a two-part semantics-aware architecture: 1) Persistence path: ANCHOR outlines encrypting and authenticating PKVS persistent files and preventing rollback with manifest versioning. 2) Volatile path: ANCHOR treats caches, indexes, and filters as untrusted hints unless accompanied by verifiable provenance, enforced by a TEE-resident policy. Finally, we outline key invariants and discuss enclave-friendly batching and asynchronous I/O to amortize verification without undermining disaggregation's performance and elasticity benefits.
Read the full abstract

All authors Viraj Thakkar, Dongha Kim, Hokeun Kim, Zhichao Cao