Peer Revenue Publish or profit

Papers

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

All of arXiv

Thursday 3 September

Computer Vision

Tree species mapping in Denmark: A comparison of spectral-temporal features with geospatial foundation model embeddings

We map tree species across Denmark using National Forest Inventory plots and EO data, while evaluating the potential of foundation models for large-scale forest characterization. We compare two alternative input representations for tree species classification: (i) manually engineered spectral-temporal features (STF) derived from multi-temporal Sentinel-1 and Sentinel-2 observations, and (ii) embeddings generated by the EO FMs TESSERA and AlphaEarth. Both representations are complemented with canopy height information. Random forest, XGBoost, and Multi-Layer Perceptron (MLP) classifiers are evaluated for all input representations, with separate assessments for pure and mixed forest stands. The STF-based MLP achieves the highest classification performance, yielding macro F1 scores of 0.843 and 0.653 for pure and mixed stands, respectively. The MLP trained on TESSERA embeddings delivers competitive performance for pure stands, achieving results within 1.1 percentage points of the best-performing model. TESSERA consistently outperforms STF-based models when fewer than approximately 25% of training plots are available, demonstrating a substantial advantage under limited training data. Multi-year observations systematically improve classification accuracy relative to single-year inputs, while ablation experiments reveal the complementary contributions of Sentinel-1 backscatter, spectral indices, and canopy height data. The best-performing model is subsequently applied at the national scale to generate a 10 m tree species map of Denmark. Area-adjusted validation indicates an overall map accuracy of 79.9%. The resulting map, released as an open-access product, is the first high-resolution national tree species map of Denmark and provides a valuable resource for forest monitoring, ecological research, and land management applications.
Read the full abstract

All authors Alkiviadis Koukos, Spyros Kondylatos, Thomas Nord-Larsen, Lotte Nyborg, Christian Tøttrup, Kenneth Grogan

2609.03480 · 3 Sep · This preprint presents a national-scale tree species mapping framework for Denmark using Sentinel-1/2 time series, National Forest Inventory data, and EO foundation model embeddings. The resulted national map can be found here: https://zenodo.org/records/22108850

Plasma Physics

Dependence of self-injected bunch parameters on the plasma density gradient and laser pulse amplitude at LWFA in a conical plasma channel

Laser wakefield acceleration (LWFA) is an advanced method of high gradient acceleration of charged particles with wakefield excited in plasma by laser pulse. A distinctive feature of this method is the ability to create and accelerate so-called self-injected bunches with unique parameters - charge, energy, emittance, and geometric dimensions - without the need for an external injector of the required bunches for their subsequent acceleration to higher energies. Self-injected bunches emerge due to the plasma electrons trapping by the excited wakefield (self-injection phenomenon). For many applications, self-injected bunches can be used directly in relevant experiments. In this paper the dependence of the self-injected bunch parameters on the laser pulse amplitude and longitudinal gradient of plasma density in tapered plasma channel is investigated using numerical simulation with the WarpX code. At the laser amplitude $a_0=E_0(m_{e0}c\omega/e)^{-1}=3.6$ in a conical channel with the radius decreasing from $4.0\,c/\omega_{pe}$ to $2.16\,c/\omega_{pe}$ and with the plasma density increasing linearly from $n_e=2.61\cdot10^{19}$ cm$^{-3}$ at the channel entrance to $3n_e$ at the exit, a self-injected bunch is obtained with the charge $32.1\,\mu$C/m, the mean longitudinal momentum $111.9\,m_ec$, the length $5.10\,\mu$m, the area $5.3\,\mu$m$^2$, the transverse emittance $1.6\cdot10^{-2}$ mm$\cdot$mrad.
Read the full abstract

Artificial Intelligence

AutoGraphForge: Towards Automated Graph Theory Discovery

We report on our ongoing project to develop a computational pipeline, AutoGraphForge, for an automated graph-theoretic conjecturing-refuting-formalizing-proving system. Conjecture generation is counterexample-guided and runs in rounds: a Graffiti3 generator proposes conjectures over a small, evolving snapshot table $T$ (initially a few hundred graphs with their computed invariants) that grows only by counterexamples to its own conjectures. A novelty filter of $559$ classical and folklore relations, closed under transitive composition and linear identity substitution, decides via a linear program whether a candidate is already implied by known results. Surviving candidates are tested against a dataset of about $348,000$ graphs, unioning the complete House of Graphs invariant export, the exhaustive census of all connected graphs on at most nine vertices, several extremal families (strongly regular, minimal Ramsey, Cayley, cages, barbells, lollipops, spiders), and random models. Counterexample-search algorithms then attack the remainder. Run for several rounds on an HPC cluster, the loop yields $6,522$ conjectures that survived the refutation dataset, the novelty filter and every active-search run – among them nontrivial relations between the annihilation number and the edge-cover number for bipartite and regular graphs, which we prove by hand. A subsequent formalization and proving stage deterministically translates each surviving conjecture into a Lean 4 statement skeleton; every candidate proof is kernel-verified against a pinned mathlib4 and our custom invariant preamble. This stage integrates two neural provers – DeepSeek-Prover-V2-671B (served with vLLM) and the Lean-specialised OProver-32B – behind the independent kernel check. It is implemented end-to-end and passes initial sanity checks, with the full pipeline currently running on the cluster.
Read the full abstract

General Relativity and Quantum Cosmology

Dynamical Selection of Horizon-BMS Goldstone Modes in Evaporating Black Holes

We investigate the dynamics of horizon soft degrees of freedom associated with near-horizon BMS supertranslations in an evaporating Vaidya-Schwarzschild black hole spacetime. Considering the dynamic nature of the supertranslation parameter, we derive its effective action directly from the Einstein-Hilbert action. The resulting Goldstone sector is intrinsically coupled to the evolving black hole dynamics, with the mass function entering the evolution of the Goldstone modes while the Goldstone configuration contributes to the dynamical evolution of the black hole mass. Azimuthal periodicity and regularity at the poles select the physically admissible angular sector and yields a mass-dependent $selection\ rule$ on the azimuthal modes. Consequently, the spectrum of horizon-supported Goldstone modes evolves with the black hole mass; as the horizon shrinks during evaporation, the horizon is left with a progressively reduced set of lower-order modes. The evaporation thus induces a dynamical filtering of the horizon soft sector, arising intrinsically from the black hole mass dynamics. These results provide an effective gravitational framework linking near-horizon BMS symmetry, dynamical Goldstone modes, and black hole evaporation, suggesting a direct connection between macroscopic horizon evolution with the microscopic organization of the gravitational soft degrees of freedom residing on the horizon.
Read the full abstract

Mesoscale and Nanoscale Physics

Built-In Electric Field Modulation of Spontaneous Magnetism and Thermospin Transport in Boron-Nitrogen Doped Zigzag Graphene Nanoribbons

