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

Saturday 12 September

Machine Learning

Lie to me: Detecting Managerial Evasiveness in Earnings Calls via Conversational Audio Encoders

Earnings conference calls are a primary channel through which managers disclose information under analyst scrutiny. Prior work has linked vocal and lexical cues to future adverse outcomes, but often pools features over an entire call and underuses the interactive structure of Q&A. We propose a two-branch late-fusion framework for detecting managerial evasiveness as a predictor of extrinsic SEC events (primarily late filings): (i) an LLM-as-a-judge that maps Q&A text to an interpretable call-level vector X_text via a structured binary rubric, and (ii) a frozen conversational encoder whose temporal hidden states are read by a DeepVoice-style sequential reader to produce an audio representation h. Late fusion of (X_text, h) yields a call-level risk score p. On n=1,039 calls (212 late filings) with firm-grouped 5-fold CV, fusion reaches AUROC approx. 0.89, versus 0.55 for the text judge and 0.71 for duration alone. These results show that conversational audio dynamics encode managerial evasiveness beyond lexical content and call length, yielding a stronger early-warning signal of adverse SEC outcomes.
Read the full abstract

Optimization and Control

CyclOT: Learning Quadratic Optimal Transport Maps via Synchronized Forward-Backward Interpolants

We study the recovery of forward and reverse quadratic optimal-transport maps from unpaired samples in high dimensions. We introduce a bidirectional neural framework in which the learned maps induce forward and backward displacement interpolants, while the training objective combines bidirectional quadratic action, discriminator-restricted Jensen-Shannon endpoint objectives, and two-sided cycle consistency. The construction requires neither precomputed sample pairings nor an explicit convex-potential parameterization. For absolutely continuous probability measures supported on a compact convex set, and under the stated generator-approximation, discriminator-richness, and minimizer-attainment conditions, we prove a population recovery theorem: for every prescribed accuracy, the sum of the corresponding \(L^2\) errors between any global minimizer and the forward and reverse quadratic Brenier maps is below that accuracy, provided the discriminator level is sufficiently large and the annealing action weight becomes sufficiently small. Moreover, the cycle loss is bounded above by \(\lambda W_2^2(\mu_0,\mu_1)\). Complementary results quantify approximate invertibility and show that exact endpoint Jensen-Shannon divergence and cycle consistency control missing target mass and many-to-one map collapse, respectively. Experiments on Swiss roll, MNIST, CelebA, single-cell perturbation data, and chest X-ray images evaluate endpoint fidelity, transport cost, inverse consistency, and the geometry of the induced interpolations.
Read the full abstract

All authors Shizhou Xu, Jiachen Liu, Shih-Hsin Wang, Stefan Broecker, Yuhao Huang, Bao Wang, Thomas Strohmer

Classical Analysis and ODEs

Polynomial corners in finite fields beyond the distinct-degree case

We prove a quantitative polynomial Roth theorem for corners in \(\mathbb F_p^2\) for arbitrary pairs of linearly independent polynomials. More precisely, given a positive integer $d$, there are constants $p_0$ and $C$ (depending only on $p$) so that for every $ p>p_0$, if polynomials \(\phi_1,\phi_2\in \mathbb \mathbb{F}_p [y]\) are of degree $\leq d$ vanishing at $0$ and are not linearly dependent, then every \(A\subset\mathbb F_p^2\) with $ |A|\ge C p^{2-1/14} $ contains a nontrivial corner $$ (x_1,x_2),\qquad (x_1+\phi_1(y),x_2),\qquad (x_1,x_2+\phi_2(y)) $$ for some \(y\in\mathbb F_p^\times\). This improves the estimate $p^{2-1/16}$ of Han–Lacey–Yang and removes the distinct-degree restriction from their quantitative theorem. The main obstruction is the equal-degree resonant case, where the Jacobian argument of Han–Lacey–Yang degenerates. We adjoin the frequency-independent part of the phase to form an augmented map \(\widetilde F:W\to\mathbb A^3\) from the correlation threefold. We prove that this map is generically finite on every top-dimensional geometric component and has no two-dimensional fibre. Using the associated Artin–Schreier sheaf and Katz–Laumon estimates for Fourier transform of perverse sheaves, we obtain square-root cancellation outside an algebraic exceptional set of dimension at most one and uniformly bounded degree. A separate curve-sum argument gives uniform control on the exceptional set. An \(\ell^2\) matrix estimate adapted to such sets completes the resonant case.
Read the full abstract

All authors Ji Li, Chun-Yen Shen, Tuyen Trung Truong, Liangchuan Wu

Multiagent Systems

Learning How Much to Collaborate: Difficulty-Aware Topology Selection for Multi-Agent Code Generation

