Peer Revenue Publish or profit

Papers

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

All of arXiv

Friday 4 September

Artificial Intelligence

LLM-Guided Program Evolution for Circle Packing: Breaking 10 Packomania Records for $28

We present Discovery Loop, a lightweight system that uses a large language model (LLM) to iteratively evolve optimization algorithms. Starting from a simple seed solver, the LLM proposes algorithmic improvements guided by a scoreboard of results and a history of prior ideas. Each candidate is evaluated against an independent verifier; improvements are kept and failures discarded. Applied to the Packomania circle-packing benchmark (csqv: maximize the sum of radii of N variable-radius circles in the unit square), the system improved the best known solutions for 10 values of N in the range 101-114, with gains of 2.4%-5.4% over prior records, all within 15 iterations and at a total LLM cost of $27.72. These results have been independently accepted by Packomania. We describe the method, analyze cost-efficiency dynamics including an adaptive plateau-detection mechanism, and discuss implications for democratizing automated scientific discovery.
Read the full abstract

Cryptography and Security

Operational Roles of QRNG-Derived Quantum Entropy in Bitcoin Proof-of-Work Architectures

Replacing classical entropy with QRNG output does not change honest Bitcoin PoW success probability when candidate headers remain distinct. The original contribution of this paper is a reproducible benchmark that locates and measures the operational value of quantum entropy in hybrid quantum-classical mining infrastructure through two scheduler-level observables, the entropy-efficiency factor $\eta$ and the reboot-diversity index $\rho$. Monte Carlo and scheduler simulations with confidence intervals show parity for competent deterministic and strong-classical baselines, while QRNG value emerges in assurance-oriented scenarios involving correlated restart faults, namespace reuse, and entropy provenance. The study is therefore positioned as a simulation-based validation framework rather than as a device-level QRNG demonstration; hardware-in-the-loop validation with recorded or live QRNG streams is identified as the next experimental step.
Read the full abstract

Computer Vision

Training-Free Logical and Structural Anomaly Detection via Calibrated Fusion

Industrial anomaly detection must handle two distinct defect families: structural anomalies, which manifest as local texture corruptions, and logical anomalies, which violate global rules on object count, composition, or arrangement. Existing detectors typically favor one family at the expense of the other. In particular, training-free methods effectively exploit frozen representations but lack an explicit notion of object count, while methods that reason about counts usually rely on category-specific component modeling. We show that counting ability can be introduced into training-free anomaly detection without additional training or part-level supervision. Our key idea is a normal-set calibration that aligns heterogeneous anomaly cues using statistics from normal images, enabling their direct fusion within a unified training-free framework. Built upon this calibration, our detector combines complementary frozen cues to address both logical and structural anomalies. On MVTec-LOCO, our method achieves image-level AUROCs of 89.0 and 95.9 on logical and structural anomalies, respectively, yielding a 92.5 average—the best among training-free detectors in our comparison. It remains competitive with methods requiring network training or part annotations, while its structural variant matches PatchCore on MVTec-AD (99.1 image-AUROC), suggesting that the proposed calibration generalizes beyond logical anomaly detection.
Read the full abstract

All authors Changyi Li, Miao Yu, Kai Dong, Yu Xiao

Artificial Intelligence

Constructing and Evaluating Clinical Reasoning Trajectories for Medical Agent

Evaluation of medical artificial intelligence (AI) agents remains predominantly answer-centric, assessing only the correctness of final outputs while overlooking the quality of intermediate reasoning. We propose MedTraj, a framework that treats reasoning trajectories as primary objects for modeling the progressive refinement of clinical evidence toward diagnostic decisions. A reasoning trajectory captures the state transitions among medical concepts—from clinical observations through evidential reasoning to a final conclusion—making the implicit reasoning chain of a medical agent explicit and inspectable. Each trajectory is scored across five quality dimensions: coherence, evidence support, hallucination, completeness, and traceability. Controlled error injection introduces targeted faults into otherwise correct trajectories to establish causal links between specific reasoning failures and measurable quality degradation. Step-level filtering based on marginal contribution identifies which individual reasoning steps drive or undermine reasoning trajectory quality. Quality-weighted reasoning trajectory context feeds these evaluations back into the model at inference time. Experiments across CareQA, PubMedQA, and CECMed demonstrate that reasoning trajectory context consistently improves reasoning coherence. For the severity assessment on the CECMed, quality-weighted reasoning trajectory context nearly doubles the correctness over the zero-shot baseline while cutting the hallucination ratio by 87%. Experiments show that 15.3% of reasoning steps carry most of the quality signal, and that extending chains beyond four steps yields diminishing returns.
Read the full abstract

