Representation Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 29 August
Strongly bounded objects in a weakly approximable triangulated category are known to relate closely to global dimension and to play a significant role in the uniqueness problem for triangulated enhancements. In this paper, we investigate when the full subcategory of strongly bounded objects admits a bounded $t$-structure. Our main result, under a finiteness condition termed the finite strong finitistic dimension, states that this happens exactly when the subcategory agrees with the full subcategory of bounded objects in the ambient triangulated category. In that case, the bounded $t$-structure is unique up to equivalence; even more, the uniqueness holds unconditionally on the full subcategory of bounded objects.
Artificial Intelligence
Learning to Follow In-Context Watermark Instructions via Self-Distillation
In-context watermarking (ICW) prepends an instruction to a query asking the model to embed a statistically detectable signal in its response. It thus equips LLMs with a watermarking interface that third parties can invoke without access to model internals. Its reliability hinges on the LLM following the instruction without degrading answer quality, yet how well current LLMs do so has not been measured. We introduce $\mathsf{ICWBench}$, a benchmark of three verifiable ICW instruction families, each scored on both detectability and answer quality. Evaluating 14 frontier proprietary and open-source LLMs, we find that none of the evaluated LLMs achieves both objectives across all three families. To address this, we propose a self-contained two-stage training method, requiring no distillation from a stronger model, no manual annotation, and no pre-existing ICW IF ability. The first stage, self-distillation with logits perturbation (SDLP), uses the same base LLM as both teacher and student: an instruction-equivalent decoding-time logits perturbation makes the teacher follow the ICW instruction, and the student is trained to match the teacher's output distribution. The second stage applies reinforcement learning with the automatic verifier as the reward. Applied to Qwen3-14B and GPT-OSS-20B, our method raises average TPR@$1\%$FPR across three ICW instructions from $0.100$ to $0.974$ and from $0.337$ to $0.968$, respectively, while maintaining high response quality under both perplexity evaluation and LLM-as-a-Judge.
Read the full abstract
Machine Learning
Flow-JEPA: Robust Latent Dynamics for JEPA World Models via Flow Matching
Joint-Embedding Predictive Architectures (JEPAs) provide a powerful framework for latent world modeling and planning in a reconstruction-free manner. Although numerous JEPA-based approaches have been proposed to mitigate representation collapse, our experiments on localized, out-of-distribution visual noise reveal that performance degradation remains pronounced and unresolved. We propose Flow-JEPA (F-JEPA), a flow-based latent dynamics model that jointly generates a sequence of future latent states conditioned on the current observation and actions. A Gaussian distribution serves as the flow source, exposing the vector field to perturbed latent trajectories as it learns to transport them toward clean future representations. This formulation retains the reconstruction-free JEPA framework while switching from pointwise transition regression to stochastic trajectory-level prediction. F-JEPA raises mean success from $86\%$ to $92\%$ under clean observations and from $67\%$ to $86\%$ under noisy conditions. Further evaluations over varying perturbation severity and inference settings show that the performance advantage persists across a broad range of conditions. These results suggest that conditional flow matching provides a promising alternative to deterministic autoregressive prediction as a dynamics formulation in JEPA world models.
Read the full abstract
Artificial Intelligence
Facts Without Rules: Boundary Metadata Collapse in Multi-Agent LLM Handoffs
Multi-agent LLM systems often coordinate by compressing an upstream interaction into a handoff artifact that downstream agents treat as shared state. We show that this handoff step is a structural source of privacy leakage: summaries preferentially preserve operational facts while weakening the boundary metadata that governs how those facts may be used—a failure mode we call summary collapse. On a controlled multi-agent coordination testbed we measure marker survival with a human-validated judge ($\kappa = 0.74$), where $\sigma_b = 1$ means every boundary marker survives verbatim and $\sigma_b = 0$ means all are lost. Boundary-marker and operational-fact survival are nearly uncorrelated at the handoff level on both GPT-5-mini and DeepSeek-R1-32B (Pearson $r$ near zero): uncompressed free-text handoffs preserve boundaries at $\sigma_b \approx 0.80$, whereas a $25$-word budget drops $\sigma_b$ to ${\approx}0.57$ while operational-fact survival stays near ceiling. Controlled downstream tests reveal that protection depends on boundary explicitness: vague languages leak in $73\%$ of GPT and $50\%$ of DeepSeek cases, while explicit constraints reduce leakage to under $15\%$ across all three tested models. A no-handoff single-agent control further shows the failure is not reducible to multi-agent topology as direct full-marker access still leaks more often than the operationalized handoff. Prompt-only mitigation and exact-string redaction only partially address the problem, while a gold-derived audience allowlist nearly eliminates leakage across models, showing that correctly identifying audience boundaries is the key factor.
Read the full abstract
Computer Vision
Explainable Multi-Loss Distillation Framework for Efficient and Interpretable Shrimp Disease Text Classification
Shrimp disease classification has become an urgent issue due to its significant impact on the import-export output of producing countries, particularly Vietnam. Most existing studies focus on image-based classification, which typically operates at the late stage of disease manifestation. Therefore, text-based classification has the potential to enable early and timely disease detection. To address this limitation, we introduce the SALT (Shrimp disease text Analysis with multi-Loss disTillation) framework, which incorporates explainability analysis using Local Interpretable Model-agnostic Explanations (LIME) and SHapley Additive exPlanations (SHAP) to evaluate model predictions and interpret the learned linguistic features. Experimental results demonstrate that SALT achieves competitive performance across multiple distillation objectives, outperforming supervised baselines while providing a favorable trade-off between predictive performance and computational efficiency. Moreover, it exhibits strong explainability, accurately identifying key linguistic features and semantic patterns relevant to disease descriptions. These findings highlight the potential of knowledge distillation-based text classification for future applications in early shrimp disease diagnosis and related research directions.
Read the full abstract
Artificial Intelligence
Disentangling Representation using Attributes-based Gaussian Estimation for Medical Sound Diagnosis
Deep learning has a powerful capability of feature extraction. However, the lack of fairness and interpretability in deep neural networks poses limitations to their adoption in the medical domain. This paper proposes a disentangled representation learning (DisenRL) framework, named the Attributes-based Gaussian Estimation for Disentangled Representation (AGEDR), which incorporates Attribute Mapping Embedding (AME) modules designed to map attributes into vectors and align them with a subset of the latent vectors in a Variational AutoEncoder (VAE). This part of the latent vector will be disentangled from the remaining latent vectors by minimizing mutual information. A classifier is then trained using the mean parameters of the latent vectors from the VAE. Extensive experiments demonstrate that AGEDR outperforms both conventional classification models and existing disentangled representation learning methods. The ablation experiments also indicate the disentangling capability and fairness of AGEDR. The source code is publicly available at https://github.com/ZhaoKe1024/DisentangledRepr.
Read the full abstract
Statistical Finance
Deep Hedging Under Realistic Market Frictions: A Regime-Conditional Empirical Study of Dynamic Option Hedging on Bitcoin Options
Classical option-hedging methods like Black-Scholes delta assume constant, free rebalancing, which real markets don't allow. Deep hedging trains a neural network to handle these frictions directly, and prior work reports strong results. But those comparisons usually pit deep hedging against a frictionless classical baseline on simulated price data. That's not a fair fight, and it leaves open whether the advantage is real. We test this using five years of actual BTC options data from Deribit (2020-2024), comparing Black-Scholes delta, Leland's cost-adjusted hedge, and the Whalley-Wilmott no-trade band against three deep hedging setups: an LSTM and a feedforward network, each trained with a CVaR loss and, in some runs, a penalty for trading too often. All six strategies face the same 5 basis point transaction cost. On 11,546 test episodes from September 2023 to December 2024, Whalley-Wilmott cuts transaction costs significantly versus hourly rebalancing, saving $1.79 per episode against plain BS delta (95% CI [-2.21, -1.39], p < 0.0001) by trading about eight times less often. Its P&L and tail-risk numbers are better too, though not quite significant at this sample size. None of the three deep hedging models beat any classical benchmark on any metric, and all kept trading almost every hour regardless of penalty weight, a twenty-fold range barely moved the needle. A calmer validation period shows Whalley-Wilmott's P&L edge shrinks or disappears there while its cost edge holds, so the result depends on market regime. We think the likely causes are a small training set and the lack of any built-in mechanism for sitting still in the architectures tested. Not a flashy result, but an honest one: a real-data check on a claim mostly supported by simulations so far.
Read the full abstract
Machine Learning
Hybrid Semantic Context-Enhanced Ensemble Learning for Wind Power Ramp-Event Forecasting and Uncertainty-Aware Evaluation
Wind power ramp events which are sudden, large swings in turbine output over short windows are difficult to estimate, and standard models often miss them. Hybrid forecasting approach is built which augments semantic context to ramp-event forecast. Rather than applying an extensive language model directly to predict turbine operating data, we have implemented a pipeline where turbine operating data is converted to simplified text, which is then converted to dense embeddings to be used as inputs for ensemble models incorporated with other features. Testing runs are performed at multiple intervals within the SDWPF dataset, including 10-minute, 30-minute, and 60- minute horizons, with ramp events constituting the highest change in future power output. We check robustness against autoregressive, LSTM, and GRU baselines plus several ensemble configurations, using Diebold-Mariano tests and bootstrap confidence intervals, and we vary the ramp threshold, compress the embeddings with PCA, and validate externally on Kaggle SCADA and NREL data with uncertainty-aware scoring. The semantic-context features produce negligible yet statistically significant gains over the baselines in multiple paired ensemble runs, most clearly at the 30- and 60-minute horizons where these gains hold across different ramp-threshold definitions, and PCA compression helps in some longer-horizon cases. The best context- augmented ensembles rank near the top overall, though the GRU model still posts the lowest ramp-event RMSE at 30 and 60 minutes. External tests confirm the error reduction generalizes across datasets, but the size of the gain depends on both model and dataset. Prediction intervals cover most test cases well but weaken during ramp events, pointing to a localized shift in the data distribution.
Read the full abstract
Robotics
Teaching Robot Policies to Humans Using Erroneous Examples
Human-robot collaboration describes the process of humans and autonomous agents working together to accomplish common goals. This process is facilitated best when robot policies, or behaviors in different situations, are made transparent to humans. Demonstration-based explanations have been a focus of human-robot collaboration research, and the field has frequently drawn upon literature from education to improve how humans are taught robot policies. However, no single teaching method has been proven effective across domains, difficulties, learners, and other variables; the question of how humans can most effectively be taught robot policies remains open. In traditional classrooms, learners are shown erroneous examples, in which they reflect on and correct incorrect responses to understand common pitfalls when learning a concept. We propose using erroneous examples to teach robot policies, extending an existing policy teaching framework. We conduct a user study in which participants view incorrect demonstrations of robot behavior and correct the actions to align with the actual policy. Our findings suggest that viewing these incorrect demonstrations and verbalizing one's reasoning in predicting a robot's actions improves retention of the policy over time, in agreement with the effect of erroneous examples in classrooms. We also categorize participants into distinct learning styles and establish that participants using inverse reinforcement learning-like reasoning perform best on policy prediction tasks. With this work, we aim to advance the methods by which robots educate humans on their policies.
Read the full abstract
Dynamical Systems
On the Existence of Geometrically Attracting Measures for Iterated Function Systems with Varying Sets of Transformations
In this paper, we focus on the asymptotic behavior of random iterated functions systems, in which both the family of transformations and the distribution of selecting them vary at each step. We consider two types of dynamics: the time-inhomogeneous Markov chain arising from forward iterates and the non-Markovian process generated by backward iterates. For both settings, we provide certain criteria for the existence of a probability measure that is geometrically attracting in the bounded Lipschitz distance, independently of the initial distribution. Finally, we illustrate our results through applications to specific models involving affine transformations.
Read the full abstract
Audio and Speech Processing
Beyond Speech: Dual-Domain SSL Fusion for Unified All-Type Audio Deepfake Detection
Unified all-type audio deepfake detection aims to determine whether an input clip is real or fake when its audio type may be speech, environmental sound, singing voice, or music. Existing speech-centric or type-dependent solutions are insufficient for this setting because the test-time audio type is unknown, while the required output is still a single binary decision. To address these issues, this paper proposes a dual-domain SSL fusion method that maps heterogeneous audio into a shared binary authenticity space. EAT-large and wav2vec 2.0 XLS-R-300M are used as complementary SSL feature sources, providing broad acoustic and event-level representations as well as waveform-level, vocal, and speech-sensitive representations. Layer-wise weighted fusion integrates multi-level artifacts from different transformer depths, while token-level fusion forms a unified feature pool without enforcing frame-level alignment between the two SSL streams. The fused tokens are summarized by multi-head attentive statistics pooling and classified with a binary MLP head. With conservative speech refinement applied on top of this unified core detector, the submitted system achieves 95.58% Macro-F1 on the AT-ADD Track 2 evaluation set and ranks second in the challenge.
Read the full abstract
Signal Processing
A Continuous Payload-Bearing Discrete Multitone Modulation Framework for Fiber-Optic Integrated Sensing and Communication
A key challenge in fiber-optic integrated sensing and communication (ISAC) is to make the payload-bearing waveform itself serve both functions without a separate sensing waveform or sensing-only silent interval. We propose a continuous discrete multitone (DMT) framework with two waveform modes, in which the same payload-bearing waveform supports forward intensity-modulation/direct-detection (IM/DD) communication and backward distributed acoustic sensing (DAS). A unified phase-sensitive optical time-domain reflectometry ({\phi}-OTDR) model represents distributed Rayleigh backscattering as a finite-memory sensing multipath channel. It shows that conventional pulse-and-wait {\phi}-OTDR requires a round-trip-time-scale silent interval to isolate successive returns, while nonzero off-peak samples in practical matched-filter (MF) pulse compression cause spatial intersymbol interference (ISI). Continuous DMT instead retains superposed returns and separates range-cell contributions through known-waveform channel reconstruction. Cyclic-prefix DMT (CP-DMT) uses a full-memory CP and one-tap frequency-domain equalization (FDE); under sufficient-CP and ideal full-bin inversion conditions, it eliminates MF-correlation-induced spatial ISI. Cyclic-prefix-free DMT (NoCP-DMT) applies regularized least squares (LS) to the long-memory linear convolution, avoiding the CP at higher receiver complexity. Experiments over a 10-km fiber link localize a 600-Hz disturbance applied by a piezoelectric transducer (PZT) near 5.071 km and recover gauge-differential phase with correlations of 0.989 and 0.987 for CP-DMT and NoCP-DMT, respectively. At 2- and 1-V PZT drive levels, the ten-record localization standard deviations are 0.16/0.11 m and 0.18/0.38 m, respectively. The corresponding IM/DD error vector magnitude values range from 4.80% to 5.00%, with no bit errors observed.
Read the full abstract
Information Retrieval
Book Readership During Movie Releases: An Exploratory Analysis
Exogenous events can temporarily change the relevance of items in recommender systems, but these shifts are often not visible in historical interaction data until after users have already responded. In book recommendation, movie adaptations provide a clear example of such events: the release of a movie based on a book can temporarily increase attention to the source text and change its relevance for some readers. We examine this phenomenon using a large Goodreads dataset matched to movie release dates. We find a clear spike in readership around the release month, and then we evaluate existing recommendation models to understand how they rank movie-adapted books around the movie release date.
Read the full abstract
Machine Learning (Statistics)
Sharp Restricted Isometry Thresholds for Global Minima of Rank-Restricted Matrix LASSO
We determine the sharp restricted isometry threshold for recovery at global minima of the rank-restricted matrix LASSO. For target rank $r_{\star}$, if the rank-$k$ RIP constant satisfies $\delta<\delta_{\mathrm{sharp}}(k/r_{\star})$, where $\delta_{\mathrm{sharp}}(t)=t/(4-t)$ for $0<t<4/3$ and $\delta_{\mathrm{sharp}}(t)=\sqrt{(t-1)/t}$ for $t\ge4/3$, then every global minimizer has Frobenius error $\lesssim\sqrt{r_{\star}}\lambda$ for all $\lambda\gtrsim\|\mathcal{A}^{*}(\xi)\|_{\mathrm{op}}$ and at every search rank $r\ge r_{\star}$. The constants depend only on the RIP constant and $t=k/r_{\star}$, and in particular are independent of the search rank. When the rank restriction is inactive, the result specializes to the ordinary convex matrix LASSO. We also obtain the analogous results for sparsity-restricted vector LASSO. Conversely, we show that the threshold $\delta<\delta_{\mathrm{sharp}}(k/r_{\star})$ cannot be improved, due to the existence of counterexamples whose global minimizers fail to recover the ground truth.
Read the full abstract
Quantum Physics
Hardware-Efficient Exchange-Only QML: Singlet-Triplet Spin Chains via Inter-pair Coupling without Magnetic Gradients
Standard universal quantum computing using exchange-only qubits typically requires three physical spins per logical qubit, leading to significant hardware overhead. Conversely, two-spin units offer higher density but rely on local magnetic field gradients for control, increasing integration complexity. In this paper, we propose a resource-efficient quantum machine learning (QML) architecture that achieves high expressibility using minimal two-spin units and Heisenberg exchange interactions alone, without any magnetic gradients. We shift the paradigm from universal gate-based control to utilizing the intrinsic, time-domain dynamics of a spin chain as a learning resource. Numerical simulations on MNIST digit classification demonstrate that the symmetry-protected constraints of isolated spin pairs are bypassed by leveraging inter-pair exchange coupling. This interference-mediated state mixing significantly enhances the expressibility of the Hilbert space. The model reaches a test-set accuracy of 90.9% +/- 0.2% over five independent seeds on the full 10,000-image MNIST test set. Under an identical linear readout, the trained quantum feature map (88.1%) clearly outperforms a classical linear baseline on the same PCA inputs (83.2%) as well as an untrained (reservoir-style) version of the same dynamics (53.0%), demonstrating that the learned, input-dependent exchange pulses implement a genuinely non-linear and trainable feature map. The protocol is also robust to experimentally relevant imperfections: accuracy remains at 89.9% under 10% quasi-static pulse-area noise and at 89.8% when every observable is estimated from 10^3 measurement shots. These findings suggest that competitive QML can be executed on the simplest possible semiconductor spin-chain hardware, bypassing the need for leakage-prone encodings or complex micro-magnet integration.
Read the full abstract
Computer Vision
Towards Fully Automated Medical Imaging Code Generation via Validation-based Context Engineering
Large language models (LLMs) have demonstrated considerable promise in program generation for small-scale and conventional application development; however, they remain limited when applied to complex, domain-specific tasks such as medical image processing. General-purpose models lack explicit domain knowledge and robust validation mechanisms to ensure correctness, often requiring substantial human intervention to produce reliable processing pipelines. To address these limitations, we propose AutoMedImg, a multi-agent framework for fully automated medical image processing code generation. AutoMedImg orchestrates specialised agents across two phases: a Planning Phase that performs dataset analysis and architecture design with semantic and formal verification, and a Coding Phase that generates modules in parallel with static checking, execution testing, and assembly validation. This multi-stage validation mitigates error propagation throughout generation, while comprehensive auto-context engineering combining domain-specific knowledge bases, shared memory, and validation feedback automates context construction without manual prompting. A cross-project adaptive pipeline synthesis mechanism further accumulates validated pipelines and retrieves proven components for new tasks based on project similarity, enhancing generation efficiency through cross-project learning. Extensive evaluation across six diverse and well-established medical imaging datasets with five backbone LLMs demonstrates that AutoMedImg achieves zero human intervention, with Dice scores of up to 0.90 for segmentation tasks and 99% accuracy for classification.
Read the full abstract
Mesoscale and Nanoscale Physics
Probing spin order via magnon transmission across quantum Hall ferromagnet heterojunctions
Two-dimensional material platforms now host a remarkable array of exotic correlated phases, from unconventional superconductivity to fractional Chern insulators. Probing magnetic order in these systems is essential for understanding their underlying physics, yet dilute spin densities render conventional magnetic probes ineffective. Spin waves, or magnons, in quantum Hall ferromagnets (QHFM) have proven effective for probing the magnetic order in various symmetry-broken quantum Hall (QH) phases in graphene systems, but previous works have been limited to homojunction configurations within a single material. Here, we demonstrate magnon transmission across a monolayer-bilayer graphene quantum Hall ferromagnet heterojunction - the first magnon transmission across quantum Hall ferromagnet heterojunctions, using one material as a magnon source to probe magnetic order in a distinct material. Generating magnons in monolayer graphene (MLG) at $\nu$ = 1, we detect their transmission through bilayer graphene (BLG) via nonlocal voltage measurements, revealing spin order in BLG symmetry-broken quantum Hall states. The transmission exhibits hallmark magnon signatures: a sharp onset at the Zeeman energy and systematic variation with Landau level filling, including suppression at $\nu$ = 4 and 8 where spin polarization vanishes. Our findings establish heterojunction magnon transmission as a powerful, modular probe of magnetic order, opening new avenues for investigating exotic quantum states across the rapidly expanding family of two-dimensional materials.
Read the full abstract
Numerical Analysis
Gappy probabilistic manifold decomposition for nonlinear field reconstruction
This paper proposes gappy probabilistic manifold decomposition (Gappy PMD), a nonlinear method for reconstructing high-dimensional fields from extremely sparse measurements. Gappy PMD reconstructs the field on the nonlinear manifold learned by probabilistic manifold decomposition (PMD). We further propose a differentiable point selection method for reduced-order model (ROM)-based field reconstruction (DPS). Using differentiable meshless interpolation within the ROM-based reconstruction framework, DPS makes the full-field reconstruction error differentiable with respect to the sampling locations and directly optimizes these locations. In addition, a theoretical error analysis for Gappy PMD is also given. It splits the squared reconstruction error into two orthogonal parts: one normal to the reconstruction manifold and the other induced by sparse sampling and observation noise. Under a stability condition on the sampling operator, this error vanishes with the PMD approximation error and the noise. The Gappy PMD is evaluated on three numerical test cases: flow past a cylinder, lid-driven cavity flow, and backward-facing step flow. For the same reduced dimension and sampling points, Gappy PMD attains mean relative $L^2$ errors one to two orders of magnitude below Gappy POD. Optimizing the sampling points with DPS further improves reconstruction accuracy and robustness.
Read the full abstract
Algebraic Topology
Weighted Homology and Cohomology of Weighted Polyhedra
We define the notion of weighted polyhedron which can be thought of as the geometric realization of a weighted simplicial complex introduced by Dawson. Moreover, we will define a weighted version of singular homology theory for a weighted polyhedron and prove that it is isomorphic to the weighted simplicial homology of the weighted polyhedron. This implies that weighted simplicial homology is an invariant under isomorphisms and more generally under certain type of homotopy equivalences of weighted polyhedra. Moreover, we will generalize the cup product and cap product to weighted singular cohomology. In addition, we will interpret some known theories of orbifolds in terms of our weighted singular homology and cohomology.
Read the full abstract
Artificial Intelligence
Frequency Selective Neural Networks as a Foundation Architecture for Time Series Learning
Time-series data across physical and biological domains are fundamentally driven by complex, non-stationary oscillatory modes. While deep learning models, such as Convolutional Neural Networks (CNNs), Recurrent Neural Networks, and Transformers, have dominated sequential analysis, they remain fundamentally "spectral-blind". By mapping continuous physical waves into unconstrained spatial or discrete token spaces, these architectures suffer from severe spectral entanglement, acting as opaque black boxes that decouple predictive accuracy from physical reality. In this paper, we introduce the Frequency Selective Neural Network (FSNN), pioneering a foundation architecture guaranteeing physical interpretability without sacrificing expressive power of deep learning. FSNN addresses spectral entanglement by explicitly embedding the rigorous mathematics of advanced signal processing into its neural topology. Through a fully differentiable Wiener-like filter bank optimized via complex-domain backpropagation, FSNN autonomously discovers and isolates the precise physical modes of a given task. Extensive evaluations demonstrate that FSNN establishes state-of-the-art predictive performance, achieving $77.0\%$ average accuracy on the standard 10 multivariate UEA datasets and leading across all major metrics on the highly imbalanced PTB-XL clinical ECG benchmark. Crucially, in contrast to yielding abstract feature maps, FSNN converges directly on physically meaningful frequency bands, such as isolating the cardiac QRS complex, providing a highly scalable, interpretable paradigm for robust pattern recognition in complex temporal domains. Our code is available at: https://github.com/ad6174hhhh/FSNN.
Read the full abstract
Astrophysics of Galaxies
Can Little Red Dots Contribute To The Early Universe Cosmic Dust Budget?
The origin of dust in the early Universe remains uncertain. We explore whether Little Red Dots (LRDs) could provide a high-redshift dust-production channel. Motivated by an analogy with Type IIn supernovae, we investigate whether LRDs may share the efficient dust-forming conditions. We consider dust formation in outer winds and later in a shielded cold dense shell after the central source fades. Such dust may avoid a global remnant-phase reverse shock, while longer LRD lifetimes may promote grain growth. We model the SEDs of two low-redshift LRD analogs as a thermal pseudo-photosphere plus optically thin dust components, obtaining dust reservoirs of order $10^{2}$-$10^{3}\,M_{\odot}$. Although photometry cannot exclude pre-existing dust, the narrow Balmer components of both analogs are close to the Case B ratio and their narrow-line environments are metal-poor, disfavoring a dominant diffuse host-ISM origin for the inferred reservoir. Formation within the LRD outflow is consistent with our optical-depth, sublimation, and energy-balance checks. In this scenario, the large dust masses do not produce a strong optical attenuation because a clumpy or asymmetric distribution can leave the dominant optical sightlines relatively unobscured. Our population calculation shows that the LRD contribution to early-Universe dust production can range from negligible to dominant. At higher efficiencies, LRDs can approach or exceed the lower CCSN contribution above $z\approx5$, whereas less favorable assumptions yield a minor contribution. We therefore propose that LRDs can act as early-Universe dust factories and, under some conditions, may dominate over CCSNe or provide seed grains for subsequent growth in the early ISM.
Read the full abstract
Human-Computer Interaction
How Mental Health Self-Disclosure Becomes Visible: Evidence from Eight Conditions on Reddit
People share mental health diagnoses on social media, yet how such language becomes visible around their self-disclosure, and whether community engagement tracks it, remain unexamined across conditions. We analyze 89,605 Reddit posts from 739 users across eight conditions, removing each user's diagnosis disclosure and aligning their surrounding posts to that anchor. Within the pre-disclosure year, language-visible burden was highest in the month before disclosure for six conditions, earlier for post-traumatic stress disorder and furthest from it for borderline personality disorder, and remained visible afterward rather than resolving. The theme Seeking Clinical Explanations showed the largest early-to-late difference before disclosure in five conditions, yet engagement rarely tracked what users wrote: only 9 of 360 language–engagement correlations survived correction. Disclosure is therefore a waypoint in an unevenly visible process, and we offer implications for community practice and platform design where engagement metrics do not reflect clinical need.
Read the full abstract
Numerical Analysis
A Sharp Unitarily Invariant Norm Bound for the Off-Diagonal Block Perturbation of a Hermitian Matrix
Let $$ A=\begin{bmatrix} H_1 & E^* \\ E & H_2 \end{bmatrix} \quad\text{and}\quad \widetilde A=\begin{bmatrix} H_1 & 0 \\ 0 & H_2 \end{bmatrix} $$ be partitioned Hermitian matrices, with $\widetilde A$ obtained by dropping the off-diagonal blocks of $A$. Let $\eta$ be the minimum distance between the spectra of $H_1$ and $H_2$; these spectra may interlace. Define, for $\delta,\epsilon\ge0$, $$ \phi(\delta,\epsilon)= \begin{cases} 2\epsilon/(\delta+\sqrt{\delta^2+4\epsilon^2}), &\quad\mbox{if $(\delta,\epsilon)\ne (0,0)$}, 1, &\quad\mbox{if $(\delta,\epsilon) = (0,0)$}, \end{cases} $$ and let $\widetilde E=A-\widetilde A$ and $\epsilon_2=\|E\|_2=\|\widetilde E\|_2$, the matrix spectral norm. Li and Li [Linear Algebra Appl., 395:183–190, 2005] established a sharp spectral-norm bound on the changes in the eigenvalues of $A$: $$ \big\|\mathrm{diag}\big(\pmb{\lambda}(A)-\pmb{\lambda}(\widetilde A)\big)\big\|_2 \le \phi(\eta,\epsilon_2)\,\|E\|_2, $$ where $\pmb{\lambda}(A)$ is the vector whose components are the eigenvalues of $A$ in descending order and similarly for $\pmb{\lambda}(\widetilde A)$. In this paper, this bound is extended to every unitarily invariant norm $\|\cdot\|_\mathrm{ui}$: $$ \big\|\mathrm{diag}\big(\pmb{\lambda}(A)-\pmb{\lambda}(\widetilde A)\big)\big\|_\mathrm{ui} \le \phi(\eta,\epsilon_2)\,\|A-\widetilde A\|_\mathrm{ui}. $$ A $2\times2$ example attains equality for every such norm. An analogous bound for singular values is also established when the off-diagonal blocks of a rectangular matrix are dropped.
Read the full abstract
Artificial Intelligence
Multi-Step Forecasting of Grape Berry Temperature based on LSTM Model with Feed-Forward Attention
Accurate forecasting of grape berry temperature (Tb) is essential for enabling timely heat stress management in vineyards. In this study, a feed-forward attention mechanism integrated with a Long Short-Term Memory network (FAM-LSTM) was developed and evaluated for multi-step, high-resolution Tb prediction. Models were trained using environmental data from 2023 and 2024 at Prosser, WA, USA, and validated on 2025 summer data. FAM-LSTM was benchmarked against LSTM, GRU, RNN, and Random Forest (RF) across horizons ranging from 15 minutes to 72 hours (288 time steps). Two input scenarios were evaluated: nearest open-field weather station observations and in-vineyard microclimate measurements. FAM-LSTM consistently outperformed all benchmark models across all horizons and input scenarios. Incorporating in-vineyard microclimate data significantly improved forecasting accuracy at longer horizons. Using open-field data, FAM-LSTM achieved MAE and RMSE ranges of 0.58 to 1.70 deg C and 0.65 to 2.07 deg C, respectively. In-vineyard observations further improved performance, with MAE and RMSE in the ranges of 0.51 to 1.55 deg C and 0.71 to 1.87 deg C. Error analysis showed prediction uncertainty was highest during peak daytime periods (11:00 to 18:00) and increased progressively with forecast horizon. Overall, the FAM-LSTM framework offers robust Tb forecasting to support precision heat stress management in vineyards.
Read the full abstract
Mesoscale and Nanoscale Physics
Fractional Impurity Entropy from Potential Scattering in a Free Electron Gas
Fractional changes in entropy are often associated with strong electron correlations or non-Abelian anyons in topological systems. We show that neither condition is necessary – a system of free electrons on a ring scattering off a repulsive point-like impurity undergoes a $k_B\ln\sqrt 2$ entropy change as the impurity strength is increased. This effect arises from a shift of allowed single-particle momenta from integer quantization to half-integer quantization, induced by the impurity. We show that this fractional entropy change is universal across a broad class of single-particle dispersions, demonstrating that such signatures can arise without strong correlations or topological order.
Read the full abstract
High Energy Physics (Phenomenology)
First Evidence for an Unambiguous Triangle Singularity from $\psi(2S) \to p\bar{p}\eta$
Triangle singularities, predicted by Landau in 1959, are purely kinematic enhancements arising from hadronic rescattering loops. Despite their proposed role in various anomalous decay processes and exotic hadron candidates, a direct experimental confirmation has remained elusive for more than six decades. We analyze the $p\eta/\bar{p}\eta$ invariant mass spectrum in $\psi(2S) \to p\bar{p}\eta$ measured by the BESIII Collaboration. The data exhibit a clear cusp-like structure around 1.564~GeV in the $N(1535)$ region, in precise agreement with the kinematic position predicted for the triangle singularity. Including the triangle singularity loop in the fit substantially improves the description of the data, with $\chi^2/\mathrm{d.o.f.}$ decreasing from 1.22 to 0.90, corresponding to a significance of $\sim 3.8\sigma$ for the triangle singularity contribution. The precise alignment of the observed excess with the predicted kinematic position provides the first compelling evidence for the triangle singularity effect.
Read the full abstract
Robotics
When Does Corruption Break the Plan? A Degradation-Tolerance Benchmark for Camera-Only End-to-End Driving
Camera-only end-to-end (E2E) driving models are nearing deployment, where the camera stream is degraded by blur, noise, low light, weather, frame loss, and memory faults. How much a policy tolerates before its driving breaks is unclear. Corruption-robustness benchmarks target detection or bird's-eye-view perception, not the planning output that drives the car. We present DriveDegrade, a benchmark for image-degradation tolerance in camera-only E2E driving. Sixteen corruption families at five severities are injected on the fly inside the image loader, one operator reaching fifteen policies, and we evaluate open-loop planning on nuScenes and NAVSIM plus a CARLA closed-loop anchor. First, mild degradation barely affects planning, and the families that break it have a clear threshold at mid severity. Second, fragility is corruption-dependent: blur, JPEG, and raindrop damage planning most, while weather and bit error are tolerated far into the range. Third, a flat curve is ambiguous, so we separate corruptions that degrade the image from those that remove it. A planner that reads its camera must lose accuracy when information is deleted, whatever it does under quality loss. On these two axes the planners separate sharply, quantifying the ego-status shortcut without mistaking indifference for robustness. A released vision-language-action planner is flat on both axes, and blinding all six of its cameras costs it only 11.5 percent.
Read the full abstract
Machine Learning
Context-Aware Interpretable Representations for Retrieval and Graph Convolutional Network Classification
The advances in visual information modeling and representation during the last decades are remarkable, mainly supported by Convolutional Neural Networks, Transformer-based, and Foundation Models. Despite this progress, critical challenges regarding the nature of similarity assessment and model transparency have been neglected. A primary concern is the Geometric Gap, where traditional pairwise measures fail to capture the intrinsic geometry of the dataset manifold. Furthermore, the Interpretability Gap persists, as representations often lack alignment with human cognition. Therefore, how to provide interpretability to representations while maintaining low dimensionality and high effectiveness in downstream tasks remains an open challenge. In this paper, we propose a novel unsupervised framework that integrates Manifold Learning strategies with Rank-based Interpretable Graph Embeddings. Our approach effectively bridges these gaps by first characterizing the contextual information of the dataset through manifold analysis and subsequently generating sparse, self-explainable embeddings. The proposed approach employs a flexible formulation, allowing different Manifold Learning and Representation Learning strategies. Extensive experimental evaluation across diverse datasets and features demonstrates that our Context-Aware representations not only provide intrinsic interpretability and dimensionality reduction but also maintain or enhance effectiveness in downstream tasks, specifically in image retrieval and semi-supervised classification using Graph Convolutional Networks (GCNs).
Read the full abstract
Computer Vision
RoSe-SLAM: Robust Semantic-Aware Gaussian Splatting SLAM from Dynamic Monocular Videos
In dynamic and unstructured environments, conventional SLAM systems generally suffer from significant accuracy degeneration due to their static assumptions. In this work, we propose Robust Semantic-aware Gaussian Splatting SLAM (RoSe-SLAM), to address the dynamic challenge by a holistic semantic scene understanding from uncalibrated monocular inputs, achieving accurate camera tracking and high-quality geometry reconstruction. Unlike conventional semantic SLAM using handcrafted semantic labels, our RoSe-SLAM exploits the semantic feature from 2D foundation model to enhance the dynamic tracking and mapping performance. By distilling the rich semantic features to our Gaussian fields, our method effectively identifies dynamic distractors and achieves semantic-aware multi-view consistency, significantly enhancing the geometric reconstruction and scene inpainting. Specifically, we propose a spatial-temporal motion mask generation module, enabling both long-term motion monitoring and short-term transient dynamics capturing, achieving robust and effective disentanglement of dynamic objects and static backgrounds. During global bundle adjustment, we propose an occlusion-aware keyframe selection mechanism to prioritize the occlusion as metric to pick the keyframes, and a multi-view semantic consistency module to improve the mapping quality in dynamic environments. By combining geometric motion cues with semantic priors, our system dynamically filters unreliable observations and reconstructs accurate static scene geometry. Extensive experiments conducted on benchmark datasets including dynamic TUM, Bonn and Wild-Mocap datasets, demonstrate that our method achieves superior performance in both trajectory estimation and static scene mapping, outperforming existing dynamic RGB SLAM baselines in long-term dynamic indoor environments.
Read the full abstract
Analysis of PDEs
The Stokes Operator on Exterior Domains in Homogeneous Weighted Function Spaces:From Weak Theory to $\mathscr H^\infty$-calculus to Fractional Domains
We consider the Stokes operator $A$ on smooth exterior domains $\Omega$ of $\mathbb{R}^n$ in homogeneous Sobolev spaces $\widehat H^{\kappa,q}_w(\Omega)$ with radially symmetric Muckenhoupt weights $w\in \mathscr A_q$. A fundamental property is the existence of a bounded $\mathscr H^\infty$-calculus of the Stokes operator on weighted nonhomogeneous and homogeneous $L^q$ Sobolev spaces. This property implies the existence of uniformly bounded purely imaginary powers $A^{it}$, $t\in\mathbb{R}$, and the characterization of domains of fractional powers $A^\theta$ equipped with nonhomogeneous ($\| u\|_{L^q_w} + \|A^\theta u\|_{L^q_w}$) as well as homogeneous norm ($\|A^\theta u\|_{L^q_w}$) as complex interpolation spaces. The final aim is the identification with homogeneous spaces $\widehat{\mathcal D}((-\Delta_{q,w})^\theta) = [L^q_{w},\widehat{\mathcal D}(-\Delta_{q,w})]_\theta$ intersected by a space of solenoidal vector fields. Moreover, we obtain weighted variational inequalities for weak solutions of the Stokes equations, weighted $L^q$-$L^r$ decay estimates of the Stokes semigroup and $L^p$-maximal regularity on $L^q_{\sigma,w}(\Omega)$.