Peer Revenue Publish or profit

Papers

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

All of arXiv

Thursday 3 September

Information Retrieval

Unified Pitch Graphs for Diagnosing Pitching Strategy

Pitching strategy in baseball is expressed through both physical execution and the ordered context in which pitches are used, yet common representations collapse pitches into discrete types or aggregate statistics. We present Unified Pitch Graphs (UPG), a hierarchical graph representation for retrospective analysis of sequential spatiotemporal events. UPG preserves each pitch as an exact event with reconstructed three-dimensional trajectory and context, connects consecutive pitches through directed sequence edges, and organizes the same events across semantic and temporal resolutions. A support-adaptive mechanism backs off from fine, long sequences when repeated evidence is insufficient, while retaining exact event lineage. We evaluate UPG on 3.94 million MLB Statcast pitches from 2021 to 2026. Nominally identical pitch sequences exhibit distinct physical executions, and ordered structure becomes increasingly evident in longer context-conditioned paths. Support-adaptive backoff increases held-out path coverage from 18.9% to 94.9% while improving execution reconstruction from $R^2=0.495$ to $0.685$. UPG also reliably localizes controlled execution changes that discrete pitch-mix and sequence representations cannot detect. These results demonstrate that UPG provides a traceable, multi-scale representation for identifying recurring strategy patterns without conflating retrospective associations with causal or future-performance claims.
Read the full abstract

Machine Learning

A Peer-Relative Representation Learning Framework for Energy Inefficiency Identification in Mobile Network Sites

Energy consumption is one of the largest operational expenditure items for mobile network operators, yet site-level energy inefficiencies such as faulty cooling controllers, idle radio equipment, and parasitic auxiliary loads often remain undetected because no ground-truth inefficiency labels exist and historical measurements may already contain embedded inefficiencies. This study proposes an unsupervised peer-relative approach based on the premise that sites with similar structural and operational characteristics should exhibit comparable energy consumption. To capture these relationships, a novel energy-aware Minimum Distortion Embedding (MDE) formulation is introduced that extends the standard MDE objective with an energy-based repulsion mechanism. This encourages sites with anomalously high energy consumption relative to comparable peers to become displaced from their local neighbourhoods in the embedding space. The resulting low-dimensional representation simultaneously preserves structural similarity and encodes energy-related deviations, enabling the identification of potentially inefficient sites through peer-relative comparison. The derived anomaly scores provide a practical mechanism for prioritising field investigations, allowing mobile network operators to focus engineering resources on sites most likely to yield energy savings. Experimental results demonstrate that the proposed approach outperforms conventional anomaly detection baselines and provides a robust foundation for large-scale energy-efficiency optimisation in mobile networks.
Read the full abstract

All authors Eliud Nyakweba Koto, Jaco du Toit, Adham Stoltz, Johan du Preez

Numerical Analysis

A stabilized scheme satisfying the discrete maximum principle for a time fractional convection-diffusion-reaction equation

We study a time fractional convection-diffusion-reaction equation in a bounded domain $\Omega\subset\mathbb{R}^2$. A stabilized numerical scheme satisfying a discrete maximum principle is constructed by combining the conforming linear finite element method with the algebraic flux correction method. The resulting semi-discrete scheme is nonlinear, and its well-posedness is established. Assuming nonsmooth initial data, we derive error estimates for the semi-discrete scheme using energy arguments. For the temporal discretization, we employ the L1 method, obtaining a fully discrete scheme for which we prove well-posedness and the discrete maximum principle. We also present numerical experiments that validate the order of convergence as well as we test our schemes to solutions that possess layers.
Read the full abstract

Machine Learning

Almost Free State Prediction Separation

State–prediction separation (SPS) relieves a language model's hidden state of two competing burdens—summarizing the context and predicting the next token—by splitting the forward pass into a state stream and a prediction stream. The separation works, but it is expensive: the prediction stream is a second pass over the whole backbone, costing $\sim$1.9$\times$ the pretraining FLOPs, and even more in terms of wall-clock time when using a flexible attention mask. This paper makes state–prediction separation almost free. We take the separation to its limit with a free pause token: a prediction stream that writes no keys or values at all and so rides the sequence's existing positions. It improves next-token prediction of a standard Transformer by 2-3 centinats in practice on a 1B parameter model, and because it adds no position it costs nothing at inference—no added context length, no KV cache, no decode steps, and essentially no latency, with the growth in inference flops typically irrelevant as it is not the active bottleneck on throughput. The cost is therefore entirely in training where we use four mechanisms to drive it down: a two-pass split that keeps FlashAttention kernels viable, the $w{=}0$ prediction window, a shared gated FFN that evaluates one FFN per position rather than one per stream, and phasing the separation onto the tail of the run. Together these bring the overhead versus an optimized pretraining pipeline to $1.33\times$ wall-clock while recovering ~94% of the gain compared to SPS, and to as low as $1.09\times$ along a graceful quality/compute tradeoff. Furthermore, the FFN optimization reduces the raw flops required at inference time. The result is an isoflop, isoparameter, and isotoken improvement over standard next token trained transformers.
Read the full abstract

