Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Tuesday 1 September

Systems and Control

Strategic and Grid-Aware Maintenance Planning of Offshore Wind Farms

Wind turbines require regular maintenance and the resulting costs are a substantial component of a wind farm's cost of electricity production. As a result, there has been ongoing interest in improving wind turbine maintenance scheduling to find an optimal balance between maintenance costs and the risk of failure or unplanned repairs. What remains understudied is the opportunity for wind farms to schedule maintenance in the context of grid conditions and electricity market clearing. This paper contributes to closing this gap by modeling and studying wind farm maintenance planning in a grid and electricity market context. We also review current U.S. practice of wind farm maintenance scheduling, which motivates this paper and its models. Our focus is the derivation of a strategic maintenance planning problem, alongside an efficient solution approach, in which the wind farm operator aims to submit a derated wind farm capacity such that the resulting market clearing and electricity prices maximize its profit while ensuring that all required maintenance can be performed. We derive and study both deterministic and stochastic versions of the model, with the latter considering environmental and operational uncertainties. We conduct numerical experiments using the IEEE RTS 96-bus testbed with real-world offshore wind farm data and investigate the roles of farm and turbine size, as well as forecast quality. We observe an alignment between strategic and grid-serving maintenance planning and find that wind farms can improve their bottom line with low impact on system costs.
Read the full abstract

Systems and Control

IMU-Aided Correction of Orientation-Induced Ranging Error in Bluetooth Channel Sounding on Commercial Hardware

Bluetooth Low Energy Channel Sounding (BLE CS), standardized in Bluetooth Core Specification 6.0 (September 2024), enables distance estimation via phase-based ranging (PBR) and round-trip time (RTT). Although prior work has studied CS accuracy in configurations with a fixed orientation, no published work has studied how device orientation affects ranging error on commercial hardware. We present the first study of orientation-induced CS ranging error and a Machine Learning correction using IMU features. This study used the EFR32xG24 Channel Sounding Development Kit, the only commercial CS platform with an integrated six-axis Inertial Measurement Unit (IMU). Our results show that device orientation has a substantial effect on CS ranging accuracy; we found that a Random Forest model trained on the IMU derived orientation achieved a 74.6% Mean Absolute Error (MAE) reduction under a Leave One Orientation Out Evaluation, demonstrating that IMU readings have potential to improve ranging accuracy.
Read the full abstract

Computer Vision

You Cannot Photograph the Same Street Twice: Reliability Limits in Vision-Language Measurement of Urban Change

Vision-language models (VLMs) are increasingly used to measure urban change from repeated street-level imagery, and the results are often mapped for individual sample points. Such maps assume that a perception score changes only if the street does. We test this assumption with repeated Google Street View captures of unchanged streets in five US cities and with controlled experiments that hold the photograph, scene or camera fixed. Re-photographing an unchanged street shifts its perception score by two-thirds of the average difference between two streets in the same city. Much of this shift arises in the scoring and averages out over question orders; the rest comes from the photographs and is not predicted by image statistics of weather and light. A single image measures a place moderately well, but the change at one location barely separates redeveloped from unchanged streets. All models tested score degraded images as worse-looking streets, and in crowdsourced imagery camera differences cause false reports of physical change unless both images are rendered through a common virtual camera. After aggregation, redeveloped streets are scored as wealthier and better maintained, with more enclosure and less greenery. Streets photographed in the same capture campaign share part of their error, which averaging within a district does not remove. For urban research and planning, VLM perception scores can support comparisons between groups of streets, such as redeveloped and unchanged streets photographed in the same campaigns, but not the identification of individual streets that improved or declined.
Read the full abstract

Robotics

Human-robot conversation with multiple participants in noisy public spaces

For noisy real-world environments such as those in open public spaces, spoken dialogue systems for both autonomous robots and avatars should be carefully designed to provide enhanced speech signals. These signals can be used either for speech recognition or, in the case of an avatar system, transmitted as clean speech to a remote operator. This work proposes an audio system that can be used for both these scenarios and was demonstrated as a proof-of-concept at the 2025 World Expo in Osaka. The first scenario is an attentive listening system with the android ERICA, and the second is a conversation support system with mobile Teleco robots, with one of them acting as an avatar for a remote operator. Both systems feature multi-party conversation and use a single multi-channel microphone array. We describe how our audio system not only enhances the speech of multiple speakers in a noisy environment, but provides a form of spatial audio which allows for more immersiveness in avatar-based conversational interactions.
Read the full abstract