Multi-agent code-generation systems often use one communication topology for every problem. Across five topologies and 614 problems from APPS, HumanEval+ and LiveCodeBench, the advantage of hierarchical collaboration over a single agent grows from 2.4 points of pass@1 on the easiest third to 21.1 points on the hardest third, at about ten times the token cost. We propose the Difficulty-Aware Topology Selector (DATS), which predicts each topology's success probability and maximises predicted success minus cost. Its graph predictor treats topologies as nodes of a connectivity order. The complete graph-head comparison reports a 1.7-point advantage over a flat multi-label head while changing several mechanisms; capacity-matched adjacency controls show smaller descriptive differences. A scalar cost penalty can be recalibrated without retraining for approximately matched-spend comparisons when targets are attained. With a shared penalty, six methods span 21.6 percentage points of spend; two leading baselines fall behind DATS after method-specific calibration near the common target. At 40% of always-hierarchical cost, DATS reaches 77.7% pass@1 versus 73.6% for always-hierarchical and 74.3% for the strongest learned competitor. The main comparison includes Holm–Bonferroni-adjusted McNemar tests; unequal-cost differences do not imply matched-budget superiority. Backbone-specific gains are 4.07–4.23 points across four backbones. Alternatives to the 39 interpretable features, including a hybrid encoder, yield a largest observed gain of 1.3 points, with no significant pairwise improvement; this establishes neither equivalence nor an upper bound. A study on 400 mathematical reasoning problems reproduces difficulty-dependent collaboration gains, widening from 2.5 to 20.9 points.
Read the full abstract

Cryptography and Security

When Malicious Instructions Persist: Persistent Memory Poisoning Attack on Harness-Based Agents

Harness design has transformed the development of LLM-based agents by integrating memory, tool use, and runtime control. However, this design also introduces security and privacy risks because malicious instructions from external sources may be written into persistent memory and persist across sessions. To study this risk, we propose PMPA, a Persistent Memory Poisoning Attack against harness-based agents. PMPA embeds malicious instructions into benign external sources and induces the victim agent to write them into persistent memory without directly accessing to the agent framework. Once stored, the poisoned memory can be retrieved in later sessions, triggering additional malicious actions and causing privacy leakage. We evaluate PMPA on OpenClaw and Claude Code across different backbone LLMs, input modalities, and trigger scenarios. Across all settings, PMPA achieves average Injection Success Rate (ISR) and Cross-session Attack Success Rate (C-ASR) of 73.7%/ 55.5% on OpenClaw and 66.9%/ 81.7% on Claude Code, while preserving benign task performance on both systems. We further evaluate a targeted prompt-level defense and find that it can reduce memory injection in many settings, but provides limited protection once the persistent memory has been poisoned.
Read the full abstract

Commutative Algebra

Independence polynomials and the weak Lefschetz property for tadpole graphs

Let $T_{m,n}$ be the tadpole graph obtained by joining a cycle $C_m$ to a path $P_n$ by a bridge. We prove that the independence polynomial of every tadpole graph is unimodal and establish sharp bounds for its mode. The unimodality result follows from a general criterion for graphs obtained by attaching a path to a fixed vertex. Over a field of characteristic zero, we also give a complete classification of the pairs $(m,n)$ for which the Artinian algebra defined by the edge ideal of $T_{m,n}$ together with the squares of all variables has the weak Lefschetz property.
Read the full abstract

Logic

On Banach and Kuratowski Theorem and generalized strong sequences

In 1929, Banach and Kuratowski proved under CH a combinatorial theorem, which implies that there is not a non-vanishing $\sigma$-additive finite measure on $\mathbb{R}$ which is defined for every set of reals. In 2003 Bartoszyński and Halbeisen proved that Banach and Kuratowski theorem is equivalent to the existence of a K-Lusin set of the cardinality continuum an the existence of such sets is independent of $ZFC + \neg CH$. On the other hand in 1965 Efimov introduced the strong sequences method which used to prove some well-known theorems in dyadic spaces. The aim of this paper is to show that all this notions can be generalized, i.e. considered in the generalized Baire space and to show some equivalences among them. Moreover, some applications in the direction of calibres, boundedness and partitions relations are also shown.
Read the full abstract

Systems and Control

Optimal Threshold Type Policies for Partially Observable Restless Bandits

We study a finite-state partially observable restless multi-armed bandit (PO-RMAB) motivated by resource-constrained wildlife monitoring. The underlying condition of each location evolves independently, while only a limited number of locations can be actively monitored at each decision epoch. Activation reveals the current state, whereas passive operation provides no observation, yielding a collapsing-bandit belief dynamics. Our main contribution is a structural characterisation of optimal policies for the multidimensional belief-state problem. We establish sufficient conditions under which an activation advantage is monotone with respect to the belief state, and hence the optimal policy has the threshold type structure over the $(M-1)$-dimensional belief simplex. The key result is obtained by bounding the variation of the value function through a model-dependent Lipschitz constant. We further specialise the result to one-step birth-death dynamics and derive explicit bounds.
Read the full abstract

Quantum Physics

Faithful certification of steering- and incompatibility-breaking channels