All authors John Langford, Nathan Godey, Giovanni Monea, Yoav Artzi, Harry Dong, Ying Fan, Gustavo de Rosa, Zheng Zhan

Artificial Intelligence

SVG-Score: Human-Aligned Evaluation of Text-to-SVG Generation

Scalable Vector Graphics (SVG) generation is attracting increasing attention as generative models improve in expressiveness and controllability. Progress, however, is held back by the lack of domain-specific evaluation protocols: current practice relies on metrics designed for natural images, most notably CLIPScore, which was never trained on vector graphics and aligns only partially with human judgment. We introduce \ours, a human-aligned evaluation framework for text-to-SVG generation. Through controlled caption and image perturbations, we first show that CLIP-based scores barely react to the errors SVG generators actually make, such as wrong colors, counts, and spatial relations, and that off-the-shelf Vision-Language Model (VLM) judges, while more sensitive, respond unevenly across error types and SVG styles. We then introduce a human-annotated dataset for Semantic Alignment, measuring how faithfully a generated SVG reflects its caption. Building on it, we develop two complementary evaluators: CLIP scorers adapted to vector graphics and then aligned to human preferences, for fast large-scale evaluation, and a VLM judge trained with supervised fine-tuning and reward-shaped reinforcement learning, for more expressive and interpretable assessment. Using both, we benchmark major open-source, commercial, and optimization-based SVG generators on an independent caption set.
Read the full abstract

All authors Marco Cipriano, Leonardo Zini, Alexandra Schild, Valentin Teutschbein, Afsana Mimi, Marcella Cornia, Lorenzo Baraldi, Gerard de Melo

Statistical Methodology

Comment on: "The Two Cultures of Prevalence Mapping: Small Area Estimation and Model-Based Geostatistics"

Small Area Estimation (SAE) and Model-Based Geostatistics (MBG) provide complementary approaches to prevalence mapping, with their relative advantages depending on the inferential goals and characteristics of the available data. We argue that a fuller comparison should consider model interpretability, the role of epidemiologically motivated covariates, inferential objectives beyond area-level prediction, integration of data from different spatial partitions and surveys, and task-specific model validation. In particular, we question whether survey design variables should routinely be included in MBG models when their effects may instead be mediated by measurable environmental and socio-economic risk factors. We further argue that simulation-based validation, tailored to the operational objectives of prevalence mapping, can provide a more informative assessment of model performance than conventional cross-validation alone.
Read the full abstract

Computer Vision

Urban Boundaries, Social Barriers: A Benchmark and Vision-Centric Framework for Mapping Gated Communities and Equity Implications

Communities are fundamental spatial units that shape urban form and social life. Whether a residential compound is spatially open or enclosed affects mobility, access to public services, and equity, yet studies of Chinese fengbi xiaoqu remain largely qualitative or small-scale, limiting reproducible city-scale analysis. We address this gap by introducing GBA-GCs, a metropolitan-scale multimodal benchmark for locally grounded gated/open community recognition in China's Greater Bay Area, covering 37,444 residential compounds with aligned boundary polygons, high-resolution satellite imagery, Chinese metadata, and structured attributes, together with expert-verified labels, inter-annotator reliability, and official evaluation splits. Built on this benchmark, we present Multimodal Classifier for Gated Community (MCGC), a vision-centric multimodal framework based on DINOv3-SAT that fuses imagery, text, and structured cues via modality-aware cross-attention and adaptive gating to mitigate modality imbalance. MCGC consistently outperforms strong unimodal and multimodal baselines. Finally, we apply the validated model to metropolitan-scale mapping and report equity-oriented findings including spatial clustering of GCs, privatized green space, and reduced pedestrian connectivity. The benchmark, code, and release documentation are available at https://github.com/MinweiZhao/GBA-GCs.
Read the full abstract

All authors Minwei Zhao, Weiming Zhang, Jiawang Du, Qiming Liu, Weiming Zhuang, Pei Nie, Cai Wu

Combinatorics

List-distance consistent vertices in trees are confined to a path

A labeling of a connected graph $G$ on $n$ vertices is a bijection $c:V(G)\to\{1,\dots,n\}$; writing $c(u,v)=|c(u)-c(v)|$, a vertex $u$ is list-distance consistent if $d(u,v)<d(u,w)$ implies $c(u,v)\le c(u,w)$ for all $v,w$. The maximum number of such vertices over all labelings is the list-distance consistency ldc$(G)$, introduced by Casselgren and Henricsson. We prove that in a tree, the consistent vertices of any labeling lie on a single path, along which the labels form a block of consecutive integers in increasing order (with respect to a suitable orientation of the path), no vertex off the path receiving a label from that block. We deduce that ldc equals $3$ for every complete $k$-ary tree except the binary tree of height two, and we determine ldc for all spiders.
Read the full abstract

All authors Fei-Huang Chang, Ma-Lian Chia, David Kuo, Guan-Ting Lai

Quantum Physics

Quantum Query Complexity of Finding a Tarski Fixed Point on a High-Dimensional Grid