All authors Divesh Lala, Yogeeswaran Muthukumaran, Vincent Fernandes, Kazushi Kato, Shota Fujiki, Zihao Chi, Masaya Iwasaki, Taiken Shintani, Megumi Kawata, Kazuki Sakai, Koji Inoue, Yuicihiro Yoshikawa, Tatsuya Kawahara

Machine Learning

DK-GBMKKM: Dynamic Kernel-Space Granular-Ball Multiple Kernel $k$-Means Clustering

Multiple kernel $k$-means integrates complementary nonlinear similarities by learning a combination of base kernels. Its pointwise optimization, however, is sensitive to noisy and boundary samples and repeatedly operates on sample-scale kernel matrices. Granular-ball representations organize local sample groups into mesoscopic units, but granular balls generated once in the input space may be inconsistent with the fused-kernel geometry that evolves during multiple kernel learning. We propose dynamic kernel-space granular-ball multiple kernel $k$-means (DK-GBMKKM). The method generates granular balls in the current fused kernel space and alternates kernel-weight learning with granular-ball membership updates, allowing the representation to adapt to changes in the fused-kernel geometry. A sample-size-weighted granular-ball kernel is further constructed to preserve the contributions of balls of different sizes, and its positive semidefiniteness and related equivalence properties are established. Experiments on 12 public datasets demonstrate the strong overall clustering performance of DK-GBMKKM. The code has been open-sourced for reproducibility: https://github.com/lianxiaoyu724/DK-GBMKKM.
Read the full abstract

All authors Xiaoyu Lian, Yuchao Zhang, Shuyin Xia, Siqi Zhong, Xuzhao Xiang

Artificial Intelligence

DramaChain Bench: An End-to-End Benchmark for Short-Drama Generation

Commercial short-drama production follows a multi-stage chain: script, storyboard, keyframe imagery, shot-level video, and the finished short drama. Most existing benchmarks evaluate solely the video-generation stage using pre-authored inputs instead of real upstream pipeline outputs. This leaves two critical questions unanswerable: whether each stage adheres to the original script intent (rather than only its immediate input prompt), and whether disparate shots remain coherent after assembly into multi-episode releases. We present DramaChain Bench, the first short-drama benchmark that evaluates every stage of the complete production chain. It is built upon three in-house systems sharing one dimension system, DramaChain Dimensions: five evaluation axes instantiated at every stage, resolving into 63 leaf dimensions. DramaChain Agent is calibrated against commercial short-drama platforms in both workflow and finished short-drama quality, enabling stage-wise fair comparison across models. DramaChain Labeling System has each of the 5,785 items scored independently by three professional annotators, with all defects spatio-temporally localised and selected from a predefined defect list. This process produces 17,488 valid scores and 255,925 traceable attribution records. The human annotations confirm that upstream defects cascade across the pipeline, demonstrating that final episode quality is not governed by video generation alone. DramaChain Agentic Judge then scores every leaf dimension automatically, gathering evidence over multiple agentic rounds before judging against a per-item checklist; it reproduces the model ranking at a mean PLCC of 0.918, enough to admit new models at no annotation cost.
Read the full abstract

All authors Haoyuan Shi, Mingtao Chen, Shuo Jiang, Ziyan Chen, Xuyi Sheng, Yiming Liu, Ying Zhang, Miao Wang, Jianxiang Lu, Fanyang Lu, Songyuanyi Lu, Xiele Wu, Zhichao Hu, Yuhong Liu, Richeng Xuan

Analysis of PDEs

Global persistence of nearly radial concentrated vortices in a bounded domain

In this paper, we study the evolution of nearly radial concentrated vortices for the incompressible Euler equation in a bounded planar domain. We prove that if a single vortex is initially concentrated near a strict local minimum point of the Robin function of the domain and is close, up to translation, to its symmetric decreasing rearrangement, then both its shape and location remain uniformly controlled for all time. We also establish an analogous result for a pair of opposite-sign vortices near a strict local minimum point of the corresponding Kirchhoff–Routh function. No symmetry is imposed on the domain or the initial data, and the initial data need not be close to any steady state. To prove these results, we develop a new Lyapunov mechanism for the evolution of vorticity governed by the Euler equation starting from such initial data, providing quantitative control of both vortex shape and location. Specifically, we combine kinetic-energy conservation and vorticity equimeasurability with several fixed-time estimates to obtain a conditional estimate, and then use a set-valued first-exit argument to propagate it globally in time.
Read the full abstract

Optimization and Control

Disciplined Bilevel Programming