All authors Yunqi Zhu, Wen Tang, Jinghao Niu, Wensheng Zhang, Xuebing Yang

Statistical Methodology

On E-Backtesting: Generalizations and Sample Size Determination

We present an approach for determining sample sizes required to detect underestimations of the expected shortfall with a prescribed power when applying the recently proposed e-backtesting procedure. We consider scenarios in which the value-at-risk at level $p$ is always estimated correctly, while the difference between the true expected shortfall and the value-at-risk is underestimated by a given factor $r$. We show that exploiting the structure of the backtest e-statistic proposed for backtesting the expected shortfall at level $p$ enables the derivation of approximate lower bounds for the required sample sizes by considering a sequence of independent and identically distributed Bernoulli random variables. We also discuss potential limitations of this approximation and compare the resulting sample size requirements with those obtained in practical applications using Monte Carlo simulations. Furthermore, we present generalizations of the e-backtesting procedure, in particular to risk measures which constitute Bayes pairs.
Read the full abstract

Artificial Intelligence

Measuring AI Accountability Through Argumentation Analysis: Can Model Reasoning Withstand Scrutiny?

AI oversight methods rely on ground truth for validation, but what constitutes appropriate AI behavior is contested. This leaves evaluation of moral reasoning in LLMs and debate-based oversight implicitly avoiding realistic ambiguity. We investigate an alternative standard designed to function despite such ambiguity: structural quality of the defence a model can mount for its verdicts in response to critical questions, measured through a four-phase dialectical protocol grounded in Walton's theory of argumentation schemes and Govier's criteria for argument cogency. The protocol is adaptive to different frames of reasoning, extends beyond multiple-choice framing, and treats both the reasoning that precedes a verdict and its post-hoc justification. Across nine frontier models and 200 high-ambiguity MoralChoice items – $6,778$ judge-scored cells, validated against $89.6\%$ inter-judge agreement on the binary failure judgment – models defend their reasoning well above the rubric minimum on every dimension. Failure mass concentrates on grounds and sufficiency, and correlates with epistemic hedging rather than argument length. Reasoning is better defended than post-hoc justification, on every model and every Govier dimension. The scheme a model presents in its justification differs from the one it reasoned with on a substantial share of dilemmas ($\geq 20\%$ per model), despite value-based practical reasoning dominating both tracks. The protocol catches strictly indefensible defences (self-contradiction, false premises), and it surfaces difficulties in characterizing the role of retraction in AI alignment, suggesting a need for more situated evaluations.
Read the full abstract

Systems and Control

Regional Frequency Constrained Dispatch Method Considering Spatial-joint Stochastic Disturbances and Contingencies

The increasing penetration of renewable energy challenges frequency stability due to high variability and declining inertia. Traditional frequency security constrained dispatch methods fail to capture regional frequency heterogeneity and spatially correlated stochastic disturbances, resulting in inaccurate frequency security enforcement. To address this, a regional frequency constrained dispatch method is proposed, considering the spatially joint stochastic disturbances and contingencies. Firstly, a multi-regional frequency response model is constructed, incorporating the Vine-Copula based characterization of regional stochastic disturbances and regional frequency support. Then, a progressive latent-bottleneck physics-informed neural network is applied to characterize differential frequency nadir terms and regional frequency support integral terms via an encoder-decoder architecture, which enables optimization compatible expressions of system frequency dynamics. Finally, a day ahead dispatch model is developed in which regional stochastic frequency constraints are embedded using a CVaR-based formulation. A case study on the IEEE 118-bus system shows that the proposed method outperforms the unified center of inertia embedded approach in mitigating regional frequency violations, with the regional frequency nadir and RoCoF improved by 32.76% and 2.06%, respectively.
Read the full abstract

All authors Nian Liu, Yubing Chen, Kai Jiang, Jiahao Liu, Cheng Wang, Tianshu Bi

Chemical Physics

Measurements of Diffusion Coefficients of CO$_{2}$ in 1-Butanol with a New Laminar Jet Apparatus and PFG-NMR, Pointing to Interfacial Mass Transfer Effects

A novel laminar jet apparatus (LJA) was constructed for precise gas-liquid mass transfer measurements up to 12 bar, significantly extending the technique's operating window. It was applied to carbon dioxide + 1-butanol between 283 K and 333 K. Corresponding measurements were performed using pulsed field gradient NMR spectroscopy (PFG-NMR), which does not involve interfacial mass transfer. Fick diffusion coefficients from LJA and self-diffusion coefficients from PFG-NMR were compared in the limit of infinite dilution, where both must coincide. Both methods show consistent trends, but LJA data are systematically lower. Experimental errors cannot explain the deviations. We therefore hypothesize an additional gas-liquid interfacial mass transfer resistance. PCP-SAFT combined with density gradient theory predicts high CO$_{2}$ enrichment at the interface, and the deviations correlate with this enrichment. Whether such an interfacial resistance exists and is caused by enrichment remains to be established in future studies.
Read the full abstract

