Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Friday 11 September

Physics and Society

Global maps of travel time to emergency and tertiary hospitals

Global estimates of access to health care treat every facility alike. Drive time was routed on the OpenStreetMap network from all 217,841 of its hospitals and 15-, 30- and 60-minute isochrones dissolved for nested capability tiers, weighted with GHS-POP 2025. 96.2% of the world's population lives within an hour's drive of a hospital, 78.5% of a hospital with a documented emergency department, and 40.3% of one with a helipad or university name marking tertiary care. The 1.45 billion people within an hour of a hospital but not of an emergency hospital live mainly in South and East Asia and Nigeria; the 312 million beyond an hour of any hospital lie in a belt from the Sahel to Madagascar. Defining the tertiary tier by helipad alone leaves its estimate unchanged, and the isochrone construction shifts the 60-minute figures by a few percent. Counting every facility as equivalent overstates access to time-critical care.
Read the full abstract

Human-Computer Interaction

Understanding Game Coaching on Gig Platforms

Freelance game coaches monetize their gaming expertise by offering personalized instruction to players seeking to improve, working through gig platforms, yet little is known about how they operate. To address this gap, we conducted semi-structured interviews with 20 experienced freelance coaches across 17 competitive games on Fiverr. Despite lacking shared formal training, these coaches converged on similar practices centered on rapport-building, individualized diagnosis, and adaptive feedback. We identify two structural conditions shaping this work: dual precarity, in which coaches navigate both gig platform instability and the lifecycle volatility of live-service games; and earned authority, in which coaches must continually establish legitimacy through visible competitive achievement within the same gaming spaces as their students. These coaches welcomed AI for administrative and analytic support but resisted its use in live interactions where trust, relational engagement, and situated judgment remained central. We discuss implications for Games HCI and the design of computational coaching systems.
Read the full abstract

Artificial Intelligence

I Am AdMan: A Pipeline for Automatic Generation of Personalized Advertising Imagery

Personalized marketing can increase customer engagement, satisfaction, and conversion. While existing personalization approaches have become effective at matching the right product to the right customer, the visual representation of advertisements remains generic and only weakly tailored to the individual. Prior research shows that generative artificial intelligence can improve the creation of personalized advertisements, particularly for text, and that image generation models can support scalable advertisement production. However, little research has examined how detailed customer information can be systematically translated into fully AI-generated, personalized advertising imagery at scale on a technical level. To address this gap, we propose AdMan, a multi-agent pipeline that transforms customer data into personas, generates personalized advertisement images conditioned on product reference images, and applies an LLM-based judge agent for automated quality control. We implement the pipeline with two different model configurations and evaluate it across four products, using six celebrity personas for qualitative inspection, and 100 real customer profiles, producing 1745 advertisements. The evaluation combines a qualitative expert focus group and a quantitative artifact-rate assessment. The results show that the pipeline can generate photorealistic and personalized advertisements. At the same time, performance varies substantially by product complexity and model configuration. Our findings extend the literature on AI-based personalized advertising by demonstrating the feasibility and current limitations of fully automated image generation for advertising.
Read the full abstract

All authors Victor Kolominsky-Rabas, Leopold Müller, Claudius Budcke, Niklas Kühl

Theoretical Economics

Optimal growth under irreversible pollution: The Forster-Ramsey model

We study optimal growth in a Ramsey economy with irreversible pollution, where the natural absorption capacity is non-monotonic and non-concave a la Forster. In the absence of pollution control, the capital dynamics decouple from pollution, and we characterize a simple threshold on the maximal absorption capacity above which the optimal path is sustainable and below which an optimal regime of irreversible pollution sets in. We then introduce an optimal abatement pollution control to assess whether irreversible pollution ceases to be optimal. We derive a four-dimensional dynamical system for capital, consumption, pollution and the (shadow) cost of pollution, coupled with an algebraic rule for optimal abatement. First, we show that while optimal abatement does shift the irreversibility threshold, it may not rule out optimal irreversible pollution paths. Second, and more importantly, we show that embedding the Forster's pollution dynamics into a Ramsey growth model generates a novel and robust hybrid ecological-economic irreversibility condition that is invisible in pollution-only frameworks. Coupling ecosystem curvature with the social discount rate, it is structurally robust and preeminent over all feasibility conditions amenable to policy intervention, and defines the boundary between a world where sustainability is achievable and one where it is not.
Read the full abstract

All authors Raouf Boucekkine, Natalia Hritonenko, Yuri Yatsenko, Ullrika Sahlin

Analysis of PDEs

Lipschitz Stability Estimates for Master Fields with Measure-Variable Regularity in Mean Field Games