Bilevel optimization provides a natural modeling language for hierarchical decision problems. However, applying existing numerical solvers usually requires substantial manual analysis and reformulation. In this paper, we introduce disciplined bilevel programming (DBLP), a symbolic framework that allows users to specify and solve optimistic bilevel problems in a high-level, human-readable way that is close to the mathematical formulation. For problems with a disciplined nonlinear upper problem and a convex lower problem satisfying the disciplined parameterized programming rules, DBLP automatically canonicalizes the lower problem into conic form and constructs an equivalent single-level reformulation using the conic Karush-Kuhn-Tucker conditions. We relax the resulting complementarity constraint and use a gap continuation procedure to approximately solve a sequence of smooth nonlinear problems. We implement DBLP in the open-source Python package BLVPY, an extension of CVXPY for bilevel programming. We demonstrate the modeling and solution capabilities of BLVPY on a range of bilevel optimization problems from several application domains. The proposed framework and implementation allow users to specify and solve bilevel optimization problems within a few lines of code, without prior expertise in bilevel modeling and numerical optimization.
Read the full abstract

Artificial Intelligence

REVISE: Validity-Guided Recovery for Online Revisions in Agent Workflows

Agent revisions expose a fundamental correctness–efficiency trade-off during concurrent execution. Discarding ongoing work preserves latest-version correctness but wastes progress that may remain valid, whereas reusing prior work preserves efficiency but risks propagating stale state into outputs and tool effects. Existing recovery strategies resolve this trade-off in an imbalanced way with coarse-grained policies: they either favor efficiency by allowing potentially stale work to continue, or favor correctness by restarting the workflow or recomputing a linear suffix from the earliest conflict, thereby discarding unaffected progress. We present Revise, a validity-guided runtime for fine-grained recovery in structured agent workflows. When a revision arrives, Revise first intersects its delta with recorded data and control dependencies and propagates the resulting impact through the partially executed DAG to identify affected work. It then stops invalid work, preserves validity-established progress beyond the earliest conflict, and recomputes only the affected region. Incomplete provenance conservatively expands recovery, while reused results are revalidated before commit. Analysis of real coding-agent traces show online recovery opportunities: 118 sessions retain observable work before a queued later message is delivered; across 167 overlapping assistant responses, enqueue-to-completion overlap reaches 56.55~s at p95. Across 300 challenging revision/commit executions, Revise matches a latest-version oracle with no stale outputs or effects. On unmodified LangGraph and LLMCompiler applications using Qwen3-14B, it reduces model calls by 40.6–56.0% relative to full restart and by 31.3–43.6% relative to suffix recomputation. Under serving pressure, it further reduces revision-to-correct-completion tokens by 13.26% and improves SLO goodput by 3.07–5.43%.
Read the full abstract

All authors Ruoling Qi, Xuaner Wu, Penghang Liu, Jian Chen, Yirui Liu

General Relativity and Quantum Cosmology

Circulation and operational sparsity of analogue Hawking radiation in rotating acoustic horizons

Temporal sparsity compares the mean interval between emitted quanta with a characteristic single-quantum timescale. We study this operational quantity for the rotating draining-bathtub acoustic horizon in two spatial dimensions. The Hawking temperature is fixed by the radial drain and does not depend on circulation, while the geometric capture width and the transmission spectrum do. A geometric black-body benchmark therefore predicts reduced temporal separation as circulation increases. We then solve the radial scattering problem and compute converged greybody-corrected number and energy fluxes, including the superradiant sector. At a circulation-to-drain ratio of unity, the thermal-clock sparsity is 0.44 whereas the spectrum-based sparsity is 1.82. The former crosses the temporal-overlap benchmark near a ratio of 0.40, while the latter remains above unity at all sampled circulation ratios. We also show that the binned sparsity definition is logarithmically infrared sensitive in two spatial dimensions. Rotation therefore enhances the number flux while hardening the spectrum, making temporal overlap intrinsically dependent on the operational clock used to resolve the emitted quanta.
Read the full abstract

Robotics

AM-Bench: A Modular Simulation Suite and Benchmark for Aerial Manipulation Policy Learning

Standardized benchmarks have played a central role in advancing robot manipulation learning, yet most focus on ground-supported manipulation systems, which limits their applicability to dynamics-critical domains such as aerial manipulation (AM). AM presents distinct system-level challenges, including environmental disturbances, coupled dynamics between the manipulator and floating base, and constrained degrees of freedom. Consequently, task performance depends jointly on robot embodiment, low-level control, and high-level policy design. We introduce AM-Bench, a modular simulation suite and benchmark for multirotor-based AM policy learning. AM-Bench includes representative embodiments spanning underactuated, fully actuated, and overactuated systems, 12 tasks across contact, transport, and constrained interaction, configurable aerodynamic disturbances and actuator saturation, standard low-level controllers, and baseline policy-learning algorithms. Unlike prior manipulation benchmarks that primarily emphasize end-to-end policy performance, AM-Bench enables system-level evaluation of how embodiment, control, disturbances, and policy choices interact. We demonstrate its diagnostic value through three simulation studies spanning high-level policies, policy–control interfaces, and embodiments, together with real-world validation of modeled effects and a hardware test of the learning pipeline.
Read the full abstract