All authors Oliver Großmann, Sarah Mross, Jens Wagner, Kerstin Munnemann, Fabian Jirasek, Hans Hasse

Materials Science

Cross-Layer Anomalous Hall Transport driven by Néel-Vector rotating in the Altermagnet candidate V2Te2O

In van der Waals (vdW) materials, weak interlayer coupling generally suppresses vertical dispersion, reinforcing the conventional paradigm that in-plane transport dominates over cross-layer channels. Here, using first-principles calculations and magnetic symmetry analyses, we uncover a giant, symmetry-unlocked cross-layer anomalous Hall conductivity (AHC) in the vdW altermagnet V2Te2O. In the magnetic ground state with Neel vector N//z, horizontal mirror symmetry protects a spin-polarized nodal chain near the Fermi level and strictly enforces zero anomalous Hall response. Tilting the Neel vector explicitly breaks this mirror protection, allowing spin-orbit coupling to gap the nodal chain and activate a sharp cross-layer Hall response. When the Neel vector is rotated into the in-plane configuration (N//x), cross-layer orbital hybridization generates intensive Berry curvature hotspots, boosting the cross-layer component of AHC {\sigma}_{yz} to approximately 255 S/cm, which exceeds in-plane component {\sigma}_{xy} by nearly two orders of magnitude. Furthermore, varying the azimuthal angle systematically redistributes the anomalous Hall response, enabling full directional control of transverse transport. Our findings demonstrate a highly sensitive cross-layer anomalous Hall switch activated by low-barrier spin canting, offering promising avenues for directional tensor selection and low-power multi-axial vdW spintronics.
Read the full abstract

All authors Yanan Pan, W. Z. Zhuo, Pan Gao, Ziyu Zhou, Junqing Xu, Lijie Shao, Damin Meng, Weiwei Chen, Zhongjun Li, Ye Yang

Robotics

ToPos: Automated Optimal Positioning on Topographic Manifolds using Constrained Geodesic Voronoi Decomposition

Reliable autonomous mapping, environmental sampling, last-mile logistics, and infrastructure deployment depend on the optimal surface area-balanced distribution of Spatial Reference Sites (SRS). Conventional 2D Euclidean methods often fail in high-relief environments by neglecting topographic variations and physical obstructions. This leads to significant planimetric distortion, spatial clustering, and the placement of targets in inaccessible or shadowed regions, compromising both data integrity and operational safety. This paper introduces ToPos, an automated framework for TOPography-aware Optimal Sampling on topographic manifolds. We treat the terrain as a discrete 2-dimensional manifold embedded in 3D Euclidean space and replace standard flat-map distances with non-Euclidean geodesic distances that follow the actual surface geometry. The point distribution is formulated as an optimization problem using a Constrained Geodesic Voronoi Decomposition, solved via a Riemannian Nesterov Accelerated Gradient (NAG) engine. Our approach restricts target locations to a feasible "safe zone," accounting for non-traversable slopes, vegetation, environmental occlusions, etc. Through evaluations on non-convex sinusoidal manifolds, we show that ToPos mitigates planimetric distortion by utilizing geodesic metrics. This approach results in a $\sim$74% improvement in optimal surface area-balanced distribution, as measured by the coefficient of variation (CV) of the Voronoi cell areas. The framework is architected as a Geographic Information System (GIS)-ready micro-service to bolster the mentioned applications. Index Terms: Topographic Manifolds, Geodesic Voronoi Decomposition, Infrastructure Deployment, 3D Mapping, Spatial Sampling, and Non-Euclidean Optimization.
Read the full abstract

All authors Rajesh Raveendran, Akseli Vanhamaa, Jaakko Suutala, Antti Tikanmäki, Juha Röning

2609.05084 · 4 Sep · \copyright 2026 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works

Optimization and Control

Trembling-Hand Perfection in Mean Field Games

We introduce an admissible trembling-hand refinement for stochastic mean field games formulated through relaxed controlled martingale problems. A relaxed MFG equilibrium is perfect if it is the common Wasserstein limit of two sequences of joint control-state laws. The first consists of full-support population perturbations admissible for the state laws they generate; the second consists of exact optimal responses to those perturbed state laws. This admissibility condition prevents the control and state coordinates of a perturbation from being varied independently. Under the standing continuity, growth, and coercivity assumptions, we prove existence without requiring compact controls or bounded coefficients. The proof combines a perturbed fixed-point argument in the compact-bounded case with truncation, uniform moment estimates, compactness, and stability of controlled martingale problems. A one-dimensional model with exactly two relaxed mean field game equilibria shows that the refinement is genuinely selective: only one equilibrium is trembling-hand perfect.
Read the full abstract