Zigzag-edged graphene nanoribbons (ZGNRs) host large magnetic moments at two zigzag edges due to spontaneous magnetism, whose ground state is antiferromagnetically coupled spin-order edge state (AF state). In this paper, the spontaneous magnetism and thermoelectricity of ZGNRs with periodic substituted doping of boron and nitrogen atoms along the axial direction are investigated by first principle calculation. The doping induces an internal electric field, which modulates the magnetic moments at the two zigzag edges and the band structure with spin splitting. For varying doping configuration, the ground state could be AF state, ferromagnetically coupled spin-order edge state (FM state), or degenerated pair of AF and FM states. External transversal static electric field can further modulate the magnetic moments and the band structure. By designing the doping configuration and the external field, pure thermal spin current with the absence of thermal charge current can be generated at room temperature, which can be switched on and off by flipping the magnetic configuration between AF and FM states. Thus, the doped ZGNRs can be applied as prototype devices for spin-caloritronic.
Read the full abstract

Computer Vision

SafeRestore: Detector-Relative Risk Certificates for Selective Industrial Image Restoration

Industrial inspection pipelines often restore a measured image before a detector acts on it, yet restoration can suppress detector-supported defect structure or create clean-region activations. We formulate restoration as a selective action problem over the measured display, five restored candidates, and review. SafeRestore ranks candidates with action-specific fitted scores, chooses a gate on threshold-tuning data, and evaluates the fixed gate on a disjoint certification sample with two one-sided exact binomial bounds: one for the positive-conditional evidence-loss incident rate and one for the all-accepted excess-activation incident rate. The guarantee is marginal for one policy fixed before its certification outcomes are observed, under an image-level i.i.d. working model. In a retrospective split-sample study of 4,591 public Carinthia-S images, the protocol yields auditable risk-coverage behavior. The primary all-action policy passes in one of five training repetitions (12.0% +/- 26.9% pass-gated test coverage when failures count as zero), whereas fixed bicubic and reduced-complexity variants pass more often. On reserved morphologies, evidence-loss incidence rises to 81.1-90.3%, and KolektorSDD lacks both detector competence and enough positive certification images for the stated target. The contribution is therefore an auditable, detector-relative framework for deciding when a transformed image may be returned automatically and when review remains necessary – not a claim that adaptive routing outperforms simpler policies on the present evidence.
Read the full abstract

2609.03475 · 3 Sep · 27 pages, 10 figures, 6 main-text tables, and 17 supplementary tables. Shares the Carinthia-S image identities with arXiv:2607.17401 by the same authors; the overlap and the distinct estimand are stated in Section 2.4 and Table 1

Game Theory

Otter: A Provably MEV-Resilient Automated Market Maker via Surplus Redistribution

Miner extractable value (MEV) in automated market makers allows block builders to profit from transaction ordering and injected trades, imposing costs on users and contributing to builder centralization. We introduce Otter (Optimal Truthful Trading with Excess Redistribution), a two-asset batch AMM that achieves provable MEV resilience when the consensus layer provides censorship resilience and block space is uncongested. Otter makes truthful behavior a dominant strategy for both users and builders. Consequently, a builder cannot profit from strategic deviations, including reordering bids or injecting sybil bids, even when the builder is itself a trader with intrinsic value. Moreover, we show that Otter maximizes social welfare, in a strong sense, within a natural class of mechanisms satisfying the desired game-theoretic properties. To achieve these guarantees, we introduce a new paradigm called surplus redistribution, which provably prevents residual surplus from being captured as MEV by redirecting it to the broader community. Specifically, the pool's output tokens need not be distributed entirely among users in the current batch. Instead, residual surplus may be transferred to a smart contract governed by the decentralized community. The accumulated surplus can be used to benefit community members — for example, by subsidizing transaction fees, rewarding liquidity providers, or returning assets to the pool. Our approach relies on the underlying consensus layer to provide censorship resilience. We motivate its necessity through an impossibility result showing that the desired game-theoretic guarantees become unattainable when the builder is additionally allowed to censor transactions. Thus, our results also provide a mathematically formal demonstration of how consensus-level security guarantees can fundamentally expand what is achievable at the application layer.
Read the full abstract

All authors Elaine Shi, Mengqian Zhang, Hao Chung, Yuhao Li

Soft Condensed Matter

Granular Rods Fall Faster in Denser Obstacle Fields

How does particle shape affect driven transport through obstacle fields? We simulate a dissipative rod falling under gravity through randomly placed fixed obstacles. For sufficiently slender rods, the mean descent speed before trapping decreases, increases, and then decreases again as obstacle density rises, opening a window of densities in which rods fall faster in denser fields. Scaling arguments based on collision rates and rod geometry explain the three regimes and their crossovers. Particle shape can thus reverse the expectation that crowding slows driven transport.
Read the full abstract

Category Theory

Override and Update in Restriction Categories

We study the override and update operators on partial functions from the perspective of restriction categories. We propose a definition of override restriction categories, in which both of the operators in question exist. We prove a number of results concerning these operators and their relationship to the structure of the ambient restriction category, as well as relating them to the existing literature on the override and update operators. We provide various examples of override restriction categories and in particular show that every classical restriction category is an override restriction category.
Read the full abstract

Audio and Speech Processing

Summary of the ChinaVoices Challenge 2026: Data, Tasks, Baseline, and Methods

This paper summarizes the ChinaVoices Challenge 2026, which aims to establish unified task definitions and evaluation conditions for Chinese dialect speech processing and to advance multi-dialect identification and automatic speech recognition. The challenge covers 16 dialect categories and defines two tasks: Chinese Multi-Dialect Identification and Chinese Multi-Dialect Automatic Speech Recognition (ASR). It uses approximately 320 hours of speech across the Reference Set, Open Evaluation Set, and Hidden Evaluation Set. The two tasks use the same evaluation audio, and each includes restricted-data and open-data tracks. We describe the task settings, data, evaluation metrics, and Qwen3-ASR-1.7B baseline, and analyze the leaderboard results and submitted systems. In total, 28 teams submit results, 17 provide system reports, and systems from 15 teams pass the compliance review and are included in the analysis. Most eligible systems outperform the baseline, and the official top-three order remains unchanged on the Hidden Evaluation Set for both tasks. Dialect-level results show that categories with higher identification accuracy generally have lower ASR error rates, although the tasks assess related but distinct capabilities. Leading identification systems commonly exploit dialect-discriminative acoustic representations, whereas leading ASR systems emphasize data normalization, augmentation, and auxiliary CTC objectives. These results provide practical guidance for developing and evaluating Chinese multi-dialect speech processing systems.
Read the full abstract

All authors Yujie Liao, Bingshen Mu, Shuiyuan Wang, Liumeng Xue, Hexin Liu, Xian Shi, Jie Hu, Lei Xie

Information Retrieval

ExplainRoute: A Pre-Deployment Audit Framework for Non-Answer-Giving Programming Tutors