We consider a quantum steering scenario where Alice prepares a bipartite state, sends one subsystem to Bob through a quantum channel, and aims to convince him that their shared state is entangled. Bob, however, will never be convinced if the channel is steering-breaking, that is, if the channel destroys steerability for any input state. To verify that a channel renders a state useless for demonstrating steering, one must consider all possible measurements performed by Alice and check if the conditional states Bob receives admit a local-hidden-state (LHS) model. This is generally a hard problem since it requires considering an infinite number of measurement combinations. Here, we show that the method proposed in [Phys. Rev. Lett. 117, 190401 (2016); Phys. Rev. Lett. 117, 190402 (2016)] can be utilized to tackle this problem. Furthermore, owing to the intimate relation between steering and measurement incompatibility, our approach can faithfully certify whether a channel destroys incompatibility for any set of measurements. Finally, we propose an experimental criterion for certifying steering- and incompatibility-breaking channels, which may be of independent interest.
Read the full abstract

Materials Science

A Direct Algebraic Approach to Normal Ordering of Exponential Bosonic Operators with Applications to Two-Dimensional Excitonic Form Factors

We develop a systematic algebraic approach, based on the Wei–Norman factorization method, to the normal ordering of exponential bosonic operators and apply it to derive analytical excitonic form factors in two-dimensional semiconducting materials. By introducing an auxiliary parameter, the normal-ordering problem is reduced to a system of ordinary differential equations determined by the commutation relations of the underlying closed Lie algebra. The approach is first illustrated for exponential operators associated with the Heisenberg–Weyl and $su(1,1)$ algebras, and is then extended to two-mode bosonic operators involving $su(2)$ and a six-generator closed algebra that contains two coupled $su(1,1)$ subalgebras. For the excitonic application, the Levi–Civita transformation maps the two-dimensional exciton problem onto an oscillator representation, providing a natural formulation in terms of bosonic creation and annihilation operators. Combined with the Laplace and Fourier representations of the Rytova–Keldysh potential, this formulation reduces the interaction matrix elements to the evaluation of exponential bosonic form factors. The isotropic problem is governed by a three-generator $su(1,1)$ algebra, whereas the anisotropic case requires the full six-generator algebra together with an additional $su(2)$ factorization. Explicit analytical expressions for both form factors, $\langle e^{-rt}\rangle$ and $\langle e^{i\mathbf q\cdot\mathbf r}\rangle$, are obtained, providing useful building blocks for matrix-element calculations in two-dimensional excitonic systems and potentially in other quantum problems involving exponential bosonic operators.
Read the full abstract

All authors Duy-Anh P. Nguyen, Ngoc-Tram D. Hoang, Dang-Khoa D. Le, Van-Hoang Le

Numerical Analysis

Adaptive moving mesh methods for isotropic/anisotropic mean curvature flow with axisymmetric geometry

This paper introduces adaptive moving mesh methods for the numerical simulation of axisymmetric mean curvature flow, addressing both isotropic and anisotropic cases. The methods are developed within the framework of the mesh equidistribution principle, where a carefully designed tangential velocity is employed to dynamically redistribute mesh points during the evolution. To accurately capture the key geometric features of the evolving interfaces, we select monitor functions based on the curvature $\kappa$, its arc-length derivative $\kappa_s$, and the squared curvature $\kappa^2$. These monitor functions can be flexibly tailored to suit different problem settings and play a vital role in determining the resulting mesh quality and numerical accuracy. Spatial discretization is performed using central finite differences, while temporal integration is handled with first- and second-order time-stepping schemes, including the BDFk ($k=1,2$) and Crank-Nicolson methods. Additionally, a Lagrange multiplier approach is incorporated into the adaptive system to enforce the underlying geometric constraint, resulting in energy-stable numerical schemes. Numerical experiments confirm the convergence and energy stability of the proposed methods. More importantly, the results clearly show that the proposed methods offer significant advantages in complex geometric evolutions: by utilizing appropriately designed monitor functions, the adaptive methods achieve dynamic redistribution of mesh points, efficiently capturing localized geometric features, significantly improving numerical accuracy, and effectively preventing mesh degeneration, particularly in anisotropic cases.
Read the full abstract

Superconductivity

Vortex rivers and multiple voltage transitions in superconducting MgB$_2$ thin films

Vortex dynamics govern the dissipation and magneto-resistive properties of type-II superconductors. At large transport currents, the current-voltage ($I$-$V$) characteristics of a superconductor in the mixed state usually exhibit a nonlinear upturn followed by an abrupt jump occurring due to a flux-flow instability. However, other transition behaviors are also possible, including the formation of phase-slip lines and normal domains. Which mechanism dominates depends on the sample uniformity, its dimensions relative to the coherence length and penetration depth, and the rates of electron energy relaxation and heat removal. Here, based on the time-dependent Ginzburg-Landau equation, we present the results of numerical modeling of the $I$-$V$ curves of superconducting films with various types of disorder. For a grain-boundary defect mesh, we find multiple voltage transitions overlaid with a nonlinear upturn of the $I$-$V$ curves. For randomly arranged elongated defects, the $I$-$V$ curves exhibit voltage steps, whereas for L-shaped defects oriented perpendicular to the transport current, the $I$-$V$ curves show extended linear regimes separated by voltage transitions. We analyze the evolution of the order parameter along the $I$-$V$ curves and discuss the experimental accessibility of the revealed dynamics regimes.
Read the full abstract

All authors Anton Pokusinskyi, Clemens Schmid, Thomas Hauet, Oleksandr Dobrovolskiy

Sound

Musical Timing in Studio Recordings

