Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 7 November
A one-particle effective kinetic equation with repulsive Dirac-Delta potential in one dimension is rigorously derived from a moderate interacting second order particle system. It is proved that the Wasserstein distance between the empirical measure and the solution of Vlasov equation converges to zero. A convergence rate is obtained by a combination of the estimates for particle trajectory and a smoothed version of modulated energy.
Artificial Intelligence
Agentic discrete-event simulation for manufacturing system design: an open 3D simulator, a benchmark and an industrial case
The design of manufacturing systems relies on discrete-event simulation (DES) models that experts still build in tool-specific interfaces. AI agents can now write simulation code, but every model they write from scratch is new, unverified software. We present SimuLean, an open-source 3D DES simulator on the Unity engine designed to be programmed by AI agents: its modelling semantics are verified once, in the platform, and the agent builds and studies one model through domain-level commands, in the 3D scene or headless; physically simulated durations are calibrated for fast headless studies. We evaluated it on 18 manufacturing modelling tasks, from single machines to published production lines. A frontier agent built valid models in 93 of 108 attempts (86%), in about two minutes each; on the benchmark's interface version, two frontier agents built 105 of 108 models through domain commands alone, so that each comes with a record of how it was built. Every residual failure was silent - a model that builds and runs but answers wrongly - and only comparison with reference models revealed them all. In an industrial case, one agent working alone rebuilt, verified and studied a robotised welding workshop from a published study, in SimuLean and in SimPy. Comparing them with the published, expert-built model exposed an error in it; against the corrected model, the agent-built models agree within 1%. One agent can already build complete, realistic and traceable models for the design of manufacturing systems; independent reference models are what make them trustworthy.
Read the full abstract
Computation and Language
AI in the Clinical Documentation Loop: Effects of LLM-Induced Note Bloat and Diagnostic Overcall on Downstream LLMs
Large language models (LLMs) are increasingly used to process medical records for healthcare tasks such as clinical documentation. Because these tools also generate documentation, the relationship is now bidirectional: models both read from and write to the record. Understanding how LLMs behave when reading records that already contain LLM-authored content is therefore critical for their safe deployment. In this study, we examine how LLM-authored content in the medical record affects downstream LLMs that read the same record. We consider two types of LLM-induced artifacts: bloat, in which LLM-generated summaries accumulate in the record and change the length and provenance of its content over time; and distortion, in which LLMs subtly alter clinical findings rather than fabricating facts outright. As a case of distortion, we study diagnostic overcall (documenting an unconfirmed differential diagnosis in the record) and test whether it propagates to the reader LLM's output. Across seven reader models from four families, we find evidence of both effects. First, LLM-generated summary notes modestly but consistently degraded downstream hospital-course generation compared with copy-forward and templated text of matched length. Second, injected overcalls reappeared in downstream outputs at rates that varied by reader model, without detectable changes in standard quality metrics. These findings show the need to monitor AI-generated content in medical records and to account for it when those records are later processed by AI.
Read the full abstract
Artificial Intelligence
InfoOrgBench: Can Agents Turn Scattered Information into Coherent Hierarchies?
When agents organize records into folders, they may correctly group the excerpts of a design proposal yet place the proposal under the wrong owning group. Existing agent benchmarks do not directly measure such higher-level errors. We introduce InfoOrgBench, a benchmark of 150 tasks in which agents organize scattered records from meeting recaps, issue threads and design proposals into hierarchies. Integrity checks verify that every record is preserved, and a Structure Score measures agreement with the source hierarchy at every level, independent of folder names and order. We evaluate 45 systems that pair nine models with five agent harnesses. The best system scores 83.2 out of 100, but no system exceeds 78 on meeting recaps or issue threads. Model choice affects scores far more than harness choice: model means span about 27 points, whereas the average effect of each harness is below one point. More importantly, parent-level relations have higher error rates than leaf-level relations in all three domains. In design proposals, nearly half of the outputs analyzed by level make exactly this kind of error. These results show that evaluating information organization requires measuring higher-level relations separately from record preservation and local grouping.
Read the full abstract
Computer Vision
The RenAIssance: Caption-Guided Diffusion Models for Historical-Art Visual Media
Generative AI can expand cultural collections into prompt-responsive visual media, but historical artworks rarely provide the paired descriptions needed to adapt modern image generators. We present The RenAIssance, a scalable pipeline that turns a collection of historical European artworks into a reusable text-to-image media resource. The pipeline generates scene-level captions with BLIP and uses the resulting approximately 15,000 image–text pairs from DEArt to train a compact LoRA adapter for Stable Diffusion v1.5. The adapter shifts generated images toward the historical-art distribution while retaining the base model's ability to render novel concepts. On historical and contemporary prompts of different lengths, it improves FID to the DEArt reference distribution in every setting with only a modest decrease in CLIP text–image similarity. Qualitative results show that the same adapter can render both period-appropriate subjects and contemporary concepts in a coherent historical visual language. By decoupling a reusable style representation from the base generator, the approach offers a practical building block for controllable historical-art media creation, interactive authoring, and rich-media experiences.
Read the full abstract
Differential Geometry
Smooth local isometric embeddings in dimension four
We prove that every smooth four-dimensional Riemannian metric admits, near each point, a local isometric embedding into $\mathbb{R}^{10}$, and that this universal dimension is optimal. A Gram criterion constructs a regular analytic embedding of the Euclidean metric from a rational positive semidefinite tensor obtained by signed evaluations. A specified finite-field minor certifies characteristic regularity. The real-principal-type construction of Nakamura and Maeda gives openness of the metric map on a fixed ball. Rescaling then applies it to arbitrary smooth metrics.
Read the full abstract
Differential Geometry
Curvature estimates for stable hypersurfaces of the Euler-Dierkes-Huisken functional
A hypersurface $\Sigma \subset\mathbb{R}^{n+1}$ is called EDH-stable if it is a critical point of the Euler-Dierkes-Huisken functional $\mathcal{E}_\alpha(\Sigma)=\int_\Sigma|x|^\alpha\, d\mathcal{H}^n$ with nonnegative second variation, which was introduced by Dierkes and Huisken in \cite{[DH-24]}. In this paper, we first establish a Bellettini-type $\epsilon$-regularity theorem and use it, together with tangent cone analysis, to derive curvature estimates for EDH-stable hypersurfaces with $2\leq n \leq 6$.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Constraining Cosmic Deceleration using the Solar System
We investigate whether Solar System dynamics can provide independent constraints on the present day cosmological deceleration parameter $q_0$, offering a complementary approach to conventional cosmological probes. By relating cosmic acceleration to a weak Hooke type radial perturbation, we derive bounds using planetary perihelion precession, trans-Neptunian objects, and Oort cloud dynamics. We obtain relatively robust planetary bounds of $|q_0|\lesssim 10^9$, while the outer Solar System yields potentially stronger, albeit more model dependent, constraints approaching $10^5$. Through Monte Carlo uncertainty propagation and sensitivity analyses, we explore the statistical robustness of these estimates and their dependence on orbital measurements. Finally, we demonstrate how future precision astrometry and outer planet missions could improve these limits by several orders of magnitude, establishing Solar System dynamics as a complementary laboratory for probing cosmological acceleration.
Read the full abstract
Cryptography and Security
Design and Evaluation of Secure Distributed Chaotic Image Encryption on ESP32-S3
The limited computational resources of Internet of Things (IoT) devices present challenges for secure image processing. This paper presents a distributed chaotic image encryption system using independent Wi-Fi-connected ESP32-S3 microcontrollers. A master-worker architecture distributes image blocks through master-coordinated chaotic sequence management, maintaining one logically continuous chaotic sequence by assigning block-specific starting states independently of worker assignments. The implemented system uses reversible chaotic substitution (SUBSTITUTE), while Elliptic Curve Digital Signature Algorithm (ECDSA)-signed discovery messages and Transport Layer Security (TLS) 1.3 with mutual authentication secure device communication. Experimental evaluation using one, two, and four workers demonstrates a reduction in execution time from 43.215 to 15.878 seconds, achieving a speed-up of 2.72 times. The encrypted image achieves a Shannon entropy of 7.999940 bits/byte and near-zero adjacent-pixel correlation. Exact image recovery is verified through matching Secure Hash Algorithm 256-bit (SHA-256) hashes and a Structural Similarity Index (SSIM) value of 1.0. Additional experiments demonstrate successful encryption and decryption using different worker counts and block sizes, automatic task reassignment following worker failure, and rejection of a mismatched private key during TLS authentication. These findings demonstrate the feasibility of secure, flexible, and distributed chaotic image processing across independent resource-constrained IoT devices.
Read the full abstract
Distributed Computing
OneReel: Efficient Multi-Scene Video Generation with Scene-Structured Attention
Multi-scene video generation must follow scene-specific prompts while preserving consistency across scenes. Dense joint generation enables cross-scene information exchange but incurs quadratic attention cost, whereas separate generation avoids this cost at the expense of cross-scene consistency. We present OneReel, a training-free system that exploits scene structure to enable efficient multi-scene generation. Our key insight is that multi-scene generation can preserve complete intra-scene attention while restricting cross-scene information exchange to a bounded shared memory. OneReel uses scene prompts and durations to establish scene-specific attention scopes and dynamically selects a bounded set of representative latent frames for cross-scene sharing. This reduces video attention complexity from quadratic to linear in the number of scenes. To translate these savings into execution speedups, OneReel packs scene-local and shared K/V into dense variable-length attention and employs work-balanced multi-GPU partitioning with communication-aware selection between K/V gathering and Ulysses-style parallelism. Our evaluations across four video generation models show that OneReel achieves 1.7-4.9x end-to-end speedup over dense attention and 1.2-2.2x over existing sparse-attention advances, while improving text-following accuracy by 34-37 percentage points and maintaining cross-scene consistency.
Read the full abstract
Statistical Mechanics
Markov-Shielded Typicality for Thermal Quantum States
Pure states of quantum many-body systems at thermal equilibrium are known to be typical, in a sense that a randomly chosen pure state from an appropriate energy shell reproduces the Gibbs-state expectation values of most observables acting on a small subsystem. However, such typical states are intrinsically stochastic, conventionally generated from the random high-temperature state, suffer from statistical fluctuations, and do not provide a continuous connection to the ground state. Here, we introduce a deterministic variational framework for constructing a Markov-Shielded Typical (MST) state, a unique thermal pure-state representative whose local reduced density matrices closely approximate those of the Gibbs state, from the ground state up to infinite-temperature limit. Our approach reformulates free-energy minimization by replacing the nonlocal von Neumann entropy with a local, computationally tractable Markov entropy, where we establish rigorous upper and lower bounds of MST free energy to lie in the very vicinity of the thermal free energy. This framework extends the concept of typicality to deterministic pure-state representations of thermal equilibrium, offering a scalable wave-function approach with potential applications to both classical and quantum computing.
Read the full abstract
Computer Vision
MotionGraphicsBench: Evaluating Motion Graphics Generation with Programmatic Verification
Large language models can generate motion graphics from static images and natural language requests, but it remains difficult to evaluate how well models follow requests that combine spatial, appearance, and temporal requirements. We introduce MotionGraphicsBench, an expert-curated benchmark of 100 instances for animating an input static SVG with a motion edit prompt. By supplying all required visual elements, our editing task reflects a designer-like workflow and isolates motion generation from graphic generation. Derived from real-world Lottie motion designs, our benchmark contains diverse combinations of spatio-temporal animation behaviors. Each benchmark instance pairs its model input with a deterministic, human-readable verification program that accepts different valid implementations and reports which prompt requirements pass or fail, rather than comparing against a reference animation or using a VLM judge. We construct these programs with a multi-agent pipeline using human-labeled animations and synthesized test cases. On a balanced test set of 180 animations, our programs achieve 93.3% raw agreement with human judgments, outperforming frontier VLM judges by 4.4%-12.8% while achieving at least 90% recall for both human approvals and rejections. Across 47 configurations from 32 LLMs and 12 providers, pass@1 ranges from 5.0% to 68.0%. Across 15 models at their highest reasoning effort, additional attempts improve every model, but pass@32 still ranges from 38.0% to 95.0%. Our analysis of verification programs reveals that generated animations often fail to match reference poses, follow requested motion trajectories, or coordinate related events. We fine-tune Qwen3.8-27B with group relative policy optimization (GRPO) using our verification programs as rewards, improving pass@1 from 30.31% to 52.19% on held-out instances. Our project page is at https://motion-graphics-bench.github.io/.
Read the full abstract
Theoretical Economics
Sequential Candidate Entry: A Counterexample to the Osborne–Kats Conjecture
Finitely many potential candidates sequentially choose an electoral position on the interval [0,1] or stay out, observing all prior choices. Voters have a uniform distribution of ideal positions on the same interval and vote non-strategically for a nearest candidate; candidates at the same position divide its votes. Candidates with the largest vote share divide a unit payoff equally, losing entrants receive a negative payoff, and staying out yields zero. In the mid-1980s, Osborne and Kats conjectured that, for every number $n\geq 2$ of players, the unique subgame-perfect Nash equilibrium (SPNE) outcome has only the first and last players entering at the median. We refute the conjecture by establishing the existence of a different SPNE outcome for 12 players. Starting from the first two entries proposed earlier by de Vries, we select an SPNE strategy profile after the first two locations 1/2 and 1/10 that gives the second player payoff at least 1/10.
Read the full abstract
Probability
Strong relaxed dynamics in stochastic control
We characterize relaxed dynamics for which any finite family of strong state solutions, together with their relaxed inputs, can be approximated by the prescribed controlled dynamics, ground-stably in law. Relaxed inputs include parametrizations of relaxed controls over the unit interval. Unlike relaxed controls, these parametrizations determine action couplings. The proposed relaxed dynamics is driven by a single cylindrical Brownian motion in a Hilbert space. For each relaxed input, its state is the unique strong solution of the corresponding equation. The collection of these states, over all relaxed inputs, satisfies the approximation requirement. Conversely, suppose one assigns to each relaxed input a continuous adapted state process on a fixed probability space. Pairwise approximation forces the assignment to be the strong solution map of the same dynamics, for a unique cylindrical Brownian driver. In fact, even for a state map indexed by (non-parametrized) relaxed controls, the relevant relaxed control class admits coherent parametrizations under separability and finite-family approximation assumptions, and the same type of dynamics is recovered again.
Read the full abstract
Signal Processing
Intelligent Reflecting Surface for ISAC: From Beamforming to Joint Design With Surface Orientation
Rotatable semi-passive intelligent reflecting surfaces (SIRSs) provide an additional spatial degree of freedom (DoF) by proactively adjusting the orientation, while dedicated sensors directly receive target echoes. To exploit this DoF for integrated sensing and communication (ISAC), we investigate the joint optimization of SIRS rotation, base station (BS) transmit beamforming, and SIRS phase-shifts to minimize the Cramér-Rao bound (CRB) for target's spatial-frequency estimation subject to per-user communication signal-to-interference-plus-noise ratio (SINR) constraints. We first establish an orientation-dependent system model that characterizes the effective aperture gains, based on which the CRB is derived. To gain useful insights, closed-form expressions of the beamforming and rotation designs are derived in the sensing-only and communication-only cases. For the co-located user and target case, we further characterize the condition under which the sensing-oriented rotation design also satisfies the communication requirement. In the single-user single-target case with ideal unit aperture gains, we analyze the channel correlation and its impact on ISAC performance. For the general multi-user case, an effective method based on the genetic algorithm is developed. Numerical results demonstrate the superiorities of the rotatable SIRS over the fixed-orientation SIRS and show that jointly optimizing the SIRS orientation and beamforming can improve the effective aperture gains and the correlation between communication and sensing channels.
Read the full abstract
Quantum Physics
Initialization masks overcome decoding obstructions in compressed QAOA
In compressed quantum optimization, a variational state is converted into a classical assignment by decoding noncommuting observables. We show that this step creates structural restrictions that changing the initialization can remove, even when increasing circuit depth cannot. For an explicit infinite family of connected cubic graphs on $n=3r$ vertices, with a fixed Pauli encoding and deterministic sign decoder, every all-plus QAOA circuit has cut at most $2r$, at every finite depth and every real angle sequence. A uniform signed product-state mask at fixed depth-one angles has expected cut $13r/4$, an additive advantage $5n/12$; an infinite subfamily admits an optimal mask. A second construction retains a linear depth-one separation under weak weighted couplings, a bounded cost-angle domain and a specified production-encoder ordering. Noiseless simulations then test classical mask selection before energy optimization. On 1,699 random cubic MaxCut instances, one selected mask achieves mean ratio $0.9100$, versus $0.7067$ for the all-plus $X$ baseline and $0.9125$ for the best of $r^2$ separately optimized random masks. On complete cohorts of weighted MaxCut, sparse Ising, Max-2-XOR and Max-2-SAT, the selected mask also improves on the baseline at every size, but it trails the pool at small sizes and leads it significantly only at the larger MaxCut and Ising sizes. Finite-pool order statistics separate the effect of selection from that of drawing a random mask. The results distinguish decoded expressivity from optimized energy and empirical performance; they do not establish a quantum computational advantage.
Read the full abstract
Signal Processing
From Discrete Snapshots to Geometric Entity: Motion-Native Channel Tracking for THz Near-Field XL-MIMO
Channel tracking in mobile terahertz (THz) near-field extremely large-scale multiple-input multiple-output (XL-MIMO) systems is challenging because spherical-wave propagation couples angle and range, leading to rapid and nonlinear channel evolution under sparse pilot observations. Existing approaches typically estimate pilot-local channel or position snapshots before applying temporal tracking or smoothing, making them vulnerable to information loss during snapshot formation. To break this bottleneck, we propose a paradigm shift from tracking discrete snapshots to estimating a holistic geometric entity, namely, one shared continuous UE trajectory over the tracking window. Specifically, we parameterize the trajectory using a low-dimensional cubic B-spline representation and directly couple the per-pilot profile likelihoods through this shared trajectory before any pilot-local position estimate is finalized, thereby inducing continuous near-field channel evolution. We further characterize the efficient geometric information supplied by each pilot observation and its aggregation in the shared spline-coefficient space. Based on this formulation, we develop a regularized maximum a posteriori estimator and a quadratic-penalty lifted solver that separates parallel pilot-local geometric updates from a structured global spline update. The resulting global system is banded and, for a fixed spline degree, admits linear-complexity factorization, enabling an efficient structured implementation. Simulations demonstrate consistently improved tracking accuracy over representative temporally refined baselines in the tested medium-to-high-SNR regime, together with a favorable accuracy–runtime trade-off. These results highlight the benefit of coupling sparse pilot observations through a shared continuous trajectory rather than temporally processing independently estimated snapshots.
Read the full abstract
Multiagent Systems
M3FT: Micro-Macro-Micro Reasoning for Multi-Agent Cryptocurrency Perpetual Futures Trading
Cryptocurrency perpetual futures form a large-scale online financial market in which automated agents manage interacting asset positions under changing conditions. Policies relying solely on micro-level numerical states may overlook cross-asset relationships and become vulnerable to regime shifts, while macro-level linguistic judgments alone cannot ensure precise measurement or optimize positions under trading costs and risk constraints. Connecting market interpretation to coordinated multi-asset decisions remains challenging. We propose M3FT, a micro-macro-micro framework for multi-agent perpetual futures trading. The first micro stage constructs time-aligned numerical states from exchange and account observations through deterministic processing. The macro stage transforms these measured states into explicit market interpretations without adding external market information. Four asset-specific teams, each comprising a Market Interpreter, an Asset Communicator, and a Risk Reviewer, refine these interpretations through experience retrieval, cross-asset communication, and review of joint-position risks. The final micro stage combines encoded linguistic representations with the original numerical states to learn continuous target positions. We implement this framework with a language-conditioned multi-agent policy: asset actors use global and private numerical states together with linguistic context, while centralized critics evaluate joint actions using portfolio-wide information and shared-account rewards. Experiments on real cryptocurrency perpetual futures data, including comparisons across language models and policy-learning algorithms and component ablations, show that the best-performing M3FT configuration achieves a higher mean test return than the evaluated direct LLM, numerical RL, and rule-based baselines.
Read the full abstract
Software Engineering
Safe by Accident: Crash-Testing LLM-Written Code
Evaluations of LLM-written code run it once, in one environment, and credit the code with whatever passes. We show that this credit can belong to the environment. We crashed LLM-written backend code just before each database, file and email call, re-ran it as an operator would, and judged the result under two transaction modes of Python's sqlite3: the default, in which the library quietly opens a transaction, and autocommit, in which it does not. Across 9,100 solutions from ten models on 24 backend tasks, more than half (54%) of the database code that survives every crash in the default mode is left half-updated in autocommit mode. This holds for every model, and it hides in ordinary code, including with conn: blocks that look like transactions but open none. Telling the model that its connection is in autocommit mode does not change what the local code models write, while the API models' unsafe share falls by 30 points. Asking for crash safety helps every model, and strong models repair nearly all unsafe code, but often write safe code only when asked. Thus, much of the crash safety that LLM-written database code appears to have is borrowed from the library rather than designed into it, and a second test under a less forgiving configuration reveals the difference.
Read the full abstract
General Relativity and Quantum Cosmology
ERG, axions, and a PT-symmetric accelerating Universe
In conventional quantum mechanics, the Hamiltonian is required to be Hermitian, ensuring real energy eigenvalues. Certain non-Hermitian Hamiltonians can also possess entirely real spectra when they are invariant under the combined action of parity ($\mathcal P$) and time reversal ($\mathcal T$). Such Hamiltonians are called unbroken parity–time ($\mathcal{PT}$)-symmetric. We conjecture that, in a string-inspired scenario, a repulsive phase of gravity may be due to a $\mathcal{PT}$-symmetric gravitational theory, characterised by anomalous Chern-Simons terms, coupled to axion fields. The conjecture is based on the behaviour of the chiral anomalous couplings of these axions to electromagnetic potentials. Within the Exact Renormalisation Group (ERG) framework in the modified local potential approximation, we argue that singularities in the ERG beta functions for such couplings may indicate an infrared phase transition. At the energy scales of these singularities, we conjecture that the field theory transitions from the Hermitian phase to a ${\mathcal P}{\mathcal T}$– symmetric theory, of gravity, characterised by a repulsive Netwon's “constant”. This may induce the acceleration observed in the Universe at late eras, without the need for a dark–energy component.
Read the full abstract
Analysis of PDEs
From many-body Schrödinger dynamics to magnetic Vlasov equation
We analyse the combined mean-field and semiclassical limit from the time-dependent Schrödinger dynamics of $N$ spinless fermions in a non-constant magnetic field to the magnetic Vlasov equation with scaling $\hbar = N^{-1/3}$. With the velocity-shifted coherent states and the induced magnetic Husimi measure, we derive an exact BBGKY hierarchy with a remainder of order $\hbar^{1/2-}$. The main result is the weak $L^1$ convergence of the $k$-particle magnetic Husimi measures to the $k$-copies of the solution to the magnetic Vlasov equation. Furthermore, the convergence holds in the Wasserstein distance $\mathbb{W}_2$ when the second moment of initial Husimi measure correspondingly converges.
Read the full abstract
Systems and Control
Shifted Interaction Functions: A Unified Framework for Imperfect Actuation and Sensing in Consensus Networks
Practical networked robotic systems rarely implement ideal consensus interactions exactly, since local actuation constraints, sensing biases, and heterogeneous interaction maps may shift the input-output relations used by distributed controllers. Rather than focusing solely on whether consensus occurs, such imperfections can fundamentally alter the structure of the asymptotic collective behavior, typically yielding global or clustered velocity alignment, while exact static agreement arises only in special cases. This paper develops a shifted-interaction framework for analyzing collective alignment under imperfect actuation and sensing. Shifted functions provide a compact representation of local actuator and sensor maps, allowing actuation constraints and sensing biases to be represented by horizontally and vertically shifted monotone interactions. The framework distinguishes nodal shifted actuation from edge-wise shifted sensing. For shifted actuation, a Lyapunov analysis establishes global velocity alignment under compatible actuation ranges, including bounded, non-invertible, and deadzone-type maps. For shifted sensing, a maximum-principle argument and a paired-sensitivity condition establish convergence to velocity clusters over edges with infinite accumulated sensitivity; uniform sensing sensitivity yields exponential global velocity alignment. In the linear case, closed-form expressions characterize asymptotic behavior and identify actuation as a special case of sensing. Simulations illustrate static, globally aligned, and clustered velocity-aligned behaviors.
Read the full abstract
Artificial Intelligence
Receiver-Resolution APS-PDP Maps for Wireless Channels: Benchmarking and Coarse-to-Fine Modeling
Angle Power Spectrum (APS) and Power Delay Profile (PDP) are receiver-facing spectra that govern beam selection and wideband equalization. Most ray-tracing benchmarks provide supervision as variable-size multipath component lists. This format does not match practical receivers, whose angular and delay resolutions are limited by array aperture and system bandwidth. As a result, learning targets are ambiguous and evaluations can change with reconstruction conventions. We introduce UrbanADPSMap, a benchmark that converts ray-traced supervision into fixed-grid APS and PDP targets by explicitly modeling bandwidth-limited and aperture-limited response kernels. By fixing the receiver-domain kernels, discretization, and validity mask, UrbanADPSMap removes reconstruction-induced target ambiguity and stabilizes downstream evaluation across methods. Built on this benchmark, we propose SpecFlowAR, a coarse-to-fine generator based on multi-scale autoregressive flow matching. The model first captures coarse dispersion structure and then refines beam-relevant peaks and low-power tails. The number of function evaluations controls the sampling budget, enabling latency and quality to be adjusted for dense spectrum queries. Experiments on the test set show that SpecFlowAR reduces BPL@5 to 2.03 dB under a unified NFE=80 budget, while improving beam utility and reducing errors of 3GPP dispersion statistics.
Read the full abstract
Quantum Algebra
Integrals of motion for the deformed $W$-algebra $W_{q,t}(D_l)$
The deformed $W$-algebra $W_{q,t}(D_l)$ of type $D_l$ possesses an infinite family of commuting elements that can be viewed as a two-parameter deformation of the classical Hamiltonians for the KdV hierarchy of type $D_l$; these conserved charges are termed local integrals of motion (IMs). Concurrently, the quantum toroidal algebra $U_q(D_l^{"})$ of type $D_l$ admits four distinct representations via free field realizations, each corresponding to one of the four end nodes of the affine Dynkin diagram. Utilizing these representations, we associate an infinite set of commuting operators with each node, which we define as non-local integrals of motion. Both local and non-local integrals of motion act simultaneously on a shared Fock space consisting of $l+1$ free fields. We provide a direct, computational proof demonstrating that these local and non-local integrals of motion mutually commute.
Read the full abstract
Machine Learning
Predictive Modelling of Solid Waste Generation through Time Series Analysis
Reliable forecasting of Municipal Solid Waste (MSW) production is pivotal for sustainable urban management, as it enables efficient resource planning, optimized collection schedules, and reduced environmental impacts. Existing works on MSW forecasting have some limitations, such as unavailability of granular data from lower administrative units, small datasets, limited or sometimes no consideration of important factors that can affect MSW generation, including holidays, weekends, seasonality, changes in temperature or humidity. This work presents a comprehensive comparative analysis of four popularly used time series forecasting models, namely Seasonal Autoregressive Integrated Moving Average with Exogenous Regressors (SARIMAX), Prophet, Long Short Term Memory (LSTM) and Gated Recurrent Unit (GRU), using a real-world MSW dataset from Sri Lanka spanning 2012-2018. A detailed factor-wise analysis is conducted to examine waste generation behaviour considering holidays, weekday-weekend variations, seasonal patterns, temperature and humidity. The results show lower waste generation during holidays and weekends, higher generation during Summer and Winter, and comparatively lower generation during Monsoon and Post-Monsoon. Temperature and humidity do not exhibit a direct linear relationship with waste generation, although their seasonal variations are associated with the changes in waste generation across different seasons. All model performances are evaluated using Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE), Root Mean Squared Error (RMSE), and the coefficient of determination (R2). Among the evaluated models, LSTM and SARIMAX achieve the best overall forecasting performance.
Read the full abstract
Human-Computer Interaction
EgoVeil: Personalized Privacy Reasoning for Egocentric Video
Recent advances in vision-language models (VLMs) enable AI systems to interpret egocentric video. Yet continuous visual capture raises privacy concerns because sensitive content is pervasive and varies across users and contexts. We present EgoVeil, a personalized privacy reasoning system that determines which visual content to obscure based on individual preferences while retaining context useful for downstream assistance. It converts localized visual regions into structured semantic observations and combines a privacy reasoner with an explicit user-specific memory for personalized privacy reasoning. This design supports personalization and continual adaptation as preference evidence accumulates. We evaluate on in-the-wild data from 10 smart-glasses users under a cross-user chronological protocol. EgoVeil achieves 91.93% balanced accuracy and 84.42% Mask recall, outperforming direct VLM baselines and other controlled privacy reasoning baselines. Our results show that personalized, adaptive privacy reasoning better aligns privacy preservation with individual preferences while retaining the visual context needed for effective smart-glasses assistance.
Read the full abstract
Computation and Language
Global Context Guidance for Diffusion Large Language Models
Diffusion large language models (LLMs) have recently emerged as a promising alternative to autoregressive LLMs, enabling parallel generation through iterative denoising. Recent guidance methods improve diffusion LLMs by introducing a weak model to guide the prediction of the base model during denoising. However, the influence of the weak model during denoising remains less clear, and computing its prediction requires an additional forward pass at each denoising step. We present in this paper an in-depth analysis of how diffusion LLMs use contextual information during denoising. Our analysis reveals that diffusion LLMs rely more heavily on local context while often underutilizing global context. Based on this observation, we introduce Global Context Guidance (GCG), a feature-space guidance method that enhances global-context utilization without constructing an explicit weak model. Extensive experiments on LLaDA-8B, Dream-7B, and LLaDA-1.5 across diverse benchmarks demonstrate that GCG consistently outperforms existing guidance methods, while incurring much lower inference overhead.
Read the full abstract
Information Retrieval
When Greedy Is Sorting: Exact and Certified Ideal Rankings for Novelty Metrics
The ideal ranking that normalizes novelty metrics is NP-hard to compute in general, so widely used $\alpha$-nDCG evaluators approximate its denominator with a greedy rule that rescans every remaining document at each rank. We identify a regime in which this ideal ranking is exact and cheap for both $\alpha$-DCG and intent-aware expected reciprocal rank (ERR-IA). When each document is positively judged for at most one intent, each metric reduces to the classical allocation of a fixed budget across chains of decreasing marginal gains. A metric-specific virtual-score transformation followed by a multiway merge, which we call ChainMerge, returns the globally optimal top-$K$ ranking in $O(G+K\log G)$ time from $G$ preordered intent groups, or in $O(n+K\log G)$ time from $n$ globally preordered candidates, instead of the $\Theta(nK)$ of the greedy rule. When intent judgments overlap, exact $\alpha$-DCG optimization is NP-hard under the standard logarithmic discount and $\alpha=0.5$, even when every document has three intents and every intent occurs in two documents. For arbitrary overlap, a polynomial-size LP over nested ranking prefixes upper-bounds the ideal score and certifies the optimality gap of any feasible ranking. In the official TREC Web 2009-2012 judgments, 64.8% of positive documents serve a single intent, yet only 20 of 198 complete queries do so throughout. Beyond this exact regime, the LP certifies 189 of the 198 greedy denominators as globally optimal, and the resulting score intervals preserve the winner in all eight matched comparison groups. On 65,238 MIND-small candidates, ChainMerge returns identical optimal objectives 17-1,011 times faster than the greedy rule. For $\alpha$-DCG, these results trace the hardness of the ideal ranking to intent overlap.
Read the full abstract
Computer Vision
ROLECUE: Diagnosing Cross-Lingual Role-Binding Failures in Vision-Language Models
Vision-language models (VLMs) can recognize events in images and parse sentences, but it remains unclear when they bind visual Agent-Patient structure to linguistic semantic roles across languages whose role cues depend on morphology, word order or construction. We introduce ROLECUE, a controlled diagnostic that pairs 192 validated two-person action images with German, Turkish, Japanese, English, Korean and Bangla sentences in canonical and patient-first orders. The evaluation separates image-only role recognition, text-only role parsing, direct image-sentence matching, response-compliance behavior and an external modular composition of the model's own component predictions. Across eight recent open-weight VLMs, ROLECUE reveals a structured spectrum: some models fail visual or linguistic component tests, some largely solve the diagnostic, some collapse to constant semantic assent and several show component-joint gaps in which reliable image-only and text-only role predictions do not survive direct joint inference. The largest non-degenerate gaps reach 44.9 percentage points, with final bootstrap intervals confirming that the effect is not a point-estimate artifact. These results reveal multilingual component-joint performance gaps and acceptance biases hidden by aggregate VLM benchmarks and show why component diagnostics are necessary before interpreting joint multimodal errors.
Read the full abstract
Trading and Market Microstructure
Is price-impact decay statistically identifiable by propagator estimation? Diffusive prices force the inferred kernel to be transient and fine-tuned
Despite the long memory of market-order flow, price dynamics remain diffusive—a seemingly paradoxical coexistence known in econophysics as the diffusivity puzzle. The propagator model has long been regarded as a promising solution: price impact decays in time, finely balanced against the order-flow memory, and propagators inferred from data have been reported to be consistent with this fine balance. Here we prove a no-go theorem: asymptotic impact decay is not statistically identifiable by propagator estimation, since for diffusive prices the fine-tuned decay is returned whether or not the true impact decays. It rests on universal theorems for the Wiener–Hopf deconvolution by which propagators are inferred under long-memory order flow: (i) the inferred propagator is necessarily transient, even when the true impact is permanent; (ii) under a mild condition, it decays with the fine-balance exponent, fixed by the order-flow autocorrelation alone. The fine-tuned decay is thus a property of the deconvolution, not evidence of impact decay. We demonstrate this with an exactly solvable null model that retains order splitting and the square-root law but whose impact is strictly permanent: the inferred propagator shows an artificial fine-tuned decay although the true impact never decays. Nonlinear propagator estimation, being of Wiener–Hopf type, is subject to the same theorems whenever true metaorders have long memory.