Machine Learning
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 4 September
Recent benchmarks such as PowerGraph provide large collections of power-grid graphs for cascading-failure classification. Graph neural networks (GNNs) achieve strong predictive performance on this task, but typically require end-to-end training and model-specific tuning, while their latent representations can be difficult to relate to physically meaningful propagation patterns. Random Walk Fingerprints (RWF) offer a scalable and interpretable alternative, but existing variants primarily emphasise topology and node-level information, leaving grid-relevant operational edge states in the walk dynamics. We propose Multi-Channel Physics-Aware Random Walk Fingerprints (MC-PA-RWF) for power systems, a lightweight graph-level representation framework that introduces physical edge states into random-walk propagation. The method constructs multiple edge-weighted channels from domain-relevant attributes, extracts a channel-specific fingerprint from each weighted graph, and concatenates the resulting vectors into a compact representation. Experiments on three PowerGraph benchmark systems show substantial improvements over topology-only RWF and competitive balanced accuracy against strong GNN baselines, including Graph Convolutional Networks (GCN), Graph Attention Networks (GAT), Graph Isomorphism Networks with edge features (GINE), and Transformer-based Graph Convolutional Networks (TransformerConv). At the largest evaluated settings, the node-edge extension MC-PA-RWF+ achieves around 98.04% - 99.32% balanced accuracy and improves failure-class F1 over the strongest GNN baseline by 1.60 – 5.84 percentage points, with statistically significant gains across all three systems.
Computer Vision
Learning 3D Editing without Paired Supervision via Generative Prior Distillation
Instruction-guided 3D editing is essential for interactive content creation, yet it faces a significant bottleneck: the severe scarcity of high-quality paired training data. Existing approaches attempt to bypass this by either relying on slow test-time optimization or training on pseudo-pairs constructed via complex pipelines, which often introduce structural drift and geometric artifacts. In this paper, we propose a novel framework that learns feed-forward 3D editing without paired 3D supervision via Generative Prior Distillation. Instead of relying on ground-truth 3D pairs, our core idea is to distill visual, semantic, and geometric knowledge from powerful foundation models directly into a 3D editing model. Specifically, through a differentiable rendering pipeline, we supervise the 3D representation using two complementary signals: a 2D visual prior from an image editing model at the main editing view, and a semantic prior from a Vision-Language Model at novel views to ensure strict instruction following and source identity preservation. Crucially, to address the geometric collapse and multi-view inconsistencies inherent in 2D projection supervision, we introduce a 3D-aware Distribution Matching regularization. Acting as a geometric prior, this term operates in the 3D latent space, constraining the edited output to remain within the manifold of realistic 3D assets defined by a pretrained image to 3D teacher model. Extensive experiments demonstrate that our method achieves superior instruction fidelity and cross-view consistency, significantly outperforming state-of-the-art baselines. Our project is available at: https://github.com/thiamine128/PriorEdit3D.
Read the full abstract
Plasma Physics
Revisiting kinetic electrostatic electron non-linear (KEEN) waves in the presence of dynamical ions
We revisit the kinetic electrostatic electron nonlinear (KEEN) waves studied by Afeyan et. al in 2014 using a hybrid flow-mapping strategy that combines the characteristic mapping method (CMM) with numerical flow iteration (NuFi). The study extends the classical setup to dynamical ions, comparing their impact on the long-time KEEN dynamics with the static-ion case. To this end, we extend the CMM-NuFI framework with a multi-map strategy, assigning one map to the ion and one to the electron characteristic flow. The resulting problem exhibits a wide separation of spatial and temporal scales, driven by the fine structures generated by the ponderomotive force and by the large ion-to-electron mass ratio, which renders it computationally prohibitive for conventional grid-based methods. Our multi-map CMM-NuFI method efficiently resolves these disparate scales, enabling long-time simulations of KEEN dynamics with fully dynamical ions.
Read the full abstract
Statistical Methodology
Treatment persistence drives estimator performance in longitudinal causal inference based on observational data: A simulation study
Longitudinal clinical data are increasingly available, offering opportunities to study treatment effects over time but also raising challenges related to time-varying confounding and evolving treatment decisions. We investigate how longitudinal treatment dynamics affect causal effect estimation when baseline and longitudinal methods target different causal estimands. Using a structural causal model (SCM), we simulate data with time-varying confounding, binary treatment, and an absorbing binary outcome under 9 scenarios combining functional complexity and treatment persistence. We compare three baseline and two longitudinal estimators against Monte Carlo ground-truth risk ratios (RRs) under sustained treatment regimes. Results show that treatment persistence is the main driver of estimator behaviour. High persistence reduces the discrepancy between baseline and sustained-regime estimands, making baseline estimators closer to the sustained-regime ground truth (average relative deviation of baseline IPTW/TMLE decreasing from 61% under low persistence to 10% under high persistence), whereas low persistence induces practical positivity challenges and increases the variability of longitudinal estimators, with empirical 95% interval widths increasing from 0.22 to 0.46 for longitudinal IPTW and from 0.20 to 0.36 for LTMLE when moving from high to low persistence. These findings emphasise that estimator performance should be interpreted jointly with the target intervention and the treatment process generating the observed data.
Read the full abstract
Computer Vision
LensStyle: Learning the Optical Aesthetics for Controllable Stylized Lens Effect Rendering
The visual aesthetics of photographs are deeply influenced by lens characteristics such as aperture shape, optical vignetting and optical diffraction, which together define a camera's unique optical style. Existing lens effect rendering methods primarily focus on accurately simulating the blur transition from small to large apertures but overlook the stylistic aspects of lens effects. As a result, they fail to produce diverse bokeh effects under large apertures or capture distinctive photographic phenomena such as starbursts that emerge under small apertures. In this work, we introduce LensStyle, a unified framework for controllable stylized lens effect rendering that explicitly models lens aesthetics through joint continuous-discrete control. Our model incorporates a Dual-Path Controller that disentangles continuous optical parameter modulation (e.g., focus distance and blur strength) from discrete lens-style conditioning (e.g., circular, polygonal, donut, cat-eye, and starburst effects), enabling fine-grained, interpretable, and physically grounded lens manipulation within a single unified framework. To support model training, we curate a comprehensive MultiLens dataset containing multi-lens image pairs synthesized under real optical constraints. Extensive experiments demonstrate that LensStyle achieves superior realism, controllability, and aesthetic quality compared with existing lens effect rendering approaches and diffusion-based image editing models, advancing computational photography toward multiple-lens-style simulation.
Read the full abstract
High Energy Physics (Phenomenology)
Global Fixed Point Potentials in the Abelian Higgs Model with $N$ flavors
Existence of charged fixed points in the Abelian Higgs model with $N$ flavors in $d$ dimensions is studied using the functional renormalization group. We numerically solve the coupled fixed point equations for the scale dependent charge and the non-perturbative effective potential for the scalar field. We show that the $\epsilon=4-d$ expansion, famously successful in theories with $O(N)$ symmetry, fails to produce reliable results when taking the $\epsilon \rightarrow 1$ limit. By determining global fixed point potentials, it is shown that the critical flavor number at which charged fixed points appear, modifies significantly compared to the perturbative treatment. In $d=3$, signs of a richer fixed point structure with presumably multicritical fixed points are also found. Discussions include subtleties of the gauge fixing and the corresponding modified Ward-Takahashi identities, including the possibility of a nonzero dimensionless photon mass at the infrared fixed point.
Read the full abstract
Geophysics
Bayesian inversion of multilayer $\mathrm{CO}_2$ migration from seismic plume observations using a graph-based finite-rate invasion-percolation model
Vertical migration of $\mathrm{CO}_2$ in layered sandstone reservoirs is controlled by thin shale barriers whose properties are often poorly known. We develop a Bayesian framework that uses time-lapse seismic plume observations to estimate effective parameters governing lateral and vertical $\mathrm{CO}_2$ migration. The forward model is a fast graph-based invasion-percolation model that extends conventional IP by representing both capillary-controlled filling of structural traps beneath shale barriers and finite-rate transfer through them. Parameters are inferred with approximate Bayesian computation and sequential Monte Carlo sampling, and the posterior samples are propagated into forecasts. Applied to real data from Sleipner, posterior simulations reproduce the broad distribution of $\mathrm{CO}_2$ across nine sand units and its redistribution between 2010 and 2023. In contrast, the quasi-static model fails to reproduce this temporal evolution. Complementary synthetic experiments assess parameter recovery, forecasting, monitoring duration, and model misspecification. These experiments show that the information gained from monitoring depends on the migration events captured, with breakthrough and post-breach redistribution providing particularly strong constraints. This combination of fast simulation, probabilistic updating, and interpretable effective parameters makes the framework well suited to repeated forecast revision during active injection, especially when full-physics inference is too computationally demanding.
Read the full abstract
Probability
Homogenization of anisotropic diffusion on pre-Sierpiński carpets
We investigate the restoration of isotropy for anisotropic diffusions on pre-Sierpiński carpets in the plane, a problem previously studied by Barlow, Hattori, Hattori and Watanabe \cite{BHHW} in which they obtained a weak homogenization property for the ratio of effective resistances of the anisotropic diffusions. We establish the weak convergence of these anisotropic diffusions to Brownian motion on the Sierpiński carpet. As a consequence, we give an affirmative answer to the strong homogenization conjecture raised in \cite[p.3]{BHHW}.
Read the full abstract
Statistics Theory
Testing Equality of Distributions via Repeatedly Integrated Quantile Metrics Under Weak Moment Conditions
Testing whether two independent samples arise from the same underlying distribution is a fundamental statistical problem. We propose a new class of two-sample distribution tests based on a family of probability metrics $\Delta_{n,p}$, constructed from repeatedly integrated quantile functions. On their respective domains, these metrics are proved to be genuine distributional distances. The case $n=1$ recovers the $p$-Wasserstein distance, which requires finite $p$-th moments; for $n\geq2$, the proposed metrics are well defined and require only finite first moments. The asymptotic properties of the plug-in statistic are established, including strong consistency and limiting distributions under the null and fixed alternatives. A permutation calibration for finite-sample inference is also proposed. We further derive an asymptotic power function under local alternatives. Finally, the finite-sample performance of the proposed tests is examined through simulation studies, and their reduced sensitivity to extreme upper-tail observations is illustrated through a real data application.
Read the full abstract
Differential Geometry
Weak Lie 3-groups, 2-gerbes over torus fibrations of type F1, and T-Duality
We construct a weak Lie 3-group $T_2 \mathbb B^{F_1}_n$ from the 2-category of gerbes over $\mathbb R^n / \mathbb Z^n$ and the $\mathbb R^n/ \mathbb Z^n$-action on it by pullback along translations. We also construct a homotopy equivalence between $T_2 \mathbb B^{F_1}_n$ and a different Lie 3-group $T_2 \mathbb D^{F_1}_n$, which admits a dimensional reduction to the homotopy equivalence of Lie 2-groups introduced by Nikolaus and Waldorf to model half-geometric T-duality. This is a first step towards establishing a higher form of T-duality for 2-gerbes over torus fibrations, relevant to supergravity and M-theory.
Read the full abstract
Statistical Methodology
Goodness-of-fit testing for the Pareto type-I distribution based on a mean residual life characterization
The statistical analysis of heavy-tailed data has received considerable attention because extreme observations frequently arise in many practical applications. The Pareto type-I distribution is a fundamental heavy-tailed model used in economics, finance, actuarial science, insurance, reliability, and extreme value analysis. In this paper, we propose novel goodness-of-fit tests for the Pareto distribution using a mean residual life characterization. The test statistic is constructed using U-statistic theory, and its asymptotic behaviour is established under both the null and alternative hypotheses. Its finite-sample performance is evaluated through Monte Carlo simulations using maximum-likelihood and method-of-moments estimation and compared with existing tests. The results show that the proposed test controls the nominal significance level and performs competitively in terms of power across a broad range of alternatives. Finally, the proposed methodology is illustrated using the Danish fire insurance loss and pollution datasets.
Read the full abstract
Earth and Planetary Astrophysics
Multi-Wavelength Post-Perihelion Polarimetry of Interstellar Comet 3I/ATLAS
We present new post-perihelion polarimetric observations of the third discovered interstellar object, 3I/ATLAS (C/2025 N1; hereafter 3I), obtained using FORS2 at the Very Large Telescope, ALFOSC at the Nordic Optical Telescope, and FoReRo2 at the 2 m Ritchey-Chrétien-Coudé telescope. The observations span phase angles 1-30$^{\circ}$, providing the most extensive polarimetric phase angle coverage obtained for an interstellar object to date. The post-perihelion measurements reveal that the unusual polarimetric properties of 3I persist across perihelion and match recent independent post-perihelion observations, indicating no significant evolution in the polarimetric properties. The increased phase angle coverage allowed us to further constrain the minimum polarisation to $-2.9\%$ at phase angle $5.5^{\circ}$. Multi-band BVRI observations reveal a wavelength dependence of polarisation, with the negative polarisation branch becoming deeper and shifted toward smaller phase angles at longer wavelengths. The polarimetric colour is predominantly red and increases with phase angle, consistent with behaviour observed in other comets. Imaging and polarimetric maps show a substantially more extended coma after perihelion, while the polarisation distribution itself remains smooth and spatially homogeneous. Numerical modelling suggests that the unusually deep polarisation phase curve originates from moderately porous dust aggregates consisting of weakly absorbing sub-micron monomers, resulting in much brighter dust than that in typical solar system comets.
Read the full abstract
Artificial Intelligence
Solving Hard XAI Queries Based on a Compiled Dual-Rail Encoding
The widespread adoption of artificial intelligence (AI) within real-world applications has raised a lot of concerns regarding their trustworthiness, especially in critical applications. The field of eXplainable AI (XAI) has emerged with the objective of providing explanations to the users about the decisions made by AI systems. Several explanations for boolean classifiers have been introduced in the literature, including abductive and contrastive explanations, each giving a different insight on the decision of the classifier. However, computing an explanation for a decision of a boolean classifier is a hard problem in general. One way to deal with this complexity is to rely on a compiled representation of the classifier for which each explanation can be computed efficiently. Unfortunately, we prove in this paper that several classes of abductive explanations, remain hard to compute even for Ordered Binary Decision Diagrams, one of the most tractable subsets of the knowledge compilation map. Included in such classes are shorter abductive explanations or abductive explanations that include the explainee's preferences. To recover the benefits of working with compiled representations, we show that a proper representation of the dual-rail encoding of the classifier can be used to compute efficiently these classes of explanations.
Read the full abstract
Numerical Analysis
Frequency-explicit convergence analysis of a multiscale finite element method for highly heterogeneous scattering problems
We analyze the numerical approximation of time-harmonic scattering by highly heterogeneous penetrable obstacles. These problems are especially challenging in the high-frequency regime, where the size of the scatterer $L$ is much larger than the wavelength, i.e., the wavenumber $k$ is such that $kL \gg 1$. Here, we further consider the situation where the scatterer contains different materials, with a characteristic size $\varepsilon$ such that $k\varepsilon \ll 1$. We propose a high-order multiscale finite element method, and provide an error analysis that is explicit in both $k$ and $\varepsilon$. Crucially, our error estimates suggest that using a high-order method should reduce the computational cost for large frequencies, which is corroborated by numerical examples.
Read the full abstract
Soft Condensed Matter
Liquid-liquid phase separation precedes crystallization in supercooled water-glycerol solutions
Understanding the structural evolution of supercooled water-glycerol solutions is important for cryopreservation, yet distinguishing liquid-state transformations from ice crystallization remains challenging. Here, we investigate a deeply supercooled water-glycerol solution by X-ray photon correlation spectroscopy (XPCS) in ultra-small-angle X-ray scattering (USAXS) geometry, combined with wide-angle X-ray scattering (WAXS). This combination simultaneously captures the structural and dynamical evolution of the supercooled liquid upon quenching to cryogenic temperatures (172 K). We observe discontinuous changes in the liquid structure on molecular length scales and formation of microscale domains. The dynamics slow down during this stage and exhibit hyper-diffusive, ballistic-like relaxation. This transformation precedes ice crystallization, which we identify from the emergence of ice Bragg peaks in WAXS, allowing the two processes to be temporally separated. Phase-field (Cahn-Hilliard) simulations qualitatively reproduce the experimental observations and show that a spinodal-decomposition scenario is consistent with the measured scattering evolution. These findings are consistent with a liquid-liquid phase separation scenario preceding ice crystallization and provide a route to disentangle the two processes in supercooled aqueous systems.
Read the full abstract
Optimization and Control
Open-Loop Stackelberg LQ Difference Games with Coupled-Affine Inequality Constraints: An Exact OCP–LCS/LCQP Reformulation
In this letter, we study finite-horizon linear-quadratic Stackelberg difference games with coupled-affine state-control inequality constraints. Under the stated assumptions, we show that generalized open-loop Stackelberg equilibria admit an exact reformulation as an optimal control problem subject to a discrete-time linear complementarity system. Eliminating the dynamic variables yields a large-scale linear complementarity quadratic program, together with an explicit recovery map for the follower strategy. This reformulation enables the numerical computation of these equilibria. We illustrate the proposed approach using a constrained network-flow game.
Read the full abstract
Optimization and Control
Bipolar Fuzzy Minimum-Weight Satisfiability under Continuous t-Norms: A Clause-Witness Branch-and-Bound Framework
Minimum-weight satisfiability asks for a satisfying Boolean assignment of minimum cost, while many fuzzy decision and knowledge systems operate with graded positive and negative relations rather than crisp literals. This paper introduces a bipolar fuzzy minimum-weight satisfiability problem in which positive and negative clause–variable relations, target clause levels, and variable states are represented in the unit interval. The clause requirements are expressed by bipolar fuzzy relational equalities defined with an arbitrary continuous t-norm. Classical minimum-weight CNF satisfiability is recovered as a crisp special case, independently of the selected t-norm, and an optimal Boolean solution is shown to exist in that specialization even though the proposed formulation uses continuous variables. For the graded problem, clause satisfaction is characterized through admissible variable domains and effective clause-witness sets. This structure leads to an exact clause-witness branch-and-bound method with preprocessing, propagation, lower-point closure, and a disjoint-witness packing bound. Computational experiments verify the solver against explicit witness enumeration, mixed-integer baselines, and external SATLIB formulas; on a focused graded ablation set, the packing bound reduces the median number of explored nodes by about 45 percent relative to the single-row witness bound.
Read the full abstract
Numerical Analysis
Construction of trace-preserving Fortin operators
We present a unifying framework to construct local Fortin operators for conforming mixed finite element pairs for the Stokes equations. The operators are constructed to satisfy the divergence-preservation property, local stability and approximation properties, and certain trace-preservation properties. For the latter, some of the finite element pairs require an enrichment of the velocity space. We present the construction for the $P_d-P_0$ element, the Bernardi-Raugel element, the conforming Crouzeix-Raviart element, a modified MINI element and generalised Taylor-Hood elements. Furthermore, we discuss implications of the existence of such a Fortin operator beyond inf-sup stability. These include applications to non-Newtonian fluid flow, problems with inhomogeneous Dirichlet boundary conditions, as well as uniform inf-sup stability relevant for domain approximation and moving domains.
Read the full abstract
Nuclear Theory
Thermal boundaries for relativistic fluids without a conserved charge
We study an ultrarelativistic fluid with no conserved particle number in a planar slab geometry bounded by two parallel, thermally conducting plates held at fixed (possibly different) temperatures. The fluid-wall interaction is described within kinetic theory by modeling the fluid as self-interacting radiation: a gas of bosons emitted and absorbed by the walls according to black-body laws, while mutual collisions enforce local equilibration. From this microscopic setup we derive effective boundary conditions for the hydrodynamic fields, finding that the walls behave as modified absorbing boundaries (and not as thermostats). In particular, the fluid temperature at the boundary does not generally coincide with the wall temperature. We prove that the resulting initial-boundary-value problem is well posed. When the plates are held at different temperatures, the system develops a uniform steady flow from the hotter to the colder wall, with energy density equal to the arithmetic mean of the corresponding black-body energy densities in the limit of a small temperature difference.
Read the full abstract
Optics
Relaxing Coherence Requirements on Laser Sources for Nanoscopy through Optical Fiber Technique
High numerical-aperture (NA) focusing of cylindrical vector beams (CVBs) typically requires costly, high-quality lasers to supply a stable vector pupil field. Here, we introduce fiber-conditioned vectorial nanofocusing, in which an optical-fiber-based mode-selective coupler projects a strongly distorted beam of a diode that costs two orders of magnitude less than the reference laser into radially or azimuthally polarized CVBs. A three-tolerance analysis clarifies its operating principle by establishing separate requirements for spatial state, temporal coherence and residual wavefront error. The resulting fields reproduce expected high-NA focal signatures and generate orientation-sensitive single-molecule excitation patterns consistent with reference-laser measurements, lowering the barrier to structured-light experiments.
Read the full abstract
Social and Information Networks
Who's Blocking Whom? Candidate Generation and Block Prediction on Bluesky
Blocking is a widely used tool that helps people manage unwanted interactions on social platforms. We study the problem of predicting block events on Bluesky: whether a given user will block a particular account, given recent interaction, network, activity, and content signals. Using more than three million block events and over 260 million user interactions, we examine several formulations of the directed block prediction problem, differing in which possible targets are considered and how negative examples are selected. We observe that only about 5% of user blocks are preceded by a recent direct interaction. Expanding the set of possible targets to include accounts connected through a common neighbor raises the share to about 22%, once high-degree accounts are excluded as intermediaries. Conditional on candidate inclusion, Hits@1 ranges from 61.3% to 72.4%, compared with a random baseline of 16.7%. However, predictive performance and the signals used by the models depend strongly on how candidates and comparison examples are constructed. Although our goal is to empirically analyze user behavior rather than to propose a deployable system, these findings are relevant to user-facing moderation tools that might help users identify accounts they may wish to avoid or block. In such tools, candidate generation would be a substantive design and evaluation choice rather than merely a preprocessing step.
Read the full abstract
Combinatorics
A Fixed-Point Worpitzky Identity and a Positive Binomial Transform for Type $B$ Involutions
Let $\mathcal I_n^B$ be the involutions of the hyperoctahedral group $\mathfrak B_n$, and let $\des^B$ denote the descent number with respect to the natural Coxeter order. We derive the fixed-point-refined Worpitzky identity \[ \sum_{n\ge0}\frac{\mathcal F_n(p,t)\,z^n}{(1-t)^{n+1}} =\sum_{m\ge0} \frac{(1+pz)^m\,t^m}{(1-pz)^{m+1}(1-z^2)^{m(m+1)}}, \quad \mathcal F_n(p,t)=\sum_{\pi\in\mathcal I_n^B}p^{\fixB(\pi)}t^{\des^B(\pi)}. \] Extracting the stratum with $j$ two-cycles and $f$ fixed positions yields a one-parameter deformation of the fixed-point-free Worpitzky series of Wan, Gao, Li and Yang. After the change of variables $x=t/(1+t)^2$, this deformation becomes a positive binomial transform. More precisely, if \[ P_j(x)=\sum_sD_{2j,s}x^s \] is the fixed-point-free $\gamma$-polynomial, then the transform coefficients $A_{j,r}(x)$ are determined by \[ \sum_{r\ge0}A_{j,r}(x)W^r =\sum_{s=0}^{j}D_{2j,s}x^s (1+4xW)^{2j-2s}(1+2W+4xW^2)^s, \] and the $\gamma$-polynomial of the $(j,f)$-stratum is \[ \Phi_{j,f}(x)=\sum_{r=0}^{f}\binom fr A_{j,r}(x). \] This manifestly positive transform is the main structural result of the paper. As consequences, every fixed cycle-type stratum is $\gamma$-positive and $\mathcal F_n(p,t)$ is coefficientwise $\gamma$-positive in the fixed-point variable $p$. The cases $f=0$ and $p=1$ recover, respectively, the fixed-point-free theorem of Wan–Gao–Li–Yang and the all-involution theorem of Cao–Liu. We also give explicit formulas for the first binomial layers and for the strata with one and two two-cycles.
Read the full abstract
Computer Vision
One Diffusion Model, Two Roles: Guided Trajectory Planning and Safety-Critical Scenario Generation in Closed-Loop Simulation
Diffusion probabilistic models can capture the multi-modal, interaction-rich distribution of joint future trajectories in driving scenes. We show that a single pretrained diffusion traffic model can serve two complementary roles in the autonomous driving development loop: as an ego motion planner, and as a controllable generator of safety-critical scenarios for stress-testing the planners. On the planning side, we introduce a Single-Stream Dual-Stream (SSDS) diffusion-transformer decoder that fuses scene context via joint attention rather than late cross-attention, improving closed-loop performance on nuPlan. We further propose Decoupled Annealing Posterior Sampling with Energy (DAPSE), a training-free guidance scheme that injects arbitrary energy functions at the clean-sample level, avoiding the first-order approximation errors while requiring no auxiliary networks. Beyond planning, we leverage the same diffusion model as a controllable scenario generator to create realistic long-tail driving interactions for closed-loop evaluation. Through inference-time guidance, selected agents are steered toward safety-critical behaviors, including aggressive cut-ins, lead-vehicle braking, and combined longitudinal-lateral interactions, while preserving realistic traffic behaviors. Evaluated in closed-loop nuPlan simulations with independent black-box planners, the generated scenarios expose failure modes that remain hidden under standard benchmarks. Although the SSDS-based planner achieves stronger nominal performance, it experiences larger degradation under these challenging scenarios, demonstrating that benchmark superiority does not necessarily translate to robustness. These results demonstrate that a single learned traffic prior can simultaneously improve motion planning and provide a realistic framework for systematic planner robustness evaluation.
Read the full abstract
Networking
QUASAR: Quantum Satellite Architecture and Routing Simulator
The deployment of Low Earth Orbit (LEO) satellite constellations is an important step toward global-scale quantum networking. However, evaluating satellite quantum network protocols under spatiotemporal orbital dynamics and quantum physical constraints remains computationally expensive and challenging. In this paper, we propose QUASAR, a lightweight simulator for evaluating entanglement distribution in satellite-based quantum networks. QUASAR provides a decoupled architecture that integrates dynamic orbital topologies, time-varying optical transmittance, and quantum memory decoherence into network- layer attributes. To demonstrate its capabilities, we abstract and implement two representative hardware architectures: Simultaneous Downlink and On-Orbit Stitching. We further introduce an Entanglement Distribution Rate (EDR)-Aware Spatiotemporal Routing (EASR) heuristic as a reference workload. Our case study examines how QUASAR supports different satellite architectures, routing workloads, realistic orbital traces, concurrent requests, and scalable event-driven execution. With over 85% lower network-layer update latency than continuous polling, QUASAR provides a practical and extensible framework for future satellite quantum network protocol evaluation.
Read the full abstract
Rings and Algebras
The ozone group of $U_q^+(B_2)$
We determine the ozone group of \(U_q^{+}(B_2)\). More precisely, if \(\ell=\operatorname{ord}(q^2)\) when \(q\) is a root of unity, we obtain $$ \operatorname{Oz}(U_q^{+}(B_2)) \cong \begin{cases} \mu_2 , & \text{if \(q\) is not a root of unity},\\[2mm] \mu_{\gcd(\ell,2)}, & \text{if \(q\) is a primitive \(m\)-th root of unity, \(m\geq5\).} \end{cases} $$ We also study several homological properties of \(U_q^{+}(B_2)\), showing that it is Artin–Schelter regular of global dimension \(4\), Auslander-regular, Cohen–Macaulay, strongly Noetherian, and skew Calabi–Yau. Using two different iterated Ore presentations, we show that its Nakayama automorphism is trivial for every $q \in \K^*$, so $U_q^{+}(B_2)$ is Calabi–Yau of dimension $4$; for $q$ not a root of unity this also follows from work of Goodearl and Yakimov. When $q$ is a primitive $m$-th root of unity with $m\geq5$, we deduce that the center is Gorenstein, we check directly that the ozone group acts with trivial homological determinant, and we describe the nonzero normal elements in terms of the ozone group.
Read the full abstract
Differential Geometry
Rectangular Pegs on Jordan Curves of Finite $p$-Variation
We prove that every planar Jordan curve of finite \(p\)-variation, with \(1\leq p<2\), inscribes a rectangle of every prescribed similarity class. In particular, every such curve inscribes a square. The proof combines the recent criterion of Asano and Ike with a variation-controlled approximation argument. We show that for every \(q>p\), a Jordan curve of finite \(p\)-variation can be approximated in the \(q\)-variation topology by smooth Jordan embeddings. The construction uses simple polygonal interpolants of Boedihardjo and Geng, an elementary interpolation inequality between variation seminorms, and a variation-controlled smoothing of polygonal embeddings. Young integration then gives locally uniform convergence of the associated primitives.
Read the full abstract
Artificial Intelligence
Artificial Intelligence in Equity and Crypto Markets: Progress, Profitability Evidence, and the Limits of Automated Investing
Artificial intelligence (AI) now supports investment workflows from data and prediction through research, portfolios, execution, and tool use. Technical capability, however, is not evidence of investment profitability. This critical state-of-the-art review examines public research available through 31 August 2026 on listed equities, exchange-traded funds, centralized crypto spot, perpetual futures, and on-chain markets. We organize evidence with an alpha-translation chain: point-in-time information must yield a stable signal, feasible positions, executable orders, and risk-adjusted returns after costs. Across machine learning, time-series foundation models, financial language models, reinforcement learning, and agents, the examined record shows real but mainly upstream progress in prediction, text processing, portfolio design, and workflow integration. Evidence is thinner for durable net performance. Temporal contamination, repeated selection, survivorship, weak benchmarks, implementation costs, venue mechanics, and capacity can break translation to net alpha. Strong historical results coexist with predictor decay, corrected look-ahead failures, mixed prospective evidence, and few audited live-capital records. Crypto adds informative state but requires separate treatment of spot, perpetual, and decentralized cash flows and execution. Within the public evidence examined here, no general AI architecture is shown to deliver persistent, cross-regime, capacity-aware net alpha. More credible claims require point-in-time data and models, decision-aligned objectives, joint portfolio–execution evaluation, controlled adaptation, prospective tests, and authority-matched governance. These conditions can improve evidence and implementation; they do not guarantee profit.
Read the full abstract
Information Theory
Minimum Schubert Codewords and Second-Minimum Grassmann Codewords
In this paper, we give a classification of the minimum weight codewords of Schubert codes $C_\alpha(\ell, m)$ by settling the conjecture proposed by Ghorpade and Singh in 2018, for all values of $q$ and all $\alpha$. We use this classification to prove that a codeword of the Grassmann code $C(\ell, m)$ has the second minimum weight if and only if it is indexed by an element of $\bigwedge^{m-\ell}V$ that can be written as the product of a decomposable $(m-\ell-2)$-vector and an alternating $2$-vector of rank $4$. Finally, we give an enumeration of the second minimum weight codewords of the Grassmann code.
Read the full abstract
Artificial Intelligence
Compact-Memory LLM Agents via Online Max-Member Clustering and Atom-Aware Packing
Many long-horizon LLM deployments face tight prompt budgets: latency, cost, and context limits make full-context prompting impractical as interaction length grows. The key question is then not raw recall alone, but which memory design gives the best quality–token trade-off in the compact-memory regime. We present RSM-full, an online clustered-memory pipeline designed for a strong quality–token Pareto point. RSM-full combines two design choices: a cosine-gated max-member merge write rule and an atom-aware grouped context packer. On AMA-Bench, our primary compact-memory benchmark, it reaches $83%$ of Full-Context quality at $32%$ of the token cost at a $4$k budget; under four-seed averaging it beats the closest streaming-clustered baseline (Online K-Means) by $+3.5$–$6.0$,pp ($p{<}.001$) across the whole ${\sim}2.6$k–${\sim}5$k regime. Three-seed ablations show most of this gain comes from the merge rule ($+5.7$,pp over Online K-Means and matched-$\tau$ DP-means) and the grouped packer ($+5.0$,pp over flat concatenation). The pattern reproduces on RealMem, an independent long-horizon persona-memory benchmark: RSM-full improves on Budget-RAG ($+0.69$,pp, $p{=}.006$), is on par with BM25-RAG (paired $\Delta{=}{+}0.27$,pp, $p{=}.47$; we do not claim BM25 equivalence in the equivalence-test sense), and significantly outperforms Streaming-Proto ($+2.97$,pp) and the closest reproduced 2025 agentic-memory baseline A-MEM ($+1.65$,pp, $p{<}.001$). Across benchmarks the message is consistent: under tight budgets, compact-memory performance is driven mainly by how streaming memories are merged and how retrieved content is assembled. Overall, RSM-full is most useful when answeroughly $2k$–$5k$ prompt tokens, where itdefines a strong compact-memory Pareto point; higher-token baselines remain stronger outside this regime.
Read the full abstract
Chemical Physics
Derivation of the Sample-Size Scaling of TWO-NN Intrinsic-Dimension Estimates from Molecular Dynamics Trajectories
The intrinsic dimension of a dataset is the number of independent directions needed to describe the space occupied by its data. Nearest-neighbor estimators infer it from how the probability of finding a neighbor grows around each sampled point. Because the neighbor distances $r$ decrease as the sample grows, the estimated dimension can depend strongly on the number $N$ of available points, which in molecular dynamics is set by trajectory length and saving frequency. We derive the large-sample behavior of the TWO-NN estimator for data drawn from a smooth $d$-dimensional space. The typical nearest-neighbor distance scales as $N^{-1/d}$, and smooth deviations from local uniformity produce corrections in powers of $N^{-2/d}$. Isotropic noise adds a correction proportional to $N^{+2/d}$; for a five-dimensional hyperplane in 100 noisy features, the extended expansion recovers the dimension within a few percent when noise is moderate. We test the scaling on ten independent 100 $\mu$s simulations of alanine dipeptide, represented by the pairwise distances among its ten heavy atoms, whose geometric dimension is $3n_{\mathrm{at}}-6=24$. Over the investigated range, the estimate does not depend systematically on the temporal spacing between configurations, but increases from $7.6$ to $15.6$ as $N$ grows from $10^2$ to $2\times10^5$. Extrapolations that retain corrections through $r^2$, $r^4$, and $r^6$ give limiting dimensions of $24.81$, $23.47$, and $25.30$, respectively. All three estimates lie within 6% of the known dimension and bracket it, and their spread measures the uncertainty due to truncation. The derived scaling provides a practical route from finite-sample estimates to the geometric dimension.