Materials Science

A locally ab initio computational framework for arbitrary incommensurate materials interfaces

Incommensurate materials interfaces constitute a broad and technologically important class of systems, yet their lack of shared periodicity limits predictive and computationally efficient first-principles electronic-structure methods. Here we introduce a scalable computational framework for constructing locally ab initio electronic Hamiltonians for arbitrary materials interfaces. Our approach exploits the nearsightedness of Wannier Hamiltonian matrix elements, enabling their systematic extrapolation and interpolation across interlayer registries. This strategy yields transferable Hamiltonians that retain first-principles accuracy while bypassing the need for prohibitively large commensurate supercells or Moiré approximations. We validate the framework on quasicrystalline 30{\deg} twisted bilayer graphene, reproducing experimentally observed spectral features including mirrored Dirac cones and minigaps at avoided crossings arising from generalized interlayer scattering. We further predict quasiperiodic flat-band states in experimentally accessible doping regimes. By enabling predictive electronic-structure calculations across structurally incommensurate interfaces, this framework establishes a practical route to first-principles exploration of emergent interfacial phenomena.
Read the full abstract

Machine Learning

Deep Microcompression: Structured Pruning and Bit-packed Quantization for Microcontrollers

This paper introduces Deep Microcompression (DMC), a hardware-aware pipeline for deep learning inference on bare-metal microcontrollers. DMC integrates structured pruning, quantization-aware training, and fixed-length bit-packing to achieve a 55.8$\times$ weight compression ratio on LeNet-5 (98.77% accuracy), generating a dependency-free C library with deterministic latency. On the RP2040 (Cortex-M0+), DMC reduces binary size by 3$\times$ versus TensorFlow Lite while matching its accuracy. Critically, DMC enables the first documented deployment of a standard CNN on the ATmega328P, a device constrained to 2KB SRAM, previously considered infeasible for CNN inference.
Read the full abstract

Earth and Planetary Astrophysics

Gravitational instability in planet-forming discs

During the earliest phases of star and planet formation, a young star is surrounded by a disc that can become gravitationally unstable. Indeed, if the protoplanetary disc is sufficiently massive, its self-gravity triggers the formation of large scale spiral arms, transporting angular momentum, trapping solid particles and, potentially, collapsing to form sub-stellar companions. In this paper, we review the theoretical and observational advances in the study of gravitational instability in protoplanetary discs over the last 10 years, since the advent of ALMA. These developments have transformed our understanding of gravitational instability, moving beyond its historical role as a theoretical mechanism for giant planet formation toward a physically rich framework that can be directly tested against high-resolution observations.
Read the full abstract

Artificial Intelligence

TruthInsightBench: An Evidence-Grounded Benchmark for Automated Evaluation of Open-Ended Scientific Discovery Agents

Autonomous coding agents are increasingly proposed as AI-scientist systems that conduct analyses and write research reports, but executing a prescribed analysis is not the same as making a discovery. Existing benchmarks are configured for reproduction: tasks, data, and rubrics are built around a hidden target study, and recovery of its result is rewarded. We present TruthInsightBench, a benchmark configured for discovery. Its 40 blind tasks, drawn from 40 peer-reviewed studies across 10 scientific domains, expose only a neutral scientific objective and frozen data; source conclusions, expected values, and analysis paths are withheld, leaving the agent to determine what claim the data support. A fixed LLM-based judge scores the evidentiary maturity of an agent's own claims along six dimensions, operationalized as 29 artifact-grounded items, with automated, deterministic aggregation and no per-instance human grading, so evaluation can be repeated automatically as agents evolve. On one frozen base model, four coding agents form a narrow plateau (58.4-60.3 of 100) with no statistically reliable pairwise separation: they execute and document analyses competently, with comparatively strong evidence auditability and novelty, but largely lack the discriminating acts that establish a trustworthy claim (controls, robustness, falsifiability, and cross-dataset generalization). The bottleneck is scientific judgment rather than coding, and genuine discovery remains out of reach. TruthInsightBench makes this gap a measurable target; data and scoring code are at https://github.com/TruthInsight-stack/TruthInsightBench.
Read the full abstract

All authors Zhibo Yang, Chen Zhang, Yuewei Zhang, Hao Wang

Mesoscale and Nanoscale Physics