The Knaster-Tarski fixed-point theorem states that every monotone function over a complete lattice has a fixed point. Beyond its fundamental role in order theory, the theorem and its algorithmic variants have found broad applications in areas such as economics, game theory, and programming languages. While the query complexity of finding a Tarski fixed point has been extensively studied in classical models, comparatively little is known in the quantum setting. We prove an $\Omega(k\log n)$ quantum query lower bound for finding a fixed point of a monotone function on $[n]^k$, using the nonnegative spectral adversary method. In the two extremal regimes $n = 2$ and $k = 1$, our quantum lower bound matches the previous classical lower bounds $\Omega(k)$ and $\Omega(\log n)$, respectively. For $n, k\geq 2$, our bound improves the best previous classical lower bound when $n < k$ and is within a factor of $\log n / \log k$ compared to the known classical lower bound when $n \geq k$. To construct the adversary matrix, we develop the Tree–Filtration Adversary Method. Besides yielding our lower bound, the method offers a more transparent combinatorial interpretation of the nonnegative spectral adversary method. When the hard instances of a problem admit a tree-like organization and suggest an intuition analogous to classical decision-tree lower bounds, our method provide a promising approach to establishing quantum complexity lower bounds.
Read the full abstract

All authors Tongyang Li, Weiran Ma, Ziyi Yang, Xingyu Zhao

Machine Learning

DCCQ: From Ordered Bernoulli Levels to Critical-Line Geometry: Integer Quantization, Bernoulli Residual Phase, and Prime-Power Spectra

We present the discrete–complex complement quotient (DCCQ) framework through the ordered Bernoulli-word kernel $f(p,n,k)=p^k(1-p)^{n-k}$ and its inverse-integer level sets. The binary level $2^{-n}$ selects $p=1/2$ as the unique real split-independent anchor. Imposing the additional continuation rule $1-z=\overline z$ gives the conjugation-symmetric line $z=1/2+iu$. On the central normalized branch, the inverse-level split $\kappa=k/n$ also has real part $1/2$. The quadratic coordinate $Q(z)=1/4+u^2$ identifies complementary conjugate points, has minimum $1/4$, and has an explicit two-sign inverse; restricting its values to integers defines an arithmetic quantization. For supplied positive critical-line zero ordinates $\gamma_k$, the induced level has the exact decomposition \[ L_k=\frac14+\gamma_k^2=N_k+\delta_k,\qquad \delta_k=\widetilde B_1\!\left(\gamma_k^2+\frac34\right), \] where $N_k=\lfloor L_k+1/2\rfloor$ and $\widetilde B_1(x)=\{x\}-1/2$. The integer–phase pair $(N_k,e^{2\pi i\delta_k})$ retains the level and the positive ordinate. Prime-exponent coordinates describe the factorization of the integer component, while conditional Fourier moments formulate an open question about the residual phases. The finite numerical diagnostics are descriptive. A distinct complex exponent $s$ gives an inverse-level representation of the supplied term $m^{-s}$; direct substitution cancels the auxiliary coordinates. These terms assemble into the classical Dirichlet series and Euler product for $\Re s>1$. The framework organizes exact coordinate identities, classical zeta connections, and numerical diagnostics; it establishes neither conditional equidistribution nor a zero-location theorem.
Read the full abstract

Artificial Intelligence

Govern the Model, Not Only the Data: Storage, Circulation, and Learning in Creative AI

Federated learning is increasingly presented as a privacy-preserving advance: personal data remain on the device, and only model updates are shared. It borrows the vocabulary of the federated social web, yet inverts its logic, distributing computation while the resulting model stays with whoever convened the training. We argue that federation is not in itself a remedy for extractive AI, because outcomes depend on who governs the data and the model and who has agency over the practices that shape them. We describe three layers at which a creative community can hold its work: storage, circulation, and learning. Examining artist-governed trusts, cooperatives, and consent infrastructures, we show that creator governance is established at storage and circulation but stops at learning: contributors can consent to training, yet have little say over the resulting model or its federation. We map the research space this opens, pairing technical open problems with the human questions from which they unfold. We propose four design principles for a creative data commons that governs models and their federation, not only datasets: govern the model, not only the corpus; make the terms legible at the moment of contribution; design for refusal as a first-class state; and decide stewardship in the open and account for it.
Read the full abstract

All authors Phoenix Perry, George Simms, Elizabeth Wilson, Yasmine Boudiaf, Nick Bryan-Kinns, Tega Brain, R. Luke DuBois, Alix Rule, Rachel Meade Smith, Kelani Nichole, Atharva Pravin Pawar, Rebecca Fiebrink

Geometric Topology

Fourier Analysis and Idempotents in Quandle Algebras

In 2023, the first author, Nunez, Singh, and Swain [10] formulated an analogue of Kaplansky's idempotent conjecture for integral quandle rings. In this paper, we develop a new Fourier-analytic approach to quandle rings and use it to establish the conjecture for two major classes of quandles: Takasaki quandles, including dihedral quandles, and medial commutative quandles. A central contribution of the paper is the introduction of Fourier analysis on Alexander quandles, which provides a new framework for studying quandle rings and, in particular, their idempotents. Using this Fourier-analytic framework, we also prove that a previously known sufficient condition for the existence of counterexamples to the conjecture is in fact necessary, thereby resolving a problem of Jablonowski [12].
Read the full abstract