In this paper, we investigate the Lipschitz stability of the master field and its functional derivative with respect to the measure variable for the master equation in mean field games. A key novelty of this work is the derivation of a nonlocal parabolic partial differential equation governing the functional measure derivative along a characteristic measure flow. Based on this equation, we establish a Carleman estimate for the difference of the measure derivatives associated with two sufficiently regular classical solutions. We also establish a Carleman estimate for the difference of the corresponding master fields, yielding a terminal-to-interior Lipschitz stability estimate along a characteristic measure flow. Together with stability of the associated measure flows, these estimates are used to control the resulting source terms. We then obtain a terminal-to-interior Lipschitz stability estimate for both the master field and its functional measure derivative in terms of the discrepancies of the terminal data. The result provides quantitative control of the master field with measure-variable regularity, and develops a Carleman-based framework for the stability analysis of master fields and their measure derivatives in mean field game master equations.
Read the full abstract

Computer Vision

Semantically Aligned Gradient-Driven Context-Preserving Image Editing

Instruction-guided image editing has a training-time blind spot. Generative editors are never required to semantically verify whether their outputs actually satisfy the instruction. Supervision stops at reconstruction and input textual-level conditioning. This produces incomplete edits, spatial spillover, and poor localization. We present IABEdit, a model-agnostic framework that embeds differentiable semantic verification into training. A frozen vision-language model extracts spatially-aware descriptors from the ground-truth edit. A trainable aligner then reproduces them from the generated output. The residual between the two becomes a gradient that teaches the generator both what to edit and where, with no inference-time VLM cost. IABEdit is compatible with diverse backbones, including U-Net (Stable Diffusion) and MMDiT (FLUX), without altering their inference pipelines. On MagicBrush, it improves structural fidelity by +3.49 DINO-I over the best diffusion baseline and +1.26 over the best overall baseline, while remaining competitive on instruction alignment. It also achieves state-of-the-art instruction adherence performance on RealEdit and EMU Edit benchmarks based on embedding-based metrics. Most consequentially, on the D-LORD surveillance benchmark, it surpasses the proprietary Gemini agent by +5.13 DINO-P under heavy occlusion, where preserving identity is hardest. This shows that gradient-aligned VLM distillation holds up under real-world-like surveillance and occlusion conditions. Human and GPT-4o evaluations confirm perceptually precise, well-localized edits.
Read the full abstract

All authors Chiranjeev Chiranjeev, Muskan Dosi, Mayank Vatsa, Richa Singh

Machine Learning

SIFPBPNet: A Dual-Path Network for Wearable and Cuffless Blood Pressure Estimation via Individualized Steady-state Representation

Continuous and cuffless blood pressure (BP) monitoring using photoplethysmography (PPG) is of great interest for low-cost and personalized cardiovascular health management. However, significant population heterogeneity and the "one-to-many mapping" problem, where similar waveforms across individuals correspond to different BP levels, limit the accuracy of conventional population-based models. To address this challenge, we propose a dual-path architecture termed SIFPBPNet, which separately represents steady-state and instantaneous features, through a Steady-state Feature Path (SFP) and an Instantaneous Feature Path (IFP). The SFP employs a Graph Attention Network (GAT) to extract individual-specific and long-term characteristics from multi-day historical PPG trajectories. In parallel, the IFP captures short-term dynamics from current PPG segments and incorporates the steady-state prior via a cross-attention mechanism. Experiments on a large-scale wearable dataset demonstrate that SIFPBPNet achieves a Mean Absolute Error (MAE) of 8.57 and 5.97 mmHg for systolic and diastolic BP, respectively, outperforming state-of-the-art models. Furthermore, the SFP module consistently improves performance when integrated into various backbone architectures, yielding 2.8-13.1% relative MAE reductions for systolic BP. These results highlight the strong generalizability and plug-and-play transferability of the SFP module, underscoring its great potential for accurate cuffless BP monitoring.
Read the full abstract

All authors Shuailong Tang, Xiaoyu Li, Donglin Xie, Wei Chen, Guangpu Zhu, Yelei Li, Yali Zheng

Quantum Physics

Emergent universality in Kraus maps of quantum chaotic many-body dynamics

Recent studies of "deep thermalization" have revealed universal physics in quantum many-body dynamics beyond equilibration towards Gibbs states: maximally random quantum state ensembles can emerge on local subsystems, generated by measurements on their complement. In this work, we further identify a new form of universality exhibited in the "finer fingerprints" of quantum dynamics for local subsystems, induced by global unitary time-evolution. Specifically, we consider the projected Kraus ensemble, an ensemble of Kraus operators obtained by unraveling the quantum channel on a small subsystem with respect to knowledge of the classical configurations of its complement. Our central result is a one-parameter random matrix Ansatz that captures the ensemble's emergent statistical behavior along particular spacetime scalings, valid for generic 1D circuit dynamics without conservation laws: the ensemble is described by the product of a complex Ginibre random matrix and an independent log-normal random real scalar. The former encodes scrambling within the subsystem, captured by rotational invariance of the Ginibre measure, whereas the latter encodes fluctuations in the Born probabilities, arising from locality of the underlying dynamics. Our Ansatz can be established in the special cases of dynamics generated by global Haar random unitaries and dual-unitary circuits, while we motivate it for generic circuits using arguments of spacetime duality and the multiplicative ergodic theorem on long products of spatial transfer matrices. Extensive numerical simulations for random and Floquet circuit models verify these predictions. This universality in Kraus operators also provides a microscopic mechanism for deep thermalization in generic 1D quantum circuit dynamics, and has implications for local quantum information recoverability involving classical side information tied to knowledge of the bath.
Read the full abstract