Engineering Giant Thermoelectric Performance through Electrode-Coupling Geometry and Magnetic Flux in Quasiperiodic Su-Schrieffer-Heeger Rings

We investigate coherent thermoelectric transport in magnetic-flux-threaded quasiperiodic Su-Schrieffer-Heeger (SSH) rings with engineered multi-site electrode couplings using the nonequilibrium Green's function formalism within the Landauer-Büttiker framework. We demonstrate that the electrode-coupling geometry serves as a powerful control parameter for tailoring quantum interference, thereby reshaping the transmission spectrum and thermoelectric response. In the absence of magnetic flux, the trivial dimerized phase ($t_1>t_2$) exhibits the highest thermoelectric efficiency, with asymmetric coupling producing a substantially larger figure of merit than the symmetric geometry. Magnetic flux further reconstructs the transmission spectrum through Aharonov-Bohm interference, driving a crossover of the optimal thermoelectric regime from the trivial to the topological dimerized phase. Under optimal flux conditions, the thermoelectric figure of merit reaches $ZT \approx 12$ for symmetric coupling and is dramatically enhanced to $ZT \approx 90$ for asymmetric coupling through enhanced energy filtering and suppressed electronic thermal transport. We further establish a clear correlation between the enhancement of thermoelectric efficiency and the violation of the Wiedemann-Franz law. Our results demonstrate that the combined interplay of quasiperiodicity, topology, magnetic flux, and electrode-coupling geometry provides a versatile strategy for engineering high-performance coherent thermoelectric devices.
Read the full abstract

Statistics Theory

Simultaneous Change-Point Inference for High-Dimensional Functional Time Series

We develop a framework for simultaneous change-point inference of high-dimensional functional time series. The observations are modeled as temporally dependent vectors whose coordinates take values in possibly different separable Hilbert spaces, thereby covering a broad class of functional data. Heterogeneous mean changes may occur at coordinate-specific locations, and the contemporaneous dependence across coordinates is left unrestricted. Our procedure is based on coordinatewise cumulative-sum statistics and a residual block multiplier bootstrap that provides a common critical value for the global test and all coordinatewise decisions. We establish a nonasymptotic Gaussian approximation, quantitative nonasymptotic bounds for strong family-wise error control under arbitrary mixtures of changed and unchanged coordinates, covariance-adaptive detection guarantees, and simultaneous high-probability bounds for change-point localization. The bounds accommodate high-dimensional regimes in which the number of functional coordinates grows exponentially in a power of the sample size. We investigate finite-sample performance in simulations and illustrate the method using river discharge curves and high-frequency financial log returns.
Read the full abstract

Audio and Speech Processing

Enhancing Neural Speech Coding with Semantic and Visual Cues

At low bitrates, neural speech codecs have limited capacity to encode all information needed for high-quality re construction, especially when relying solely on speech-derived representations. To address this limitation, this paper proposes a Semantic- and Visual-enhanced Speech Codec (SVSC), which in corporates semantic and visual cues into the neural speech coding process. Specifically, built upon a mainstream neural speech cod ing architecture, SVSC introduces a semantic encoding-decoding branch and an image analysis-synthesis branch. It fuses deep semantic features with visual cues through a cross-attention mech anism, forming an auxiliary high-level representation enriched with contextual and articulatory information. To handle different inference scenarios, SVSC introduces two information-injection strategies based on the availability of auxiliary semantic and vi sual cues. When such cues are available, the fusion mode directly incorporates the auxiliary representations into the speech coding branch through feature concatenation; otherwise, the distillation mode transfers auxiliary information into the speech coding branch through knowledge distillation during training, enabling speech-only inference without additional inputs. Experimental results validate the effectiveness of incorporating semantic and visual cues, improving the ViSQOL score of reconstructed speech from 3.86 to 4.01.
Read the full abstract

All authors Yao Guo, Yang Ai, Hui-Peng Du, Xiao-Hang Jiang, Chen-Yuan Ning, Zhen-Hua Ling

Artificial Intelligence

MePo++: Unifying Representation Refinement and Reconciliation for General Continual Learning

