Artificial Intelligence
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 1 September
Token aggregation converts token-level representations into fixed-dimensional sample representations, but most pooling methods operate only in the original token space. We introduce Frequency-Domain Latent-attention Gated Pooling (FLaG), a plug-in aggregation module that re-expresses encoder outputs in the Fourier domain before final pooling. FLaG represents the nonredundant rFFT spectrum through concatenated real and imaginary components, summarizes spectral tokens with learnable latent queries, derives a sample-conditioned channel gate, and reconstructs modulated token representations for downstream aggregation. We evaluate the same architecture across ESM2-based antimicrobial peptide (AMP) activity prediction, ResNet18 image classification on CIFAR-10 and CIFAR-100, and three RoBERTa-based language tasks. FLaG achieves the best macro-averaged Spearman correlation coefficient, RMSE, and Recall@50 across four AMP backbone-species settings and the highest top-1 accuracy on CIFAR 10. It also achieves the best mean results on five of seven language metrics, although mean pooling remains strongest on STSBenchmark. AMP-side mechanistic analyses reveal low-frequency prediction sensitivity across most encoder layers, with increased relative high-frequency sensitivity in the final layer, and pronounced peptide-specific positional responses. The residual gate broadly amplifies spectral channels while preserving the low-frequency-dominated energy profile, whereas latent cross-attention exhibits sample- and species-specific spectral allocation. Overall, FLaG provides a transferable frequency-domain aggregation bias across protein, visual, and textual representations, with benefits that depend on the backbone and downstream task. Supplementary materials, source code, and data are available at https://www.healthinformaticslab.org/supp/ and https://github.com/Kewei2023/AMPCliff/tree/FLaG.
Computer Vision
Visual Attention Faithfulness in Vision-Language Models is Heterogeneous
Whether attention weights faithfully reflect model reasoning has been actively debated in NLP, yet this question remains largely unexplored for the visual modality in Vision-Language Models (VLMs). We address this gap through causal perturbation analysis on current VLMs, evaluating both the comprehensiveness and sufficiency gap of attention-ranked visual tokens. Our analysis reveals that visual attention faithfulness is heterogeneous, manifesting in three distinct processing modes: Faithful-Sufficient, where top-$k$ attention tokens are both necessary and sufficient for prediction; Faithful-Distributed, where they are necessary but broader visual context remains required; and Non-Focal, where no localized attention region is individually necessary while visual information remains an essential trigger for prediction. Furthermore, human-annotated ground-truth regions satisfy comprehensiveness in only $\sim 60$% of cases compared with model attention rankings, revealing systematic divergence between model visual reliance and human intuition. We demonstrate these patterns across both general VQA on VQAv2 and document tasks on VRDU and ChartQA, showing that visual attention faithfulness varies systematically with processing demands and model architectures rather than being uniformly faithful or unfaithful.
Read the full abstract
Machine Learning
HarnessEvolve: Learning from Reference Trajectories for Reliable Agent Self-Evolution
Self-evolving agents advance toward autonomy by optimizing their harness—prompts, skills, tools, and execution logic—based on environmental feedback. This paradigm, however, is hampered by three challenges: credit assignment failure, where terminal success/failure feedback makes it ambiguous which step caused the error; shortcut learning, where agents memorize task-specific patterns rather than acquire generalizable capabilities; and catastrophic forgetting, where unguarded updates degrade previously acquired competence. In this paper, we introduce HarnessEvolve, a self-evolving framework that learns from reference trajectories to achieve reliable agent self-evolution. HarnessEvolve decouples the execution agent from the evolutionary pipeline, assigning execution, evaluation, optimization, and gating to independent agent modules, enabling generalizable and stable harness improvements. Specifically, HarnessEvolve overcomes credit assignment failure by generating reference trajectories (execution paths produced when given the ground-truth answers) and aligning failed executions against them to extract error signals, which are clustered to reveal systematic failure patterns. To prevent shortcut learning and catastrophic forgetting, candidate harness updates must pass two gates: a quality gate that filters data leakage and prompt bloat, and a performance gate that accepts each update if it improves on the current batch without degrading recent batches, with epoch-end validation on a held-out set selecting the best-performing accepted agent snapshot. We conduct extensive experiments on several benchmarks spanning open-domain and enterprise scenarios, using different models and agent frameworks. Results demonstrate that HarnessEvolve consistently outperforms state-of-the-art baselines across all benchmarks and settings, confirming reliability across task domains.
Read the full abstract
Geophysics
A Frequency-Aware Dynamic Knowledge Distillation Framework: An Effective Tool for Bridging Low- and High-Frequency Seismic Information
Seismic data contain rich information across different frequency bands, with low-frequency components primarily characterizing large-scale geological structures and high-frequency components preserving fine-scale seismic details. Effectively integrating these frequency-dependent components is essential for seismic feature learning to better preserve structural continuity and fine-scale details. Knowledge distillation provides an effective means for transferring informative representations from high-quality data. However, existing distillation-based frameworks usually treat seismic features in a full-band manner, ignoring relationships across frequency bands and thereby limiting the coordinated transfer of low- and high-frequency knowledge. To bridge low- and high-frequency seismic features through knowledge distillation, we propose a frequency-aware dynamic knowledge distillation framework (FADKD-Net), which establishes a teacher-student learning framework and performs frequency-aware knowledge transfer between low- and high-frequency bands. Specifically, FADKD-Net decomposes seismic features into low- and high-frequency components and performs targeted distillation to exploit their complementary information. Low-frequency distillation guides the student model to learn stable structural priors, thereby improving the overall continuity of seismic events. Meanwhile, high-frequency distillation enhances detailed feature modeling and improves the representational capability for complex and small-scale structures. Furthermore, a cross-domain feature alignment strategy is proposed to reduce distributional discrepancies across different surveys and enhance the transferability of the seismic representations learned by FADKD-Net.
Read the full abstract
Systems and Control
Low-Complexity Control Under Input Saturation and Performance Constraints: A Bidirectional Modification Scheme
This article addresses the output tracking control problem for a class of high-order uncertain highly-coupled MIMO nonlinear systems subject to input saturation and performance constraints. To resolve the problem, a bidirectional modification mechanism is constructed, which is able to not only relax the constraints when saturation occurs to alleviate potential conflict, but also accelerate the recovery of original constraints after saturation ceases, and further tighten the constraints to enhance control performance if saturation remains inactive at the steadystate phase. Based on the mechanism, a model-, approximationand complexity-explosion-free control scheme is proposed. To bypass the obstacle in Lyapunov analysis, a novel stability analysis framework is developed, which, given that two parameter selection conditions are met, ensures satisfaction of modified constraints and boundedness of all closed-loop signals. Simulation results validate the effectiveness and superiority of the methodology.
Read the full abstract
Analysis of PDEs
Regularity and Rivière's ${GL}(m)$-Gauge Construction for Elliptic Systems with Antisymmetric Potentials in Arbitrary Dimensions
Let $1 \leq q \le 2$ and denote by $2 \leq q'$ its corresponding conjugate exponent. We prove the continuity of solutions $u \in W^{1,(\frac{n}{n-1},q')}(B^n, \mathbb{R}^m)$ to the critical elliptic system $-\Delta u = \Omega \cdot \nabla u$ in dimension $n \ge 3$, where the potential $\Omega \in L^{(n,q)}(B^n, \mathfrak{so}(m) \otimes \wedge^1)$ is antisymmetric. First, we construct $P \in W^{1,(n,q)}(B^n, \mathrm{SO}(m))$ such that the PDE can be rewritten as $-\operatorname{div}(P^{-1}du) = \ast d\xi \cdot P^{-1}du$, which is nearly a Jacobian structure up to the rotation $P$. Second, we provide a Rivière's $\mathrm{GL}(m)$-Gauge in order to establish a "full" $(A,B)$-conservation law, i.e. $-\operatorname{div}(Adu)=d^\ast B \cdot du$. We show that the assumption on $\Omega \in L^{(n,q)} (B^n, \mathfrak{so}(m) \otimes \wedge^1) $ for $q\leq 2$ is optimal.
Read the full abstract
Quantum Physics
Quantum-Based Optimization of Gas Throughput in Natural Gas Transmission Networks Under Hydraulic Constraints Using QAOA
Maximizing gas throughput in transmission networks under hydraulic and operational constraints is a combinatorial problem whose complexity grows exponentially with network size, making it computationally intensive to solve exactly. This paper addresses the graph-based optimization problem by optimizing nodal-pressure assignments under the Panhandle-B hydraulic equation. By framing the problem as a search over discretized nodal-pressure assignments coupled with a cost Hamiltonian that encodes both the delivery objective and physical-constraint penalties, we establish a unified formulation suitable for the Quantum Approximate Optimization Algorithm (QAOA). The mathematical model is adapted to a Quadratic Unconstrained Binary Optimization (QUBO) formulation and implemented using the Classiq quantum software platform. In simulator-based experiments, QAOA recovered the maximum-throughput valid operating point, consistent with classical exhaustive evaluation and classical hydraulic simulation reference solutions. A distinctive contribution of this work is the end-to-end execution of a reduced problem instance on the IonQ Forte-1 trapped-ion quantum processor. Remarkably, the hardware implementation used only $p=2$ QAOA layers, substantially fewer than the $p=30$ layers used in the simulator-based study. Despite this significant reduction in circuit depth, the QPU produced physically valid and interpretable candidate solutions that bracketed the continuous classical optimum, with each located within one pressure-discretization step of it. These results demonstrate that meaningful gas-network optimization behavior can be obtained using considerably shallower QAOA circuits than initially expected and provide an end-to-end proof of concept for near-term quantum-assisted gas-network optimization.
Read the full abstract
Symbolic Computation
The Indefinite Summation Problem for the Laurent Ring
This article solves the Indefinite Summation Problem (ISP) for the difference ring $(A, \alpha)$, where $A$ is the Laurent ring of shift operators on the lattice $\Z^n$, and $\alpha$ is any ring automorphism of $A$ of finite order. The space of summable elements in $(A, \alpha)$ is infinite dimensional, and it is possible to write down an explicit basis for it. The solution translates to a finite procedure involving a matrix multiplication, where the size of the matrix can be estimated. It follows that the arithmetic complexity of the solution can also be determined. These results extend to a solution of the ISP for the ring of functions on $\Z^n$, on which $\alpha$ acts by duality. The article also points out that the solution to the ISP amounts to calculating the group cohomologies $H^i([\alpha], A), i = 0, 1$, where $[\alpha]$ is the cyclic group generated by $\alpha$.
Read the full abstract
Artificial Intelligence
Polished but Unresolved: Identifying Late-Stage Pressure States in Long-Horizon Tool-Use Agents
Long-horizon tool-use agents need not only to search and plan, but also to decide when to finalize. We study late-stage pressure states, in which an agent is biased toward submitting a final answer that appears complete and polished while key constraints remain unresolved. We first train a linear probe to show that this pressure state is identifiable from the agent's hidden states. Then, we use activation interventions along this pressure direction and find that shifting the hidden states changes both the pressure score and whether the agent continues tool use or submits early. Through controlled context manipulations, we further see that the pressure is mitigated by constraint clarity and action mapping. Based on these findings, we propose Probe-Sensed Pressure Relief (PSPR), a plugin that applies lightweight pressure relief direction under moderate pressure and moves to structured organization under high pressure risk. Experiments on multiple long-horizon benchmarks show that our method consistently strengthens existing agent methods.
Read the full abstract
Systems and Control
A Three-phase and Single-phase Compatible Dual-Mode EV On-Board Charger with Integrated Active Power Decoupling
Onboard charger (OBC) is essential part of Electric Vehicle (EV). High-performance EVs are preferring three phase charging to achieve higher power level. However, the ability to charge from a single phase supply is also required. A dualmode OBC for EVs is proposed, which is capable of operating from both three-phase supply and single-phase supply. The single phase charging comes with the requirement of bulky DC link capacitance due to double frequency current in DC link. The proposed topology eliminates this by achieving Active Power Decoupling (APD) using only one additional relay switch and a small capacitor. The proposed topology is verified under different conditions in a detailed simulation, which shows more than an order of magnitude reduction in DC link capacitance during single phase operation.
Read the full abstract
Networking
SkyShare: Constellation-wide Sky Sharing for LEO-Radio Astronomy Coexistence
Rapidly growing low-Earth-orbit (LEO) constellations increasingly operate in the spectrum shared with radio astronomy services (RAS), creating escalating interference risks for sensitive scientific observations. Existing mitigation mechanisms rely on reactive beam steering, or avoidance near observatories but fail to account for aggregate sidelobe emissions-leading to residual interference and substantial, unnecessary capacity loss. We present SkyShare, a constellation-wide sky-sharing system that enables predictive, interference-aware spot beam scheduling to protect radio astronomy while preserving network coverage. SkyShare integrates high-fidelity orbital prediction with International Telecommunication Union (ITU)-compliant Equivalent Power Flux Density (EPFD) modeling, and real-time observatory data via Operational Data Sharing (ODS) to jointly optimize beam-cell assignments over observation windows. To make constellation-scale coordination tractable, we introduce a concept of EPFD-budgeted Region-of-Interest(RoI) that bounds residual sidelobe interference while confining optimization to a minimal, provably sufficient set of cells. Building on RoI, we formulate LEO-RAS coexistence as a scalable scheduling problem and design SkySched, a flow-based algorithm that is optimal in special cases and yields scalable near-optimal solutions in the general NP-hard setting. SkyShare operates entirely in the control plane and requires no satellite hardware changes. Using real Starlink constellation geometries, we evaluate SkyShare across 25 single-dish, Ku-band RAS sites worldwide. Compared to Starlink boresight avoidance, SkyShare reduces unserved cells by up to 90.68% while remaining within EPFD limits.
Read the full abstract
Commutative Algebra
Krasner Completions of Filtered Bands
We introduce the Krasner completion of a band equipped with a decreasing filtration by subgroups of its unit group and give a criterion for reconstruction from its quotient bands. We recover the Krasner–Linzi inverse-limit theorem for valued fields. We also obtain a valuation ring analogue of the Krasner–Linzi theorem and compare Krasner completions of unit bands with adic completion.
Read the full abstract
Computational Engineering
VPID: An Integrated Framework for Vulnerability Prioritization and Intrusion Detection in Enterprise Networks
Small enterprises face increasingly serious threats to their internal networks but often lack the financial resources, computing capacity, and specialist staff required to deploy resource intensive security platforms. This paper designs and implements VPID, a lightweight framework for vulnerability prioritization and intrusion detection that consists of two principal modules: controlled vulnerability validation and intelligent intrusion defense. The first module uses OpenVAS for asset mapping and vulnerability identification, applies a decision tree to prioritize vulnerabilities, and employs a rule engine to generate targeted validation payloads. The second module captures network traffic using Scapy, analyzes it through a detection pipeline that combines a decision tree with multinomial Naive Bayes, verifies traffic assessed as high risk using Snort rules, and performs blocking and alerting through iptables. The evaluation uses 550,000 network flow samples containing normal and attack traffic for detector training, together with 15,000 labeled vulnerability records. On the vulnerability ranking test set, the decision tree achieves a precision of 91.8%, a recall of 89.5%, and an F1 score of 90.6%. On an independent test set containing 55,000 traffic samples, the combined detection pipeline achieves a precision of 94.5%, a recall of 88.3%, and an F1 score of 91.3%, while maintaining a false positive rate below 1.5%.
Read the full abstract
Artificial Intelligence
AnalysisBank: An Expert Analysis Pattern Library for Financial Report Generation
We argue that financial report generation should operate at the analytical rather than structural level, composing content from data-derived insights rather than high-level topics or sections. To this end, we propose AnalysisBank, which distills expert reports into a reusable library of Analyses, each pairing a data signal, an analytical move, and the expert span it was derived from. At inference time, AnalysisBank matches input signals to library entries and applies the retrieved moves to compose the report. A study of Analyses distilled from 550 expert reports reveals a heavy-tailed distribution of 47-52 signal types spanning 13 move types. On two financial benchmarks across four LLM backbones, AnalysisBank increases the proportion of novel, data-grounded insights by 1.7-3.7x over structural-level baselines. Transfer to scientific writing suggests that the distinction generalizes beyond finance. Code and the distilled Analysis library are available at https://github.com/yajingyang/AnalysisBank.
Read the full abstract
Distributed Computing
Characterizing the Scalability and Performance of Large-Scale AI Training Under Multi-Tenancy
Characterising AI workload performance on modern HPC systems requires understanding both their scalability in isolation and their behaviour under concurrent execution. However, the interplay among parallelisation strategies, network congestion, compute capability, and interconnect technologies remains poorly understood. This work investigates the performance and scalability of AI models up to 2400 GPUs. We quantify the communication overheads and their impact across different interconnects by evaluating scale-up, scale-out, and rack-scale configurations under multiple allocation schemes. Finally, we study how multiple concurrent training jobs interfere with each other by designing a realistic noise model. We design a benchmark suite of AI models to evaluate the performance of five distinct parallelisation strategies across different supercomputing clusters, including Alps, Leonardo, LUMI, JUPITER, NVL72 GB300, and DGX A100. Our work provides a systematic characterization of the scalability and execution efficiency of distributed AI training, while offering key insights into performance behavior under realistic multi-tenant scenarios.
Read the full abstract
Computer Vision
Can Scene Text Recognition Read Rare Compositions?
Scene text recognition is reported as 89–97% accurate on the six standard benchmarks, and the problem is widely treated as saturated. We present an alternative reading. When the same test images are stratified jointly by ground-truth word rarity and character n-gram novelty against a reference corpus, accuracy at the rare-word x rare-trigram corner of the resulting 5x5 grid drops 10–18 pt below the q3/q3 centre across nine English specialised recognisers, and the same direction (corner below centre) holds on all 13 of 13 (language, model) pairs we test across four writing systems (Latin, Han, Han+kana, Arabic). The drop is not a capacity bottleneck. A 6x vision-backbone scale-up (CLIP4STR-Base 158M -> CLIP4STR-Huge 1.0B, OpenCLIP ViT-H/14 LAION-2B) leads every benchmark in aggregate accuracy yet leaves the stress corner unchanged (86.9 -> 86.5, within paired-bootstrap noise). Four converging probes–layer-wise probing, confidence-when-wrong, attention re-balancing, and a cross-script commit-vs-abstain error split–localise the failure to the autoregressive decoder's lexical prior. We then ask how much of the gap existing techniques recover. Of 16 non-architectural mitigations, the largest mean q5/q5 gain is +1.3 pt and none clears the paired-bootstrap noise floor; the only intervention that does is the architectural shift from autoregressive to CTC decoding (SVTRv2, +2.5 pt, p=0.02, n=474). A confidence-routed AR-CTC ensemble adds a directionally consistent +0.6 pt that stays within noise, and its dominant learned coefficient is each model's own minimum-softmax confidence–independently echoing the mechanism above. No configuration we test improves both the compositional corner and aggregate accuracy. The rare-input long tail thus points to architectural change rather than added capacity.
Read the full abstract
Systems and Control
A Modular IoT-Enabled Remote Laboratory Platform for Hybrid Energy System Research and Engineering Education
Remote laboratory systems improve accessibility in engineering education and research by enabling Internet-based interaction with physical equipment. This paper presents a modular IoT-enabled remote laboratory platform for hybrid energy system studies, combining renewable energy emulators, battery storage, and programmable loads within a three-interface architecture based on a web HMI, TIA Portal, and MATLAB/Simulink, all connected through a Talk2M VPN cloud. An industrial PLC and IoT gateway provide deterministic local control as well as secure remote access and monitoring. A hierarchical energy-management algorithm is validated by comparing local and remote executions under identical wind and irradiance profiles. The results show small differences in the energy balances of the renewable sources, battery, and load, while typical communication delays are on the order of 100 ms. Consequently, the platform supports research-grade remote experimentation and project-based learning in control and energy systems engineering.
Read the full abstract
Computer Vision
RingMoClaw: An Experience-Inspired Multi-Agent Framework for Self-Evolving Research in Remote Sensing
Remote sensing visual models have continuously advanced various interpretation tasks. However, the research process behind model improvement still heavily relies on manual expertise, requiring extensive trial-and-error iterations in model design, data processing, and performance diagnosis. Existing agent-based approaches mainly focus on task execution and workflow orchestration, while lacking the capability of autonomous research iteration for continuous performance optimization. To address this issue, we propose RingMoClaw, an experience-inspired self-evolving multi-agent framework for remote sensing visual interpretation. RingMoClaw integrates a research branch, a quality-control branch, and a dual-stream dynamic experience bus to establish a closed-loop optimization process covering strategy generation, experiment execution, independent review, and experience accumulation. The heterogeneous Critic mechanism provides stage-wise diagnosis and feedback, while the dual-stream experience bus incorporates external knowledge and internal experimental experience to guide strategy evolution and eliminate ineffective searches. Extensive experiments on four remote sensing downstream tasks, including object detection, scene classification, semantic segmentation, and change detection, demonstrate the effectiveness and generalization of RingMoClaw. Compared with the corresponding baseline models, RingMoClaw improves performance by 1.84% mAP$_{50}$ on object detection and achieves consistent gains across the other three tasks, while reducing the required evolution steps by over 40% compared with existing research automation frameworks. These results suggest that RingMoClaw offers a feasible route from task execution toward continuous research driven model evolution in remote sensing.
Read the full abstract
Artificial Intelligence
One Policy, Any Budget: Internalizing Budget-Aware Search via Reinforcement Learning
While reinforcement learning has enabled LLM-based search agents to invoke external tools, existing methods train under fixed budgets and cannot adapt when constraints vary at deployment. We propose AnySearch, a framework that enables a single policy to perform budget-aware search under any budget constraint through a training scaffold and curriculum reinforcement learning. In the first phase, we train the agent with explicit budget state injection and structured reasoning prompts that guide efficient allocation under linearly decaying budgets. In the second phase, the scaffold is removed and the agent learns to operate autonomously under adaptively sampled budget constraints, matching inference conditions. Both phases are optimized with a composite reward that couples answer accuracy with budget efficiency through absolute and relative signals, where an adaptive weight amplifies the efficiency signal for high-accuracy queries and attenuates it for low-accuracy ones. Extensive experiments on seven general and multi-hop QA benchmarks show that our method outperforms baselines across all budget scales, generalizes to unseen constraints beyond the training range, and achieves superior tool productivity without excessive token overhead. Our code is available at https://github.com/xwsun01/AnySearch.
Read the full abstract
Computational Engineering
Aerodynamic Shape Design Space Exploration with Deep Latent Diffusion Model
We propose DiffGeo, a latent space diffusion-based generative framework for aerodynamic design space exploration under extreme data scarcity. DiffGeo combines a learned latent space model for automatic shape parameterization, with a diffusion sampler to directly generate novel, geometry-valid and controllable designs. We validate the approach on a series of case studies: (i) a 2D airfoil generation benchmark, where DiffGeo's latent diffusion model is compared against GAN- and VAE-based baselines in terms of sample quality, diversity and constraint adherence under limited data; (ii) integration into a surrogate-based optimization pipeline, where DiffGeo's conditional sampling produces task-informed airfoil data that improve both surrogate modeling and optimization performance; and (iii) extension to 3D turbomachinery blade prototyping, where DiffGeo generates realistic and high-performance blade geometries from a small set of reference designs. Throughout these investigations, DiffGeo achieves high-quality and diverse shape generation with at least an order of magnitude less data than alternatives, decouples geometry representation from design targets for flexible reuse, and seamlessly incorporates complex design constraints via energy-based conditioning. These capabilities demonstrate DiffGeo's potential to enhance early-stage design by automating design space exploration–improving efficiency, expanding design diversity and embedding engineering knowledge through controllable guidance.
Read the full abstract
Computer Vision
ReBridge-Flow: Re-Coupling Posterior Bridges in Flow Matching for Image Restoration
Flow Matching provides an efficient generative prior for image restoration by learning continuous transport between source and data distributions. However, existing methods typically incorporate measurement constraints through local corrections. Such corrections may disrupt the source-clean endpoint coupling implicitly encoded by the pretrained flow, making the corrected endpoint pair incompatible with the current state. To address this issue, we propose ReBridge-Flow, a posterior bridge re-coupling method. Specifically, given the current state, ReBridge-Flow first decodes the corresponding local source and clean endpoints. It then incorporates measurement information through clean-side anchoring and synchronously re-couples the source endpoint, yielding a measurement-aware endpoint pair with improved local bridge compatibility. The re-coupled endpoints further define a posterior-informed transport direction for advancing the sampling process. We also introduce the Posterior Bridge Defect, which jointly characterizes measurement error, deviation from the flow prior, and bridge mismatch, and leads to explicit updates for clean-side anchoring and source-side re-coupling. Extensive experiments on multiple natural and medical image restoration tasks demonstrate that ReBridge-Flow effectively alleviates bridge mismatch and improves the structural consistency of restored images.
Read the full abstract
Differential Geometry
Uniqueness and Stability of Monge–Ampère Potentials in Big Cohomology Classes
In this paper, we establish a stability estimate and a uniform estimate for the modulus of continuity of solutions to the degenerate complex Monge-Ampère equation in big cohomology classes. Consequently, we prove the uniqueness of solutions to complex Monge-Ampère mean field equations for a sufficiently small parameter.
Read the full abstract
Neurons and Cognition
Temporally constraining source imaging estimates in an underdetermined neural system with eigenmodes of cortical geometry
Geometric eigenmodes provide a compact and biologically grounded representation of large-scale neural activity. Previous work demonstrated that they can mitigate the underdetermined nature of electroencephalographic (EEG) and magnetoencephalographic (MEG) source localisation, an ill-posed inverse problem in which neural activity is reconstructed from non-invasive recordings. Beyond their spatial structure, neural field theory predicts the temporal evolution of eigenmodes through analytically derived transfer functions. Motivated by this framework, the present work investigates whether these transfer functions can be used to introduce temporal constraints into EEG source imaging. The approach is evaluated using simulated seizure dynamics generated by coupled Epileptor neural mass models. Transfer functions derived directly from neural field theory were found to be generally ineffective as temporal constraints for source localisation, primarily because they neglect cross-eigenmode coupling. Incorporating empirically estimated coupling terms substantially improves localisation performance, particularly in noisy conditions. Although estimating these eigenmode coupling interactions from experimental data remains challenging, the findings motivate dynamical source imaging approaches that combine spatial eigenmode structure with empirically informed cross-modal dynamics.
Read the full abstract
Human-Computer Interaction
Ctrl-F-Resist. Practices, Challenges, and Technical Needs of Civil Society Organizations Monitoring the Far-Right Online
As far-right actors increasingly exploit online platforms to disseminate ideology and mobilize supporters, civil society organizations (CSOs) play a vital yet underrecognized role in monitoring antidemocratic dynamics online. Unlike fact-checkers or content moderators, CSOs engage in long-term, contextualized analysis, often in resource-constrained settings and under precarious conditions. Despite their critical societal role, CSOs face significant barriers to adopting or co-developing technical solutions, including legal uncertainty, limited platform access, and chronic underfunding. Existing research and tool development efforts have largely overlooked these actors in favor of more institutionally embedded stakeholders. This paper addresses this gap through a qualitative study with 15 practitioners from 12 Germany-based CSOs engaged in online monitoring, positioning them as key yet overlooked stakeholders in the governance of digital spaces. We explore their current practices, challenges, and expectations regarding technological support. Our findings show that monitoring remains largely manual due to the lack of tailored tools, with enhanced search capabilities emerging as the most pressing technical need. While participants express openness to AI-supported features such as media processing and content discovery, many remain skeptical of automated classification, citing concerns around trust, legal usability, and professional credibility. Grounded in these findings, we introduce a conceptual monitoring workflow and describe its implementation in an open-source Telegram monitoring prototype designed to flexibly support diverse monitoring goals. We outline concrete design, policy, and research recommendatios, and introduce the manual labor trap as an empirically grounded concept that explains why monitoring CSOs tend to remain locked into labor-intensive, low-capacity arrangements.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Baryonic feedback suppression of the matter power spectrum: a three-parameter fitting formula and its single-parameter reduction
Baryonic feedback can suppress matter clustering by $\sim 10\%$ at $k\sim 1h$/Mpc and $z\sim 1$, and is therefore a major source of systematic errors in weak lensing cosmology. We investigate this effect through the ratio $S(k,z)\equiv P_{\rm hydro}(k,z)/P_{\rm DMO}(k,z)$ measured in the FLAMINGO, IllustrisTNG, and Illustris hydrodynamical simulation suites, together with the one-parameter-at-a-time (1P) variation runs of CAMELS-TNG and CAMELS-SIMBA. We present a three-parameter fitting formula that reproduces all but one of these runs with maximum error less than $0.03$ (and typical error less than $0.01$) at $k\leq 3h/$Mpc and $z\leq 2$; the only exception is a run with unrealistically low $\Omega_m=0.1$. Each of the three parameters ($B_0$, $n$, and $a$) has a clear physical interpretation: $B_0$ sets the characteristic scale of the suppression at $z=0$, corresponding to a gas particle displacement scale of $B_0^{1/2}$; $n$ sets the suppression floor $(1-\Omega_b/\Omega_m)^n$; and $a$ sets the redshift $z_B$ at which the suppression peaks. Furthermore, we find that $B_0$ and $z_B$ are significantly correlated for most runs. Also, $n\simeq 1$ for FLAMINGO, TNG and CAMELS-TNG. For these simulations, the description reduces to a single parameter formula with maximum error less than $0.03$. The formulas remain accurate at max$(|\Delta S|)<0.03$ (and typical error less than $0.01$) for cosmologies well away from the calibration cosmology, spanning the range $\Omega_m\in [0.2,0.5]$, $\Omega_b\in [0.029,0.069]$ and $\sigma_8\in [0.6,1.0]$. These results imply that, despite the diversity of baryonic physics implementations, an accurate description of $S(k,z)$ requires at most three effective degrees of freedom. Therefore the impact of feedback on weak lensing cosmology can in principle be mitigated internally without significant loss of cosmological constraining power.
Read the full abstract
Cryptography and Security
Effective Interventions Against AI-Enhanced Scams
In 2025, scams were responsible for an estimated $442 billion in direct losses globally. In the United States, reported losses increased by nearly 400% between 2020 and 2025. Though AI in scamming is a relatively new phenomenon, its use significantly changes the economics of scams as well as the bottlenecks in scam operations. In this paper I investigate what interventions will remain effective under this new AI-driven scamming regime. I develop a simple model of scam profits to understand how different interventions asymptotically affect scam operations. I find that three levers–reporting rate, centralization of reporting, and report accuracy–multiply in their effect on expected victims per scam channel, reducing revenue per scam channel while increasing costs. Because effects multiply, interventions affecting all three could have a significant effect on the profitability of the scam business model. My analysis suggests that even modest reporting rates against high-value scam infrastructure could have significant impacts on scam profitability.
Read the full abstract
Artificial Intelligence
Towards a Reliable and Practical Eval Pipeline
LLM-based software systems increasingly require effective "evals" as quality gates in the development lifecycle. However, existing work typically addresses individual aspects of eval reliability rather than the full set of practical requirements. We present an end-to-end eval pipeline that combines eval checklist creation, with learned aggregation for checklist responses, to improve agreement across LLM judges and accuracy against human judgments. The framework additionally pro- vides self-consistency, explanations, and prediction uncertainty, and we empirically demonstrate its effectiveness.
Read the full abstract
Robotics
Connectivity-Aware Graph Extension for Decentralized Multi-Robot Exploration
Exploring unknown environments with multiple UAVs requires coordination under intermittent communication, making decentralized operation a baseline assumption. We propose, within a decentralized framework, a novel exploration graph extension strategy based on frontier connectivity to extend exploration plans and maintain area partitioning among agents stable and robust to disconnections and changes in spatial layout. The proposed extension method is applied to two state-of-the-art area partitioning methods and evaluated in simulation. Experiments show improved performance over existing graph extension approaches with higher exploration efficiency under low communication rate.
Read the full abstract
Solar and Stellar Astrophysics
The Influence of Evaporation on the Formation and Evolution of Huntsman Systems
Huntsman systems are a recently identified and rare subclass of millisecond pulsar (MSP) binaries, characterized by a detached neutron star and an evolved giant companion in relatively wide orbits. Their formation has been proposed to involve red-bump-induced detachment, whereas the influence of MSP-driven evaporation during this evolutionary stage has not yet been quantitatively assessed. We quantify the influence of MSP-driven evaporation on the formation and evolution of Huntsman systems and assess its effects on their observable properties. We performed detailed binary evolution calculations including MSP-driven evaporation over a wide range of initial binary parameters and combined them with binary population synthesis to predict the observable population of Huntsman systems. We find that Huntsman systems originate primarily from binaries undergoing Case B mass transfer and red-bump-induced detachment, with initial donor masses of $1.0-2.5\ M_\odot$ and orbital periods above the bifurcation period. Evaporation has a secondary effect, slightly modifying the orbital evolution and the duration of the detached phase, but does not significantly alter the formation parameter space or the expected population, which contains about 10 Huntsman systems. We further show that evaporation can produce systematic shifts in the white dwarf mass-orbital period relation at the low-mass end, leading to systematically wider final orbits for a given white dwarf mass.
Read the full abstract
Computation and Language
TEIDAN: A Multilingual Multiparty Dialogue Corpus
Multi-party interaction is a central setting for human communication and a necessary target for human-agent interaction systems that must participate in group conversation. Yet available corpora often focus on meetings, task-oriented interaction, text-based interaction, or acted scenarios, and fewer resources support cross-linguistic comparison of spontaneous face-to-face triadic discussion. This paper presents TEIDAN, a multilingual multimodal corpus that currently consists of Japanese and English three-party conversations. TEIDAN records groups of three participants discussing open-ended topics with individual pin microphones, a microphone array, and participant-facing cameras, and provides IPU-based transcripts for both language portions. Earlier studies used subsets of the Japanese portion for task-specific benchmarks in multi-party dialogue modeling; in contrast, this paper presents TEIDAN as a corpus resource spanning both Japanese and English, with planned expansion to additional languages. We describe the collection design, participants, recording setup, transcription format, and corpus statistics, and provide preliminary analyses to illustrate how TEIDAN can support research on turn-taking, addressee recognition, and multimodal grounding in human-human and human-agent interaction.