All authors Qi Camm Huang, Wai-Keong Mok, Tobias Haug, Wen Wei Ho

Probability

No free lunch for continuity of stochastic convolutions

We construct compact, exponentially stable $C_0$-semigroups $S$ on Hilbert spaces $X$ such that, for every $T>0$, the stochastic convolution $U_g(t)=\int_0^t S(t-s)g(s)\,\mathrm{d}\beta_s $ is unbounded on $[0,T]$ with positive probability for some predictable $g\in L^\infty(\Omega;L^2(0,T;X))$, where $\beta$ is a real Brownian motion. One example is even an analytic semigroup. For the other, the negative generator $A$ has sectorial angle $\pi/2$ and a bounded $H^\infty$-calculus. Our main tool is a necessary condition: for exponentially stable semigroups, an $L^2$-maximal estimate on $\mathbb R_+$ forces a lower square-function estimate for the negative generator. We deduce this implication from a new identity involving the stochastic convolution, the subordinated Poisson semigroup, and a stopped Brownian motion. Combining this condition with Schauder multipliers on a conditional trigonometric basis yields counterexamples to the maximal estimate. An extrapolation argument then produces the integrands with unbounded stochastic convolutions. Finally, an energy-adapted chaining argument gives continuity and maximal estimates for arbitrary $C_0$-semigroups under the stronger condition $g\in L^2([0,T]; L^\infty(\Omega;X))$.
Read the full abstract

Optimization and Control

Extended Mean Field Control Games with Moment Interactions: General Framework and Linear-Quadratic Model

Mean field control games (MFCGs) provide a framework for studying non-cooperative games involving groups of cooperative players in the limit as both the number of players and the number of groups go to infinity.This class of games includes mean field games (MFGs) and mean field control (MFC) problems as special cases, corresponding to purely non-cooperative and purely cooperative settings, respectively. We incorporate interactions through the mean of actions, hence the terminology of extended MFCGs. We first show that the equilibrium control can be described using a coupled system of partial differential equations consisting of a Hamilton-Jacobi-Bellman equation and a Fokker-Planck equation. After introducing the general framework, we focus on a linear-quadratic (LQ) structure. We show that the equilibrium can be reduced to a system of ODEs, generalizing those obtained for MFGs and MFC problems. We then provide two numerical examples illustrating specific features of MFCGs.
Read the full abstract

All authors Zhongyuan Cao, Mathieu Laurière, Andrew Shi, Jiefei Yang

Artificial Intelligence

Residual Vector-based Reconstruction as Long-Context Recall Regardless of Context Window Size

Large language models (LLMs) process long contexts, including long documents and lengthy conversations, but face token-level memory usage that increases proportionally to input length. Although model optimization and lossy prompt compression are widely used, these methods still fail to solve the long-context recall problem beyond pretrained and size-constrained context windows. This paper proposes a long-context recall method that maintains near-constant GPU memory usage as context length increases, without additional training. The main idea is to reconstruct facts using parameter activations in the LLM's feed-forward layers, which store residual vectors representing facts from the source document. Utilizing residual vectors allows the LLM to deterministically reconstruct query relevant facts without referencing the original document, preserving high fidelity and reducing memory usage without fine-tuning weights. Experimental results show that the proposed method enables answering single-fact questions in two-million-token story contexts where previous methods fail.
Read the full abstract

Metric Geometry

Self-dual sets up to a translation: a negative answer to Milman's question

Let \(K,T\subset\mathbb R^n\) be convex bodies with the origin in their interiors. If \(K=T^\circ\), then the identity \( K+T=K^\circ+T^\circ \) holds trivially. V.~Milman asked whether these trivial solutions are the only ones, that is, whether \( K+T=K^\circ+T^\circ \) forces \(K=T^\circ\). We show that the answer is positive for polytopes but negative for general convex bodies.
Read the full abstract

Artificial Intelligence

Generative AI Use Cases In Real Estate Marketing: Adoption and Constraints in Germany

Generative artificial intelligence (GenAI) is changing how work is organized and performed. Real estate marketing is a prime example of this, yet evidence of GenAI in real estate agents' day-to-day practice remains scarce. In this work, we report on our insights from a German-based empirical study with eleven semi-structured interviews. GenAI is already utilized across different activities, with marketing communication being the most prominent. Concrete use cases are emergent and unevenly adopted, with writing exposé texts being the only widely established one. Interaction is predominantly human-in-the-loop: GenAI drafts, structures, and retrieves, while real estate agents curate, verify, and decide. Constraints stem less from model capability than from integration with listings and documents, data availability, and compliance in sensitive tasks. The study contributes a grounded map of existing and potential use cases and identifies tentative practical implications for adoption.
Read the full abstract