Studio recording techniques vary considerably, ranging from live recordings in a shared acoustic space, to isolated booth recording and overdubbing, where musicians record their parts separately, while listening to previously recorded material. These approaches differ in terms of physical co-presence, visual contact, sound leakage, and acoustic isolation, factors that may influence musical coordination. This study investigates whether the recording style affects timing precision; specifically, whether musicians performing together in the same space achieve tighter temporal coordination. To address these questions, two datasets with a total of 391 multi-track recordings were analyzed to measure the timing relationships between musicians. In addition, an automated sound-leakage detection method was employed to infer the recording conditions of each song: pairwise Mel-spectrogram similarities between the tracks were computed, and summary statistics from the resulting similarity matrices were used to identify recordings with shared acoustic content. The results suggest that recordings showing evidence of shared room acoustics and sound leakage tend to exhibit lower timing variability than highly isolated recordings, whereas overdubbing is associated with increased timing variability.
Read the full abstract

Solar and Stellar Astrophysics

Investigating r-Process Diversity in Mildly Metal-Poor Stars Using the Th II 5989 Angstrom Line

The origin of the heaviest elements remains a fundamental mystery, with the "actinide-boost" (Thorium overabundance) serving as a critical diagnostic of r-process nucleosynthesis conditions. While this diversity is well documented in extremely metal-poor (EMP) stars, its frequency in the mildly metal-poor (MMP) regime ($-2.0 < $ [Fe/H] $< -0.5$) is poorly constrained due to blending issues in the commonly used 4019 angstrom line. We present a systematic abundance analysis of mildly metal-poor stars, exploiting the relatively unblended Th II 5989 angstrom line. High-dispersion spectra were obtained using the 1.5 m telescope at Gunma Astronomical Observatory with GAOES, complemented by archival data from the Subaru Telescope/HDS retrieved via SMOKA. We successfully detected Th in 32 out of 42 sample stars. Our analysis demonstrates that the 5989 angstrom line is a useful diagnostic for Th abundance measurements in cool red giants. The mean [Th/Eu] ratio remains nearly constant over the MMP metallicity range, suggesting that progressive homogenization of the interstellar medium during Galactic chemical evolution would reduce abundance variations inherited from individual r-process events, or the dominant r-process events may share similar initial Th/Eu production ratios. While the [Th/Eu] ratio is nearly constant overall in the MMP regime, its dispersion appears to increase toward the metal-rich end of this regime and reaches approximately 1 dex near solar metallicity. This behavior may reflect the combined effects of variations in the initial Th/Eu production ratios of the progenitor objects, the mixing of r-process products in the interstellar medium, and the radioactive decay of Th over stellar lifetimes.
Read the full abstract

Artificial Intelligence

Map Users and Mapmakers: The Scope of Cognitive Attribution from Acquired Representations

An acquired representation can enlarge a system's cognitive repertoire without transferring the capacities exercised in producing that representation. This paper develops a framework for specifying that enlargement and its limits. Its central contribution is a five-part attribution table distinguishing effective tracking, application of acquired structures, acquisition from explicit specifications, acquisition from identifying observations, and retention and reuse. Each entry identifies a positive capacity commitment and a further claim requiring additional support. The argument deliberately grants meaningful content, causal efficacy, and productive inference, so that its conclusion does not depend on treating representations as inert encodings. Map and category examples show why even complete application competence leaves acquisition capacity undetermined, and why acquiring a criterion from its description differs from finding it in examples. Short formal proofs appear in an appendix. The framework is applied to Andrew Ng's world-model interpretation of Othello-GPT and to the specific indicators discussed in contemporary accounts of machine concepts. It preserves demonstrated recognition, classification, inference, and qualified acquisition while specifying what remains unestablished about criterion discovery and accumulation. The result concerns the scope of cognitive attribution rather than the constitutive conditions of concept possession: cognitive achievements deserve credit for the capacities they establish, without silently importing a broader repertoire through the labels attached to them.
Read the full abstract

Machine Learning

A Multi-Resolution Multi-Domain Pre-Training Framework for Universal Traffic Forecasting

Spatio-temporal traffic data are central to intelligent transportation systems, yet their heterogeneity poses significant challenges for large-scale modeling. Existing pre-trained models often rely on a homogeneous modeling paradigm to handle highly heterogeneous traffic data. This fundamental mismatch not only limits model generalization but also leads to computationally expensive and parameter-inefficient designs. To this end, we propose FlexST, a novel pre-training framework that introduces modularity and adaptivity for traffic modeling. Specifically, we first propose a multi-resolution spatio-temporal diffusion module that captures both short-term fluctuations and long-range trends, effectively reconciling inputs with divergent temporal and spatial resolutions. After that, we construct a domain-adaptive mixture-of-experts that dynamically routes data to specialized sub-networks, enabling selective knowledge transfer while preventing negative interference across diverse domains. Moreover, we devise a unified periodic encoding strategy that injects resolution- and domain-aware inductive biases to harmonize periodic inconsistencies across datasets. Extensive experiments on 23 real-world traffic datasets demonstrate that FlexST significantly outperforms state-of-the-art baselines in zero- and few-shot settings, showcasing superior generalization, adaptability and efficiency. This work offers a new direction for building general-purpose pre-trained models capable of handling the complexity and variability of urban traffic systems.
Read the full abstract