All authors Yutong Wang, Dongjae Lee, Xiaofeng Guo, Yuanzhu Zhan, Yufei Jiang, Bavin Saravanan, Muqing Cao, Jia Xie, Chenyang Mao, Sebastian Scherer, Junyi Geng, Guanya Shi

Sound

TUTTI: Toward generalizable audio-to-score transcription via fully synthesized data

Generalizable Audio-to-Score (A2S) transcription is fundamentally constrained by the severe scarcity of high-quality, real-world paired data. Relying solely on existing human-annotated datasets often restricts the generalization of A2S models, limiting their efficacy primarily to single-instrumentation domains. To break this dependency on scarce real-world data, we introduce TUTTI (Transformer for Unified audio-To-score Transcription trained on Synthetic multi-Instrumentation Data), a pre-training paradigm driven by a purely synthetic, large-scale dataset. Rather than using human-composed scores, we leverage a symbolic music generation model to generate a massive, highly scalable multi-instrumentation corpus and create audio-score pairs with expressive acoustic characteristics. Capitalizing on the generated data, we employ a standard Transformer encoder-decoder architecture. We empirically demonstrate that pre-training a unified attention-based model on generated, multi-instrumentation data yields a consistently stronger foundational representation than single-instrumentation training. When fine-tuned with downstream real-world datasets, TUTTI outperforms previous approaches, establishing new overall state-of-the-art results across various A2S baselines. Notably, TUTTI shows remarkable cross-instrument transferability, effectively adapting to unseen instruments with highly competitive performance. The source code and the TuttiCorpus dataset will be made publicly available at https://github.com/a-musiclover/TUTTI.
Read the full abstract

All authors Jianhuai Hu, Yashan Wang, Shangda Wu, Zhancheng Guo, Shijie Liang, Wuna Meng, Chuanqi Yang, Xiaobing Li, Feng Yu, Maosong Sun

Statistical Mechanics

Strengthened second law for periodic processes

We derive a lower bound on the entropy production of any physical system that evolves as a periodic process. Crucially, this lower bound is completely independent of the physical mechanism implementing the periodic dynamics; it follows purely from the definition of entropy production and the fact that whatever the physical mechanism is, it repeats in each period. In particular, the lower bound holds in both Markovian and non-Markovian systems, in systems that obey or violate (local) detailed balance, and even if the underlying physical mechanism uses currently unknown laws of physics. Moreover, the bound is strictly positive whenever the dynamics is not logically invertible. In this breadth of applicability, our bound is a strict strengthening of the second law. We illustrate our bound for spins coupled to two heat reservoirs and for finite automata.
Read the full abstract

All authors Jake Schaefer, Ben Ansbacher, Jan Korbel, David H. Wolpert

Information Retrieval

It Takes Two to Match: Co-Evolving Generative Retriever with Reinforcement Learning

Retrieval is the first stage of modern search and advertising systems, selecting a candidate set from a large item universe for downstream ranking and auction. Recent work increasingly leverages LLMs to improve retrieval through query expansion, data synthesis, and retrieval-feedback training. However, the generative component is typically used for query-side augmentation, while final matching is still delegated to a downstream retriever. We introduce CoGR, a retrieval framework that instead trains LLMs to directly construct retrieval representations on both query and item sides. Each generator produces a compact set of keywords, which are matched directly through an inverted index, preserving compatibility with existing keyword-based retrieval infrastructure. CoGR uses a two-stage training pipeline. Supervised fine-tuning first establishes an aligned keyword space, after which co-evolving reinforcement learning alternately optimizes the query- and item-side generators with GRPO against the opposite side's frozen index. Both sides optimize the same query-to-item retrieval $F_1$ objective: the query side receives retrieval $F_1$ directly, while the item side receives a counterfactual marginal reward measuring the change in query-side $F_1$ caused by its generated keywords. Across 10 representative sparse, dense, and generative baselines, CoGR achieves the best performance on both an internal APP Marketplace dataset and the public WANDS benchmark, improving $F_1$ over the strongest baseline by $10.9\%$ and $36.1\%$, respectively. Further analysis shows stable co-evolution and increasingly aligned query–item keyword spaces over training.
Read the full abstract

All authors Runpeng Dai, Kaili Huang, Changsung Kang, Ciya Liao

High Energy Physics (Phenomenology)

Reanalysis of exclusive charmonium production at the $B$ factories