All authors Victor Kolominsky-Rabas, Leopold Müller, Felicia Perpina, Niklas Kühl

High Energy Physics (Experiment)

Search for a light pseudoscalar Higgs boson in final states with boosted muon pairs and tau lepton pairs in proton-proton collisions at $\sqrt{s}$ = 13 TeV

A search is presented for a light pseudoscalar Higgs boson, a, using LHC proton-proton data at $\sqrt{s}$ = 13 TeV collected by the CMS experiment from 2016 to 2018, corresponding to an integrated luminosity of 138 fb$^{-1}$. The analysis targets the process H $\to$ aa $\to \mu\mu\tau\tau$, where the scalar H can be either the 125 GeV Higgs boson or a heavier state. Because of the large mass difference between H and a, the two tau leptons are highly Lorentz boosted and collimated, often failing standard CMS tau lepton reconstruction. To address this, dedicated ditau reconstruction techniques, including a deep neural network, are developed to improve the efficiency for events in which at least one tau lepton decays to hadrons. No significant excess over the standard model (SM) background is observed. Model-independent upper limits at the 95% confidence level are set on the product of the Higgs boson production cross section and branching fraction, divided by the SM cross section. For a Higgs boson mass ($m_\mathrm{H}$) equal to 125 GeV, these limits range from 5$\times$10$^{-5}$ to 2.7$\times$10$^{-4}$ for pseudoscalar masses between 3.6 and 21 GeV. For the first time using LHC data, upper limits are also obtained in final states with tau leptons for a hypothetical scalar boson with a mass up to 1 TeV. For $m_\mathrm{H}$ = 1 TeV, the limits range from 3.5$\times$10$^{-4}$ to 1.5$\times$10$^{-3}$ for pseudoscalar masses between 3.6 and 50 GeV. In addition, limits are set for SM extensions involving two-Higgs-doublet plus singlet models for $m_\mathrm{H}$ = 125 GeV, extending previous LHC results.
Read the full abstract

Computer Vision

NOVA-GS: Noise-Aware View-Consistent Gaussian Splatting for Low-Light Novel View Synthesis

Reconstructing 3D scenes under real-world low-light conditions remains challenging due to severe sensor noise, low signal-to-noise ratios, and degraded photometric consistency, which destabilize geometry estimation and novel view synthesis. Existing approaches often rely on well-lit reference data for reliable Structure-from-Motion (SfM) initialization under degraded inputs or apply per-view enhancement methods that introduce cross-view inconsistencies. To address these limitations, we propose NOVA-GS, a unified noise-aware framework for low-light 3D Gaussian Splatting that subsumes enhancement, denoising, and geometry optimization within a single process. Our method leverages VGGT-based feed-forward estimation to obtain robust camera poses and geometry directly from degraded inputs, eliminating the need for SfM. Building on this initialization, NOVA-GS integrates three coupled components: a structure-aware enhancement module for exposure correction, a self-supervised denoising module with blind-spot masking for pseudo-supervision, and a consistency-driven Gaussian Splatting optimization enforcing cross-view geometric coherence. We further introduce a noise-guided spherical harmonic regularization to suppress view-dependent artifacts in noisy regions. Extensive experiments on diverse real-world low-light datasets demonstrate improved geometric fidelity, color consistency, and robustness without requiring paired supervision or well-lit references. https://shaurya2524.github.io/nova-gs/
Read the full abstract

All authors Shaurya Pavan A, Vemunuri Divya Madhuri, Yash Pradeep Gawande, Kaushik Mitra

Cryptography and Security

Bridging the First-Hour Gap: Evaluating AI Reliability and Benchmarking Deficiencies in Cyber Incident Response for Law Enforcement

The actions of frontline law enforcement officers in the initial hour of a cyber incident play a vital role in determining the ultimate success of an investigation. The minor mistakes they commit might result in irreversible critical impacts. The integrity of the investigation can be compromised, and the prosecution of cyber criminals can be hindered due to minor mistakes that happen in the initial hour. These are mainly because of the volatile nature of digital artifacts that might lead to procedural errors and evidence attrition. This paper provides a systematic survey of decision-support architectures designed to assist first responders of a cybercrime, categorizing them into playbooks, Large Language Models (LLMs), Retrieval-Augmented Generation (RAG) frameworks, and Agentic AI systems. The survey critically considers the constraints of limited technical proficiency and inconsistent forensic infrastructure in a practical scenario. Our analysis identifies RAG-based systems as a relatively viable intermediate solution due to their natural language adaptability. However, significant risk factors like prompt sensitivity and the potential for confident hallucinations in legal contexts pose a major challenge. Furthermore, we review current benchmarks in cybersecurity and demonstrate that they are not sufficient to capture the specific safety and legal requirements of law enforcement, focusing on the initial hour of the cybercrime. We conclude by arguing for the necessity of a new evaluation benchmark focused on naive query robustness and evidence preservation, so as to ensure that AI-driven guidance aligns with the mandatory demands of judicial proceedings.
Read the full abstract