Programming tutors should support learners' own explanations rather than immediately providing model answers. We present ExplainRoute, a pre-deployment audit framework for non-answer-giving programming tutors. Given a code line and a learner explanation, it estimates the explanation state and selects one of two bounded responses: a Feynman-style self-explanation prompt or a Socratic scaffold. The framework exposes its state, strategy, cited code fragment, and leakage risk through a machine-checkable contract. Unlike benchmarks that rank tutors by fluency alone, ExplainRoute audits information boundaries, response polarity, failure closure, and the value of learner-explanation visibility before classroom deployment. We evaluate it offline on the 1,770-pair SelfCode corpus using a code-group split, with 443 pairs reserved in 11 untouched holdout groups. The evaluation compares direct answers, fixed open self-explanation, fixed Socratic scaffolding, adaptive routing, and an adaptive no-state ablation. Contract validity reaches 100% for all pedagogical conditions. Adaptive routing matches the frozen reference rule on 60.5% of records, with state macro-F1 of 0.238 (Open: 0.229; Socratic: 0.246), showing no reliable adaptive advantage. An independent language-model judge scores adaptive responses 4.516/5, outperforming the no-state ablation (2.819/5) but slightly below fixed open self-explanation (4.598/5) and Socratic scaffolding (4.658/5). A blinded rubric evaluation on a stratified 40-row subset confirms that visible learner explanations improve information value while adaptive routing does not outperform fixed strategies. The contribution is a validated audit protocol and a boundary finding, rather than evidence of improved learning, retention, or causal instructional effectiveness.
Read the full abstract

Computational Complexity

Promise Systems of Equations over Magmas with Identity and over Algebras in Congruence Modular Varieties