In this paper, we present a comprehensive analysis of the next-to-next-to-leading-order (NNLO) QCD corrections to the exclusive processes $e^{+}e^{-}\to J/\psi+\eta_{c}$, $e^{+}e^{-}\to J/\psi+\chi_{cJ}$, $e^{+}e^{-}\to \eta_{c}+\gamma$, and $e^{+}e^{-}\to \chi_{cJ}+\gamma$ $(J=0,1,2)$ at the $B$ factories, comparing perturbative expansions truncated at the amplitude level and squared-amplitude level. Our results show that the amplitude-level prescription improves the perturbative convergence, with the NNLO/LO ratios lying closer to the corresponding NLO/LO ratios than those in the squared-amplitude-level prescription. This improvement is particularly pronounced for $e^{+}e^{-}\to\chi_{c2}+\gamma$, where the NNLO prediction is about 27% of the LO result in the amplitude-level prescription, compared with only 12% in the squared-amplitude-level prescription. The amplitude-level prescription also reduces the residual renormalization scale dependence, particularly for the $P$-wave channels. Finally, the NNLO predictions are generally in good agreement with the available Belle and BaBar measurements and have central values closer to the data than those obtained with the squared-amplitude-level prescription. For channels with only upper limits, the predictions from both prescriptions are consistent with the experimental constraints, except for $e^{+}e^{-}\to\eta_c+\gamma$, where both NNLO predictions remain above the current upper limit.
Read the full abstract

Combinatorics

Forcing monochromatic subdivisions

We prove that for every integers $d \ge 1$ and $s\ge2$ there exists an integer $D$, that depends only on $d$ and $s$, such that for every graph $P$ with maximum degree at most $ d$, there is a graph $H$ with maximum degree at most $D$ in which every $s$-coloring of $V(H)$ yields a monochromatic subdivision of $P$.
Read the full abstract

Soft Condensed Matter

A deviatoric-stress closure for constitutive modeling of viscoelastic dynamics

Standard rheological measurements yield only selected stress components; thus, inferring tensorial constitutive equations from experimentally accessible observables is complicated. We propose a constitutive formulation written in terms of a deviatoric stress tensor, whose trace is zero, rather than the extra stress tensor. From rheometric data including shear stress, first and second normal stress differences under shear, and elongational stress under uniaxial elongation, we can construct a deviatoric stress state without the indeterminate isotropic stress. The deviatoric-stress dynamics is represented by a closure inferred through symbolic regression, constrained to satisfy material objectivity and a given linear Maxwell response. To demonstrate the proposed formulation, two closures inferred from stress responses of the Giesekus and Larson models successfully captured untrained transient-flow responses under planar elongation and mixed shear/uniaxial elongations at deformation rates around an inverse relaxation time. Steady rheological functions of the closures agreed with the original models in the linear-response regime and over a deformation-rate range connected to the training data, whereas deviations and divergent responses appeared at larger deformation rates outside the training regime. These results demonstrate that the proposed deviatoric-stress formulation provides a practical route for constitutive modeling of observable linear and nonlinear viscoelastic dynamics, while clarifying its range of validity under strong deformation.
Read the full abstract

All authors Souta Miyamoto, Shotaro Moro, Takeshi Sato, Shota Kato, Katsuaki Tanabe, John J. Molina, Takashi Taniguchi

Computer Vision

Beyond Landmark Extraction: A Framework for Robust Geometric Feature Evaluation in Structured Image Classification

Much of the literature on structured image recognition has disproportionately focused on the comparison of classification algorithms. Rather than investigating which classifier performs best, this paper instead asks: what should a classifier know before it ever makes a prediction? In structured vision problems such as gesture recognition, facial expression categorization, and medical image analysis, discriminative information lies less in individual pixels and more in spatial relationships between semantic parts. Raw pixel spaces are high-dimensional, sensitive to nuisance variation, and often obfuscate the geometric structures that make visual tasks interpretable. Landmark extraction provides one form of dimension reduction, but it does not by itself determine the information preserved. This paper studies the post-landmark feature map as the central object of analysis and proposes a systematic framework for constructing and interpreting landmark-derived representations as an, informed, feature-based "dimension reduction" step. Using static hand gesture recognition as a case study, we evaluate coordinate, distance, angle, and hybrid representations through perturbation and ablation experiments. The results show that visually variable data exposes substantial gaps between raw coordinate features and their geometrically invariant counterparts, while hybrid representations achieve the strongest overall performance by combining complementary geometric components. These findings frame feature construction as a fundamental modeling decision and ultimately suggests that the question of what representation should a classifier learn from is one worth asking. The code used for feature construction and evaluation is available at https://github.com/ShivMaureeCWRU/Feature_based_dimension_reduction
Read the full abstract