Statistical Mechanics

Chirality enhances diffusion in disordered environments

Chirality, a systematic rotational bias in the motion of a particle, arises in a wide range of physical and biological systems, from charged colloids in magnetic fields to swimming bacteria near surfaces. While its effects in homogeneous environments are well understood, the interplay between chirality and structural disorder has remained largely unexplored. Here we investigate the chiral random walk on two-dimensional percolation clusters above the percolation threshold, combining numerical simulations with an analytically tractable annealed-disorder approximation. We find that the long-time diffusion coefficient depends non-monotonically on both the chirality parameter and the obstacle density: for every obstacle density above the percolation threshold, there exists an optimal chirality that enhances diffusion relative to the achiral walk. We show that the optimal chirality is set by an edge-adhering mechanism: maximum diffusion is achieved when the persistence length of the wall-adhering motion matches half the typical obstacle cluster perimeter. This yields a closed-form prediction for the optimal chirality in terms of geometric properties of the medium alone, which we verify across the full range of obstacle densities studied. The enhancement extends to first-passage statistics, where chirality shortens typical search times at strong disorder while lengthening them at weak disorder, with direct implications for biological navigation in disordered environments.
Read the full abstract

All authors Joshua Uhlig, Jan Wójcik, Ralf Metzler, Erik Kalz

Information Retrieval

Personalized and Trust-Aware Health Recommendation Policies for a Construction Workplace

Construction workers face workplace risks such as fatigue, heat stress, and other physically demanding conditions that can negatively affect their health and safety. Although monitoring these risks is important, timely and personalized health interventions are also needed to help prevent negative impacts on workers' well-being and productivity. To this end, in this paper, we propose a model to capture the interactions between a trust-aware health recommender system and workers who differ in health and trust sensitivity. Specifically, in our proposed dynamic model, worker health evolves over time, worker trust is affected by both health and recommendation dynamics, and trust in turn affects compliance with future recommendations. Given this model, we characterize the recommender policy, including a health-based recommendation triggering threshold and the recommendation frequency. We do so using both model-based short-horizon control and model-free reinforcement learning. We then investigate how recommendation frequencies are adjusted for different workers to balance their health, productivity, and trust. Our findings provide insight into the design of personalized health recommendation policies in construction workplaces and beyond.
Read the full abstract

All authors Atefeh Mollabagher, Yogesh Gautam, Houtan Jebelli, Parinaz Naghizadeh

Computer Vision

Detecting and Explaining Fake News Short Videos with Multimodal Content and Real-World Evidence

Short-video platforms have become a primary news source for the public, which has also enabled the widespread dissemination of fake news videos. We study the task of fake news video detection and explanation (FNVDE). Existing methods face two critical limitations. First, commonly used frame selection strategies may omit veracity-relevant cues or provide insufficient temporal context for understanding news videos. Second, prior methods neglect either multimodal understanding or evidence retrieval. To address these limitations, we propose NVKE-CEI, a unified system that integrates a news video keyframes extraction method (NVKE) and an FNVDE framework leveraging both content and evidence information (CEI). NVKE selects keyframes based on chronological changes in combined visual and OCR-text similarity. CEI employs two specialized LLM-based fact checkers (content-based and evidence-based) whose outputs are fused by a lightweight judge model. Extensive experiments show that NVKE-CEI outperforms state-of-the-art baselines while generating high-quality content-grounded explanations.
Read the full abstract

All authors Yifeng Luo, Yupeng Li, Ming Tang, Jianxiong Guo, Liang Lan

Robotics

Size Doesn't Matter: Material-State Reinforcement Learning for Excavator Transferable Soil Manipulation

Earthmoving tasks such as excavation, backfilling, or embankment construction require deliberate repositioning of deformable soil. For these tasks, human operators use all shovel faces, while autonomous systems so far are limited to excavation and dumping. Current methods often rely on heuristic models but do not incorporate soil mechanics. We address this shortcoming by using Reinforcement Learning in a GPU-parallelized Material Point Method particle simulation. Our controllers are conditioned on material state such as shape and compactness, enabling skills that use multiple contact faces of the tool and displace material both inside and outside of the shovel. To use the same learned weights across machines, our policies operate in a normalized end-effector space and are deployed through a calibrated machine interface. We evaluate this calibrated transfer on an 11.5t hydraulic excavator and a 500g tabletop robot. We validate performance through autonomous construction of a 42m long, 2.1m high embankment in 45min, executing 201 individual policy strokes without failure, retry, or operator intervention. In a direct comparison, the autonomous controller matches an expert operator's progression speed and produces a higher, more consistent embankment. Additional qualitative backfilling and compaction experiments demonstrate the material-state awareness and calibrated transfer across machines.
Read the full abstract