Soft Condensed Matter

Peeling threshold for removal of an adhered elastic sheet by a shear flow

Fluid shear can induce detachment of a thin elastic sheet adhered to a flat substrate. This peeling process is important in a variety of environmental and technological systems. The condition for peeling depends on: the shear rate $\dot{\gamma}$, the fluid viscosity $\eta$, the length of the detached portion of the sheet $L$, the bending rigidity $B$ and the adhesion energy $\Gamma$. What are the laws governing the detachment? We address this question experimentally in the regime of intermediate adhesion, using macroscopic sheets bonded to a substrate and immersed in a shear cell containing a viscous fluid. The experiments indicate a critical shear rate for peeling of the order of $\dot{\gamma} \sim B/(\eta L^3)$. This threshold is, unexpectedly, independent of adhesion. We rationalise this result by applying Griffith's fracture theory to optical measurement data of the shape of the sheet, under conditions of freely moving peeling front or clamped boundary. The results indicate that the large curvature of the sheet for $\dot{\gamma} \sim B/(\eta L^3)$ yields a nearly diverging strain energy release rate at this threshold. This approximate divergence in turn yields a peeling threshold that depends at most weakly on $\Gamma$, confirming a theory that was proposed recently (Salussolia et al., J. Mech. Phys. Solids, 2020, 134). Among other applications, our work provides a quantitative formula that can aid the production at scale of 2D materials such as graphene.
Read the full abstract

Artificial Intelligence

Transfiver: Human-AI Co-Inference through a Shared Editable State

Long-term human-AI interaction is difficult because the information that guides inference is updated implicitly by the model and is not directly inspectable or controllable by the user. We introduce the TRANSparent Framework for Interactive, Verifiable, Editable Representation (Transfiver), an architecture for human-AI co-inference through a shared editable state. Its central idea is that interaction-specific information is maintained in a single persistent state $(S_t)$ that both the model and the human update. Transfiver distinguishes two modes of state evolution. In an implicit stream update, the model interprets ongoing interaction and decides whether new information revises an existing state item or creates a new one. In an explicit directed edit, a human inspects and modifies an addressed item. Both act on the same underlying state, so a human correction changes the state that subsequent computation reads, rather than adding another instruction or separate record. The architecture separates shared parameters $(\theta)$, learned before ordinary use, from the persistent state $(S_t)$, which evolves during deployment without parameter retraining. Extending Transfiver to rich natural-language, relational, and large-scale shared states remains open.
Read the full abstract

Computer Vision

LLaDA-Image: Building Strong Image Generators with Fully Open Training Recipes

We introduce LLaDA-Image, a unified framework that pairs a 6B Diffusion Transformer (DiT) trained from scratch with a frozen vision-language understanding module built on the LLaDA2.0-Mini diffusion language model backbone. Instead of relying heavily on paired image-text data from the beginning, we first build a strong visual generative prior through image-only pre-training and mid-training. The generation pipeline comprises 220M samples, 98 of which are real images. For efficient and scalable optimization, we use parameter-free RMSNorm throughout the DiT together with the Muon optimizer. The resulting unified model produces highly photorealistic images while accurately following fine-grained editing instructions. We further distill LLaDA-Image into LLaDA-Image-Turbo, enabling fast inference in 2-4 sampling steps. On Qwen-Image-Bench, LLaDA-Image achieves overall scores of 53.53 and 53.38 on the English and Chinese tracks, respectively, setting a new state-of-the-art among open-source models on both tracks. To support further research on capable and efficient generative models, we release our model weights, training code, and detailed recipes.
Read the full abstract

All authors Chuyan Chen, Haoxing Chen, Kun Chen, Zhenglin Cheng, Long Cui, Ruishan Fang, Zhangxuan Gu, Zhicheng Huang, Zhenzhong Lan, Yuanting Lei, Haoquan Li, Jianguo Li, Rongchuan Li, Sidu Li, Tao Lin, Deyuan Liu, Jiacheng Liu, Lin Liu, Yuxuan Lou, Zhisheng Lu, Yuxin Ma, Shuheng Shen, Peng Sun, Chaoyang Wang, Hongjun Wang, Xiaomei Wang, Yongxin Wang, Chengzhang Wu, Hongru Wu, Jun Xie

Materials Science

Exciton multipolarity controls coherent and squeezed phonons in van der Waals heterostructures