Logic

Infinite Communication Complexity and KW Games

We characterize the Borel sets with an infinite version of Karchmer and Wigderson's game linking finite circuit complexity to communication complexity. To this end, we formulate an infinite version of communication complexity and prove that a given subset of the Cantor space is Borel if and only if a certain infinite communication game is solvable. We utilize this connection to provide new elementary and purely combinatorial proofs of some classical results in descriptive set theory, including the analytic separation theorem and the equivalence of monotone and positive Borel sets. Another consequence is a characterization of Borel separability via the winner of a certain "cut-and-choose" game, which we use to obtain new combinatorial proofs that neither the set of ill-founded trees nor any infinite parity function is Borel.
Read the full abstract

Machine Learning

Breaking the Structural Identity: Personalized Federated LoRA Fine-tuning under Rank Heterogeneity

Large Language Models (LLMs) have achieved remarkable success across diverse domains, but their adaptation to privacy-sensitive, distributed datasets remains a challenge. While Federated Learning (FL) combined with Low-Rank Adaptation (LoRA) provides a resource-efficient paradigm for collaborative fine-tuning, practical deployments are hindered by the dual challenges of resource heterogeneity and data heterogeneity. Existing rank-heterogeneous methods primarily focus on bridging dimension mismatches for aggregation but typically provide a unified global model for all clients sharing the same rank, failing to capture client-specific features in non-IID scenarios. In this paper, we propose FedRoRA (Federated Rank-wise Personalized LoRA), a novel framework that enables fine-grained personalization within rank-heterogeneous federations. FedRoRA decouples adaptation into shared global directions and personalized rank-wise magnitudes governed by learnable diagonal scales. On the server side, it extracts a global subspace via singular value decomposition (SVD) and redistributes client-specific initializations through a personalized projection and top-$k$ selection mechanism. Extensive experiments on NLU and NLG benchmarks demonstrate that FedRoRA consistently outperforms state-of-the-art methods.
Read the full abstract

All authors Lei Wang, Jieming Bian, Letian Zhang, Jie Xu

Mesoscale and Nanoscale Physics

Floquet scattering and Fano resonances in nodal-ring and multi-Weyl semimetals: Role of propagating and evanescent modes

We develop a comprehensive Floquet scattering theory for quantum transport in periodically driven nodal-ring semimetals (NRSs) and multi-Weyl semimetals (mWSMs), extending our earlier study reported in Annalen der Physik 535, 2200460 (2023), in which evanescent modes were neglected, to a complete formalism that includes both propagating and evanescent channels. By solving the full boundary-value problem, we obtain the complete set of scattering states and show that, although evanescent modes are indispensable for satisfying the matching conditions at the potential interfaces, they carry zero net probability current and do not contribute to any observable transport quantity. We identify a previously unexplored transport regime in NRSs in which two propagating channels coexist and participate in coherent scattering, producing multi-channel quantum interference and Floquet-induced Fano resonances. The transmission, reflection, pumped shot noise, and the associated Fano resonance features are determined entirely by the propagating channels, and the resonance energies coincide with those of the corresponding quasi-bound states of the static potential well. Our results establish a unified framework for Floquet transport in anisotropic topological semimetals, and confirm that the approximation of neglecting evanescent modes in our earlier work is justified for all measurable transport properties.
Read the full abstract

Solar and Stellar Astrophysics

Discovery of the First-Ever Recorded Fading Event of the Wolf-Rayet Star WR 59

This paper presents the visual discovery of the first-ever recorded fading event of the Wolf-Rayet star WR 59. Historically documented as a stable star with an approximate magnitude of 13.9, the star underwent a sudden major decline during high-cadence visual monitoring in May 2021. On 11 May 2021 (JD 2459346), I observed the star plunge 1.3 magnitudes to a deep minimum of magnitude 15.2. It remained in this faded state for roughly 1 day before undergoing a structured 14-day recovery back to its baseline. This episode was independently verified by NASA's Transiting Exoplanet Survey Satellite (TESS) during Sector 38. The satellite's calibrated data stream confirms that the timing, structure, and recovery of the fade matched the ground-based observations. While a close 11.7 V companion star masked the true depth of the drop for automated large-pixel survey pipelines, this event firmly establishes WR 59 as an active dust-producing system. It demonstrates how high-magnification visual monitoring can successfully resolve crowded stellar fields.
Read the full abstract

Computation and Language

ExpArt-KG: Artwork Image Description Generation through Iterative Exploration of Knowledge Graphs