All authors Lennart Werner, Pol Eyschen, Sean Costello, Pierluigi Micarelli, Andrei Cramariuc, Marco Hutter

High Energy Physics (Theory)

Mass Dependence of Araki Relative Entropy through Modular Theory

Building on the established one-particle formula for the Araki relative entropy of coherent states, we study how its value acquires a nontrivial dependence on the mass of the scalar field. For a localized vector $h$ belonging to the standard subspace $H_m$ of the one-particle Hilbert space, the known quadratic-form expression is: $S_{H_m}(h)=-\langle h,\log\delta_{H_m}\,h\rangle$. Our contribution is to construct explicitly a mass-indexed family of vectors of the wedge standard subspace on which this expression is evaluated. The mass-shell map $h_m=E_mf$ organizes four structural conditions on rapidity representatives—on-shell dependence, a controlled massless boundary value, decay for large real rapidity, and Bisognano–Wichmann strip analyticity—and we exhibit an entire rapidity wave function, built from a doubled light-cone phase, two sinc factors, and a Gaussian pair, that satisfies them together with the sharp localization criterion: Hardy-type $L^2$ control throughout the Bisognano–Wichmann strip and the exact Tomita boundary relation. The family therefore belongs to $H_m(\W_R)$ for every $m>0$, and its Araki relative entropy is finite and strictly positive, with an exact spectral representation that makes positivity manifest. The entropy is strongly suppressed at large mass, attains a maximum at intermediate mass in $1+1$ dimension, and converges to a finite value along the modular flow as $m\to0^+$. The construction extends fiberwise to $1{+}d$ dimensions through the transverse mass.
Read the full abstract

Numerical Analysis

An Optimal IPDG Scheme for the Biharmonic Equation

This paper presents an optimal interior penalty discontinuous Galerkin (IPDG) scheme for the planar biharmonic equation using piecewise polynomials of degree $k=3$ or $4$. In standard IPDG methods, large penalty parameters force the discrete solution into an overconstrained space, severely degrading accuracy—phenomenon known as numerical locking. To overcome this, our method enforces only vertex continuity and projects the jumps of the function and its normal derivative onto $\mathcal{P}^{k-3}$ and $\mathcal{P}^{k-2}$, respectively. Consequently, as the penalty parameters tend to infinity, the discrete solution is forced to lie in a constrained subspace $V_{h,\infty}^k$, which we identify as the optimal nonconforming finite element space $B_h^k$. This intrinsic connection fundamentally eliminates numerical locking. We prove optimal error estimates of $\mathcal{O}(h^{k-1})$ in a mesh-dependent energy norm and $\mathcal{O}(h^{k+1})$ in the $L^2$ norm. Numerical experiments on both convex and L-shaped domains confirm that the proposed scheme is robust and entirely locking-free, even for extremely large penalty parameters.
Read the full abstract

Computation and Language

Doc2FRC: Length-Consistent Document-Level Machine Translation via Fixed-Range Chunking

Advanced large language models (LLMs) with long context windows can substantially reduce input truncation in document-level machine translation (DocMT). However, direct Doc2Doc translation remains prone to n-gram repetition and progressive quality degradation. A common remedy is to segment the document into finer-grained chunks. Nonetheless, conventional rule-based chunking approaches fail to handle the length distribution mismatch between training and inference. To address this, we introduce Fixed-Range Chunking (FRC), utilizing dynamic programming to partition documents into chunks within a predefined length interval. By consistently applying FRC during training and inference, the input documents of any length are mapped to the same length distribution, substantially reducing train-test length mismatch. Centered on FRC, we propose a lightweight dual-boundary matching algorithm for chunk alignment, alongside four distinct training strategies. Experimental results show that FRC-based fine-tuning substantially improves 7B LLMs over direct Doc2Doc fine-tuning and outperforms existing DocMT methods on IWSLT2017. We further construct GlobVDoc, a 10-language test set independent of mainstream DocMT training sources, and show that FRC improves out-of-distribution document translation.
Read the full abstract

All authors Xiaotian Wang, Youyuan Lin, Zhan Shen, Hitomi Yanaka

Combinatorics

A maximum matching based refinement of Brouwers conjecture