Photoexcitation-driven changes in the electronic distribution displace atoms, generating coherent phonons on ultrafast timescales. Two-dimensional (2D) materials and their heterostructures offer a powerful platform for engineering these phonons. Yet, despite the widespread observation of photoexcited coherent phonons, a design principle for controlling their character remains elusive. Here, using detailed atomistic simulations of multilayers of alternating MoSe$_2$ and WSe$_2$, we reveal exciton multipolarity as a design principle for tuning photoinduced phonons from coherent to squeezed. These phonons are interlayer breathing modes, with dipolar excitons coupling linearly to generate coherent states and quadrupolar excitons coupling quadratically to produce squeezed states. Moreover, an out-of-plane electric field enables switch-like control, converting quadrupolar excitons into dipolar excitons and switching the phonon state from squeezed to coherent. For example, in trilayer WSe$_2$/MoSe$_2$/WSe$_2$, the photoexcited 1.04-THz breathing mode switches from a squeezed state at zero field to a coherent state under an applied vertical field. Experimentally, these phonon states can be directly probed by ultrafast X-ray or electron diffraction and indirectly through transient reflectivity. Our results open new avenues for ultrafast control of lattice and electronic dynamics on picosecond timescales, with implications for THz quantum phononics, nanophotonic technologies, and quantum-noise-limited sensing.
Read the full abstract

All authors Indrajit Maity, Arash A. Mostofi, Johannes Lischner, Ángel Rubio

Robotics

A comparative study on the accuracy & repeatability of mobile robotic platforms for the delivery of precision NDE measurement

Mobile robotic platforms offer a flexible alternative to fixed manipulators for non-destructive evaluation (NDE) of large aerospace structures, but their base-positioning accuracy and how that accuracy should inform deployment have not been assessed under a common, externally referenced protocol. This work presents a laser tracker-based evaluation workflow (ground truth approximately 6 micrometers) that measures the static and segmented trajectory positioning accuracy of five commercial mobile platforms (KUKA KMP-1500, KUKA KMR, MiR250, Boston Dynamics Spot, Clearpath Husky) under a common protocol. A coupled multi-corner calibration recovers the laser-to-robot transformation and reflector offsets; ordinary least squares over all poses is used, with robust estimation retained only as a blunder check. Static positioning accuracy ranged from a median of 8.2 mm (KMP-1500) to 63.5 mm (Spot), with the wheel-odometry-only Husky uncalibratable. Dynamic path following was characterised by cross-track error; the component was insensitive to temporal alignment, which ranged from 6.9 mm (KMP-1500) to 112.1 mm (Spot). Both accuracy and calibratability tracked localisation capability, from the newest LiDAR SLAM platform to map-free visual odometry. No configuration meets the 0.2 to 1.0 mm aerospace NDE tolerance from the base alone; the results are framed as a design input that sizes the supplementary sensing each platform requires: roughly one order of magnitude for the best platform and nearly two for the worst, providing a reproducible basis for platform selection rather than a feasibility claim.
Read the full abstract

All authors SeyedMohammadAmin Nabi Pour, S. Gareth Pierce, Randika Vithanage, Ehsan Mohseni, David Carswell, Matthew Shields

Probability

Typical Martingale Diverges on a Co-$\sigma$-porous Set

We consider the space of $L^p$-bounded martingales on the Cantor space for $p\in[1,\infty]$. Equipping the Cantor space with two standard metrics, we show that under both, a typical martingale diverges at a typical point. By a 'typical martingale', we mean an element of a co-$\sigma$-porous set when $p\in[1,\infty)$ and of a co-porous set when $p=\infty$. Specifically, we show that while a typical martingale diverges on a co-$\sigma$-porous set with respect to the first metric, no martingale diverges on a co-$\sigma$-porous set with respect to the second metric. Finally, we investigate the key factors determining whether the divergence set can be co-$\sigma$-porous.
Read the full abstract

Soft Condensed Matter

Simultaneous measurements of enzyme propagation and biopolymer mobility elucidate the directional degradation of a dense biopolymer matrix

Enzymatic degradation of dense biopolymer matrices is central to natural processes like digestion and cancer progression, as well as applications in biomedicine, biomass valorization, and nanotechnology. Yet, it remains unclear how enzyme propagation and substrate degradation interact, and especially whether and how enzymatic activity shapes the propagation process. Here, we bridge this gap by employing Fluorescence-Photon Correlation Imaging to simultaneously track directional enzyme propagation and biopolymer degradation in a model system. We use viscoelastic solutions of arabinoxylan, a hemicellulosic polysaccharide with a xylan backbone substituted by arabinose and ferulic acid, and a fluorescently labeled arabinoxylanase, an enzyme that randomly cleaves the xylan chain. To resolve enzyme propagation and biopolymer degradation with spatiotemporal precision, we combine fluorescence imaging of the enzyme with speckle-based photon correlation imaging, a technique to quantify biopolymer mobility, which we show is a proxy for biopolymer degradation. Our experiments reveal that enzyme diffusion is decoupled from catalytic activity, with no evidence of activity-enhanced diffusion. Instead, the progression of the degradation front is governed by a combination of enzyme diffusion, reaction kinetics, and slow enzyme deactivation, the latter being characterized by a double-exponential decay. By extending the Michaelis-Menten framework to space- and time-dependent conditions, we quantify how cumulative enzyme exposure and deactivation shape the degradation dynamics. This work establishes a quantitative framework to understand enzymatic processes in concentrated, beyond-dilute-regime substrates, with implications for the rationalization of biocatalytic systems in industrial and biomedical applications.
Read the full abstract