All authors Zhouyang Liu, Jindong Han, Hao Wang, Xinyue Liu, Hui Gao, Dongsheng Li, Hao Liu

Data Structures and Algorithms

Tight Hardness for Temporal Path Covers at Vertex-Cover Number Two

Temporal Path Cover (TPC) and Temporally Disjoint Path Cover (TDPC) ask for minimum-cardinality covers of a temporal digraph by temporal paths, with TDPC additionally requiring pairwise temporal disjointness. Cioni et al. proved both problems NP-hard on temporal DAGs whose underlying undirected graph has vertex-cover number three and left the vertex-cover-two case open. We resolve this question affirmatively for both problems. Using polynomial-time reductions from Distinct Numerical Matching with Target Sums, we show that TPC and TDPC are NP-complete already when the underlying undirected graph has vertex-cover number exactly two. For TPC, this yields an exact vertex-cover threshold: polynomial-time solvability at vertex-cover number at most one and NP-completeness at two. For TDPC, we further study the boundary case of temporal oriented stars. A reuse-normalization argument reduces optimum solutions to leaf-unique two-edge merges. If either the incoming or outgoing side is single-label, the optimum remains polynomial-time computable even when the opposite side is multi-label. We also introduce a span parameter for feasible merge realizations and prove that any feasible family of k merges forces a realization of span at least 2k-2. Hence TDPC on temporal oriented stars is in XP parameterized by maximum span, and is polynomial-time solvable for every fixed span bound. The unrestricted multi-label star case remains open.
Read the full abstract

Robotics

Co-Speech with You: Training-Free Personalization of Robot Co-Speech Gestures

Personal robots should adapt their co-speech gesture style to a new user without requiring model retraining. We present a training-free personalization pipeline that combines a frozen audio-conditioned diffusion prior with a gesture style encoder and lightweight conditioning adapters. The encoder is first trained to discriminate speaker identities and then jointly refined with the adapters using the diffusion objective, enabling a reusable style embedding to be extracted from approximately 10 seconds of enrollment motion through a single forward pass. To support this setting, we also release a Quest~3 capture application and a dataset of spontaneous co-speech motion from ten participants. We evaluate the system on held-out speakers using Style Recognition Accuracy (SRA) and Fr'echet Gesture Distance (FGD) to measure personalization and motion quality. Our approach improves SRA from 27.6% for the frozen prior to 69.5% while preserving motion quality (FGD 34.2 versus 34.8), and replacing the enrollment embedding with another person's reduces SRA to 11.4%. The generated gestures are retargeted to a physical NAO robot, and this improvement also transfers to the robot deployment setting, where speech is synthesized using five TTS voices, retaining 67.3% SRA.
Read the full abstract

All authors Bosong Ding, Selma Ancel, Giacomo Spigler, Murat Kirtay

Optimization and Control

Generation of Custom Solvers in Rust for Convex Optimization

We introduce cvxgenrust, an open-source tool for generating custom Rust code that solves families of parameterized convex optimization problems modeled in CVXPY. cvxgenrust canonicalizes a problem family, extracts affine maps to Clarabel cone-program data, and generates a specialized Rust crate that updates parameters and calls Clarabel natively at runtime. The generated solver can also be exposed to Python and registered as a custom CVXPY solver. Our code generator supports a wide range of convex optimization problems up to semidefinite programs and exponential-cone problems. Numerical experiments show reduced runtime relative to direct CVXPY solves and performance comparable to CVXPYgen on shared problem classes.
Read the full abstract

Computation and Language

SHIFT-M3: Pre-fusion Alignment-based Consistency Screening for Multimodal ECG Record Integrity

Multimodal clinical AI typically assumes that the waveform, report, metadata, and downstream predictions attached to a record belong to the same patient. In practice, linkage failures can silently assemble individually plausible but cross-patient components, creating a safety problem that standard predictive models are not designed to detect. We study this problem as multimodal record integrity triage: given an assembled record, should its modalities be trusted to belong together? We introduce SHIFT-M3, a lightweight text-based pre-fusion screen that measures alignment-based consistency between two separately produced ECG text views: an LLM-generated interpretation and a clinical report summary. On 784,680 MEETI ECG records, SHIFT-M3 achieves 97.6% TPR@5% FPR for full text-view swaps (AUROC 0.996), 90.3% for partial swaps (AUROC 0.974), and 97.7% for label-matched hard negatives (AUROC 0.996) with only 573,569 parameters. Compared with same-dataset lexical baselines, the gains are largest on partial swaps and hard negatives, suggesting that the model is learning more than surface overlap. We also introduce the CMST (Conflict-type Multimodal Stress Test) evaluation taxonomy, a three-seed stability study, a loss ablation, a temporal-tolerance sweep, and a shared-token masking control. The main remaining failure mode is longitudinal ambiguity: at the default operating point, same-patient cross-visit pairs still produce 87.0% Type-II false positives.
Read the full abstract

Cryptography and Security