Let $G$ be a simple graph on $n$ vertices and $e(G)$ edges. Let $\mu_1\geq \cdots \geq \mu_{n-1}\geq \mu_n=0$ be the Laplacian eigenvalues of $G$. For $k=1, \ldots, n$, let $S_k(G)=\sum_{i=1}^{k}\mu_i$. Brouwers conjecture asserts that for any $k\in\{1,\ldots, n\}$, $S_k(G)\leq e(G)+\binom{k+1}{2}$. In [Bounding the sum of the largest Laplacian eigenvalues of graphs, Discrete Appl. Math., 170:95–103, (2014)], Rocha and Trevisan showed that the conjecture holds true for $1 \leq k \leq \lfloor g/5 \rfloor$, where $g$ denotes the girth of $G$. This bound on $k$ was later improved by Chen in [Improved results on Brouwers conjecture for sum of the Laplacian eigenvalues of a graph, Linear Algebra Appl., 557:327–338, (2018)], who established that the conjecture holds for $1 \leq k \leq \lfloor g/4 \rfloor$. In this article, we further strengthen these results by proving that the Brouwers conjecture holds for $1\leq k\leq\left\lfloor \frac{m(G)}{2}\right\rfloor,$ where $m(G)$ denotes the matching number of $G$. Since $m(G)\geq \lfloor g/2\rfloor$, the case constitutes a genuine improvement over the aforementioned results. As an application, we show that if $G$ is a graph of order $n$ and with a perfect matching, then the Brouwers conjecture holds for $1\leq k\leq \left\lfloor \frac{n}{4}\right\rfloor$. Finally, we provide a new perspective on verifying Brouwers conjecture by proving that $G$ satisfies the Brouwers conjecture if and only if for a fixed positive integer $h$, $\mathcal{S}_h(\overline{G})\leq e(\overline{G})+\binom{h+1}{2}$ holds whenever $\mathcal{S}_h(G)\leq e(G)+\binom{h+1}{2}$, where $\overline{G}$ denotes the complement of $G$.
Read the full abstract

High Energy Physics (Theory)

Two Recursions for the Seiberg-Witten Prepotential: Zamolodchikov's Recursion, the AGT Correspondence and Topological Recursion on the Seiberg-Witten Curve

The Seiberg-Witten prepotential of four-dimensional $\mathcal{N}=2$ gauge theory can be reached by two recursions of very different nature, and this thesis compares them explicitly. The first part is a self-contained review of the microscopic side: the ADHM construction as a hyperkähler quotient, the supersymmetric measure on the instanton moduli space, Seiberg-Witten theory, and the one- and two-instanton contributions computed by non-commutative resolution and localisation. The second part introduces the $\Omega$-background and Nekrasov's partition function, and uses the AGT correspondence to turn Zamolodchikov's recursion for Virasoro conformal blocks into a recursion for the instanton partition function. For pure $SU(2)$, this recursion is run up to five instantons, including the first corrections in $\epsilon_1,\epsilon_2$. In the last part, the same quantities are obtained from the Eynard-Orantin topological recursion on the Seiberg-Witten curve, which yields the Taylor expansion of the prepotential around an arbitrary point of the Coulomb branch. For pure $SU(2)$ we give the Bergman kernel and the $B$-periods of $\omega_{0,3}$, $\omega_{0,4}$ and $\omega_{1,1}$ in closed form. They reproduce the instanton series generated by Zamolodchikov's recursion, remain valid at strong coupling, where they detect the massless monopole, and at genus one give the first correction to the self-dual $\Omega$-background. The two recursions are thus complementary: one is exact in the vacuum expectation value and perturbative in the instanton number, the other is exact in the instanton parameter and perturbative around a fixed vacuum. We formulate a conjecture relating the $B$-periods of $\omega_{g,n}$ to the derivatives of the genus-$g$ free energy, and list open problems.
Read the full abstract

Optics

Prior-information based super-resolution optical metrology of 2D nanoscale objects

Previous work has shown that optical metrology of one-dimensional objects, such as slit width, can achieve improved accuracy by using prior information from similar objects to train the metrology estimator. Here, we demonstrate single-shot optical metrology of nanoscale elliptical particles by analysing their diffraction patterns to retrieve length, width and in-plane orientation using a neural-network estimator trained on prior information from nano-ellipses with varied dimensions and orientations. Fisher-information flow analysis was used to optimise the physical parameters of the metrology apparatus and maximise measurement accuracy. Using a 633 nm laser, we measure the dimensions of elliptical particles with accuracy down to ${\lambda}$/128, corresponding to 4.9 nm, and recover their orientation with 5${\deg}$ accuracy. Our results demonstrate the practicality of optical, deep-super-resolution, single-shot, multiparameter measurements of two-dimensional subwavelength objects, with potential relevance to microbiology and nanotechnology applications.
Read the full abstract

All authors Jin-Kyu So, Eng Aik Chan, Carolina Rendón-Barraza, Giorgio Adamo, Nikolay I. Zheludev

Signal Processing

Unified Constrained Geometric Configuration Optimization for Source Localization Systems: A Riemannian Manifold-Based Approach