All authors Vincenzo Ruzzi, Antoine Bouchoux, Carole Antoine-Assor, Donna-Joe Bigot, Salma Menzeh, Maike Petermann, Laurent Leclercq, Hervé Cottet, Cédric Montanier, Claire Dumon, Luca Cipelletti, Laurence Ramos

Differential Geometry

Canonical Bochner-Kähler potentials via the Sasaki-Kähler correspondence

We introduce a new approach to the study of Bochner-Kähler manifolds, based on normal form techniques in CR geometry. As observed by Webster, Bochner-Kähler manifolds are intimately related to spherical Sasakian manifolds. Our approach utilises this relationship as well as normal forms for spherical Sasakian manifolds (known as rigid spheres). In this setting potentials of Bochner-Kähler manifolds are nothing but the defining equations of rigid spheres in rigid normal form. This leads to a canonical formula for Bochner-Kähler potentials, as well as streamlined proofs of known results on the structure and the symmetries of Bochner-Kähler manifolds. Our approach also provides a host of examples in terms of an implicit formula of the corresponding Kähler potentials.
Read the full abstract

Machine Learning

When Minute-Resolution Monitoring Meets Session-Level Injury Labels: Landmark-Based Discrimination in Elite Women's Football

Minute-resolution athlete monitoring is increasingly common, while injury annotation may exist only at the athlete-session level and omit within-session onset time. Replicating a positive session label across every recorded minute would therefore create unsupported minute-level supervision. We address this label-resolution mismatch using fixed elapsed-time landmarks at 10, 20, 30, 40, 50, and 60 min, constructing one representation per athlete-session from information available up to each landmark while keeping the target as a same-day injury-associated session indicator. Using 2020 SoccerMon data from elite women's football, the modelling cohort contains 2,259 Team A athlete-sessions from 27 athletes, including all 22 positive sessions from five athletes. Evaluation is athlete-disjoint. We compare contextual, cumulative, and dynamic representations; Logistic Regression, Random Forest, XGBoost, and TabPFN; and training-only NONE, SMOTE, and CTGAN conditions. Robustness is assessed using athlete-cluster bootstrap, a fixed common cohort, alternative fold allocations, leave-one-positive-athlete-out analysis, and equal-athlete weighting. Discrimination is landmark-dependent and non-monotonic. TabPFN improves later-landmark discrimination relative to Logistic Regression but does not consistently outperform Random Forest. Synthetic augmentation provides condition-specific rather than universal benefit. The contribution is a unit-aligned framework for using minute-resolution predictors with session-level supervision, not minute-specific injury prediction.
Read the full abstract

2609.03790 · 3 Sep · 10 pages, 4 figures, 2 tables. v2: Substantially revised manuscript with updated landmark-based methodology, model benchmarks including TabPFN, synthetic augmentation experiments, robustness analyses, and expanded limitations and reproducibility details

Cryptography and Security

Beyond the Trust Boundary: A Critical Reassessment of the FIDO2 Threat Model

FIDO2/WebAuthn has been widely deployed as a phishing-resistant authentication scheme. Because FIDO2 relies on public-key cryptography and hardware-backed authenticators, its security is often assumed to be guaranteed by design, provided that the cryptographic implementation is correct. In this work, we critically reassess the FIDO2 threat model and show that several commonly assumed security properties do not hold under realistic deployment conditions. We extend the threat model beyond the cryptographic layer to examine eight attack vectors across the FIDO2 stack: malicious browser extensions, platform-handler malware, passive sniffing, virtual device drivers, CTAP2-specific malware, USB/hardware implants, malicious USB hubs/docks/extenders, and NFC relay attacks. Our analysis shows that FIDO2 depends on environmental assumptions that may not hold in practice. We demonstrate how AAGUID and timing information can enable user profiling and targeted attacks, and how compromise of the browser, operating system, or hardware can undermine FIDO2 security even when the underlying cryptographic primitives remain uncompromised. We further show that attack chains spanning multiple layers can bypass the intended security guarantees of FIDO2. These findings indicate that the primary weakness in a FIDO2 deployment is often not the cryptographic layer, but the surrounding trusted environment. We also examine how these attack vectors can undermine device attestation by targeting the FIDO Metadata Service (MDS3), which serves as a root of trust for authenticator metadata. Finally, we characterize the attacks according to privilege, skill, and resource requirements. We conclude that effective FIDO2 security requires layered mitigations covering the browser, operating system, hardware, protocol stack, and metadata infrastructure.
Read the full abstract

All authors Aditya Mitra, Kolluru Sai Abhiram, Sibi Chakkaravarthy Sethuraman, Anitha S

Computer Vision

A Reverse Sign Language Dictionary: Open-Vocabulary Sign Recognition from Continuous Signing via Video Captioning and Description Retrieval