PriMobiBench: Characterizing Visual Privacy Leakage in VLM-Driven Mobile GUI Agents

Mobile GUI agents increasingly rely on Vision-Language Models (VLMs) to automate smartphone tasks by interpreting screenshot streams. However, this design introduces serious and underexplored privacy risks, including direct leakage of sensitive on-screen information and unintended user profiling. The absence of standardized benchmarks makes it difficult to quantify these risks in realistic mobile agent workflows. To address this gap, we propose PriMobiBench, the first benchmark for systematically evaluating privacy leakage and visual profiling in screenshot-driven mobile agents. It provides a unified pipeline for data generation, agent trajectory construction, and multi-model evaluation. We also introduce MobiLeak, a dataset of execution traces from 16 apps, covering 25 privacy attributes with 2,960 embedded privacy instances. Our results reveal substantial risks: (1) VLMs can directly extract sensitive information with up to 82.5% success rate; (2) beyond explicit leakage, they can infer user profiles from aggregated visual evidence with approximately 70% success. We further propose a mitigation that masks privacy-sensitive but task-irrelevant UI elements before cloud processing, reducing profiling success by up to 58% with only approximately 8% performance loss. Overall, our work provides the first systematic benchmark for visual privacy risks in mobile GUI agents, demonstrates that both leakage and profiling are feasible at a highly concerning level, and offers a practical direction for mitigation.
Read the full abstract

All authors Qihang Cen, Tianshuo Cong, Da Song, Xinlei He, Jiaxing Song, Ke Xu, Qi Li

Networking

Trustworthy, Explainable, and Sustainable Decentralized Intelligence for 6G Networks

As 6G networks transition from theoretical frameworks into operational realities, artificial intelligence (AI) evolves from an add-on optimization tool into a distributed and interconnected structural layer. Unlike previous network generations that mostly relied on centralized cloud analytics platforms, AI-native 6G networks operate across a dynamic, multi-domain edge-cloud continuum where data originates from heterogeneous sources including user devices, radio access networks, sensing infrastructures, and vertical applications. Centralizing this massive volume of data creates severe communication overhead, unacceptable latency bottlenecks, single points of failure, and complex cross-domain governance challenges. Consequently, decentralization becomes a fundamental architectural requirement for future 6G network intelligence and zero-touch operations. Security serves as the primary enabler of this decentralized paradigm. Critical security functions, such as real-time threat detection, physical-layer attack mitigation, slice protection, and intrusion detection, require immediate access to local context and telemetry before operational data loses its value. However, moving intelligence to the edge via collaborative paradigms like federated learning (FL) and decentralized FL (DFL) introduces complex trade-offs. System security cannot be addressed in isolation; it is deeply intertwined with equally important aspects like trustworthiness, explainability, and energy sustainability. Taking these aspects into account, this paper develops a unified perspective on decentralized intelligence for 6G, arguing that decentralization, trustworthiness, explainability, and sustainability must be designed jointly rather than treated as independent requirements
Read the full abstract

All authors Giovanni Perin, Michele Rossi, Enrique Tomás Martínez Beltrán, Fernando Torres-Vega, José María Jorquera Valero, Manuel Gil Pérez, Eunjeong Jeong, Nikolaos Pappas, Farah Abed Zadeh, Chamara Sandeepa, Bartlomiej Siniarski, Madhusanka Liyanage, Betül Güvenç Paltun, Leyli Karaçay, Ioannis Pitsiorlas, Marios Kountouris

Formal Languages and Automata

On the Kanazawa–Salvati Conjecture

The language $\mathrm{MIX}$ consists of all words over a three-letter alphabet that have an equal number of occurrences of each letter. It is also the word problem of $\mathbb{Z}^2$ with respect to a suitable choice of generators. The Kanazawa–Salvati conjecture states that $\mathrm{MIX}$ is not a well-nested multiple context-free language. Every well-nested multiple context-free language is an indexed language. We reduce the conjecture to an explicit combinatorial problem about tuples of words, which is easier to state than the original formulation in terms of arbitrary well-nested multiple context-free grammars. More generally, for every surjective monoid homomorphism $\psi\colon \Sigma^* \to \mathbb{Z}^d$, we define a family of well-nested multiple context-free grammars $G_\psi[r]$ for $r \geq 1$, each of which generates a sublanguage of $\psi^{-1}(\mathbf{0})$. We prove that every well-nested multiple context-free sublanguage of $\psi^{-1}(\mathbf{0})$ is contained in $L(G_\psi[r])$ for some $r \geq 1$. Using this family, we prove that the four-letter analogue $\mathrm{MIX}_4$, which is a word problem of $\mathbb{Z}^3$, is not a well-nested multiple context-free language. The proof reduces this claim to a result of Bishop–Elder–Evetts–Gallot–Levine stating that the two-letter analogue $\mathrm{MIX}_2$ is not generated by any non-branching multiple context-free grammar. The Kanazawa–Salvati conjecture itself remains open.
Read the full abstract

Quantum Physics

Hiai–Petz Skew Informations and Sharp Uncertainty Relations for a Single Observable