Time of arrival (TOA), time difference of arrival (TDOA), received signal strength (RSS), received signal strength difference (RSSD) and angle of arrival (AOA) are commonly used techniques for source localization. The positioning accuracy of these systems depends heavily on the geometric configuration of sensors, which is typically constrained by practical conditions. This paper presents a unified framework for optimizing sensor geometry across all five localization systems, explicitly incorporating both distance and angle constraints on sensor positions. First, the Cramér-Rao lower bounds (CRLBs) of these systems are transformed to obtain a unified expression. Based on this expression, a unified constrained geometric configuration optimization problem is formulated. The problem is then simplified into a compact form by replacing the sensor-target angles with an orientation matrix. Subsequently, a Riemannian manifold-based constrained geometric configuration optimization algorithm (RM-CGCOA) is proposed to optimize the sensor-target distances and the orientation matrix. This algorithm casts the orientation matrix onto a product manifold of unit circles. An adaptive pullback is further proposed to strictly enforce angle-related inequality constraints, ensuring that all iterates remain feasible when updating the orientation matrix via the Riemannian gradient. Within RM-CGCOA, analytical optimal distances are derived for TOA, TDOA, RSS and AOA, whereas for RSSD, the distances are updated using projected gradient descent (PGD) together with the orientation matrix. Experimental results demonstrate that the proposed RM-CGCOA consistently achieves a significantly lower position error bound (PEB) compared with the existing strategies and yields a similar PEB to the near-optimal search algorithm, but with a much faster running time.
Read the full abstract

All authors Xin Cheng, Feng Shu, Gangle Sun, Xinrui Li, Yuqi Chen, Guangjie Han

Computational Complexity

Deterministic NC Quadratic Root Counting in Characteristic Two

Counting satisfying assignments of Boolean formulas is a basic problem in theoretical computer science, with $\#3\text{-}\SAT$ as the standard $\SharpP$-complete problem. More generally, counting the solutions of a system of polynomial equations over $\F_2$ is $\SharpP$-complete. Here we focus on the more structured problem of counting the solutions of a single polynomial equation. For polynomial equations over finite fields, Ehrenfeucht and Karpinski \cite{computationalcomplexityofxorandcountingproblems1990} showed a sharp difference between degrees two and three: quadratic root counting is solvable in polynomial time, while the degree-three problem is $\SharpP$-complete. Their quadratic algorithm is sequential. For fixed finite fields, Ishai et al.~\cite{ishai2012randomizing} later gave deterministic parallel algorithms in odd characteristic and randomized parallel algorithms in characteristic two. We give a deterministic $\NC$ algorithm for exactly counting the solutions of a quadratic polynomial equation over every fixed finite field of characteristic two. Our algorithm separates the radical and uses the absolute trace to realize the bit distinguishing the two nondegenerate finite-field types as the Arf invariant \cite{arf1941untersuchungen} of a quadratic form over $\F_2$. It then recovers that invariant from an integral matrix using Browder's determinant criterion \cite{browder2006complete}. This replaces the randomized canonical-form step in the algorithm of Ishai et al.
Read the full abstract

Computer Vision

Beyond Ambiguous Visual Cues: Studying Physiological Disruptions and Cross-Modal Inconsistencies in Deepfake Videos

Recent deepfake detection studies increasingly suggest remote photoplethysmography (rPPG) signals as an authenticity cue. However, existing benchmarks lack physiological ground truth, and current detectors underexplore the cross-level relationship between facial features and physiological dynamics, often relying on late fusion or rPPG features alone. In this paper, we construct high-fidelity deepfake manipulations on established real rPPG datasets (COHFACE and UBFC-rPPG) to investigate how forgeries disrupt natural physiological signals and facial behavior at the same time. Building on this analysis, we propose a bidirectional co-attention fusion detector that jointly models rPPG and facial behavior tokens. This mechanism explicitly captures the cross-level dependencies between pulse dynamics and facial motion to learn a robust, joint authenticity representation. Extensive experiments using a subject-disjoint 5-fold evaluation demonstrate the superiority of our approach. Achieving a 92.80% AUC on constructed datasets using face swapping and 96.78% AUC on motion transfer, our model outperforms both the rPPG-only single modality baseline and the best feature-level fusion methods. Furthermore, transfer-learning result of the fusion detector on Celeb-DF-v2 while keeping both feature extractors fixed achieves 91.20% accuracy and 86.08% AUC, which suggests applicability under target-domain adaptation.
Read the full abstract

Quantum Physics

Log-Sobolev inequality, von Neumann entropy and Entanglement of Formation

We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state $\rho$ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality $\,S(\rho)-S(\sigma)\leq C_\rho(1-F(\rho,\sigma))\,$ valid for any state $\sigma$, where $C_{\rho}$ is a constant depending on the rank of $\rho$. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state $\rho$ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality $\,E_F(\rho)-E_F(\sigma)\leq C_\rho(1-\mathrm{Tr}\rho\sigma)\,$ valid for any state $\sigma$, where $C_{\rho}$ is a constant depending on the Schmidt rank of $\rho$. In both cases the optimal constant $C_\rho$ is equal to the optimal constant $K_{d}$ in the log-Sobolev inequality for the complete graph with $d$ vertices: in the first case $d=\mathrm{rank}\rho$, in the second one $d=\mathrm{rank}\rho_A=\mathrm{rank}\rho_B$. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.
Read the full abstract