Isolated Sign Language Recognition (ISLR) is conventionally cast as closed-set classification over gloss labels, which cannot generalize to signs unseen in training and ties every deployment to a gloss-annotated lexicon. We instead recognize signs extracted from continuous signing by (1) captioning a sign-level clip into a free-form procedural description of the articulation with an open-weight vision-language model, and (2) retrieving the closest entry from a vocabulary of target descriptions with a multilingual sentence encoder: a reverse sign language dictionary that needs no gloss supervision and admits an open vocabulary. On 1,300 sign-level segments from a Japanese Sign Language (JSL) dialogue corpus annotated with procedural descriptions (against a 2% top-10 chance floor over the 503-entry target vocabulary), fine-tuning the captioner substantially improves seen-class retrieval: language and vision tower fine-tuning raises top-10 retrieval on seen classes from 4.5% (untrained) to 49%, becoming statistically indistinguishable from a standard supervised closed-set classifier (I3D) on two of the three test sets where a closed-set classifier can be evaluated at all. More importantly, unseen-class retrieval also improves significantly over the untrained pipeline (11.5% -> 21.0% top-10, p=0.0094), a regime in which the closed-set classifier cannot participate. A matcher-side empirical upper-bound analysis shows the sentence encoder already recovers close to 100% of paraphrased gold descriptions, locating a gap in captioning quality that we aim to address in future work. To our knowledge this is the first description-based, open-vocabulary sign lookup from continuous signing without gloss supervision, and the first for JSL.
Read the full abstract

Artificial Intelligence

DNative-Twin: Decision Graphs and Digital Twins for Reconstructable Agentic Decisions

AI agents increasingly gather evidence, invoke tools, apply constraints, and produce decisions that people or software may commit to action. A final output alone cannot show which evidence, tool state, rule, authorization, or action path produced it. We present DNative-Twin, a graph-native digital twin that records a committed agentic decision as a typed trajectory and re-executes its decision mechanism under declared conditions. The graph links the state observed by the agent, the path it followed, and the authority behind the resulting action. The twin synchronizes this information, replays the mechanism in isolation, and compares it under controlled changes. We instantiate the framework in enterprise decision processes using three public process logs and controlled replay suites. The experiments identify a specific failure: graph structure localizes represented changes but cannot determine the consequence of an unobserved tool state. In a three-condition controlled experiment with 300 injected instances, unresolved-divergence recall increased from 0 to 0.667 when replay-contract state was added and to 1.0 when verification results were also available; the held-out set contained no critical-class instance. Across 500–5,000 BPI 2020 cases, median end-to-end time increased from 0.794 to 8.889 seconds on the reported platform. These results separate the roles of graph structure, replay context, and verification evidence in reviewing a decision mechanism.
Read the full abstract

All authors Junjie Pang, Zhenzhen Xie, Haoke Han, Ying He, Jing Wang, Gang Liu

Human-Computer Interaction

Auditing Contextual Bias in Human Ball-Strike Calls Using KBO's Automated Umpiring Transition

This paper uses the Korean Baseball Organization's adoption of the Automated Ball-Strike (ABS) system to audit long-standing claims about contextual bias in human ball-strike calls. Using pitch-level KBO data from 2021 through the available portion of the 2026 season, we model called-strike probability for taken pitches near the strike-zone boundary, with 2022-2023 as the primary human-umpire baseline and ABS seasons (2024 and onward) as a diagnostic benchmark. The strongest evidence concerns count pressure. Relative to 0–0 counts, human umpires called substantially fewer strikes in two-strike counts and more strikes in hitter-ahead three-ball counts. Specifically, in the main 0.25-ft boundary band, 0–2 was associated with a -17.17 percentage-point effect and 3–0 with a +6.61 percentage-point effect. Under ABS, the corresponding effects were close to zero and did not survive false-discovery-rate correction. Game progression shows a smaller but coherent pattern as human calls were less strike-prone in early innings and more strike-prone in innings 7–9+, especially in late-close situations, while complete ABS seasons were essentially flat. Other suspected biases are weaker or more localized. Salary-based reputation proxies provide suggestive but proxy-sensitive evidence, and catcher identity shows human-period residual heterogeneity that disappears under ABS. Home-context evidence is mostly null at the umpire level, with one FDR-significant human-period exception and an exploratory umpire-team gap best treated as an audit lead. Overall, the results do not show that human umpires were biased everywhere. Instead, they map where the human strike zone was most context-sensitive, where evidence was weaker, and where common suspicions received little support.
Read the full abstract

Classical Analysis and ODEs

Hausdorff-Choquet Angular Spaces and Weak-Type $(1,1)$ Bounds for Rough Maximal Operators

In the present paper, we consider the maximal operator \[ \mathcal M_{\Omega}f(x) := \sup_{r>0}\frac{1}{r^n} \int_{|y|<r} |f(x-y)| \left| \Omega\!\left(\frac{y}{|y|}\right) \right|\,dy. \] A longstanding open conjecture raised by E.M.Stein asks whether the maximal operator $\mathcal M_{\Omega}$ is of weak type $(1,1)$ when $\Omega$ is merely in $L^1(\mathbb S^{n-1})$. We partially settle this problem by proving weak type $(1,1)$ bounds of $\mathcal M_{\Omega}$ with kernel $\Omega\in\mathcal X(\mathbb S^{n-1})$, yielding a significant improvement over the work of M.~Christ and Rubio de Francia. Here$\mathcal X(\mathbb S^{n-1})$ is the space related to the Hausdorff–Choquet angular space and $$ L\log^+\!L(\mathbb S^{n-1}) \subsetneq \mathcal X(\mathbb S^{n-1})\subset L^1(\mathbb S^{n-1}). $$ Prior to our work, the condition $\Omega \in L\log^+\!L(\mathbb S^{n-1}) $ remained the best known size restriction guaranteeing the weak-type$ (1,1)$ bounds for all dimensions $n > 2$. To our knowledge, the present paper is the first to relax this threshold for $n>2$. Finally, for the general Hausdorff–Choquet scale $\mathcal H\mathcal C_{\alpha}$, we show that $\alpha=(n-1)/2$ is the sharp exponent for uniform weak type $(1,1)$ estimates.
Read the full abstract