We study the computational complexity of solving promise systems of equations over finite algebras. Given two algebras $\mathbf{A}$ and $\mathbf{B}$ with a homomorphism from $\mathbf{A}$ to $\mathbf{B}$, the promise system of equations problem is to determine if an input system of equations has a solution in $\mathbf{A}$ or not even in $\mathbf{B}$. We generalize the results of Larrauri, Mottet, and Živný [ACM ToCL'26] to obtain a $\mathbf{P}-\mathbf{NP}$-hard dichotomy result for promise systems of equations over a class of algebras which contains all monoids, and a dichotomy result for promise systems of equations over algebras in a congruence modular variety. We then consider the metaproblem for promise systems of equations over algebras in a congruence modular variety: given finite algebras $\mathbf{A}$ and $\mathbf{B}$ such that $\mathbf{A}$ is in a congruence modular variety, we show there is a quasi-polynomial time algorithm for determining whether or not the associated promise system of equations problem is in $\mathbf{P}$.
Read the full abstract

Functional Analysis

Almost-invariant half-spaces of operators on $\omega$

We study the Almost-Invariant Subspace Problem for operators defined on non-normable Fréchet spaces and especially on $\omega$. This problem is stated as follows: "Given a bounded operator $T$ on an infinite-dimensional complex Fréchet space $X$, can we always find a closed almost-invariant half-space?". In this paper we solve the problem for the space $\omega$ by showing that an operator $T$ on $\omega$ possesses a closed almost-invariant half-space if and only if $T$ is conjugate to $F + R + \lambda \operatorname{Id}$ or to $B + R + \lambda \operatorname{Id}$ where $F$ is the Forward shift and $B$ is the Backward shift and where $R$ is a finite rank operator and $\lambda \in \mathbb{C}$. We also investigate the case of operators defined on $X \oplus \omega$ where $X$ is an infinite-dimensional Fréchet space with a continuous norm and we show that in this case, every operator defined on $X \oplus \omega$ possesses a closed almost-invariant half-space.
Read the full abstract

Computation and Language

When Users Don't Ask: Benchmarking Context-Driven Memory Retrieval in Conversational Agents

Large language models (LLMs) are increas- ingly deployed as long-horizon conversational agents, motivating growing interest in mem- ory systems. However, existing benchmarks primarily evaluate memory through QA-style probing rather than in-situ conversational usage. We introduce LOCOMO-CONV, a conversa- tional memory benchmark derived from Lo- CoMo with four query styles: dialog, implicit, counterfactual, and composed. Across five rep- resentative memory systems, we evaluate both retrieval recall and end-to-end response qual- ity. Our experiments show that conversational framing exposes substantial retrieval gaps over- looked by QA benchmarks, especially on im- plicit and composed queries, which multi-facet query rewriting narrows for raw-turn mem- ory but not abstractive memory. We further find that strong retrieval does not fully trans- late into response quality, and that implicit queries exhibit silent grounding, where mem- ory improves contextual grounding without ex- plicitly surfacing the gold fact. These results point to reasoning-based memory elaboration as a promising direction, and we release aux- iliary supportive_memory annotations captur- ing conversationally useful context beyond the original gold evidence.
Read the full abstract

Probability

Least-Favorable Location for Binomial Top-$t$ Selection

Consider $k$ independent Bernoulli populations, each sampled $n$ times, and select the $t$ populations with the largest success counts, breaking ties uniformly. Classical monotonicity reduces the worst case over the preference zone with separation $\delta$ to the slippage family with levels $p$ and $p+\delta$, leaving only its absolute location $p\in[0,1-\delta]$ undetermined. A Gaussian approximation suggests the symmetric center $p_{\mathrm c}=(1-\delta)/2$, and the exact two-population problem is uniquely centered there for every $n\ge2$. For fixed $k,t$ and $\delta\in(0,1)$, we prove that exact eventual centering holds precisely when $k=2t$. When $k\ne2t$, the least-favorable location $p_{n,k,t}^*$ satisfies \[ p_{n,k,t}^*-p_{\mathrm c} =(k-2t)C_\delta n^{-1/2}e^{-n\Gamma_\delta}\{1+o(1)\}, \] where $C_\delta$ and $\Gamma_\delta$ are explicit and positive. In either case, the least-favorable location is eventually unique. The proof writes incorrect selection as a union of pairwise misrankings and applies inclusion–exclusion, yielding a bipartite graph expansion. A single misranking has its exact maximum at the symmetric center and determines the central curvature; two-edge intersections sharing one population determine the central slope through their multiplicity imbalance; all remaining graphs have higher large-deviation rates.
Read the full abstract

Strongly Correlated Electrons

Studying line defect at Deconfined Quantum Criticality via fuzzy sphere regularization

The interplay between bulk critical fluctuations and nontrivial topology can enrich defect physics and give rise to novel defect universality classes. Understanding the fate of such defects therefore constitutes an important open problem. In this work, we studied a particularly simple setting: a (0+1)-dimensional pinning-field defect coupled to a (2+1)-dimensional deconfined quantum critical bulk. Using the fuzzy-sphere regularization, we numerically investigated the defect operator spectrum and extracted several universal quantities characterizing the defect conformal fixed point, including the scaling dimensions of defect-changing(creating) operators and the defect \(g\)-function. These results establish the first numerical characterization of line-defect conformal data at deconfined quantum criticality and may stimulate further investigations of defect critical phenomena in topological quantum critical matter.
Read the full abstract

All authors Shutao Liu, Shuai Yang, Jie Lou, Yan Chen

Machine Learning

Mind the Gap: Robustness Risks in PII Detection Systems

Personally Identifiable Information (PII) detection is a foundational component of data protection infrastructure where missed entities constitute direct privacy and security risks. Although modern PII systems report strong performance on standard benchmarks, we show that these evaluations mask substantial robustness failures under realistic distribution shifts encountered in deployment. Rather than comparing state-of-the-art accuracy, we study how different PII detection paradigms fail under noisy, unstructured, and informal inputs. We construct a stress test benchmark spanning seven categories of natural distribution shift and evaluate representative systems from three widely deployed architectural families: encoder-based NER (SpaCy), rule-based hybrid detection (Presidio), and generative LLM extraction (Qwen2.5-3B). All three exhibit significant degradation on out-of-distribution inputs, but with distinct and complementary failure modes. Encoder models primarily fail on unseen surface forms and boundary detection, rule-based systems fail on non-standard formats, and LLMs exhibit entity-type confusion and generation instability. These results show that aggregate benchmark scores obscure deployment-critical weaknesses and that no single architecture is uniformly reliable across PII categories. Motivated by these findings, we propose a hybrid detection pipeline with a QA-driven feedback loop for iterative risk mitigation, and release our benchmark to support OOD-aware evaluation of PII systems.
Read the full abstract

Computer Vision

BMCTrack-d: Pig re-identification and tracking via back marks in challenging camera settings

Automated pig monitoring is essential for assessing their health, behaviour, and welfare. To date, most pig monitoring solutions operate on the group-level, because individual-level monitoring requires reliable long-term identification and tracking of each animal. For domesticated pigs this remains challenging because pigs of the same breed often have highly uniform appearances. Moreover, research on pig monitoring is almost exclusively reported in top-down view camera settings, which considerably ease tracking, but are not always an option in practice. In this work, BMCTrack-d is presented, a novel tracking-by-detection approach that leverages unique back marks to enable robust pig re-identification and tracking in a challenging side-view camera setting, afflicted by rapidly moving pigs, severe occlusions and low resolution. The method first predicts the detected pigs' identities using a neural network-based back mark classifier. To improve re-identification reliability over time, two dedicated post-processing stages are introduced: a temporal prediction consistency check, which validates the identity assignments against the recent prediction history, and deduplication, which resolves conflicting identity assignments in each time step. By explicitly prioritising accurate, appearance-based re-identification over continuous tracking, the proposed approach addresses a key limitation of existing trackers for individual-level monitoring scenarios. On a demanding test set BMCTrack-d outperforms two strong baselines, BoT-SORT-ReID and TrackTrack-ReID, by 9.11% and 1.03%, respectively, in higher-order tracking accuracy. These results demonstrate the effectiveness of back mark-based re-identification and tracking for robust individual-level pig monitoring in challenging settings.
Read the full abstract

All authors David Brunner, Maciej Oczak, Marie Bordes, Jean-Loup Rault, Stephan M. Winkler, Viktoria Dorfer

High Energy Physics (Experiment)

Study of $K_{S}^{0}$-$K_{L}^{0}$ asymmetry in the decays $D^0 \to K_{S}^{0}\omega $ and $D^0 \to K_{L}^{0} \omega $

Based on $e^+ e^-$ annihilation data corresponding to an integrated luminosity of 7.93~$fb^{-1}$ collected at a center-of-mass energy of 3.773 GeV with the BESIII detector at the BEPCII collider, the absolute branching fractions of the decays $D^0 \to K_{S}^{0} \omega$ and $D^0 \to K_{L}^{0} \omega $ are measured to be $(11.79 \pm 0.19 \pm 0.26 \pm 0.47) \times 10^{-3}$ and ($10.84 \pm 0.14 \pm 0.23 \pm 0.44) \times 10^{-3}$, respectively. The $K_{S}^{0}- K_{L}^{0}$ branching-fraction asymmetry of these two decays is $R(D^0,K_{S,L}^{0} \omega) = \frac{\mathcal{B}(D^0 \to K_{S}^{0} \omega) - \mathcal{B}(D^0 \to K_{L}^{0}\omega )}{\mathcal{B}(D^0 \to K_{S}^{0} \omega) + \mathcal{B}(D^0 \to K_{L}^{0} \omega)} =(4.2 \pm 1.0 \pm 0.9 \pm 2.8)\%$. Here, the first uncertainties are statistical, the second systematic, and the third arise from the interference between $D^0 \to K_{S,L}^{0} \omega$ and the non-resonant $D^0 \to \pi^+ \pi^- \pi^0 K_{S,L}^{0}$ processes.
Read the full abstract

All authors BESIII Collaboration: M. Ablikim, M. N. Achasov, P. Adlarson, X. C. Ai, C. S. Akondi, R. Aliberti, A. Amoroso, Q. An, Y. H. An, Y. Bai, O. Bakina, H. R. Bao, X. L. Bao, M. Barbagiovanni, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M. B. Bertani, D. Bettoni, F. Bianchi, E. Bianco, A. Bortone, I. Boyko, R. A. Briere, A. Brueggemann, D. Cabiati, H. Cai, M. H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S. A. Cetin, X. Y. Chai, J. F. Chang, T. T. Chang, G. R. Che, Y. Z. Che, C. H. Chen, Chao Chen, G. Chen, H. S. Chen, H. Y. Chen, M. L. Chen, S. J. Chen, S. M. Chen, T. Chen, W. Chen, X. R. Chen, X. T. Chen, X. Y. Chen, Y. B. Chen, Y. Q. Chen, Z. K. Chen, J. Cheng, L. N. Cheng, S. K. Choi, X. Chu, G. Cibinetto, F. Cossio, J. Cottee-Meldrum, H. L. Dai, J. P. Dai, X. C. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, C. Q. Deng, Z. Y. Deng, A. Denig, I. Denisenko, M. Destefanis, F. De Mori, E. Di Fiore, X. X. Ding, Y. Ding, Y. X. Ding, Yi. Ding, J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, M. C. Du, S. X. Du, Shaoxu Du, X. L. Du, Y. Q. Du, Y. Y. Duan, Z. H. Duan, P. Egorov, G. F. Fan, J. J. Fan, Y. H. Fan, J. Fang, Jin Fang, S. S. Fang, W. X. Fang, Y. Q. Fang, L. Fava, F. Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, L. Feng, Q. X. Feng, Y. T. Feng, M. Fritsch, C. D. Fu, J. L. Fu, Y. W. Fu, H. Gao, Xu Gao, Y. Gao, Y. N. Gao, Y. Y. Gao, Yunong Gao, Z. Gao, S. Garbolino, I. Garzia, L. Ge, P. T. Ge, Z. W. Ge, C. Geng, E. M. Gersabeck, A. Gilman, K. Goetzen, J. Gollub, J. B. Gong, J. D. Gong, L. Gong, W. X. Gong, W. Gradl, S. Gramigna, M. Greco, M. D. Gu, M. H. Gu, C. Y. Guan, A. Q. Guo, H. Guo, J. N. Guo, L. B. Guo, M. J. Guo, R. P. Guo, X. Guo, Y. P. Guo, Z. Guo, A. Guskov, J. Gutierrez, J. Y. Han, T. T. Han, X. Han, F. Hanisch, K. D. Hao, X. Q. Hao, F. A. Harris, C. Z. He, K. K. He, K. L. He, F. H. Heinsius, C. H. Heinz, Y. K. Heng, C. Herold, P. C. Hong, G. Y. Hou, X. T. Hou, Y. R. Hou, Z. L. Hou, H. M. Hu, J. F. Hu, Q. P. Hu, S. L. Hu, T. Hu, Y. Hu, Y. X. Hu, Z. M. Hu, G. S. Huang, K. X. Huang, L. Q. Huang, P. Huang, X. T. Huang, Y. P. Huang, Y. S. Huang, T. Hussain, N. Hüsken, N. in der Wiesche, J. Jackson, Q. Ji, Q. P. Ji, W. Ji, X. B. Ji, X. L. Ji, Y. Y. Ji, L. K. Jia, X. Q. Jia, D. Jiang, H. B. Jiang, S. J. Jiang, X. S. Jiang, Y. Jiang, J. B. Jiao, J. K. Jiao, Z. Jiao, L. C. L. Jin, S. Jin, Y. Jin, M. Q. Jing, X. M. Jing, T. Johansson, S. Kabana, X. L. Kang, X. S. Kang, B. C. Ke, V. Khachatryan, A. Khoukaz, O. B. Kolcu, B. Kopf, L. Kröger, L. Krümmel, Y. Y. Kuang, M. Kuessner, X. Kui, N. Kumar, A. Kupsc, W. Kühn, Q. Lan, W. N. Lan, T. T. Lei, M. Lellmann, T. Lenz, C. Li, C. H. Li, C. K. Li, Chunkai Li, Cong Li, D. M. Li, F. Li, G. Li, H. B. Li, H. J. Li, H. L. Li, H. N. Li, H. P. Li, Hui Li, J. N. Li, J. S. Li, J. W. Li, K. Li, K. L. Li, L. J. Li, Lei Li, M. H. Li, M. R. Li, M. T. Li, P. L. Li, P. R. Li, Q. M. Li, Q. X. Li, R. Li, S. Li, S. X. Li, S. Y. Li, Shanshan Li, T. Li, T. Y. Li, W. D. Li, W. G. Li, X. Li, X. H. Li, X. K. Li, X. L. Li, X. Y. Li, X. Z. Li, Y. Li, Y. G. Li, Y. P. Li, Z. H. Li, Z. J. Li, Z. L. Li, Z. X. Li, Z. Y. Li, C. Liang, H. Liang, Y. F. Liang, Y. T. Liang, G. R. Liao, L. B. Liao, M. H. Liao, Y. P. Liao, J. Libby, A. Limphirat, C. C. Lin, C. X. Lin, D. X. Lin, T. Lin, B. J. Liu, B. X. Liu, C. Liu, C. X. Liu, F. Liu, F. H. Liu, Feng Liu, G. M. Liu, H. Liu, H. B. Liu, H. M. Liu, Huihui Liu, J. B. Liu, J. J. Liu, K. Liu, K. Y. Liu, Ke Liu, Kun Liu, L. Liu, L. C. Liu, Lu Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. M. Liu, W. T. Liu, X. Liu, X. K. Liu, X. L. Liu, X. P. Liu, X. Y. Liu, Y. Liu, Y. B. Liu, Yi Liu, Z. A. Liu, Z. D. Liu, Z. L. Liu, Z. Q. Liu, Z. X. Liu, Z. Y. Liu, X. C. Lou, H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. H. Lu, Y. P. Lu, Z. H. Lu, C. L. Luo, J. R. Luo, J. S. Luo, M. X. Luo, T. Luo, X. L. Luo, Z. Y. Lv, X. R. Lyu, Y. F. Lyu, Y. H. Lyu, F. C. Ma, H. L. Ma, Heng Ma, J. L. Ma, L. L. Ma, L. R. Ma, Q. M. Ma, R. Q. Ma, R. Y. Ma, T. Ma, X. T. Ma, X. Y. Ma, Y. M. Ma, F. E. Maas, I. MacKay, M. Maggiora, S. Maity, S. Malde, Q. A. Malik, H. X. Mao, Y. J. Mao, Z. P. Mao, S. Marcello, A. Marshall, F. M. Melendi, Y. H. Meng, Z. X. Meng, G. Mezzadri, H. Miao, T. J. Min, R. E. Mitchell, X. H. Mo, B. Moses, N. Yu. Muchnoi, J. Muskalla, Y. Nefedov, F. Nerling, H. Neuwirth, Z. Ning, S. Nisar, Q. L. Niu, W. D. Niu, Y. Niu, C. Normand, S. L. Olsen, Q. Ouyang, S. Pacetti, X. Pan, Y. Pan, A. Pathak, Y. P. Pei, M. Pelizaeus, G. L. Peng, H. P. Peng, X. J. Peng, Y. Y. Peng, K. Peters, K. Petridis, J. L. Ping, R. G. Ping, S. Plura, V. Prasad, L. Pöpping, F. Z. Qi, H. R. Qi, M. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. H. Qiao, J. J. Qin, J. L. Qin, L. Q. Qin, L. Y. Qin, P. B. Qin, X. P. Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, Z. H. Qu, J. Rademacker, K. Ravindran, C. F. Redmer, A. Rivetti, M. Rolo, G. Rong, S. S. Rong, F. Rosini, Ch. Rosner, M. Q. Ruan, N. Salone, A. Sarantsev, Y. Schelhaas, M. Schernau, K. Schoenning, M. Scodeggio, W. Shan, X. Y. Shan, Z. J. Shang, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F. Shen, W. H. Shen, X. Y. Shen, B. A. Shi, Ch. Y. Shi, H. Shi, J. L. Shi, J. Y. Shi, M. H. Shi, S. Y. Shi, X. Shi, H. L. Song, J. J. Song, M. H. Song, T. Z. Song, W. M. Song, Y. X. Song, Zirong Song, S. Sosio, S. Spataro, S. Stansilaus, F. Stieler, M. Stolte, S. S Su, G. B. Sun, G. X. Sun, H. Sun, H. K. Sun, J. F. Sun, K. Sun, L. Sun, R. Sun, S. S. Sun, T. Sun, W. Y. Sun, Y. C. Sun, Y. H. Sun, Y. J. Sun, Y. Z. Sun, Z. Q. Sun, Z. T. Sun, H. Tabaharizato, C. J. Tang, G. Y. Tang, J. Tang, J. J. Tang, L. F. Tang, Y. A. Tang, Z. H. Tang, L. Y. Tao, M. Tat, J. X. Teng, J. Y. Tian, W. H. Tian, Y. Tian, Z. F. Tian, I. Uman, E. van der Smagt, B. Wang, Bin Wang, Bo Wang, C. Wang, Chao Wang, Cong Wang, D. Y. Wang, H. J. Wang, H. R. Wang, J. Wang, J. J. Wang, J. P. Wang, K. Wang, L. L. Wang, L. W. Wang, M. Wang, Mi Wang, N. Y. Wang, S. Wang, Shun Wang, T. Wang, W. Wang, W. P. Wang, X. F. Wang, X. L. Wang, X. N. Wang, Xin Wang, Y. Wang, Y. D. Wang, Y. F. Wang, Y. H. Wang, Y. J. Wang, Y. L. Wang, Y. N. Wang, Yanning Wang, Yaqian Wang, Yi Wang, Yuan Wang, Z. Wang, Z. L. Wang, Z. Q. Wang, Z. Y. Wang, Zhi Wang, Ziyi Wang, D. Wei, D. H. Wei, D. J. Wei, H. R. Wei, F. Weidner, H. R. Wen, S. P. Wen, U. Wiedner, G. Wilkinson, M. Wolke, J. F. Wu, L. H. Wu, L. J. Wu, Lianjie Wu, S. G. Wu, S. M. Wu, X. W. Wu, Z. Wu, H. L. Xia, L. Xia, B. H. Xiang, D. Xiao, G. Y. Xiao, H. Xiao, Y. L. Xiao, Z. J. Xiao, C. Xie, K. J. Xie, Y. Xie, Y. G. Xie, Y. H. Xie, Z. P. Xie, T. Y. Xing, D. B. Xiong, C. J. Xu, G. F. Xu, H. Y. Xu, Q. J. Xu, Q. N. Xu, T. D. Xu, X. P. Xu, Y. Xu, Y. C. Xu, Z. S. Xu, F. Yan, L. Yan, W. B. Yan, W. C. Yan, W. H. Yan, W. P. Yan, X. Q. Yan, Y. Y. Yan, H. J. Yang, H. L. Yang, H. X. Yang, J. H. Yang, R. J. Yang, X. Y. Yang, Y. Yang, Y. H. Yang, Y. M. Yang, Y. Q. Yang, Y. Z. Yang, Youhua Yang, Z. Y. Yang, W. J. Yao, Z. P. Yao, M. Ye, M. H. Ye, Z. J. Ye, Junhao Yin, Z. Y. You, B. X. Yu, C. X. Yu, G. Yu, J. S. Yu, L. W. Yu, T. Yu, X. D. Yu, Y. C. Yu, Yongchao Yu, C. Z. Yuan, H. Yuan, J. Yuan, Jie Yuan, L. Yuan, M. K. Yuan, S. H. Yuan, Y. Yuan, C. X. Yue, Ying Yue, A. A. Zafar, F. R. Zeng, S. H. Zeng, X. Zeng, Y. J. Zeng, Yujie Zeng, Y. C. Zhai, Y. H. Zhan, B. L. Zhang, B. X. Zhang, D. H. Zhang, G. Y. Zhang, Gengyuan Zhang, H. Zhang, H. C. Zhang, H. H. Zhang, H. Q. Zhang, H. R. Zhang, H. Y. Zhang, Han Zhang, J. Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. S. Zhang, J. W. Zhang, J. X. Zhang, J. Y. Zhang, J. Z. Zhang, Jianyu Zhang, Jin Zhang, Jiyuan Zhang, L. M. Zhang, Lei Zhang, N. Zhang, P. Zhang, Q. Zhang, Q. Y. Zhang, Q. Z. Zhang, R. Y. Zhang, S. H. Zhang, S. N. Zhang, Shulei Zhang, X. M. Zhang, X. Y. Zhang, Y. Zhang, Y. T. Zhang, Y. H. Zhang, Y. P. Zhang, Yu Zhang, Z. Zhang, Z. D. Zhang, Z. H. Zhang, Z. L. Zhang, Z. X. Zhang, Z. Y. Zhang, Zh. Zh. Zhang, Zhilong Zhang, Ziyang Zhang, Ziyu Zhang, G. Zhao, J.-P. Zhao, J. Y. Zhao, J. Z. Zhao, L. Zhao, Lei Zhao, M. G. Zhao, R. P. Zhao, S. J. Zhao, Y. B. Zhao, Y. L. Zhao, Y. P. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B. Zheng, B. M. Zheng, J. P. Zheng, W. J. Zheng, W. Q. Zheng, X. R. Zheng, Y. H. Zheng, B. Zhong, C. Zhong, H. Zhou, J. Q. Zhou, S. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. X. Zhou, Y. Z. Zhou, A. N. Zhu, J. Zhu, K. Zhu, K. J. Zhu, K. S. Zhu, L. X. Zhu, Lin Zhu, S. H. Zhu, T. J. Zhu, W. D. Zhu, W. J. Zhu, W. Z. Zhu, Y. C. Zhu, Z. A. Zhu, X. Y. Zhuang, M. Zhuge, J. H. Zou, J. Zu

Numerical Analysis

Adaptively-refinable polar-spline discrete differential forms: hierarchical construction, exactness, and applications

A common approach to representing disk-like and sphere-like geometries in isogeometric analysis is to use collapsed-edge singularities in the underlying parameterization. The resulting tensor-product B-spline spaces on such singular parameterizations lack the required smoothness to be used in isogeometric analysis. Polar splines (Toshniwal et al., CMAME 2017) rectify this issue by extracting a smoother subspace, and have been successfully used to discretize high-order partial differential equations, as well as to perform structure-preserving discretizations of the de Rham complex.The latter is particularly relevant for mixed formulations that appear in applications such as electromagnetism and fluid dynamics. The main contributions of this paper are twofold. We combine the polar spline construction with hierarchical splines to obtain adaptively-refinable polar splines. Moreover, we do so in the context of structure-preserving methods. That is, we show how to construct hierarchical polar spline $k$-form spaces, prove that the corresponding basis functions are linearly independent, and prove that they form a cohomologically-correct discrete de Rham complex. These contributions provide a mathematically sound foundation for adaptive structure-preserving simulations on polar geometries. We also provide numerical experiments that validate the theory and illustrate the practical behavior of the construction with problems where preserving the structure is mandatory. These include a study of spurious harmonics that highlights how cohomology-breaking refinements differ between the polar and tensor-product settings, a discretization of a Maxwell eigenvalue problem on a locally-refined polar mesh, and an adaptive convergence study for a Hodge–Laplace problem.
Read the full abstract

Artificial Intelligence

Beyond "Made with AI": Visualizing Provenance Density to Mitigate the Transparency Penalty

As generative AI makes polished prose cheap to produce, users can no longer rely on fluency as a proxy for truth. We call this failure mode the Fluency Trap: users trust fluent hallucinations while also discounting accurate content once it is disclosed as AI-generated. Binary “Made with AI” labels respond with authorship disclosure, but they do not show what supports a claim. We propose Provenance Density, an evidence-visualization interface that shows the density of verified claims in a text. In a user study with 81 participants, an idealized Provenance Density interface produced a large discernment gap between truth and fabrication ($+4.15$ points, $d=1.82$), whereas participants given no signal showed no detectable discrimination. A technical audit with 200 samples shows that retrieval density alone is insufficient; unexpectedly, the Consistency Veto carries most of the discriminative signal on dynamic queries. As AI-generated content becomes indistinguishable from human writing, effective transparency must move from authorship disclosure toward evidence visualization.
Read the full abstract

All authors Qing Zhang, Yifei Huang, Juyoung Lee, Thad Starner, Jun Rekimoto

Distributed Computing

FlowTT: Exploiting Computation Flow Reuse in Irregular Tensor-Train Embedding

Tensor-Train (TT) decomposition effectively compresses large embedding tables in recommendation models, but TT-based embedding lookup remains inefficient because partially shared computation flows across input indices are not fully reused and intermediate results are repeatedly materialized off-chip between sequential TT-core contractions. We present FlowTT, a flow-aware GPU execution framework that reformulates TT gather as a set of prefix-shared irregular computation flows. FlowTT combines flow-aligned prefix-based index grouping, a fused TT-embedding execution path with on-chip intermediate retention, and persistent-thread scheduling with chunk-based work stealing and L2 checkpointing to preserve reuse under skewed workloads. By co-designing task formation, data buffering, and scheduling with the structure of TT gather, FlowTT reduces redundant TT-core operations, global-memory traffic, and load imbalance. On Meta's synthetic recommendation benchmarks (Meta-240, Meta-480, and Meta-788), FlowTT consistently achieves the lowest latency compared to existing methods. At batch size 32,768, it reduces latency by up to 42.2% in inference and 49.2% in training relative to EcoRec, while also achieving the lowest inference peak memory usage. These results show that exposing prefix-shared computation is key to efficient TT-based embedding execution.
Read the full abstract

Astrophysics of Galaxies

Magnetic Fields in Massive Star-forming Regions (MagMaR). IX. Radiative Torque Alignment and Disruption in NGC6334I

Intense radiation from high-mass stars is expected to significantly affect dust grain alignment and evolution through RAdiative Torques (RATs). We investigate this effect in a massive star-forming region, NGC6334I, using 1.2 mm dust continuum polarization observations from the Atacama Large Millimeter/submillimeter Array. The polarization fraction spans from $\lesssim1\%$ to $\sim10\%$ and decreases with increasing column density, remaining below $2\%$ in dense cores despite high temperatures ($\sim100$ K), where efficient grain alignment by RATs is expected. We investigate how grain alignment, grain growth, grain disruption, B-field tangling, and local physical conditions affect the polarization properties of MM1, MM2, MM3, and their surroundings. Polarization angle dispersion shows that B-field tangling contributes to depolarization at moderate densities but cannot fully explain the lowest polarization fractions. Using RAT-based grain alignment and polarization modeling, we find that reduced alignment efficiency and high optical depth reproduce the low polarization in the densest regions. MM2 shows evidence of grain growth, with maximum grain sizes $a_{\max}\sim0.35-1.0~\mu$m, while MM1 exhibits smaller values of $\sim0.35-0.50~\mu$m. Accounting for optical depth increases the inferred grain sizes in MM1 to $\sim1.0-2.0~\mu$m. Analytical estimates of radiative torque disruption from the intense outburst suggest that micron-sized grains in high-temperature, moderate-density regions can fragment into submicron grains. Alternatively, high optical depth may also explain the low polarization in the densest regions even in the presence of micron-sized grains. Incorporating the B-field inclination effect indicates a transition from predominantly plane-of-sky fields at low densities to more line-of-sight-aligned configurations at high densities.
Read the full abstract

All authors Vineet Rawat, Thiem Hoang, Patricio Sanhueza, Ian W. Stephens, Manuel Fernández López, Paulo Cortés, Jihye Hwang, Junhao Liu, Kaho Morii, Josep Miquel Girart, Ji-Hyun Kang, Yu Cheng, Shanghuo Li, Luis A. Zapata, Eun Jung Chung, Fernando A. Olguin, Huei-Ru Vivien Chen, Piyali Saha, Chakali Eswaraiah, Qizhou Zhang, O.R. Jadhav

Machine Learning

A Two-Stage Forecasting System for CPU Workload Prediction in Private Clouds

Accurate cloud resource forecasting is essential for proactive resource provisioning, maintaining Quality of Service (QoS), and reducing operational costs in dynamic cloud environments. The existing forecasting approaches predominantly estimate future CPU workload directly from historical resource traces, which often overlook the relationship between customer service demand and subsequent resource consumption. This study proposes a two-stage integrated forecasting model that explicitly models this dependency by first forecasting customer service requests, expressed as Transactions Per Second (TPS), and subsequently estimating future CPU workload from the TPS forecast. Both the forecasting component and resource prediction component employed the XGBoost model within a cascaded learning architecture, complemented by adaptive online retraining using an expanding-window strategy to address concept drift in continuously evolving cloud workloads. The proposed work was evaluated using real-world traces collected from a private cloud environment comprising ten applications. Experimental results demonstrate robust forecasting performance by achieving Symmetric Mean Absolute Percentage Error (SMAPE) below $7\%$ for most applications, with the best-performing application achieving an MAE of $0.7372$, RMSE of $1.1866$, SMAPE of $3.57\%$, and an R2 of $0.9185$. Horizon-wise drift analysis confirmed stable recursive forecasting behavior with controlled error accumulation across a 60-step prediction horizon. Compared with the conventional direct CPU forecasting method, the proposed two-stage integrated model gives improved forecasting robustness, computational efficiency, and interpretability, making it well-suited for proactive resource management and intelligent auto-scaling in cloud computing environments.
Read the full abstract

All authors Ashir Javeed, Anton Borg, Håkan Grahn, Lars Lundberg, Dhyey Patel, Sogand Shirinbab

Software Engineering

The Psychological Costs of Artificial Intelligence Adoption in Software Engineering

Artificial intelligence (AI) is increasingly used to augment software engineering (SE) workflows. While code generation remains the main use case, organizations are actively seeking AI integration in other practices such as test cases generation and code reviews. Organizational AI adoption strategies seem to focus on tangible outcomes such as productivity. However, AI is a disruptive force, introduced into settings where role identity, team norms, and the sources of job satisfaction were well established before the recent advances in generative AI. Historically, technological disruptions have caused psychological and social strains in workplaces, ranging from anxiety and eroded meaning to deskilling and disrupted professional identities. The assumption that AI for SE is cost-free may not be accurate. Therefore, in this study we sought to understand the psychological costs software professionals experience during organizational AI adoption. We carried out a case study in a large software development services company, one year after the company launched its AI adoption. We collected qualitative data through meetings and semi-structured interviews (N = 21). We found that software professionals experience accountability anxiety, craft identity disruption, meaning and satisfaction erosion, cognitive and workload intensification, and uncertainty distress. Practitioners manage these costs through practices that restore control, mitigate them through protective and identity-preserving adaptations, or absorb them, carrying what neither can resolve. We contribute to AI-human collaboration in SE by repositioning AI adoption as a human transition, not only a technological and organizational one.
Read the full abstract

Number Theory

The Klein-Vélu septic, 2-Division, and modular function fields of level 14

We study the 2-division of the Klein-Vélu elliptic normal septic. Its three non-zero 2-torsion points give rise to an explicit cubic equation over the function field of $X(7)$. We identify the three roots of this cubic with modular functions expressed in terms of septic theta functions at $\tau/2,\tau$, and $2\tau$, and show that its splitting field is precisely the function field of $X(14)$. This gives an explicit link between the 2-division geometry of the Klein-Vélu septic and the passage from full level 7 to full level $14$. Several intermediate modular function fields in the resulting $S_3$-extension are also described.
Read the full abstract

Computation and Language

When Retrieval Helps: Selective Retrieval for Single-Turn Mental-Health QA

Retrieval-augmented generation (RAG) can improve the specificity and grounding of large language model responses, but its effect is not uniformly beneficial in single-turn mental-health question answering, where user queries often combine emotional distress, treatment concerns, and safety-sensitive needs. We study when retrieval helps or hurts mental-health QA, and whether a lightweight selective retrieval policy can better control this trade-off. We operationalize retrieval need using three draft-conditioned utility dimensions: psychoeducational need, coping need, and response specificity, together with a rule-based safety trigger. Following psychotherapy-grounded RAG systems such as coTherapist, we construct a compact and controllable guideline corpus comprising coping-strategy, psychoeducational, and safety resources. We fine-tune an instruction-tuned generator on MentalChat16K using QLoRA and compare Closed-book, Always Retrieval, and Selective Retrieval settings on CounselBench-Eval and CounselBench-Adv. Experiments show that retrieval is not uniformly beneficial in this domain. Always Retrieval improves specificity but lowers overall quality and introduces additional safety-sensitive failures. Selective Retrieval preserves closed-book behavior for low-need cases while avoiding the additional degradation caused by unconditional retrieval, supporting the view that retrieval activation is a safety-sensitive control decision.
Read the full abstract

Computer Vision

Preprocessing Failure and Adversarial Detection in Depthwise-Separable Edge Vision Systems

Preprocessing-based defenses are the standard first-line response to adversarial attacks on edge vision systems, requiring no retraining, no architectural changes, and widely recommended as model-agnostic mitigations. Yet the foundational evaluations of these defenses were conducted on residual or Inception-class architectures, not on the depthwise-separable CNNs that dominate edge deployments. This untested assumption leaves a gap in the security evaluation literature. This paper closes that gap by evaluating six preprocessing defenses against adversarial perturbations across both architecture families. Across all perturbation levels and defenses tested, the two depthwise-separable architectures show consistently poor recovery while the residual architecture shows partial recovery; ablation results are consistent with an architectural rather than parametric explanation, though only three architectures and one attack family are evaluated. Crucially, this failure is not merely a negative result. The same output divergence that disqualifies preprocessing as a recovery mechanism reveals a detection opportunity: preprocessing consistently disrupts clean predictions while leaving adversarial predictions largely unchanged, an asymmetry that is directly measurable without retraining or architectural modification. We further show that standard image quality metrics are unreliable proxies for defense effectiveness, a methodological gap in current evaluation practice. A practitioner decision framework is provided for adversarially resilient edge vision deployment.
Read the full abstract

All authors Jannatul Masruk Mukta, Rifa Sanjida, Adrita Rahman Tory, Md. Saifur Rahman, Khondokar Fida Hasan

High Energy Astrophysical Phenomena

Gamma-Ray Bursts and Optical Brightness: Insights from Swift Satellite

During the examination of optical properties of gamma-ray bursts (GRBs) measured during the life of the Neil Gehrels Swift Observatory satellite, significant discoveries were made. While the satellite measures gamma, X-ray, and optical data simultaneously, in many cases, only an upper limit is established in the optical domain. Hence, survival analysis, a.k.a. dependability modelling, was necessary, serving as a tool for studying samples where some cases are bound only by the upper limit, as mentioned earlier. This method is used to analyse datasets that may have upper or lower bounds rather than precise observations, but nevertheless contain relevant information. It was previously established that the duration, gamma fluence, and peak flux all have a substantial effect on the optical brightness distribution, probably due to the energy of the beam from the GRB's central engine. However, after analysing more than 200 data points, we no longer see this association. This disagreement shows that the previously reported impact may not be as significant as previously derived, needing more research to better understand the underlying processes that determine the optical brightness in connection to gamma-ray properties.
Read the full abstract

Commutative Algebra

Relative approximation degrees and the henselian rationality problem over perfect fields

Let $(F|K,w)$ be an immediate valued function field of transcendence degree one over a rank-one perfect valued field $(K,v)$ of characteristic $p>0$. It is henselian rational if $F^h=K(Y)^h$ for some $Y\in F^h$. Kuhlmann proved henselian rationality over tame fields; we investigate how far his method extends to perfect fields. Relative approximation degrees are a central ingredient in Kuhlmann's approach. We first complete their theory over henselian fields by proving the existence of the relative approximation degree and constant of every polynomial, including for pseudo-convergent sequences of algebraic type. Using the $j$-invariants of associated monomial valuations, we describe these invariants directly through Taylor expansions and extend the henselian degree bound of Kuhlmann and Vlahu. We next study the Artin–Schreier reduction underlying the henselian rationality argument. Over perfect fields, every polynomial is Artin–Schreier equivalent to one whose relative approximation degree lies in ${1,p}$. We construct an explicit rank-one example showing that $p$ cannot always be reduced to one modulo the Artin–Schreier image of $K[X]$. Nevertheless, reduction to degree one becomes possible in this example after passing to equivalence modulo the Artin–Schreier image of $K(X)^h$, and the resulting Artin–Schreier function field is henselian rational. Finally, assume that $K$ equals its absolute ramification field, and let $L=IC(F|K,w)$ be the relative algebraic closure of $K$ in $F^h$. We prove that $F^h$ is henselian rational over $L$, and that henselian rationality descends to $K$ whenever $L|K$ is finite. This finiteness condition holds whenever some separating transcendental element induces an extension of Type II, yielding henselian rationality in this case.
Read the full abstract