General continual learning (GCL) aims to learn from evolving data streams without task identities, explicit boundaries, or repeated access to previous data, making it a realistic yet challenging setting for continual intelligence. Although pretrained models (PTMs) provide rich prior knowledge for addressing the limited supervision and non-stationary nature of GCL, existing PTM-based methods often directly adapt pretrained representations and overlook two critical gaps: the misalignment between upstream pretraining and downstream continual adaptation, and the unreliability of conventional output alignment under blurry streams. Here we propose MePo++, a unified post-training framework that bridges pretrained knowledge and downstream GCL through representation refinement and reconciliation. MePo++ introduces two complementary components: MetaPrep, which improves representation plasticity for continual adaptation through unsupervised meta-refinement over pseudo continual sequences; and StreamAlign, which reinforces representation stability by reconciling evolving online features with a stable pretrained geometry. By improving representation learnability before adaptation and preserving alignment during continual learning, MePo++ enables PTMs to remain both plastic for new concepts and stable over evolving streams. Experiments across diverse PTMs, datasets, and continual learning baselines demonstrate the consistent effectiveness and generality of MePo++ for PTM-based GCL. Our code is available at https://github.com/SunGL001/MePo_Plus.
Read the full abstract

All authors Guanglong Sun, Kanglei Zhou, Liyuan Wang, Qi Cheng, Hongwei Yan, Shuang Cui, Hang Su, Jun Zhu, Yi Zhong

Computation and Language

Influence Score and Transformers interpretability: Measure of the Effective Impact of Attention Heads at inference time

We propose an influence score to quantify the contribution of attention heads to classification decisions in Transformer-based models designed for prompt injection detection. The score combines directional influence on the logits with structural contribution within the residual stream, enabling a multi-scale analysis at the head, layer, and network levels. Applied to a DeBERTa model specialized for prompt injection detection, our framework reveals distinct decision behaviours between correct and erroneous predictions. Our method provides an effective compromise between fine-grained circuit analysis and global output-based methods, and offers a systematic way to study decision mechanisms in Transformer classifiers.
Read the full abstract

Machine Learning

Confounding-Valid Conformal Inference for Counterfactual KPIs in Wireless Networks

Conformal counterfactual inference enables network operators to use logged telemetry to reliably answer 'what-if' questions about network operation. These answers typically take the form of prediction sets that contain, with a user-defined probability, the key performance indicators (KPIs) that would have been observed under alternative control actions. A key challenge is that logged telemetry may omit variables used by the controller, resulting in hidden confounding and invalidating the statistical guarantees of counterfactual analysis. In principle, this issue can be addressed using randomized telemetry, collected by assigning control actions independently of the network state. However, because such randomization may disrupt normal operation, randomized telemetry is typically scarce, causing counterfactual analysis based solely on it to produce uninformative prediction sets. To address these challenges, we propose Confounding-Valid Counterfactual Conformal Inference (CV-CCI), which combines abundant, potentially confounded observational telemetry with limited randomized data through the General Synthetic-Powered Inference (GESPI) principle. CV-CCI leverages observational data to improve efficiency while using randomized data to retain finite-sample coverage guarantees under arbitrary hidden confounding. Experiments on two representative radio access network (RAN) control tasks show that CV-CCI remains valid under hidden confounding while producing more efficient prediction sets than state-of-the-art confounding-valid baselines.
Read the full abstract

Digital Libraries

Westlake Scholar: AI-Enhanced Scholarly Discovery over an Institutional Repository

Institutional repositories (IRs) provide mature infrastructure for preserving and disseminating research outputs, but conventional record- and document-centric interfaces provide limited support for connecting deposited papers to related research and people. We present Westlake Scholar, an open-source, institution-grounded platform that adds four complementary artificial intelligence (AI) services to repository infrastructure: contextual paper reading, research-direction-guided paper discovery, publication-grounded expert discovery, and AI-generated research chronologies for scholars. The services draw on a shared institutional knowledge layer connecting approved publication records, paper content, and scholar–publication relationships. This allows the same paper to support contextual reading, cross-paper discovery, expert matching, and longitudinal views of scholarly work. Westlake Scholar provides an open and governable implementation of an institution-controlled AI layer that connects repository content, scholarly discovery, and researcher relationships while preserving provenance, human review, and institutional governance. A deployment at Westlake University, in operation since April 2026, demonstrates that the integrated system can operate in a live institutional setting.
Read the full abstract

All authors Junshu Pan, Luodan Zhang, Yifeng Lu, Mengfan Zhao, Ming Luo, Zijie Yang, Yue Zhang, Rui Shang

Analysis of PDEs

A dispersive extension result for a class of nonlocal nonlinearities

We prove that a class of nonlocal nonlinearities on periodic Sobolev spaces can be expressed as a trace of the unique mild solution to a local dispersive problem consisting of a system of forced Schrödinger equations. The proof is based on a reformulation of the nonlocal nonlinearities as the resonant orbit average of a real-analytic function under the unitary group generated by the free Schrödinger operator $\mathrm{i} \partial_x^2$. We illustrate our result by providing an equivalent local reformulation for a recently obtained nonlocal amplitude equation that formally captures the dynamics of parabolic systems close to a conserved Hopf instability.
Read the full abstract