We study intrinsic quantum uncertainty associated with a single observable from the viewpoint of skew information. By relaxing ordinary additivity while retaining the other fundamental uncertainty requirements, we introduce a class of Hiai–Petz nonadditive skew informations that contains Hansen's metric-adjusted skew informations as the boundary case $\theta=1$. Our main quantitative result is a sharp single-observable uncertainty relation for the full Hiai–Petz class. For a fixed state, the optimal coefficient depends only on its largest and smallest eigenvalues and remains sharp even after the maximal classical contribution to the variance is retained. The general theorem yields, as special cases, sharp bounds for metric-adjusted skew informations, the SLD quantum Fisher information, and the power-commutator family. We further show that $K_s(\rho,A)=\frac12\|[\rho^s,A]\|_{\mathrm{HS}}^2$, $1/2\le s<1$, is realized within the Hiai–Petz framework through Stolarsky operator means, thereby establishing its convexity for $1/2<s<1$. More generally, for each fixed operator monotone function $f$, the Hiai–Petz spectral kernel interpolates geometrically between the metric-adjusted skew information $I^f$ and the common endpoint $K_1$. The resulting family obeys an exact power-trace-weighted composition law, replacing ordinary additivity in the interior $0<\theta<1$.
Read the full abstract

Computation and Language

Bangla Sentence Function Classification: Corpus Development, Model Benchmarking, and Interpretability

Automatic sentence function identification is important for many downstream natural language processing (NLP) applications such as dialogue systems, text-to-speech synthesis, and machine translation. However, benchmark resources for Bangla sentence function classification remain limited. To mitigate this gap, this paper introduces a corpus of 10,000 Bangla sentences, manually annotated into four functional categories, namely declarative, interrogative, imperative, and exclamatory. The corpus is nearly balanced across the four classes, with high annotation reliability reflected by a FleissḰappa of 0.82. Furthermore, we evaluate multiple feature representations, including Bag-of-Words (BoW), TF-IDF, and Word2Vec, with several classical machine learning classifiers. In addition, two heterogeneous ensemble models, namely Single-Level Ensemble (SLE) and Double-Level Ensemble (DLE), are utilized to improve classification performance. Experimental results show that TF-IDF consistently outperforms Word2Vec, likely due to its ability to emphasize discriminative lexical cues associated with sentence functions, particularly given the relatively small corpus used to train Word2Vec. The DLE model with TF-IDF features achieves the best performance with accuracy and macro-F1 of 0.95, demonstrating the effectiveness of sparse lexical representations and heterogeneous ensemble learning for this task. Further cross-validation confirms the robustness of the approach, while LIME-based interpretability provides insights into model predictions. The developed corpus and model benchmarking establish strong baselines for Bangla sentence function classification.
Read the full abstract

All authors Swapnil Kundu Argha, Abdullah Al Shafi, Rowzatul Zannat, Shoumik Barman Polok, Abdul Muntakim, Jannatul Ferdousi, M.A. Moyeen

Computer Vision

Physically Typed and Geometry-Aware Representations for Earth Foundation Models

Earth-observation (EO) foundation models have become exceptionally effective at learning se mantic, high-dimensional geospatial embeddings, while modern weather and climate models have demonstrated that Earth-specific geometry, spherical operators, meshes, and hybrid physical solvers can materially improve prediction. Yet these two advances are not equivalent. A conventional latent embedding has no inherent physical transformation law, whereas scalar fields, tangent polar-vector fields, axial/pseudovector quantities, covectors, and higher-order tensors transform differently under rotations, reflections, and changes of local coordinate frame. This proposal asks whether a general purpose Earth foundation model should preserve those distinctions explicitly, or whether standard embeddings plus augmentation already learn everything that matters. The central contribution is therefore not a more complicated architecture by assumption, but a staged falsification program. A compute-conscious ERA5 dry run first compares conventional, augmentation-matched, typed equivariant, and Hodge/Helmholtz variants under spatial, temporal, orientation, and low-data shifts. Only if explicit geometric typing yields reproducible improvements does the program advance toward a multimodal Earth foundation model in which semantic embeddings coexist with physically typed fields. The proposed gap is narrower and more defensible than claiming that current models ignore geometry entirely: several systems already respect spherical domain geometry, and emerging work explicitly learns scalar/vector fields on spheres. The unresolved question is whether foundation-scale, multimodal, parity-aware field typing produces practical gains beyond those existing approaches.
Read the full abstract

Social and Information Networks

From Network Inequality to Network Fairness: A Perspective on Responsible Decision-Making

Social networks shape how individuals make decisions and how opportunities are distributed. However, the mechanisms that generate these networks often reflect pre-existing inequalities, and technologies that rely on network-derived signals risk further amplifying such disparities. Algorithmic fairness research largely treats networks as a fixed background, grounding analysis almost exclusively in distributive justice and overlooking how network structures systematically bias decision-making. In this Perspective, we identify ten network effects and trace how they create structural biases in the relationship between what we intend to measure and what we observe. Using academic hiring as an example, we show that network biases are not inherently harmful or beneficial. Determining their legitimacy requires examining the entire decision-making process through the lenses of both distributive and procedural justice while engaging all affected stakeholders. We therefore call for a holistic, networked approach to fairness that moves beyond static group categories and recognizes the dynamic, relational, and structural nature of inequality.
Read the full abstract