Large Vision-Language Models (LVLMs) achieve strong performance on image-grounded text generation and visual question answering. However, it remains difficult for them to comprehensively and accurately describe the factual relations among the entities and concepts associated with the objects depicted in an image. In this work, we propose a framework that efficiently exploits factual information from a knowledge graph via retrieval-augmented generation (RAG), with the goal of enabling LVLMs to generate detailed and accurate image explanations. Specifically, our method alternates between answer generation and knowledge-graph retrieval, and controls the search using a correctness judgment, thereby acquiring the necessary and sufficient factual information efficiently. We also construct a knowledge graph for the artwork domain (ExpArt-KG), in which the correspondence between images and entities is unambiguous. Applying the proposed method to this knowledge graph, we show experimentally that it improves the level of detail of artwork explanations and reduces the retrieval cost of external knowledge while maintaining generation quality comparable to that of iterating a fixed number of times.
Read the full abstract

All authors Yuta Kato, Shintaro Ozaki, Kazuki Hayashi, Yusuke Sakai, Hidetaka Kamigaito, Katsuhiko Hayashi, Taro Watanabe

Computer Vision

Restrict, Don't Retrain: Inference-Time VLM Guidance for Zero-Shot Aerial Segmentation

Global welfare often depends on the correct interpretation of aerial and satellite imagery. Acting on such imagery (mapping flooded ground, crop extent, or damaged infrastructure) demands pixel-level segmentation to ensure perfect class localization. Pretrained general foundation models, when applied directly, often miss important features and cannot always find all the classes belonging to a given scene, overlooking smaller objects that matter most. We use a single consumer-grade GPU running a vision-language model (VLM) to supply this missing guidance, improving segmentation while producing structured, auditable evidence that drives the result and can be inspected on its own. We fuse three approaches: the frozen foundation model that labels every pixel, and two queries to a VLM, one to choose the classes that matter, and one to locate the small objects the base model misses. Evaluating across four aerial datasets, we see consistent gains at each stage where the base model is competent.
Read the full abstract

Analysis of PDEs

Global well-posedness of radially symmetric strong solutions to two-dimensional compressible liquid crystal flows with large data and vacuum

We study the initial boundary value problem of the two-dimensional compressible nematic liquid crystal flow with the shear viscosity $\mu$ being a positive constant and bulk viscosity $\lambda$ being a power function of density with the power exponent $\beta$. Under the condition $\beta>1$, we establish the global existence and large time behavior of the radially symmetric strong solutions to this Vaigant–Kazhikhov type model of simplified compressible Ericksen-Leslie system of Dirichlet boundary conditions for the velocity and Neumann boundary ones for the director with arbitrary large data and vacuum. This work improves the results of Zhong and Zhou (Math. Ann. 390, 2024; J. Math. Pures Appl., 212, 2026) for general 2D domains by removing the geometric angel condition on the director and relaxing the constrain on $\beta$ from $\beta>4/3$ to $\beta>1$. The key ingredient is that the rigidity mechanism arising from the radial symmetry of director prevents concentration phenomena in the transported harmonic heat flow.
Read the full abstract

Dynamical Systems

Entropy on regular sets and periodic-orbit growth for singular flows

We study entropy and periodic-orbit growth for flows on metric spaces. First, we prove that the finite topological entropy of a flow on a compact metric space is completely carried by compact subsets of its regular set. Next, we establish a Bowen–Walters inequality for geometrically separating flows on possibly noncompact metric spaces, under uniform control at time zero and dynamical isolation at infinity. As applications, we obtain the Bowen–Walters inequality for singular suspension flows over expansive homeomorphisms, multisingular-hyperbolic sets—extending the upper-bound part of \cite{pyyz}—and asymptotically sectional-hyperbolic attractors such as Rovella's \cite{r}.
Read the full abstract

Graphics

Inverse Rendering for Modeling with Line Primitives

Faithfully capturing diverse real-world objects with fuzzy, anisotropic structures, such as hair, fur, fibers, and textiles, for efficient real-time visualization remains challenging. Recent radiance field reconstruction methods capture these structures from multi-view images using translucent volumetric primitives such as 3D Gaussians rather than opaque low-dimensional primitives (e.g., triangles, line segments, and polylines), thereby limiting compatibility with standard depth-tested rasterization, reflection modeling, and physical simulation. We present an inverse rendering method for reconstructing fuzzy geometry using explicit line segments, which are rasterized on a subpixel grid for anti-aliasing to reproduce a semi-transparent appearance. While straightforward to render, optimizing numerous line primitives to match target images poses a significant challenge. We address this by introducing a stochastic differentiable rasterizer for line segments that produces informative gradients with respect to vertex positions, attributes, and discrete connectivity. Experiments on synthetic and real-world datasets show that our method outperforms surface-based approaches in capturing fuzzy boundaries and achieves quality comparable to volumetric representations while relying entirely on explicit geometry. The resulting representation integrates seamlessly with standard graphics pipelines, enabling cross-platform rendering, various shading models, and physical simulation.
Read the full abstract