Computer Vision

MultiAttenGastro: Multi-Dimensional Attention Augmentation for Gastrointestinal Endoscopy Classification

Automated gastrointestinal (GI) endoscopy classification requires models that generalize across diverse modalities and class distributions, often far from natural-image pretraining. We propose MultiAttenGastro, a plug-and-play attention framework with parallel 1-D channel, 2-D spatial, and 3-D contextual heads, and present the first systematic cross-dataset evaluation across eight CNN and transformer backbones on five public GI datasets (80 backbone–dataset runs). We find that attention effectiveness is not universal but tracks the representational gap between ImageNet features and the target distribution: MultiAttenGastro improves 6 of 8 backbones on Kvasir-Capsule (14-class WCE, large gap; best macro F1 98.33%), is uniformly negative on the small-gap Kvasir-v2 benchmark (0/8), and shows mixed outcomes on datasets with intermediate gap. Five-seed ablation on the strongest case (Kvasir-Capsule, ConvNeXt-Tiny) shows this improvement is directionally consistent, but not statistically decisive (paired $t$: $p=0.47$; Wilcoxon: $p=0.63$), and that individual attention heads are not uniformly beneficial in isolation only their combination yields a positive mean effect. Centered Kernel Alignment (CKA) analysis links this pattern to representational redundancy: low inter-head CKA under large domain gaps coincides with the framework's only consistent gains, while high redundancy under small gaps coincides with its losses. We report these results, including the non-significant margins, as evidence for when and why multi-dimensional attention helps GI endoscopy classification, rather than as a claim that MultiAttenGastro is a strictly superior architectural choice.
Read the full abstract

All authors Sadhana Devarajan, Praveen Kumar Chandaliya, Dhruvin Jashvant Kumar Shah, Kishor Upla, Kiran Raja

Computation and Language

A Structured Debate-Mixture-of-Agents Framework for Complex Clinical Diagnostic Decision Support

Large language models (LLMs) show potential for medical tasks, but their single-turn question-answer format does not reflect how clinical diagnosis is performed in practice. As a result, they remain limited in complex diagnostic settings. We developed Debate-Mixture-of-Agents (DMoA), a novel multi-agent framework that structures role-based interaction to support iterative diagnostic reasoning. Base models and DMoA were evaluated on 297 rare disease cases and 1,719 challenging cases. Across both datasets, DMoA improved most likely diagnosis accuracy by 10.21 percentage points and safety rate by 11.36 percentage points over GPT-4o baseline. Ablation experiments showed that the gains were not simply due to the use of more models or longer outputs, but also reflected the contribution of the structured workflow. Further analyses examined how framework design, base model choice, and token budget affected performance. DMoA performed better with a 4*2 structure, stronger base models, and a larger token budget. These findings demonstrate the potential of DMoA for clinical tasks and suggest further investigation of multi-agent frameworks.
Read the full abstract

All authors Chang Xia, Leilei Ouyang, Huimin Wang, Yong Zhao, Kang Li

Networking

On the Delay-Constrained Maximum Concurrent Flow Problem

Real-time services, such as VoIP and large-scale neural network training, require strict transmission delay guarantees. While routing under hop constraints is tractable, real-world delays increase sharply with equipment load, typically modeled using the M/M/1 queuing function where delay is inversely proportional to available bandwidth. We investigate the resulting Delay-Constrained Maximum Concurrent Flow (DCMCF) problem, which seeks to maximize the minimum throughput across all commodities. The problem's complexity stems from the conditional and non-linear nature of the delay constraints, which are active only along the specific paths used by the flow. We prove that DCMCF is strongly NP-hard, even for single-source/single-destination instances. To address the inherent non-convexity of the problem, we introduce a new convex relaxation expressed through second-order cone constraints, obtained from the convex envelope of a function representing the conditional delay associated with a single arc of a given path. The relaxation is shown to outperform existing formulations based on disjunctive programming. Leveraging this result, we develop a polynomial-time approximation algorithm with a provable performance guarantee and present numerical experiments demonstrating the effectiveness of the proposed approach.
Read the full abstract

All authors Walid Ben-Ameur, Guillaume Beraud-Sudreau, Hervé Kerivin, Sebastien Martin

Networking

Performance Evaluation of HAPS-enabled Coverage Enhancement in Hard-to-Reach Areas

