Artificial Intelligence
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
Fragmented safety evaluation undermines the governance of dangerous AI capabilities. We present a modular framework that evaluates each model through three orthogonal pipelines—Knowledge ($K$), Defense ($D$), and Harm ($H$)—under a unified protocol, aggregating results into a standardized dangerous-capability profile $\phi$. Pluggable modules supply scenario seeds, knowledge banks, hazard queries, and judge rubrics, while the core evaluation engine remains unchanged across domains; the CB evaluation is complemented by a cyber pilot demonstrating protocol transfer. Instantiating the framework with a chemical-biological (CB) module, we evaluate 12 commercial LLMs from four families. Our first contribution is a horizontal comparison of dangerous capability across models and model families: the three dimensions expose sharply divergent profiles—models with comparable knowledge differ in refusal resilience, and strong defenders do not generate less harmful content when they do comply—while family-level patterns further separate Claude, DeepSeek, and GPT models. The second is a temporal analysis of capability evolution: tracking $K$, $D$, and $H$ against model release dates reveals that dangerous capability has not monotonically declined; newer models deepen knowledge while only partially improving defense, showing that scaling and alignment progress do not uniformly translate into safety. Reliability is established via cross-judge consistency (bootstrap $\rho > 0.79$, 4 of 5 judges) and pipeline orthogonality ($K$–$D$–$H$ inter-correlations $\rho \in [0.32, 0.52]$).
Astrophysics of Galaxies
Empirical Near-Infrared Spectral Templates from SPHEREx: Disentangling AGN and Host-Galaxy Emission
SPHEREx conducts the first all-sky near-infrared spectral survey over 0.75-5.0 $\mu$m, spanning the transition from host-galaxy starlight to AGN-heated torus emission and enabling spectroscopic identification of active galactic nuclei (AGNs). We develop a data-driven framework combining weighted non-negative matrix factorization with forward modeling to learn empirical rest-frame templates from 2,777 normal galaxies and 1,064 AGNs in the North Ecliptic Pole (NEP) field. The resulting 14-component dictionary contains seven galaxy templates spanning stellar-population continua and nebular emission and seven AGN templates capturing emission lines and warm and hot torus continua, providing an additive, operational decomposition. Inferred near-infrared host fractions correlate with independent SDSS spectral and HSC imaging decompositions (at Pearson $r=0.68$ and $r=0.59$), comparable to the SDSS-HSC correlation ($r=0.66$) and supporting the reliability of the AGN-host separation. In the NEP deep field, the same templates recover redshifts with $|z_{\rm fit}-z_{\rm spec}| < 0.01$ for 93.0% of galaxies and 93.5% of AGNs and distinguish galaxies, narrow-line AGNs, and broad-line AGNs with 81.3% accuracy. At all-sky depth, classification retains 72.9% accuracy. The near-infrared coefficients also flag questionable DESI spectral classifications and redshifts, showing how SPHEREx complements optical spectroscopy. Learned directly from survey spectrophotometry and extending beyond the $K$ band, this empirical dictionary fills a long-standing gap in near-to-mid-infrared templates and provides a data-driven foundation for population-scale studies of AGN activity and its connection to host galaxies across the SPHEREx all-sky survey.
Read the full abstract
Instrumentation and Methods for Astrophysics
Simulation of the electron escape ratio for keV alpha-particle ionization tracks in liquid helium
The electron escape ratio for 5.3 MeV alpha-particle ionization tracks in liquid helium under varying external electric fields has been measured in several experiments. However, to the best of our knowledge, the corresponding ratio for keV-scale alpha tracks in the same medium has not yet been reported. In this article, we demonstrate for the first time that this ratio can be accurately characterized using COMSOL-based simulations. Our simulation framework was developed in two stages. In Stage I, we aimed to verify consistency between our simulated results and published experimental data for 5.3 MeV alpha particles. Following successful verification in Stage I, we proceeded to Stage II, in which the 5.3 MeV track was replaced by 2, 5, and 10 keV tracks. Our simulated results reveal that (a) keV-scale tracks exhibit electron escape ratios approximately 1.5-2.5 times higher than that of the 5.3 MeV track, and (b) the escape ratios for all track energies (2, 5, 10 keV, and 5.3 MeV) exhibit a linear dependence on the ion number density at the simulation's T0, but not on the electron number density.
Read the full abstract
Audio and Speech Processing
Sensing Bone-Conducted Speech with Earbuds
Clear capture of the wearer's own voice (OV) is essential when using earbuds for mobile communication. However, OV capture remains challenging in noisy environments. Bone-conducted (BC) speech, which can be sensed as vibrations of the earbud housing, can be used to improve OV capture. However, neither bandwidth nor spatial characteristics of OV-induced earbud vibrations have been analyzed in detail, despite both characteristics being relevant, e.g., for sensor choice and placement. This study investigates both characteristics, based on measurements with two earbud models. Spectrally, results indicate that OV-induced earbud vibrations exhibit a low-pass characteristic, with a steep roll-off of -93 dB per decade above 400 Hz. Thus, sensors with comparatively low noise floors are required to sense the vibrations above \SI{1}{\kilo\hertz}. Spatially, results indicate that the earbuds mainly vibrate in and out of the ear canal entrance, with high consistency between subjects and fits. Simulations confirm that this enables capture of the high-power vibrations below 400 Hz by a single-axis sensor with less than 1.5 dB mean attenuation.
Read the full abstract
Optimization and Control
Stochastic Optimal Control Problem under Inside Information
This paper is concerned with a stochastic optimal control problem under inside information. The control process depends on an $\mathcal{F}_{T_0}$-measurable random variable $Y$, representing the static inside information, and is adapted to the enlarged filtration generated by the underlying Brownian motion and the random variable $Y$. Accordingly, the traditional stochastic integral fails to be well-defined in this non-adapted setting; we adopt forward integrals to formulate the stochastic integral terms in the system. By means of the Donsker delta function, the original controlled system is transformed into a $y$-parameterized system. We further establish the existence of solutions to forward stochastic differential equations (SDEs), and prove the uniqueness of solutions via flow transformation techniques. Under a Gaussian assumption on $Y$, we derive both necessary and sufficient optimality conditions for the aforementioned control problem. Subsequently, we formulate the linear-quadratic (LQ) optimal control problem under inside information. Through the $y$-parameterized transformation, the original problem is converted into an LQ control problem with random coefficients. A numerical example for the LQ case is provided at the end to validate our theoretical findings.
Read the full abstract
Computation and Language
Do Cantonese-Adapted Language Models Better Predict Cantonese Reading? A Cross-Model Eye-Tracking Evaluation
Information-theoretic measures derived from autoregressive language models are widely used to characterize the expectations that shape human reading, but whether language-variety-specific training improves such psycholinguistic alignment remains unclear. This question is still open for Cantonese, where recent NLP evaluations reported mixed benefits from Cantonese-specific training relative to Mandarin-oriented or general-purpose models. Using naturalistic Cantonese eye-tracking data, we compare two within-family adaptation contrasts: CKIP GPT-2 Tiny versus its lightly Cantonese-adapted JED351 derivative, and Qwen2.5-7B versus CantoneseLLM-7B, which underwent substantially more extensive Cantonese continued pretraining and instruction tuning. From each model, we derive lexical surprisal, POS surprisal, entropy before the target, and entropy reduction. Lexical surprisal and the joint four-metric model consistently favor CantoneseLLM-7B, followed by Qwen2.5-7B, CKIP, and JED351, whereas entropy reduction favors CKIP. These results suggest that more extensive Cantonese-specific training can be associated with stronger predictive fit, while model rankings also depend on the information-theoretic measure being evaluated.
Read the full abstract
Information Retrieval
GenCAR: Generative Counterfactual Alignment with Risk-Controlled Selection for Out-of-Distribution Recommendation
Serving useful recommendations under distribution shift is crucial for balancing utility and risk in out-of-distribution (OOD) recommendation. However, most existing OOD methods improve ranking or construct counterfactual candidates without controlling the proxy-label false discovery rate (FDR) of the served set. In this work, we formulate OOD serving as the $\alpha$-Valid Counterfactual Recommendation ($\alpha$-VCR) problem to retain candidate support learned from counterfactual supervision while controlling proxy-label FDR, and propose GenCAR, which couples preference-grounded counterfactual supervision with calibrated set selection. In particular, GenCAR fixes the stable-preference representation while intervening on the environmental factor, grounds offline large language model proposals through preference anchors and trust-radius filtering, and uses conformal $p$-values for Benjamini–Hochberg selection. We theoretically bound conditional counterfactual approximation error and prove finite-sample, distribution-free control of proxy-label FDR under exchangeability and positive regression dependence, with a Benjamini–Yekutieli guarantee under arbitrary dependence. Extensive experiments audit realized proxy false discovery proportions and demonstrate that GenCAR consistently enhances OOD candidate recovery across diverse benchmarks.
Read the full abstract
Optics
Multidimensional Light Detection with Symmetry-engineered Heterojunctions
Miniaturised multidimensional light detection, encompassing full-Stokes polarimetry and spectroscopy in ultracompact footprints, is attracting growing interest for its potential to capture a comprehensive set of light properties in portable platforms. Although significant progress has been made in miniaturised schemes for independent polarisation and spectral detection, achieving simultaneous high-dimensional light detection remains an outstanding challenge that limits their development toward full integration. We overcome this limitation by breaking the rotational and inversion symmetries in a symmetry-engineered van der Waals heterojunction to realise an ultracompact multidimensional photodetector. The dual symmetry breaking gives rise to non-trivial quantum geometric and topological features, enabling simultaneous broadband polarisation- and spectrum-resolved light detection, in contrast to previous van der Waals material-based devices, which could detect only one of these modalities. Our device, with an effective area of only 10 micron x 10 micron, reconstructs full-Stokes polarisation with overall root-mean-square errors below 0.05 and resolves spectral peaks separated by 0.4 nm, capabilities not previously achieved in single-pixel detectors. By unifying high-fidelity polarimetry and sub-nanometre spectroscopy in a single electrically tunable junction, our work eliminates the need for cascaded detection architectures and establishes a foundation for multidimensional detector arrays for integrated photonics, quantum information processing, and precision imaging.
Read the full abstract
Machine Learning
GeoSPRINT: Geometric Redundancy-Aware Step Pruning for Inference in Diffusion Trajectories
Diffusion models achieve high sample quality but remain expensive at inference time because sampling requires many sequential neural function evaluations (NFEs). Existing acceleration methods either use fixed step-skipping schedules, adapt step sizes based on local numerical error, or require additional training. We introduce GeoSPRINT (Geometric Step Pruning for Inference in Trajectories), a training-free framework for constructing non-uniform sampling schedules from the geometry of denoising trajectories. GeoSPRINT detects geometrically redundant steps using a hyperplanarity test in latent space, implemented efficiently via QR factorization, and converts the resulting redundancy profile into a sampling schedule that allocates more steps to high-curvature regions of the trajectory. In addition, we introduce the trajectory projection score $\alpha_{\mathrm{traj}}$, a residual-variance metric that quantifies trajectory straightness and serves as a model-free diagnostic for rectified flow quality. Across CIFAR-10 ($32{\times}32$), LSUN Church ($256{\times}256$), and Stable Diffusion v1.5 ($512{\times}512$ latent), GeoSPRINT consistently improves over uniform DDIM (Denoising Diffusion Implicit Models) schedules at matched NFE budgets. On CIFAR-10, GeoSPRINT improves FID (Fréchet Inception Distance) by 0.7-1.1 over DDIM across 49-89 NFEs and surpasses DPM-Solver++ at NFE${\geq}30$ despite using a first-order DDIM solver. On LSUN Church, it reduces FID from 1.48 to 1.26 at 52 steps, and on Stable Diffusion v1.5 it achieves up to 1.93 FID improvement over DDIM. These results show that trajectory geometry provides a useful global signal for allocating inference steps and that schedule quality can substantially improve diffusion sampling efficiency without retraining.
Read the full abstract
Computer Vision
World-Coherent Decoding: Self-Verifying Test-Time Planning for World Action Models
World Action Models (WAMs) aim to control robots by stochastically generating visual futures and then decoding actions, but empirical observations indicate that the results can strongly depend on which future is selected. We propose World-Coherent-Decoding (WCD), a self-verifying test-time planning framework that treats WAM rollouts as falsifiable future–action hypotheses. At each decision step, WCD samples multiple candidates from a frozen WAM and ranks them using internal generative signals: flow-based video surprisal for visual plausibility and action path effort for action-generation stability. After execution, the realized observation audits the selected imagination, yielding an imagination–reality mismatch that trains a lightweight online predictor for future candidate selection. Thus, WCD converts delayed self-verification into pre-execution reliability estimation without updating the backbone model. On RoboTwin 2.0, WCD improves Hard success under limited randomized-scene supervision from $55.80\%$ to $60.90\%$, with a $+16.43$ gains on Horizon-3 tasks, and shows qualitative robustness on real Franka visual-shift tests. These results highlight a simple principle: test-time scaling for WAMs depends less on sampling more futures than on selecting reliable ones.
Read the full abstract
Computation and Language
OBJECTION! Lawyer Agents Mitigate Guilty Bias in Legal Judgment Prediction
Legal Judgment Prediction (LJP) models are typically trained on documents that describe facts from a prosecutorial perspective. Existing datasets further exhibit severe label imbalance toward guilty outcomes. Consequently, these models suffer from "Guilty Bias", blindly accepting the prosecution's narrative as objective truth. Previous studies employing three-step reasoning structures or training on synthetically generated innocence data improve overall accuracy, but they still fail to mitigate bias at inference time. In this paper, we introduce OBJECTION, an inference-time pipeline that integrates an Adversarial Lawyer Agent into each 3-step reasoning of offense, unlawfulness, and culpability. Unlike generic critics, our agent actively challenges the model's presumptions of guilt by injecting legal defense arguments at each reasoning stage. To thoroughly evaluate this, we present a new "Natural Innocent" dataset including 3.4k real-world cases, overcoming the limitations of synthetic innocence benchmarks. Test results show that OBJECTION drastically reduces the False Guilty Rate (FGR) from 82.93% (SOTA baseline) to 16.69%, proving its capability to perform substantive legal reasoning. This work denotes a key progress toward aligning Legal AI with the presumption of innocence.
Read the full abstract
Robotics
Towards Effective Physical Reservoir Computing with a Pneumatic Soft Robot
Physical reservoir computing (PRC) refers to the use of a physical dynamical system as a computational resource for tasks such as state estimation and control, but there has been a lack of formal study of design rules towards more effective design of such physical reservoirs. Using a pneumatic soft arm with a five-pouch sensing column, this work studies how the pouch interconnection topology, robot stiffness, and the number of instrumented sensors affect bending-angle estimation performance. Across 36 matched trials spanning waveform, baseline pressure of the sensing column, and actuation range, all designs are evaluated under the same-time bending-angle estimation benchmark using 0.2 s of pressure history and a fixed ridge estimator. Our analysis of the experimental results leads to three design guidelines. First, independently sealed pouches preserve a much richer observable state than a shared manifold. Second, increasing the baseline pressure of the sensing column makes the pouch responses more redundant and increases estimation error most strongly in the coupled topology. Third, in the sealed topology, two strategically placed sensors already recover most of the attainable benefit, three capture essentially all of it, and additional sensors provide little or no additional value. In summary, the results suggest that topology, stiffness, and number of instrumented sensors should be co-designed for accurate PRC of soft robot states; stronger excitation alone cannot recover the diversity that poor design choices have already removed.
Read the full abstract
Probability
The higher-dimensional Shepp problem: an exact criterion for random ball coverings of tori
We solve the Euclidean-ball case of the higher-dimensional Shepp covering problem. More precisely, we give an exact criterion for full limsup coverage of the $d$-dimensional torus, $d\ge 2$, by independently centered Euclidean balls with an arbitrary decreasing sequence of radii. Let $X_1,X_2,\ldots$ be independent Haar-uniform points, let $r_1\ge r_2\ge\cdots\downarrow 0$, and put $u_n(z)=m(B(0,r_n)\cap B(z,r_n))$ and $H(z)=\sum_{n\ge 1}u_n(z)$. Then every point belongs to infinitely many of the balls $B(X_n,r_n)$ almost surely if and only if $\int_{\mathbb{T}^d}\exp(H) dm=\infty$. In dimension one this condition is equivalent to Shepp's criterion. No regular-variation or comparable-scale assumption is imposed on the radii. The main difficulty is shared noise: after spatial decomposition, the same Poisson input acts on many uncovered cells, so their descendants are not conditionally independent. We overcome this by establishing an extinction bound for monotone population recursions driven by positively associated innovations. Together with Poissonization and spatial localization this proves sufficiency, while a second-moment estimate and the zero-one law prove necessity.
Read the full abstract
Machine Learning
Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models
The Johnson-Lindenstrauss (JL) lemma guarantees that a random projection of $n$ points to $m=O(\varepsilon^{-2}\log n)$ dimensions preserves pairwise squared distances within relative error $\varepsilon$ with high probability, and this dimension order is asymptotically optimal. In high dimensions, however, distances concentrate around a baseline while key geometric information lies in much smaller fluctuations. We show that the JL bound can therefore be uninformative about retained geometry: an independent Gaussian replacement map can satisfy it even though the replacement cloud is independent of the original data. We then ask how well any decoder can recover a feature $f(D)$ of a squared distance $D$ from a linear sketch. Under squared-error loss, the optimal decoder is conditional expectation, so recovery defines a linear operator whose singular values quantify feature recovery. For isotropic Gaussian data ($\Sigma=\sigma^2 I_d$), we diagonalize this operator in closed form. For fixed $k$ with $m,d-m\to\infty$, its $k$th singular value satisfies $\ell_k\approx(m/ d)^{k/2}$. This yields three sharp consequences. A rank-$m$ sketch retains at most an $m/d$ fraction of the variance of any feature of one squared distance. If $m\to\infty$ and $m/d\to0$, the expected Kendall correlation is $\frac{2}{\pi}\sqrt{m/d}(1+o(1))$; for fixed $q$, nearest- neighbor agreement tends to $1/q$. Yet one projection can satisfy the JL bound while mean Kendall correlation vanishes when $\log n\ll m\ll d$. After removing scale, Haar-averaged retained covariance-shape information is $(m/d)^2$. Thus JL distance preservation does not quantify the geometry available for comparison or inference.
Read the full abstract
Networking
WiP: Characterizing and Defending Against Mobile-Agent-Driven MFA Automation
Mobile agents automate smartphone tasks by interpreting interfaces, interacting with apps, and coordinating cross-app workflows. This capability challenges the human-mediated separation assumed by passcode-based MFA, creating factor collapse: valid authentication factors are combined within one autonomous environment. Our modular pipeline com- pletes all 10 authorized MFA workflows, compared with 3/10 and 6/10 for two single-agent baselines. We also de- velop a motion-based Android risk signal that distinguishes human- from agent-driven logins with 98.4% table-top and 92.6% hand-held accuracy across 116 pilot sessions. These results demonstrate factor collapse and motivate physical- interaction sensing as complementary evidence of user pres- ence.
Read the full abstract
Computation and Language
A Layered Taxonomy for Chinese Learner Grammatical Error Annotation
Grammatical error annotation in Chinese learner writing requires labels that are both consistent and linguistically meaningful. This paper proposes a layered scheme linking computational Chinese grammatical error correction (CGEC) with pedagogical error analysis. The scheme first identifies character- and punctuation-level orthographic errors, labeling them by edit operation and subtype. Other errors receive a three-layer core label combining edit operation, linguistic domain, and part of speech, with optional Chinese-specific extensions for aspect, modality, comparison, argument structure, and complements. Drawing on CGEC resources, learner-error taxonomies, and Mandarin grammar, the taxonomy is evaluated through a coverage analysis of automatically extracted MuCGEC edits and a preliminary consistency study in which five large language models apply it to a sample. The results support the layered approach while identifying category boundaries requiring further refinement.
Read the full abstract
Information Retrieval
Beyond Modality Harmony: Orthogonal Purification and Topology-Guided MoE for Conflict-Aware Multimodal Recommendation
Multimodal Recommender Systems (MRSs) typically rely on a flawed "modality harmony" assumption, presuming that multimodal features are inherently beneficial and strictly aligned with users' collaborative interaction patterns. However, modality-topology conflicts are ubiquitous in real-world scenarios due to deceptive visual clickbaits and mismatched semantics. Blindly integrating these noisy modalities inevitably pollutes the pristine collaborative space, causing severe representation distortion. To address this, we propose Orthogonal purification and topology-guided MoE for conflict-aware multimodal Recommendation (OrthoRec). At its core, OrthoRec introduces Collaborative-Guided Orthogonal Purification (CGOP), which geometrically decouples multimodal features into directions parallel and orthogonal to a pure collaborative anchor. By adaptively truncating the orthogonal noise with an energy-preserving normalization, CGOP rectifies deceptive semantic directions while preserving the modality's intrinsic representation capacity. Furthermore, we design a Topology-Aware Routing Mixture-of-Experts (TAR-MoE). Guided by the collaborative topology, TAR-MoE employs decoupled sigmoid gating to break the zero-sum bottleneck of traditional softmax attention, autonomously determining the injection scale for each purified modality. Finally, a safe-SSL objective is introduced to dynamically penalize the forced contrastive alignment of contradictory pairs. Experiments on three real-world Amazon datasets show that OrthoRec consistently outperforms competitive recent baselines and exhibits improved robustness under modality noise and item sparsity.
Read the full abstract
Solar and Stellar Astrophysics
Electron acceleration by turbulent reconnection in solar flares
Solar flares can release magnetic energy explosively in the corona and produce high-energy particles on short timescales. However, how and where these particles are accelerated remains an open question. Here, we investigate the acceleration and transport of electrons during self-developed three-dimensional turbulent reconnection of solar flares by solving Parker's transport equation in the framework of high-resolution MHD simulations. We find that thermal electrons at both the flare current sheet and loop top are rapidly accelerated up to ~90keV, with energy spectra exhibiting a power-law feature. Although the population of accelerated electrons at the flare loop top is larger than that at the current sheet, their spectral indices are similar, close to the values usually observed. More importantly, the acceleration is achieved by turbulence-driven compression structures of various scales rather than the supposed termination shock, particularly at the flare loop top. A portion of compression structures even forms shocks. These results highlight the critical role of turbulent reconnection in accelerating electrons, thereby shedding new light on the acceleration and transport of particles in other high-energy phenomena.
Read the full abstract
High Energy Physics (Phenomenology)
Macroscopic Coherent Axion Production by Reverse Parametric Fluorescence
We propose a macroscopically coherent laboratory source of axion-like particles (ALPs) through the axion–electron coupling \(g_{ae}\). Two counterpropagating optical modes drive reverse parametric fluorescence in a crystal, where two pump photons are converted into a relativistic ALP through virtual ionic transitions, while the medium returns to its initial state. Phase matching enables emission amplitudes from many ions to add coherently without preparing material coherence. The pump frequencies determine the ALP energy, making the source continuously tunable. The production rate scales with the product of the two pump powers and the square of the source length. Resonant absorption followed by fluorescence completes the detection scheme. For benchmark crystal and laser parameters, a one-year operation gives a reach of \(g_{ae}\simeq2.8\times10^{-11}\), substantially improving the sensitivity of purely laboratory-based searches for low-mass ALPs.
Read the full abstract
Human-Computer Interaction
OmegaUse-SOP: SOP Engineering for Professional Computer Use from Human Demonstrations
Large language models (LLMs) are increasingly evolving from conversational assistants into agents capable of operating external digital environments. Graphical user interface (GUI) agents play an important role in this transition, as many real-world workflows remain accessible only through user-facing software interfaces. However, despite recent progress on general computer-use benchmarks, domain-specific professional standard operating procedures (SOPs) remain challenging for GUI agents because they often involve implicit domain knowledge, software-specific conventions, and task-level verification requirements. We introduce OmegaUse-SOP, a human-in-the-loop SOP Engineering system for transforming human demonstrations of professional computer use into reusable SOP skills for GUI agents. Analogous to prompt engineering, SOP Engineering iteratively refines demonstrations, execution rules, and domain knowledge to convert professional SOPs into reusable GUI-agent skills. OmegaUse-SOP consists of four modules: Observe, Reason, Configure, and Execute. Together, these modules record expert operations as multimodal GUI traces, abstract low-level events into semantic step-level instructions, incorporate domain rules and task-specific parameters, and execute the resulting skills in live GUI environments through step-wise grounding, action generation, and verification. To demonstrate its effectiveness, we collaborate with a power-sector client and test OmegaUse-SOP on photovoltaic simulation workflows in PVsyst 7.2. The results suggest that OmegaUse-SOP can improve GUI-agent reliability on professional SOP tasks, highlighting a practical path toward deploying GUI agents in domain-specific professional software environments.
Read the full abstract
Materials Science
Charge-Transfer Electronic Structure of NiX$_2$ (X = S, Se)
We investigate the electronic structures of NiS$_2$ and NiSe$_2$ using density functional theory combined with dynamical mean-field theory (DFT+DMFT). A realistic electronic structure within DFT+DMFT was determined by optimizing the double-counting correction to reproduce experimental valence-band photoemission spectra. The validity of the present model is further confirmed by its successful description of the Ni 2$p$ core-level photoemission and Ni $L$-edge x-ray absorption spectra of NiS$_2$. Our results reveal a smaller charge-transfer energy than previously assumed, resulting in substantial ligand-to-Ni charge transfer and a reduced Ni local moment. We clarify how the relative position and interaction between the Ni upper Hubbard band and the antibonding chalcogen-dimer states shape the evolution of the low-energy electronic structure across the NiS$_{2-x}$Se$_x$ series.
Read the full abstract
Analysis of PDEs
Normalized solutions of $L^2$-supercritical NLS equations with periodic potentials
In this paper, we study normalized solutions to the following $L^2$-supercritical nonlinear Schrödinger equation with a periodic potential \begin{equation*} \begin{dcases} -\Delta u +V (x)u + \lambda u=\chi_{{\Omega}}(x)f(u)\quad \text{in } \mathbb{R}^N, u>0 \quad \text{in} \ \mathbb{R}^N, \int_{\mathbb{R}^N}\abs{u}^2\, dx =\mu. \end{dcases} \end{equation*} Here $N \geq 1$, $\mu>0$ is prescribed, $\lambda \in \mathbb{R}$ is a Lagrange multiplier, $V\in C(\mathbb{R}^N)$ is $1$-periodic in $x_1,...,x_N$, $f \in C^1(\mathbb{R})$ is a nonlinearity having $L^2$-supercritical growth at infinity, $\Omega\subset \mathbb{R}^N$ is either a (nonempty) bounded open set with smooth boundary $\partial \Omega$ or the whole space \(\mathbb{R}^N\), and $\chi_{{\Omega}}$ is the characteristic function of ${\Omega}$. In both cases, we prove the existence of normalized solutions of mountain pass type when $\mu>0$ is small and $f$ behaves like a power function $|t|^{p-2}t$ with $2+4/N<p<2^*$ at infinity. Moreover, if $\Omega$ is bounded, $1 \leq N \leq 4$ and $f$ has $L^2$-supercritical growth near the origin, then the existence of normalized solutions is obtained for all $\mu>0$. On the other hand, when $\Omega=\mathbb{R}^N$, we prove the existence of solutions corresponding to local minimizers when $\mu>0$ is small. When $\Omega$ is bounded, the results are obtained via a monotonicity trick for mountain pass values and blow-up analysis with the Morse index estimates. In the case where $\Omega = \mathbb{R}^N$, we develop the concentration-compactness argument based on the Morse index for the existence of mountain pass type solutions.
Read the full abstract
Instrumentation and Methods for Astrophysics
Overview of multi-conjugate adaptive optics reconstructors
Multi-Conjugate Adaptive Optics (MCAO) systems aim at correcting for the atmospheric turbulence uniformly over wide-field observations. Compared to classical AO, this requires a tomographic reconstruction of the turbulence perturbations, that is to say a reconstruction of the atmosphere in its volume, and the control of several deformable mirrors optically conjugated to various altitudes. During the last two decades, many tomographic reconstructors have been proposed in the AO literature and some have been implemented on sky on existing MCAO systems. This paper presents an overview of MCAO reconstructors. Four categories of reconstructors are considered: i) the reconstructors based on interaction matrix; ii) the minimum-variance static reconstructors; iii) the 3-step recontructors and iv) the Kalman-based reconstructors. We discuss their relative advantages and drawbacks.
Read the full abstract
Machine Learning
Online Non-Monotone DR-Submodular Maximization Matching the Offline $0.401$ Factor
We study online maximization of nonnegative, non-monotone DR-submodular functions over compact convex down-closed subsets of the $d$-dimensional unit cube. The best known constructive offline approximation factor is $0.401$ under the corresponding meta-solvability assumptions, whereas comparable adversarial online guarantees had remained at $1/e$. We show that this factor is also achievable online. In the post-decision full-information value-oracle model, our algorithm attains factor $0.401$ with sublinear approximate regret when oracle feedback is conditionally unbiased and bounded. The online algorithm does not run the offline construction on a changing objective. Instead, it replaces the offline objective-dependent box step by a weighted online learner that controls the required residual terms cumulatively. An exact asymmetric balance theorem preserves the offline coefficients despite adversarial variation. The direct implementation has $O(T^{3/4})$ regret and uses $O(dT^{1/4})$ oracle calls per round. More generally, for every $\delta\in[0,1/4]$, batching gives $O(T^\delta)$ calls per round and $O(T^{4/5-\delta/5})$ regret, including a one-call $O(T^{4/5})$ endpoint. Under a positive-anchor condition, randomized blocking retains factor $0.401$ with $O(T^{5/6})$ one-point bandit regret.
Read the full abstract
Complex Variables
Integrable Generators of Polynomial Vector Fields for Complex Classical Lie Groups
We consider in this paper complex Lie groups $\mathrm{SL}_n(\mathbb{C})$ for $n\geq 2$, $\mathrm{SO}_n(\mathbb{C})$ for $n\geq 5$, and $\mathrm{Sp}_{2n}(\mathbb{C})$ for $n\geq 1$. We show that for any such Lie group, the Lie algebra of polynomial vector fields can be generated by three $\mathbb{C}$-complete polynomial vector fields.
Read the full abstract
Databases
A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search
Most vector databases rely on graph-based indexes, notably HNSW and Vamana, for approximate nearest neighbor search. With embedding models widely adopted, the datasets these databases store grow rapidly. At a fixed accuracy, how does search cost scale with dataset size? The prevailing answer is poly-logarithmic growth. Yet the claim is proven only under special conditions and asserted without proof for the indexes used in practice. It is also largely untested: standard benchmarks measure cost at one dataset size, not across sizes. We put the claim to the test. The answer depends on the scale itself. While the dataset size $N$ is small relative to the data's intrinsic dimensionality, search cost grows as $N^c$ for a constant $0<c<1$. We call this scaling the Sublinear Power Law. Once $N$ is large enough, growth slows to subpolynomial, consistent with the poly-logarithmic claim. The Sublinear Power Law appears on every dataset, mostly up to its full size, at every recall target, query hardness level, and index configuration we test. The transition to subpolynomial growth appears on the two datasets that grow large enough relative to their intrinsic dimensionality. One mechanism underlies both behaviors: a dataset's intrinsic dimensionality grows with its size until the data resolves its underlying distribution. Higher intrinsic dimensionality packs more vectors into the query neighborhood the search must examine. We present a unifying theory of beam-search cost that explains our observations. For exact and bounded-degree constructions, we prove the Sublinear Power Law and the eventual transition to poly-logarithmic scaling, and derive the scale at which it occurs. We also develop models that predict the power-law exponents for any recall target and index configuration. These models give a principled way to navigate trade-offs among search cost, insertion cost, and recall as data grows.
Read the full abstract
High Energy Physics (Phenomenology)
Quasicrystalline Inflation: From the Cosmological Dipole to Primordial Diffraction
We propose quasicrystalline inflation. Six quasiperiodic phases decompose into three phonons and three phasons. It turns out that a coherent pure-phason displacement can generate a local power dipole while the linear traceless quadrupole vanishes. From spatially varying quadratic effective field theory, we derive off-diagonal correlations whose momentum transfer is restricted to integer combinations of the six icosahedral wavevectors. These correlated off-diagonal signals provide a characteristic observational signature of primordial quasiperiodic order, primordial diffraction.
Read the full abstract
Quantum Physics
Renormalization group and long-range conditional mutual information in hierarchical models
A departure of a mixed quantum state from a local Gibbs description is generally invisible to local observables but can be detected by the conditional mutual information (CMI). Here we study the relationship between the renormalization group (RG) and CMI, and in particular, how RG constrains CMI. We first show that the CMI between nonadjacent regions $A$ and $C$, conditioned on the buffer region $B$, is UV-finite whenever the state admits a locally reversible RG with a fixed on-site Hilbert space dimension. We then study two hierarchical models that have long-range CMI and yet admit a simple RG description. The first model has a divergent Markov length at every temperature $0<T<\infty$ but nevertheless flows to an infinite-temperature product state under RG. The second model satisfies the local Markov condition while violating the global one and is stable against weak noise. At the critical noise strength, the two-point CMI decays only polynomially as a function of the system size, while the two-point mutual information vanishes.
Read the full abstract
Networking
SoK: Where Do Flow Labels Come From? Auditing Label Provenance in Encrypted Traffic Benchmarks
Encrypted traffic classification infers semantics beyond the flow record from transport-layer observables, and supervised training rests on labels that hold for the individual flow they are attached to. Recent systematizations scrutinize model in- puts and data splits; we systematize the complementary label side. Across 14 audited benchmark entries, we identify two recurring label-side strategies: coarse inheritance, which risks labelling flows the evidence does not cover, and overstrict filtering, which keeps only self-attesting flows and risks dis- carding relevant ones. No audited entry exposes a countable pre-selection population, and the task objects downstream papers attach to the same labels disagree with the recovered record in 8 of 23 referenced cells. Under strict side-channel features we derive a representation-relative ceiling on bal- anced accuracy for any classifier restricted to those features: on the public benchmarks that inherit, it ranges from 0.56 to 0.76. On the filtering side, only 24.95% of connections in our fully captured corpus carry an observable SNI of their own; yet the discarded connections raise macro accuracy from 0.44 to 0.65 through same-run co-occurrence features. We end with recommendations for benchmark builders and users.
Read the full abstract
Quantum Physics
A variational quantum eigensolver-based cutting plane framework for semidefinite programming problems
Semidefinite programming plays a key role in optimization, with broad impact across control theory, machine learning, and combinatorial optimization. Although semidefinite programs are polynomially solvable, several commonly used algorithms rest on a linear-algebraic step whose running time grows cubically with the matrix dimension and which requires the matrix itself to be held in memory, at quadratic cost. In this study, we propose replacing it with a variational quantum eigensolver, whose qubit requirement is logarithmic in the matrix dimension, and present the first end-to-end implementation of such an approach within a cutting-plane framework, together with an operator-derived ansatz whose entanglement structure is read directly from the Pauli support of the candidate matrix. Evaluated on the control family of SDPLIB against an identical scheme driven by an exact eigendecomposition, the variational oracle produces valid cuts throughout, closing 32 to 82% of the initial optimality gap against a near-constant 75 to 82% for the exact oracle. Implementing and measuring the method end to end surfaces several effects not visible from theoretical analyses alone: where memory is actually consumed, how the padding required to fit a matrix onto a quantum register can mislead the variational optimizer, and why the candidate matrices prove dense in the Pauli basis, reducing the operator-derived ansatz to full entanglement. We report these findings and discuss their implications for near-term hybrid quantum-classical approaches.