All authors Lisette Espín-Noboa, Tina Eliassi-Rad, Pak-Hang Wong, Erich Prem, Meike Zehlike, Ricardo Baeza-Yates, Suresh Venkatasubramanian, Fariba Karimi

Machine Learning

The Filter Metric is Safety-Critical: Phantom Advantages in Group-Relative RL under Shaped Rewards

Group-relative policy optimization (GRPO and descendants) can discard no-contrast rollout groups through dynamic sampling, while practical implementations expose a configurable filter metric. We identify and quantify a metric-predicate mismatch under composite shaped rewards. When filtering follows the shaped training score rather than the task outcome, all-fail groups retain nonzero within-group spread and pass the predicate; standard-deviation normalization then promotes shaping differences among failures to full-size phantom advantages. In a controlled GSM8K comparison (Qwen2.5-1.5B, LoRA), no filtering and shaped-score filtering end at EM 0.080 +/- 0.112 and 0.040 +/- 0.008, whereas binary-outcome filtering holds 0.754 +/- 0.005 across four runs per arm (three default-seed reruns and one seed-123 run; mean +/- sample SD). On verl's native recipe/dapo trainer, holding model, data, reward and trainer fixed and changing only the metric, the score arm requires no batch refill in any of 40 observed steps and ends at EM 0.160; the accuracy arm refills in 29/40 steps and ends at 0.763. Both use the same custom shaped-reward hook and unmodified trainer/filter code. Prior work established shaping-induced amplification and all-fail filtering; our contribution isolates the metric-predicate semantic mismatch and directly instruments native deletion/refill telemetry. Across tested positive coefficients lambda in {0.1, 0.3, 0.5}, unsafe arms collapse; exploratory one-run cells reproduce the failure at 1.5B/7B on MATH and under GSPO, while disabling standard-deviation normalization avoids the observed collapse. Filtering under a composite reward should use a task-outcome signal whose semantics are independent of shaping.
Read the full abstract

General Relativity and Quantum Cosmology

Canonical-Ensemble Stability of the Quantum Oppenheimer-Snyder Black-Hole Exterior

We study the local canonical thermodynamics of the quantum Oppenheimer–Snyder (qOS) black-hole exterior previously obtained from loop quantum cosmology. The spacetime is adopted from the literature; no new black-hole solution, regular extension, or singularity-resolution mechanism is claimed here. At fixed quantum parameter $\alpha$, we rewrite the outer horizon in a dimensionless form and obtain exact expressions for the mass, Hawking temperature, entropy, and heat capacity. These expressions reproduce the logarithmic entropy term and the heat-capacity divergence reported in earlier analyses. We then place those results in an explicit, regulated canonical-ensemble framework. The off-shell canonical action has a local minimum on a near-extremal branch with positive heat capacity and a local maximum on a large-black-hole branch with negative heat capacity. The two saddles merge at $r_h/\sqrt{\alpha}=\sqrt{(4+2\sqrt{7})/3}$, where the temperature is maximal and the heat capacity diverges. Because the asymptotically flat partition function is not normalizable without boundary data, this divergence is interpreted as a Davies-type local stability transition, not by itself as a global first-order phase transition. The principal contribution of this work is therefore a transparent canonical-saddle organization of known qOS thermodynamic results, together with a precise statement of its domain and limitations.
Read the full abstract

Machine Learning

An Uncertainty-Aware Hybrid Mathematical-Machine-Learning Model for Smart Irrigation Decision Support

Agriculture accounts for roughly 70% of global freshwater withdrawals, yet irrigation is still commonly scheduled reactively, with no forecast of where soil moisture is heading and no statement of confidence in that forecast. Data-driven models are accurate but opaque and point-valued; water-balance models are transparent but carry large structural error. Neither alone supports a defensible irrigation decision under uncertainty. This study coupled the two and carried uncertainty through to the decision: a four-parameter water-balance core, calibrated on training data only, was corrected by a Random Forest that learned nothing but the physical residual, conformal prediction attached 90%-nominal intervals, and a risk-aware rule converted the interval lower bound into an irrigation trigger. It was evaluated on three years of hourly in-situ measurements from a rainfed Mediterranean cropland station under a strict chronological split, scored against persistence, from one hour to one week. At the 24 h horizon the hybrid reached RMSE 0.00925 m^3 m^-3 and +9.4% skill, roughly double the best of nine baselines, of which only the Random Forest beat persistence. Skill did not grow with lead time: it peaked at +27.4% at three hours and fell to +1.2% at one week. Conformalised quantile regression was better calibrated and 11% sharper than constant-width conformal prediction. The risk-aware rule raised management-threshold crossings detected in advance from 0.905 to 1.000, at a precision cost of 0.975 to 0.950 and 3.7% more notional water, and beyond 72 h the point forecast fell below the no-forecast rule while the interval-based rule did not. Uncertainty quantification therefore governs the lead time over which forecast-driven irrigation advice remains trustworthy, and here transparency in the physical layer cost no measurable accuracy.
Read the full abstract