All authors Kenji Tojo, Ariel Shamir, Nobuyuki Umetani, Bernd Bickel

Computation and Language

Trust Your Guide Only When Certain: Uncertainty-Aware Sparse Alignment at Inference Time

A prominent paradigm in inference-time alignment employs lightweight supervisors to steer Large Language Models (LLMs). Through empirical analysis, we identify a structural mismatch in this paradigm: weak supervisors exhibit pervasive high entropy across the vast majority of tokens, yet prevailing dense intervention approaches mandate supervision at every decoding step. This leads to frequent low-confidence interventions that can disrupt valid base-model reasoning and incur substantial utility costs. To resolve this, we propose TUSA (Trust-based Uncertainty Sparse Alignment). Moving away from continuous oversight, TUSA reframes alignment as a dynamic arbitration process, introducing an uncertainty-aware arbiter that authorizes intervention only when two conditions are met: the supervisor is confident and the token is semantically salient. This mechanism effectively filters out uncertainty-driven noise and redundant supervision. Extensive experiments across multiple models and benchmarks show that TUSA consistently improves both safety alignment and general helpfulness. By bypassing approximately 50% of alignment steps, it not only enhances safety preference by up to 15.6%, but also boosts general preference rates by up to 12.0% compared to the dense baseline, demonstrating that selective, high-precision alignment can outperform continuous supervision.
Read the full abstract

All authors Zeen Zhu, Zhuo Li, Weiyang Guo, Liye Zhao, Haibing Di, Yequan Wang, Jing Li

Materials Science

Overcoming the Efficiency-Stability Trade-off in Spin-Orbit Torque Devices with Thermally Robust BCC NiW Alloys

The development of high-performance spin-orbit torque (SOT) magnetic memories is fundamentally constrained by a persistent trade-off between spin Hall efficiency, thermal structural stability, and perpendicular magnetic anisotropy in conventional heavy metals. Here, we overcome this limitation by engineering body-centered-cubic (BCC) Ni-doped W alloys as highly efficient and thermally robust spin-current sources. Ni$_{30}$W$_{70}$/CoFeB heterostructures achieve deterministic out-of-plane magnetization switching at an ultra-low critical current density of 1.78 MA/cm$^2$, nearly threefold lower than that of $\beta$-W, while maintaining a high anisotropy field of 8,500 Oe and a thermal stability factor of 57.9. The BCC Ni$_{30}$W$_{70}$ alloy preserves its structural integrity and the perpendicular magnetic anisotropy of the adjacent CoFeB layer after annealing at 450 $^\circ$C, demonstrating robustness under the stringent thermal processing conditions relevant to back-end-of-line integration. Harmonic Hall and ferromagnetic resonance measurements reveal a large spin Hall angle of -0.39 and a high interfacial spin transparency of 0.75, demonstrating efficient spin-current generation and interfacial transmission. First-principles calculations further reveal enhanced intrinsic spin Hall conductivity in W-rich BCC NiW alloys, associated with the Fermi level lying within a spin-orbit-coupling-induced band gap. These findings establish BCC NiW alloys as a scalable and thermally resilient material platform for energy-efficient SOT-MRAM.
Read the full abstract

All authors Yu-Ming Pan, Chen-Yi Wei, Yi-Cheng Tsou, Tsung-Yu Pan, Guang-Yu Guo, Chih-Huang Lai

Statistical Mechanics

Feedback-Enhanced Quantum Metrology and Clock Precision under Thermodynamic Uncertainty

Feedback can convert continuously monitored quantum jumps into a thermodynamic resource. We formulate full counting statistics for open quantum systems under unital jump feedback by incorporating the feedback maps into the tilted generator. The resulting trajectory ensemble determines both current fluctuations and the Fisher information of the measurement record. We show that feedback can enhance reservoir-parameter estimation and clock precision without necessarily changing average thermodynamic currents. This enhanced precision is not bounded by reservoir entropy production alone. By embedding the reduced dynamics in an enlarged measurement-feedback process, we derive a feedback-modified thermodynamic uncertainty relation in which the information entropy production of the feedback apparatus supplies the missing cost. A charge-monitored double quantum dot illustrates the framework: jump-conditioned feedback improves thermometry and chemical-potential sensing, and stabilizes a quantum clock defined by output-current ticks.
Read the full abstract