Algebraic Geometry

A note on the noncommutative Hodge conjecture for graded matrix factorizations

Let $m\geq 2$ and $d\geq 7$. We consider homogeneous polynomials in $2m+2$ variables of the form $f=F_0(u_0,v_0)+\cdots+F_m(u_m,v_m)$, where the $F_i$ are independently very general squarefree binary forms of degree $d$. We prove the rational noncommutative Hodge conjecture for the dg category $\mathrm{MF}^{\mathrm{gr}}(f)$ of graded matrix factorizations. Its Hochschild homology is the direct sum of the scalar-invariant Jacobian sector and $d-1$ one-dimensional point sectors. Boundary–bulk images of explicit rank-one factorizations generate a lattice of rank $(d-1)^{m+1}$ in the identity sector, while grading shifts of the stabilized residue field generate all point sectors. A reduced-Burau calculation shows that the identity-sector lattice exhausts the rational Hodge classes at a very general parameter. Consequently, $\dim_{\mathbb{Q}}\operatorname{Hdg}\bigl(\mathrm{MF}^{\mathrm{gr}}(f),\mathbb{Q}\bigr)=(d-1)^{m+1}+d-1$, and the rational topological $K$-rank is $\bigl((d-1)^{2m+2}+d-1\bigr)/d+d-1$. Finally, applying the additivity of the noncommutative Hodge conjecture for semiorthogonal decompositions together with Orlov's decompositions for Fano, Calabi–Yau, and general-type hypersurfaces proves the rational Hodge conjecture for the associated smooth projective hypersurface.
Read the full abstract

Spectral Theory

Spectral properties of the magnetic Robin Laplacian on curvilinear half-plane

We analyse magnetic Robin Laplacian in curvilinear half-plane with a smooth boundary. It is well known that the spectrum of the Robin Laplacian is unstable with respect to boundary deformations. This means that if the boundary is a straight line then the spectrum of the Robin Laplacian is purely essential. From the other hand, the perturbation of the boundary produces eigenvalues below the essential spectrum. In this paper, the Robin-Laplace operator with a compactly supported magnetic field is considered. We prove that the spectrum of the magnetic Robin Laplacian is stable under small and local deformations of the boundary.
Read the full abstract

Physics and Society

ESRIcascade.jl: A Julia package for fast computation of the Economic Systemic Risk Index

This work presents ESRIcascade.jl, a Julia package for computing the Economic Systemic Risk Index (ESRI). The package combines computational efficiency with a documented interface designed for research workflows. Our benchmarks show that ESRIcascade.jl is from 140 to 300 times faster than existing implementations. For a realistically sized synthetic economy, this reduces computational time from 16 hours to 7 minutes. By reducing computation times, ESRIcascade.jl makes repeated analyses of larger production networks practical and feasible and may enable broader use of ESRI in empirical and methodological research. The package and its documentation are freely available at https://github.com/Devetak/ESRIcascade.jl under the MIT License.
Read the full abstract

Computation and Language

IndicSafeEval: Safety Robustness of Large Language Models under Multilingual Persuasive Jailbreak Attacks

Large language models (LLMs) are increasingly used in multilingual settings, yet their safety is still evaluated primarily in English. This limits our understanding of how alignment failures manifest in low-resource and culturally diverse languages. We introduce IndicSafeEval, a persuasion-based jailbreak evaluation framework for Indian languages. Our benchmark combines ten safety critical content categories with six human-like persuasive strategies across four different Indian languages, such as Hindi, Bengali, Marathi and Punjabi, resulting in 7,200 adversarial prompts. We conduct a systematic black-box evaluation of several open-source LLMs to examine how their safety behaviour varies across languages, persuasion strategies, and risk categories. Our analysis shows that the model does not behave equally safely across all languages and prompt styles. Instead, safety performance depends strongly on both the languages used and the way a request is phrased using persuasive cues. We further observe that different risk categories exhibit different levels of vulnerability, with some types of harmful content being significantly more susceptible to persuasion-based jailbreaks than others. These findings reveal important limitations of current safety evaluations, which are largely English-centric, and underscore the need for multilingual and persuasion-aware benchmarking frameworks to more accurately assess real-world LLM safety. Our implementation is available at https://github.com/MonSaikat/IndicSafeEval. Warning: this paper contains example data that may be offensive or harmful.
Read the full abstract

All authors Saikat Mondal, Mamta, Deeksha Varshney, Oana Cocarascu, Asif Ekbal