High altitude platform stations (HAPSs) are becoming a key component of future non-terrestrial networks (NTNs). HAPSs can serve a larger area than uncrewed aerial vehicles (UAVs) and offer lower propagation latency, maintenance expense, and energy costs than satellites. A major application of HAPSs is to serve the areas where terrestrial network (TN) deployment is infeasible, especially in hard-to-reach areas and post-disaster areas. For instance, in the Amazon rainforest, the Mediterranean region, and deserts, TN deployment is severely constrained by geographical and environmental conditions. Only areas close to transportation networks or coastlines can be covered, while large areas remain uncovered. Such coverage holes in hard-to-reach areas are typically overlooked in existing literature. Motivated by these realistic cases, in this paper, we use tools from stochastic geometry to mathematically model hard-to-reach areas where cellular terrestrial infrastructure only exists at their perimeter. We propose to deploy a HAPS constellation over this hard-to-reach area to enhance connectivity. For that setup, we derive the downlink (DL) and uplink (UL) coverage performance of the considered user equipment (UE) as a function of the location of the UE inside the coverage hole. Our results show how the number of HAPSs, beamwidth, and HAPS altitude affect the DL and UL coverage probabilities. Finally, we provide multiple useful guidelines for future HAPS deployment.
Read the full abstract

Computer Vision

Adaptive Multi-Granularity Temporal Modeling for Weakly Supervised Video Anomaly Detection

As the scale of video surveillance data outpaces manual annotation capacities, weakly supervised video anomaly detection (WSVAD) has emerged as a critical research frontier. Most existing approaches formulate WSVAD within a Multiple Instance Learning (MIL) framework that relies on rigid, hand-crafted temporal priors to supervise anomaly scoring. However, such formulations exhibit limited adaptability to the wide variation in anomaly durations and temporal dynamics observed in real-world videos, often leading to unstable or unreliable snippet-level predictions. To address this limitation, we propose an adaptive temporal modeling framework for WSVAD that explicitly accounts for variations in video dynamics across multiple temporal granularities. First, we introduce a Temporal Refinement Module (TRM) that leverages dynamic positional encoding and a learnable class token to model long-range temporal dependencies while distilling a stable global video-level representation. Second, to capture anomalous events with varying frequency and duration, we develop an adaptive Event Segmentation Module (ESM) that identifies event boundaries through temporal discontinuity analysis and aggregates snippet features into discriminative event-level representations. Finally, for snippet-level and event-level predictions, we propose an adaptive similarity-based fusion strategy that dynamically integrates anomaly scores into video-level predictions, replacing fixed top-k aggregation heuristics with global semantic relevance. Extensive experiments on two benchmarks demonstrate that the proposed framework consistently outperforms state-of-the-art methods.
Read the full abstract

Statistics Theory

Convex order and preservation of convexity for Bayesian posterior updates

We study how the response of a Bayesian posterior statistic to future observations changes as information accumulates. For a non-decreasing function $T$, define $\Pi_n^T=\E[T(\Theta)\vert \mathcal F_n]$, where $\Theta$ has an arbitrary prior and the observations come from a one-parameter exponential family. Conditioning on the same current value of $\Pi^T$, we show that the posterior statistic after additional observations is larger in convex order when the current posterior is based on fewer observations. We also prove preservation of convexity: the expected value of a convex function of the future posterior statistic is convex in the current posterior statistic. Together, these two properties provide structural tools for establishing time-monotonicity results in dynamic Bayesian decision and optimal stopping problems. If the exponential family contains an infinitely divisible distribution, the results extend to a continuous-time observation model through a family of Lévy processes.
Read the full abstract

Materials Science

Generalized Helicity-Dependent Magnetization Switching via Substrate Phonons

Coherent excitation of circularly-polarized substrate phonons can drive deterministic reversal of magnetization in an adjacent magnetic layer. However, the extent to which this substrate-mediated mechanism can be generalized across different materials remains unresolved. Here, we measure and compare the spectral dependence of helicity-dependent magnetization reversal in magnetic GdFeCo layers grown on a diverse set of diamagnetic substrates. Switching is observed for all investigated substrates, spanning six point groups and several infrared-active transverse-optical phonon symmetries. While the switching spectra broadly overlap with the Reststrahlen bands, their maxima are systematically shifted to wavelengths shorter than the corresponding transverse-optical phonon resonances. This spectral mismatch shows that substrate absorption alone does not determine the switching efficiency. Transfer-matrix calculations show that strong absorption concentrates energy deposition near the substrate interface, providing a possible source of local heating that could suppress magnetization reversal. Our results reveal the broad applicability of substrate-mediated phononic switching while showing that its efficiency is governed by the full optical response of the heterostructure rather than substrate absorption alone.
Read the full abstract

All authors F.G.N. Fennema, H. Damas, H. Yoshikawa, A. Tsukamoto, C.S. Davies, A. Kirilyuk