Statistical Methodology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
Factorial designs allow simultaneous estimation of multiple main effects and interactions, but covariate imbalance can substantially reduce estimation precision. Existing rerandomization methods improve covariate balance yet do not fully exploit heterogeneous priorities across factorial effects or effect-specific covariate importance. To address these limitations, this paper proposes a data-adaptive rerandomization framework for $2^K$ factorial designs. We first develop an oracle criterion that jointly incorporates researchers' priorities over factorial effects and effect-specific covariate importance, enabling precision gains with guaranteed lower bounds. To make the oracle criterion implementable, we develop a data-adaptive procedure that learns effect-specific covariate importance from a random subset of units and applies an estimated oracle criterion to the remaining units. Unlike existing two-stage rerandomization methods for treatment-control experiments, our procedure accommodates multiple factorial effects and requires no auxiliary dataset. Under a finite-population framework, we establish design-based asymptotic theory and show that the proposed procedure preserves the oracle design's precision-prioritization property and, under suitable conditions, achieves the same asymptotic precision as the oracle design. Numerical studies demonstrate substantial efficiency gains over existing rerandomization methods.
Computer Vision
KSG-Net: Key-Sparse and Global-Context Learning for Maritime 3D Ship Detection
Accurate 3D ship detection in maritime environments is critical for autonomous navigation, yet remains challenging due to large-scale vessel variations, sparse point clouds of small vessels, and severe sea-clutter interference. Existing methods, primarily based on 2D features or dense representations, struggle to balance detection accuracy and computational efficiency, while sparse 3D detectors designed for road scenes generalize poorly to maritime scenarios. This paper focuses on two key challenges in maritime LiDAR perception: weak feature representation for small and sparse vessels, and insufficient global structural modeling for large vessels due to the limited receptive field of local sparse convolutions. To address these issues, we propose KSG-Net, a Key-Sparse and Global-Context learning network for maritime 3D ship detection. The core idea is to jointly enhance local discriminative features and global structural awareness within a unified fully sparse detection framework. Specifically, a Key Sparse Multi-scale Aggregation (KSMA) module is designed to enhance the representation of small and sparse vessels by selecting informative key voxels and aggregating cross-scale neighborhood features. Furthermore, a Global Context Aggregation (GCA) module is introduced to capture long-range geometric dependencies through scene-level context modeling with gated residual interactions, thereby improving the representation of large vessels. Extensive experiments on the Thames River vessel dataset and simulated datasets demonstrate that KSG-Net consistently outperforms existing methods in multi-scale vessel detection and exhibits strong robustness in complex maritime environments.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Calculating the squeezed bispectrum in stochastic inflation by Monte Carlo simulation
The bispectrum of cosmological perturbations is an important probe of inflation and the underlying particle physics. However, calculating it becomes challenging in inflation models where inflaton dynamics is dominated by quantum diffusion rather than slow-roll, especially in the multi-field case. In this paper, employing the stochastic-$\delta \mathcal{N}$ formalism, we propose a Monte Carlo-based method to calculate the bispectrum in the squeezed limit, as an extension of the method for the power spectrum that we previously proposed. Our method involves generating paths of inflatons' time evolution that branch only several times, avoiding nested path generation, which incurs a prohibitive computational cost. As numerical demonstrations, we apply the proposed method to single- and double-field chaotic inflation for validation, and to hybrid inflation with mild waterfall, for which, to the best of our knowledge, the bispectrum is calculated for the first time in this work.
Read the full abstract
Computer Vision
DPA: Decoupling Product-Agnostic Anomaly Representations for Zero-shot Anomaly Generation
Industrial anomaly detection benefits from anomaly samples, yet newly deployed products typically provide only normal images, making anomaly samples difficult to collect. Zero-shot anomaly generation offers a promising solution which avoids collection of target-product anomalies. However, existing methods mainly rely on texture images or text descriptions as anomaly sources, which often produce unrealistic anomalies. Observing that similar anomalies can recur across different products, we propose anomaly transfer-based zero-shot generation, which reuses real anomalies from existing source products, making target-product anomalies no longer necessary to generate realistic anomalious samples for unseen target products. Since not every anomaly type suits the target product, an anomaly type filtering mechanism first selects plausible source types. To transfer selected anomaly, we propose DPA, a diffusion-based framework that decouples product-agnostic anomaly representations. Instead of directly extracting anomaly representations, DPA learns product-irrelevant anomaly embeddings through training with the mismatched data pair, enabling transferable anomaly concept learning across products. Furthermore, we design an adaptive mask-guided pipeline that leverages adaptive masks to control the positional and geometric plausibility of generated anomalies during generation. A training-free anomaly labeling module is further introduced to produce pixel-level annotations aligned with generated anomalies. Extensive experiments on MVTec-AD, VisA, and a dedicated anomaly-transfer benchmark demonstrate that the proposed setting and DPA generate more realistic anomalies and significantly improve downstream anomaly detection performance under both zero-shot and few-shot settings. Source code and models will be released.
Read the full abstract
Artificial Intelligence
CHIME: Credit-Aware Hierarchical Memory Evolution for Long-Horizon Agentic Planning
Planning is a central capability that enables agents to decompose complex long-horizon tasks into manageable steps. Test-time search and training-based methods improve planning but incur high inference costs or require expensive training data. Self-evolving memory instead accumulates reusable experience from agent interaction outcomes into an external memory bank, so planning capability keeps improving at inference time without parameter updates. However, existing self-evolving memory methods share an inherent credit assignment problem: they rely on final task outcomes as feedback, but such outcomes conflate plan quality with execution errors and environmental factors, so the accumulated planning experience is often biased and noisy. To address this problem, we propose Credit-Aware Hierarchical Memory Evolution (CHIME), a self-evolving memory framework that maintains a separate planning bank and execution bank and follows an attribute-before-memorize principle: CHIME first attributes each task outcome to the plan, the execution, both, or neither, and then updates only the corresponding memory bank. Extensive experiments on four long-horizon agent benchmarks show that CHIME consistently outperforms state-of-the-art training-based and self-evolving memory baselines. Further analyses reveal several interesting findings. For example, CHIME accumulates effective memory with far fewer items. In addition, the learned memory values faithfully reflect downstream utility: high-quality planning memories are more valuable than execution memories. Finally, the accumulated memory effectively transfers across backbone models. Code will be released at https://github.com/ATH-MaaS/Marco-DeepResearch.
Read the full abstract
Analysis of PDEs
Existence of closed non-planar $p$-elasticae
We prove existence of closed non-planar $p$-elasticae for general exponents $p\in (1,\infty)$. In particular, we show that for any $p \in (1,\infty)$, there exists a countable family of non-planar $p$-elasticae, which are realized as torus knots. This generalizes well-known results of Langer–Singer for the quadratic case $p=2$ to general exponents $p\in (1,\infty)$.
Read the full abstract
Numerical Analysis
Two Adjoint Perspectives on Fokker-Planck Optimization: A Microscopic-Macroscopic Correspondence
The Fokker-Planck equation admits both a macroscopic Eulerian description through probability densities and a microscopic Lagrangian description through stochastic trajectories. Consequently, optimization problems constrained by the Fokker-Planck equation can be formulated from either perspective. Surprisingly, the corresponding adjoint equations appear to be fundamentally different: the macroscopic adjoint is governed by the backward Kolmogorov equation, whereas the microscopic adjoint evolves pathwise along stochastic trajectories. In this note, we reconcile these two formulations by establishing their correspondence in the continuum setting. We further show that, although their discrete gradients no longer coincide after discretization, both provide consistent numerical approximations of the continuum gradient. Explicit convergence rates are established for both discretization strategies.
Read the full abstract
Systems and Control
Turnpike properties in nonlinear system identification
We analyze the problem of learning general discrete-time nonlinear state-space models using the simulation error minimization (SEM) method. In this setting, model parameters are typically learned by minimizing the mismatch between simulated and measured outputs over a training dataset, or shorter subsequences extracted from it. Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state. In the presence of non-unique optimal output sequences—as may arise, for instance, in fully black-box system identification using neural networks—the property is formulated with respect to the closest such sequence. Turnpike behavior is generally desirable in practice, as it provides a theoretical justification for employing computationally more tractable SEM formulations with fixed initial states while ensuring that their optimal output sequences remain close to unconstrained optimal ones. Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity. We additionally introduce a cardinality turnpike property and show that it is strictly weaker than the cumulative notion. Finally, we establish sufficient conditions for turnpike behavior based on incremental output stability, convexity of the stage cost, and a suitable optimality condition, and illustrate the theory by means of a numerical example.
Read the full abstract
Accelerator Physics
Rapid Mapping of Photocathode Quantum Efficiency: A Magnetized Electron Beam Imaging Approach
Quantum efficiency (QE) is a key property of photocathodes, and its uniformity is essential for producing high-brightness electron beams. Cathode imaging provides an in-situ and real-time approach for QE mapping, but in RF guns, a high charge per bunch is often needed to obtain a sufficient signal-to-noise ratio. Under such conditions, space charge effects can significantly degrade the imaging resolution and may even make point-to-point cathode imaging ineffective. In this paper, we propose a novel cathode imaging method based on a magnetized electron beam. Its feasibility is examined through theoretical analysis and beam dynamics simulations. The results show that the proposed method enables point-to-point cathode imaging in the ten picocoulomb charge regime. For a 10 pC, 3ps beam with a cathode magnetic field of 1200 Gauss, simulations indicate an imaging resolution of 11 um, representing nearly an order-of-magnitude improvement over the non-magnetized beam method.
Read the full abstract
Networking
Bridging the Gap: A Longitudinal Analysis of Extended Identifiers in the Post-Cookie Era
As third-party cookies fade because of browser restrictions, the online advertising ecosystem is turning to extended identifiers (EIDs) as an alternative. EIDs are persistent user identifiers, such as hashed email addresses, that are employed to link users across domains and devices. This paper presents a 41-month longitudinal study examining EID usage in over 145 million HTTP header bidding requests sent to six major supply-side platforms (SSPs) from 616,539 websites. Our findings show that EIDs are widely used and are becoming increasingly prevalent in the digital advertising ecosystem, reaching 83.76% of studied websites by May 2025. Our analysis of the 18 popular EID providers that account for 99.42% of all transmitted EIDs in our dataset raises concerns about the readiness of EIDs as an alternative to third-party cookie tracking. In terms of accuracy, only one identity provider consistently recognizes and identifies that the visitor is a self-identified bot crawler, and many providers regularly transmit multiple EIDs for the same visitor. We also identify privacy concerns with EIDs, as 12 of the providers create persistent EIDs that can identify the same user across visits, websites, devices, and months. Finally, we found that 16 providers transmit EIDs on EU websites without user consent.
Read the full abstract
Machine Learning
DynG-Diff: A State-Aware Dynamic Guidance Diffusion Framework for Probabilistic Time Series Forecasting
Probabilistic multivariate time series (MTS) forecasting is crucial for modeling complex dynamical systems. However, existing diffusion-based methods rely on task-specific conditional paradigms that lack flexibility and struggle with inherent "information heterogeneity"–the significantly varying noise levels and evolutionary patterns across variables. To address this, we propose DynG-Diff, a variable-sensitive dynamic guidance diffusion framework for probabilistic multivariate time-series forecasting: (1) DynG-Diff adopts a two-stage separated training strategy and uses an unconditional diffusion backbone to model the joint distribution of multivariate time series. (2) DynG-Diff introduces a lightweight state-aware policy network that adaptively infers variable reliability from real-time noisy states and one-step denoising estimates, outputting a dynamic guidance strength matrix. (3) DynG-Diff mathematically formulates this dynamic weight as the local precision of the observation distribution, enabling precise guidance for high-confidence variables during inference while filtering out interference from anomalous noise. Extensive experiments on real-world benchmarks demonstrate competitive probabilistic forecasting performance against state-of-the-art conditional diffusion models and improved robustness under severe observation corruption.The implementation code is available at: https://github.com/TT-20011031/DynG-Diff
Read the full abstract
Artificial Intelligence
ToolGate: An Executable Acceptance Pipeline for Tool-Dependent Scientific Benchmark Construction
Scientific benchmarks are commonly built by domain experts who write tasks and cross-check one another's work, or who adapt existing material from textbooks, published papers, and online resources. These routes can produce strong evaluations, but they require substantial per-item labor. Language models can reduce this repeated work by proposing candidates quickly. The remaining problem is acceptance. We target scientific questions whose answers require computations with specialist software rather than unaided reasoning alone. A candidate is invalid if its script fails or returns a different answer, or trivial if a model answers it without the software. We present ToolGate, which treats every generated item as a proposal and keeps it only if three gates pass. First, an executable solution script must reproduce the proposed answer when run with the scientific software. Second, randomized no-tool screening rejects candidates that models can already solve from the prompt alone. Third, a tool-using agent must solve each survivor within a fixed time limit. We instantiate ToolGate in FEniCSx with 500 generation attempts. The local-verification gate retains 478 candidates. For final reporting, we rescreen this pool after generation: two randomized no-tool screens exclude 222 from the reported pool, and direct GPT-5.5 API calls at medium reasoning (the API default) exclude another 121. Of the remaining 135, a GPT-5.5 Codex CLI agent with access to FEniCSx solves 130; exact deduplication leaves 128 unique protocol survivors. ToolGate turns repeated answer checking and difficulty screening into an auditable process while leaving domain design and final review to experts.
Read the full abstract
General Relativity and Quantum Cosmology
Collective Onset of Matter-Induced Scalarization around a Black Hole with Two Thin Shells
We study the linear onset of matter-induced scalarization for a static black hole surrounded by two spatially separated thin matter shells. We assume that the conformal matter coupling is unity on the scalar-free background and that its logarithmic derivative vanishes there. The scalar perturbation then decouples from the metric and matter perturbations at first order, while the invariant surface traces of the shells give singular terms in the scalar equation. For a static spherical black-hole exterior with no bulk scalar effective-mass term between the shells, the onset reduces to the finite-rank condition $$ 1-a_1-a_2+(1-\chi)a_1a_2=0, \qquad \chi=\frac{{\cal S}(R_2)}{{\cal S}(R_1)}, $$ where $a_j$ is the attractive strength of shell $j$ normalized by its one–shell threshold on the same background and ${\cal S}$ is the static radial resistance. This relation shows that two individually subcritical shells can collectively destabilize the scalar-free black hole. We derive the critical scalar cloud in closed form and verify numerically, in the Schwarzschild probe problem, that a growing mode with a finite growth rate appears beyond the threshold. For an exact scalar-free background consisting of three Schwarzschild regions joined by two Israel shells, we separately derive the static onset condition and the corresponding critical cloud. The exact Israel trace also exhibits a sign transition whose light-shell limit occurs at the Schwarzschild photon sphere.
Read the full abstract
Geometric Topology
From Bowditch question to Goldman conjecture for type-preserving representations
For punctured surfaces $\Sigma_{g,p}$ of genus $g\geqslant 2$, we explore the dynamics of the mapping class group action on the relative $\mathrm{PSL}(2,\mathbb{R})$-character varieties of type-preserving representations. For such relative character varieties, Goldman's conjecture predicts that the mapping class group acts ergodically on their non-Teichmüller components. A related question of Bowditch asks whether every non-elementary type-preserving representation that is non-Fuchsian sends some non-peripheral simple closed curve to a non-hyperbolic element. We show that, on the components of the relative character variety indexed by fixed signs of images of peripheral elements and relative Euler classes non-extremal in the generalized Milnor-Wood inequality, an affirmative answer to Bowditch's question implies Goldman's conjecture.
Read the full abstract
Probability
Coalescence and fluctuations of O'Connell$\unicode{x2013}$Yor polymers via the free-energy correlation profile
We establish an identity relating the spatial derivative of a two-point free-energy correlation to two fundamental geometric quantities: the annealed probability that two independently sampled polymers, in the same environment, meet before reaching the prescribed terminal level, and the exit-point location of a single polymer. Our result is inspired in part by recent integration-by-parts work of Gu and Quastel for the KPZ equation. A crucial step in their continuous setting relies on an ingenious application of Itô's formula, which has no direct analogue in our semi-discrete setting. Instead, we exploit intrinsic symmetries of the polymer model together with the memoryless property. We also provide two applications: (i) we recover the horizontal Burke property by proving that the anchored stationary horizontal free-energy profile is a two-sided Brownian motion; (ii) in the zero-temperature limit, we obtain the corresponding identity for Brownian last-passage percolation.
Read the full abstract
Computer Vision
LaST-SR: Laplace-Inspired Steady-Transient Complex-Frequency Decomposition for Single Image Super-Resolution
Single-image super-resolution (SISR) requires global context modeling for structurally consistent reconstruction. Fourier operators are increasingly adopted for global feature modeling. However, their periodic spectral bases constrain the representation of localized aperiodic variations, limiting the recovery of irregular structures and fine details. In dynamical systems, the Laplace neural operator extends Fourier modes to complex frequencies and decomposes the output signal into complementary steady-state and transient responses to jointly model periodic and aperiodic information. We derive, for the first time, an approximate steady-transient decomposition for two-dimensional feature maps, providing an analytical basis for the proposed complex-frequency decomposition. Accordingly, we propose LaST-SR, centered on a Complex-Frequency Decomposition module that couples a global full-spectrum Fourier branch for image-wide dependencies and long-range structural consistency with a window-conditioned local complex-frequency branch for localized, content-dependent aperiodic variations. To fuse the resulting features, we further design a Steady-Transient Collaborative Aggregation module for cross-branch interaction and joint aggregation. Experiments on five benchmarks show that LaST-SR achieves the best PSNR/SSIM among the compared methods for $\times2$ and $\times4$ SISR. Ablation studies further validate the effectiveness of the proposed architecture and its key modeling mechanisms.
Read the full abstract
Information Retrieval
SPAR: Enhancing Industrial-Scale Generative POI Recommendation via Real-World Spatial Perception
Generative Point-of-Interest (POI) recommendation, autoregressively generating a target POI's semantic ID (SID), holds great promise for Location-Based Services, where a recommendation helps only if the user can reach it. Yet, existing methods operate within an interest space defined by behavior sequences and collaborative signals, where geography enters only as a textual attribute of the SID, leaving no explicit mechanism to learn or preserve how urban places are related by distance, direction, and reachability; their predictions are thus behaviorally plausible yet far from the user's real-time location. We argue that such services require injecting real urban spatial knowledge into the interest space, rather than inferring geography from behavior alone. Hence, we propose SPAR, a unified framework whose three synergistic stages jointly construct, cultivate, and preserve urban spatial knowledge: (1) at the tokenization level, Spatially-Intrinsic SID (SI-SID) explicitly encodes longitude–latitude coordinates into a sinusoidal geospatial embedding and fuses it with the textual semantic embedding, producing identifiers via RQ-Kmeans that are simultaneously semantically and geographically consistent; (2) at the cognition level, Multi-Granular Geospatial CPT (MG-CPT) continually pre-trains the base LLM on 25 curated geospatial datasets organized into three tiers of basic attributes, pairwise relations, and city-scale navigation, so that scattered POIs cohere into a connected urban space; and (3) at the adaptation level, Task-Vector Anchored SFT (TV-SFT) anchors the acquired spatial knowledge as a frozen parameter-space task vector to prevent its catastrophic forgetting during behavioral fine-tuning, thereby fusing the two spaces. Extensive quantitative and visualization experiments on two public and four industrial-scale datasets demonstrate the effectiveness of SPAR.
Read the full abstract
Applied Physics
Nanoporous Copper Films as Platform for UV-SERS: Sensitivity and Ability to Perform Chiral Discrimination
Surface enhanced Raman spectroscopy (SERS) in the ultraviolet (UV) region offers important advantages for biomolecular detection, including resonance enhancement and reduced fluorescence interference. However, the development of UV SERS substrates that combine low cost, reproducibility, and chemical stability remains challenging. Here, we employ a dry synthesis approach to fabricate nanoporous Cu and copper oxide (CuO) films on silicon substrates and systematically evaluate their UV SERS performance using adenine as a Raman reporter under 325 nm excitation. Among the substrates investigated, nanoporous Cu exhibits the strongest enhancement, enabling adenine detection down to 10 microM. In contrast, no detectable adenine Raman signal is observed under 532 nm excitation, indicating that the enhancement is dominated by a UV induced chemical, charge transfer mechanism rather than conventional electromagnetic enhancement. The Cu substrates further enable the UV Raman spectroscopy of streptavidin, as a test protein, and, more interestingly, the discrimination between L and D tryptophane based solely on differences in UV SERS intensity, without chiral selectors or additional surface functionalization. By varying the substrate rotation speed during metal evaporation, the enantioselective response can be tuned, yielding L over D intensity ratios from 1.10 to 2.35 and demonstrating the critical role of substrate morphology in chiral discrimination. The dry synthesized nanoporous films provide a simpler, scalable, and ligand free fabrication strategy while offering additional capability for enantioselective detection. These findings establish dry processed nanoporous Cu films as promising platforms for UV-SERS biosensing and label free chiral analysis.
Read the full abstract
Artificial Intelligence
MineTRACE: An Evidence-Grounded Interactive Reasoning System for Mineral Prospectivity
Mineral exploration requires integrating heterogeneous geochemical, geophysical, and geological evidence, yet existing prospectivity systems often provide only opaque scores or heatmaps. We present MineTRACE, a web-based system for evidence-grounded exploration of eight commodities: Cu, Au, Ni, W, Sn, Co, Ta, and Mn. Users can explore prospectivity maps, query locations or regions, inspect supporting evidence, and interact through natural language. A transparent expert tree, informed by geological knowledge and known deposits, combines multi-source evidence into interpretable prospectivity scores. For a new location, the conversational assistant retrieves the score and supporting evidence from the analysis pipeline and presents them in natural language. The scorer achieves spatial AUC values of up to 0.917 across different test scenarios, while end-to-end evaluation assesses query accuracy and response grounding. MineTRACE makes public geoscience data easier to access, interpret, and verify, supporting more efficient and transparent mineral exploration.
Read the full abstract
Artificial Intelligence
DocHop: Benchmarking Out-of-domain Multi-hop Reasoning in Information-Dense Documents
Multimodal Large Language Models (MLLMs) have achieved strong performance on structured visual understanding tasks such as chart and document question answering. However, existing benchmarks typically evaluate these domains in isolation, leaving underexplored a key capability: whether models can use textual context to determine how chart evidence should be selected, interpreted, and aggregated. We introduce DocHop, a benchmark for integrated chart–context reasoning in document-style images. In DocHop, the document narrative specifies multi-step compositional constraints, while charts provide the corresponding data values. Questions are grounded on a semantic reference label defined in the narrative, requiring models to resolve target entities from context before aggregating evidence across multiple charts. To enable systematic evaluation, we construct DocHop via a stochastic logic-first generation pipeline with controllable reasoning depth and visual density, covering 2,074 examples across six task categories. Experiments on a wide range of proprietary and open-source MLLMs show a substantial gap to human performance: annotators achieve over 90% accuracy, while the best model reaches only 62.83%. Reasoning-enhanced models consistently show improved results, but performance degrades as reasoning complexity increases. Overall, DocHop provides a controlled testbed for challenging multi-hop document reasoning.
Read the full abstract
Instrumentation and Methods for Astrophysics
Lightweight Soft X-ray Imager (LSXI) with glass-based coded mask
The coded mask technique has been widely used in X-ray and Gamma-ray imagers, especially in space astronomy. However, the traditional design of coded mask imagers usually has problems with large size and heavy weight. Here, we propose a novel design for a coded mask imager made of glass based on microchannel plate (MCP) technology, making it lightweight (within 1 kg), compact, and self-supporting, which is very suitable for space exploration satellites. The design is initially demonstrated by reconstructing encoded patterns from measurements at the X-ray beamline. Monte Carlo simulations of the module integrated into a 6U CubeSat are conducted to assess its in-orbit detector performance, including sensitivity and source localization.
Read the full abstract
Artificial Intelligence
Monitoring Web Agents Without Internal Signals: Observable Trajectories and Key-Step Supervision
Reliable web-agent monitoring is difficult when model-internal uncertainty signals such as token logits are unavailable. In this work, we study prefix-level risk prediction for web agents using observable trajectory signals: given an evolving prefix, estimate whether the current execution remains on track or is tending toward failure. We derive two observable trajectory representations: Macro features summarize cross-step agent–environment behavior and feedback, while Micro features measure the consistency of intention, action, and anticipated state change through repeated black-box queries. Instead of inheriting the final result label, we label the first critical error that remains uncorrected in the observed continuation and is associated with final failure as a key-step boundary, preserving valid early prefixes of failed trajectories as on track. Across WebArena-Lite and Online Mind2Web web agent benchmarks with five open- and closed-source backbones, observable trajectory signals are competitive with internal-signal baselines. The resulting predictors also support early intervention under fixed false-cut budgets and transfer across held-out website categories. These findings show that observable trajectory signals support valuable risk prediction abilities.
Read the full abstract
Computation and Language
HyGRAIL: Cost-Aware and Evidence-Grounded Scientific Hypothesis Discovery over Knowledge Graphs
Scientific knowledge graphs organize entities and relations extracted from scientific literature, but they remain inherently incomplete. Missing typed links in such graphs can therefore represent plausible scientific hypotheses, such as unexplored associations between materials and applications. However, scientific hypothesis discovery is challenging because true discoveries are extremely sparse among typed candidate pairs: graph neural networks (GNNs) are efficient but unreliable for ambiguous cases, while large language models (LLMs) are knowledgeable but too costly to apply exhaustively and are not naturally grounded in graph structures. We propose HyGRAIL, a cost-aware and evidence-grounded framework that combines heterogeneous GNN triage with LLM-based hypothesis review. HyGRAIL first uses a GNN to score candidate hypotheses and identify a validation-calibrated ambiguous region, routing only graph-uncertain cases to LLM review. For each routed hypothesis, HyGRAIL retrieves node-level associations and multi-hop relational paths from the knowledge graph (KG), then converts this structured evidence into natural language through template-based or LLM-based naturalization. An LLM review agent finally judges each hard hypothesis using the naturalized evidence and validation-selected decision criteria. On MatKG, HyGRAIL achieves the best F1 score of 0.429, improving over the strongest prior baseline by 0.242 F1 points and over the GNN-only baseline by 0.322. Meanwhile, GNN triage reduces the LLM call rate by 54.36% on average. Ablation studies further show that retrieved graph evidence is crucial for reliable hypothesis verification and that compact, two-sided evidence is more effective than simply increasing retrieval quantity.
Read the full abstract
Computers and Society
Privacy Washing: Detecting Internal Contradictions in Privacy Policies
Privacy policies may contain internal contradictions in which commitments are undermined by practices documented elsewhere in the same policy. We operationalize this phenomenon, privacy washing, through a four-stage pipeline: statement extraction, compatibility filtering and natural language inference screening, multi-model judge verification, and thematic analysis, with contradictions confirmed by majority vote of a three-model LLM panel. Applied to two corpora of website privacy policies, 123 collected in 2026 (OPPT) and 115 collected in 2015 (OPP-115), the pipeline finds the same category patterns recurring across the 11-year gap, with third-party sharing contradictions the majority of confirmed cases in each primary run, consistent with structural factors in policy composition rather than necessarily intentional deception. At least one panel-confirmed contradiction appears in 12.2% of OPPT companies (15/123; 9.8% excluding legacy pairs) and 36.5% of OPP-115 companies (42/115). A stability re-run seven months later, with a fully separated configuration (new extraction models, judges from three Chinese providers absent from both corpora, matched filters, no judge-submission similarity threshold), reproduces the OPPT prevalence under the original protocol (13.0% vs. 12.2%), finds sub-threshold pairs confirm at rates of the same order as those above (raising prevalence to 20.3% and 40.9%), and shows the third-party majority is panel-sensitive while the recurrence of the same category pairs is not. Two caveats govern all figures: panel verdicts are not validated against human expert judgment, so precision is unknown and prevalence figures are lower bounds; and the two primary runs used different filter configurations, so their prevalence difference is not interpretable as a corpus or era effect (the matched re-run reduces the gap to roughly twofold but does not eliminate it).
Read the full abstract
Computation and Language
A Tri-Agent Framework for Evaluating and Aligning Question Clarification Capabilities of Large Language Models
Large Language Models (LLMs) are increasingly deployed in interactive systems where understanding user intent precisely is paramount. A key capability for such systems is effective question clarification, especially when user queries are ambiguous or underspecified. This paper introduces a novel tri-agent framework for the robust evaluation of an LLM's ability to engage in clarifying dialogue. Our framework comprises three distinct LLM-based agents: (1) a Question Clarifying Agent (QCA), the system under evaluation, tasked with identifying ambiguities and posing clarifying questions; (2) a Respondent Agent (RA), designed to simulate human user responses, potentially including irrelevant or challenging replies; and (3) an Evaluator Agent (EA), an LLM-as-a-judge, which assesses the quality of the dialogue based on a comprehensive set of metrics. We detail a methodology for synthetic data generation in the supply chain domain as an example. We propose metrics evaluating ambiguity handling, question quality, dialogue efficiency, language appropriateness, and final intent alignment. We also briefly discuss the validation of the EA against human judgments. This work provides a structured approach to benchmark, validate, and improve the clarification capabilities of conversational LLM applications.
Read the full abstract
Nuclear Theory
Impact of nuclear triaxial deformation on electromagnetic fields in relativistic $^{129}\mathrm{Xe}+^{129}\mathrm{Xe}$ collisions
Electromagnetic fields produced in relativistic heavy-ion collisions depend sensitively on the initial spatial distribution of nuclear charge. Using the Liénard–Wiechert potential with a triaxially deformed Woods–Saxon density, we calculate the transverse electric and magnetic field distributions in $^{129}\mathrm{Xe}+{}^{129}\mathrm{Xe}$ collisions at $\sqrt{s_{NN}}=5.44\text{ TeV}$. We systematically examine how the triaxiality angle $\gamma$ modifies the field structure at the collision time ($t=0$) in semi-central events, using spherical nuclear collisions as a baseline. The results show that nuclear triaxiality causes distinct spatial redistributions of both electric and magnetic fields in the transverse plane. These findings indicate that initial electromagnetic fields encode key information on intrinsic nuclear shapes, offering an additional constraint on nuclear deformation and its consequences for field-sensitive observables in heavy-ion collisions.
Read the full abstract
Operating Systems
SchedBlame: Who Ran While You Waited? Culprit-Attributed CPU Contention for Containers on Stock Kernels
Containers that share a machine compete for CPU. When one slows down, the operator needs to know which co-tenant is responsible, and no deployed signal can say. Pressure stall information, per-cgroup wait counters, and run-queue latency histograms are all victim-side: they report that a container waited, never who it waited for. Recovering the culprit means a kernel patch, full scheduler tracing, or statistical inference: unportable, too costly to leave on, or unreliable when victims coexist. SchedBlame is an eBPF tracer that attributes CPU contention to the cgroups that caused it, on stock kernels, continuously. It inverts the accounting: instead of measuring how long a victim waited, it measures the CPU time every other cgroup consumed while that victim was runnable but not running on the same CPU. The mechanism is a per-CPU bitmap of which measured cgroups are waiting, maintained from the kernel's own runnable counts at four scheduler hooks. Every run slice carries that bitmap, so one 16-byte record charges CPU time to a full row of a competitor x victim blame matrix; the kernel stores no per-pair state. Three properties follow. Slices are self-describing, so userspace holds no waiting state and a lost record costs measurements, not correctness. The measured set is reconfigured by publishing an epoch, invalidating every cache and per-CPU bitmap in constant time while the hooks keep running. Sampling never touches waiting state, so rescaling by the inverse keep probability keeps the estimator unbiased. SchedBlame splits each container's per-second CPU demand into runtime, internal contention, external contention, and throttling, flags anomalies against a rolling 99th-percentile baseline, and names the competitors responsible. In production on unmodified 4.18 and 5.10 kernels, tracking 84 containers on a 96-core host, it costs about 1% of Redis throughput and 6% of one core.
Read the full abstract
High Energy Physics (Experiment)
Observation of $\psi(3686)\to p K^- K_S^0 \bar \Xi^0+c.c.$
Using a sample of $(2.712 \pm 0.014) \times 10^{9}$ $\psi(3686)$ events collected with the BESIII detector, the decay of $\psi(3686)\to p K^- K_S^0 \bar \Xi^0+c.c.$ is observed for the first time with a statistical significance of $11.5\sigma$. The branching fraction of this decay is measured to be $(2.84\pm 0.40\pm 0.25) \times 10^{-6}$, where the first and second uncertainties are statistical and systematic, respectively. This measurement extends the experimental information on rare multi-strange $\psi(3686)$ decays and provides an experimental reference for future studies of related decay modes.
Read the full abstract
Combinatorics
Lower and upper bounds of Schur characters
Characterizations of lower and upper bounds for dual characters of flagged Weyl modules have attracted considerable interest. In this paper, we establish explicit pattern avoidance characterizations for lower and upper bounds of Schur characters, namely, the dual characters of Weyl modules associated with arbitrary diagrams. This setting extends the corresponding extremal problems for dual characters of flagged Weyl modules and includes skew Schur polynomials and, through Rothe diagrams, Stanley symmetric functions. Specifically, for a permutation $w$, we show that the Stanley symmetric function $F_w$ attains the lower bound if and only if $w$ avoids $321,2143,2413,3142$, and $3412$, and attains the upper bound if and only if $w$ avoids $312$ and $321$.
Read the full abstract
Machine Learning
The Dynamics of Continuous Mixture Collapse in Language Models
LLMs latent-state reasoning methods replace discrete intermediate tokens with continuous states, such as weighted mixtures of token embeddings, to retain multiple possible reasoning directions rather than committing to one. Yet pretrained language models often fail to preserve these mixtures. We study why through a combination of theoretical analysis and controlled empirical investigations on a variety of models. We identify three independent, distinct sources of failure. First, transformer architectures already distort mixture geometry, and training substantially amplifies this effect. Moreover, the failure can occur even if the model transports mixtures perfectly linearly: the softmax readout and autoregressive feedback form a dynamical system that either amplifies small differences until one component of the mixture dominates or contracts different mixtures until they become indistinguishable. We verify this theoretical prediction empirically: the observed transition between contraction and amplification occurs near the theoretical threshold derived by our analysis, and pretrained-model rollouts lie predominantly on the amplifying side. Finally, we generalize to mixtures of many components and show that exact preservation generally requires context-dependent correction, whose required dimensionality can grow with the number of components.