Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 28 August
In this work, we present the first analysis of low-degree polynomial threshold functions for the natural hypothesis testing problem of detecting the noisy random lift of a base $d$-regular graph from a uniformly random $d$-regular graph. Along the way, we obtain a new result for the distribution of short cycle counts in noisy random lift up to logarithmic lengths, which generalizes results by McKay, Wormald, and Wysocka and by Johnson in the case of random regular graphs, and results by Greenhill, Janson, and Ruciński and by Fortin and Rudinsky in the case of random lifts.
Earth and Planetary Astrophysics
A Clearer View of HAT-P-1 b: JWST NIRSpec G395H Reveals Water, Carbon Dioxide, and Possibly Hydrogen Sulfide
As part of JWST's Exoplanet Grand Tour Survey, we use panchromatic transmission spectroscopy to connect HAT-P-1 b's previously studied optical and near-infrared atmosphere to the longer-wavelength molecular bands accessible with JWST. We present JWST NIRSpec G395H transmission spectroscopy of the hot Jupiter HAT-P-1 b over 2.7–5.3~$\mu$m, and combine the new spectrum with archival HST STIS and WFC3 observations for a 0.3–5.3~$\mu$m atmospheric analysis. We independently reduce the JWST data with the Eureka!, FIREFLy, and Tswift pipelines, finding mutually consistent transmission spectra across the G395H bandpass. Atmospheric retrievals yield strong evidence for H$_2$O and CO$_2$ with Bayes factors of $\log_{10}B_{\mathrm{H_2O}}=8.9$ and $\log_{10}B_{\mathrm{CO_2}}=52.3$, while providing tentative evidence for H$_2$S ($\log_{10}B_{\mathrm{H_2S}}=1.4$). The joint H$_2$O and CO$_2$ constraints favor an atmosphere near chemical equilibrium, with $\log_{10} \text{M/H}=0.99^{+0.19}_{-0.14}$, corresponding to $\sim10\times$ Solar or $\sim9\times$ relative to the near-solar metallicity host star, and a 3$\sigma$ upper limit of C/O $<0.52$. Because H$_2$O and CO$_2$ provide a metallicity comparatively insensitive to vertical mixing in this temperature regime, their combined detection suggests the composition is dominated by bulk enrichment rather than strong disequilibrium transport. We find no significant evidence for clouds; instead, the persistence of molecular structure across the spectrum argues against strong cloud muting. The tentative H$_2$S signal, if confirmed, would further suggest limited photochemical processing at the pressures probed. Together, the molecular inventory, enriched metallicity, and low C/O ratio point to an oxygen-rich atmosphere and establish HAT-P-1 b as a benchmark for comparative studies of hot-Jupiter atmospheric composition.
Read the full abstract
Fluid Dynamics
Compaction in a deformable porous cylinder with elastic boundaries
Perfusion of soft materials such as biological tissue or hydrogels is essential for the functioning of organ and laboratory systems such as chromatographic columns and bioreactors. Inspired by these applications, we model fluid-driven compaction in a long, thin cylindrical porous medium bounded by an impermeable elastic membrane and study how flow regimes relate to elastic parameters. Using a Lagrangian formulation of Darcy flow coupled to small-strain linear elasticity with porosity dependent permeability and elastic moduli, we perform an asymptotic reduction in the small aspect ratio limit and obtain a leading-order nonlinear diffusion equation for the porosity, which we solve numerically. Whereas rigid boundaries produce a compaction plateau, compliant walls exhibit, at most, an intermediate plateau beyond which the flow increases once the imposed pressure becomes comparable to the product of membrane stiffness and initial porosity. When the membrane is less stiff than the porous medium, flow rate can exceed that expected for a rigid medium. A parameter space map distinguishes regimes where plateau and breakthrough occur, where the steady flow rate is below (sub-Darcy) or above (super-Darcy) the undeformable-medium prediction, and delineates the small-strain domain in which the theory applies. An asymptotic solution for negligible gravity captures the departure from the plateau and yields compact expressions for effective permeability and flow rate.
Read the full abstract
High Energy Astrophysical Phenomena
Exploring the sensitivity of in-ice radio detectors to cosmic ray mass composition
In-ice radio detectors have been developed primarily for the detection of high-energy neutrinos via the Askaryan effect, but have recently been shown to also be sensitive to cosmic ray air showers impacting the ice sheet. Using CORSIKA 8 to simulate impacting air showers, we find that the lateral width of the in-ice cascade is sensitive to the atomic mass of the primary cosmic ray. The width of the shower core is accessible through the shape of the Askaryan radio spectrum, while the amplitude encodes the total in-ice charge excess. Using these two observables, we show that in-ice radio detectors can be used to measure cosmic ray mass composition in the region above $10^{17}$eV if the in-ice receivers are placed to adequately sample the Askaryan emission pattern. We also show that the in-ice core width is highly, but not exactly, correlated with the depth of maximum particle count ($\mathrm{X}_{\mathrm{max}}$), the most commonly used observable for reconstructing cosmic ray mass composition.
Read the full abstract
Quantum Physics
Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware
We experimentally study error mitigation and finite-shot sampling on superconducting quantum hardware under a constrained execution budget. The study combines calibration-aware qubit selection, circuit-depth scaling, zero-noise extrapolation, dynamical decoupling, readout-error mitigation, and repeated-shot estimation on an IBM Quantum processor. Experiments are organized across ideal simulation, noise-model simulation, and physical-device execution to separate sampling uncertainty from device-induced error. We investigate how mitigation performance changes with circuit depth, effective noise scale, qubit connectivity, and measurement budget, and quantify accuracy using expectation-value error, mean-squared error, statistical uncertainty, and mitigation gain. A fixed hardware-execution budget is used to evaluate shot allocation strategies and repeated measurements without relying on unlimited sampling. The resulting analysis provides a hardware-aware characterization of when mitigation improves expectation-value estimation and when finite-shot fluctuations offset the benefit of additional mitigation overhead. The implementation uses contemporary Qiskit and IBM Quantum Runtime workflows and is designed to provide reproducible experimental evidence for error-mitigation studies on current quantum processors.
Read the full abstract
Artificial Intelligence
InstructMesh: Selective Refinement of Generative 3D Models for Fabrication
Recent advances in generative AI allow users to create 3D models from text or images. However, these models prioritize visual plausibility over geometric accuracy, often generating results with flaws that compromise their intended use post-fabrication. We present InstructMesh, an interactive post-generation refinement tool that enables selective repair of generative 3D models through region selection and targeted operations, such as opening or sealing voids, or adjusting local thickness. Users can invoke edit operations via natural language prompts or slider controls. By operating directly on the intermediate latent representation, InstructMesh allows users to apply robust geometric corrections without requiring expert modeling skills. To inform our design, we first analyze common fabrication-related failure modes in outputs from state-of-the-art generative tools. We then conduct two user studies, demonstrating that novices can identify and perform fabrication-relevant repairs on generative outputs using InstructMesh, and revealing user preference for hybrid interfaces that combine slider controls with natural language input.
Read the full abstract
Systems and Control
Targeted Power System Frequency Attack via the Selection of Maliciously Controlled Inverters
This paper studies how an adversary can execute a power system frequency attack by choosing the most effective subset of inverter-based resources (IBRs) as malicious control nodes. During the attack, the adversary controls the attacking devices to destabilize a group of designated target generators. The attack is designed by introducing an unstable oscillatory mode whose eigenvector has large components at the target generators and small components at the compromised IBRs. We formalize the optimal attacker selection problem and present an equivalent mixed-integer quadratically constrained program (MIQCP). To address this combinatorial nonconvex problem, we develop two heuristic algorithms by introducing a ranking metric. The attack process is demonstrated on a modified WSCC 179-bus system, with results verified through nonlinear dynamic simulations. We show that the proposed heuristics find optimal attacking sets in a majority of evaluated scenarios while significantly reducing the required computational time. Scenarios from the ACTIVSg500 system are used to further support our results. Finally, we discuss how selecting different eigenvalues, targets, and numbers of compromised devices impact the attack's severity.
Read the full abstract
Networking
xTRUCE: A Provably Safe Arbiter for Multi-xApp Conflict Mitigation in Agentic O-RAN
The open radio access network (O-RAN) is evolving toward agentic operation, where large language model (LLM)-driven xApps/rApps generate control proposals under operator intents. However, such proposals may be conflicting, infeasible, or hallucinated, and no existing system jointly provides proposal-independent safety, priority-aware reconciliation, and traceable feedback. To this end, we propose a provably safe arbiter, namely xTRUCE, in the near-real-time (Near-RT) RAN intelligent controller for mitigating multi-xApp conflicts in gNB control. We first develop a structured xApp proposal interface and a three-layer constraint hierarchy that places physical limits and operator-defined rules above relaxable performance targets, alongside a dual-timescale control action space. A two-stage arbitration mechanism then minimizes target shortfalls in the operator-priority order to finalize safe E2 actions within the Near-RT latency budget, while returning conflict certificates to xApps and the operator for renegotiation. Finally, we implement xTRUCE in a multi-cell O-RAN use case, and evaluate its multi-process prototype through simulations with live API-backed LLM xApps and over-the-air experiments on OpenAirInterface/FlexRIC-based O-RAN stacks. Results show that xTRUCE ensures gNB control safety with $100\%$ protected services despite severe proposal hallucinations, achieves priority-consistent performance satisfaction under overload, efficiently guides LLM intent renegotiation via certificates, and keeps a delay-safe E2 control loop.
Read the full abstract
High Energy Physics (Theory)
Positivity constraints on the dynamics of cusped impurities in CFTs
The cusp anomalous dimension is the universal logarithmic contribution to the free energy of a line defect with a cusp, and provides a useful observable characterizing defect dynamics. We generalize this notion to cusped line defects in the presence of a planar conformal boundary or interface. The geometry is characterized by three angles, and the distance of the cusp from the boundary or interface which separates short-distance and long-distance regimes. The resulting free energy contains two large logarithmic terms: a short-distance contribution governed by the usual vacuum cusp anomalous dimension, and a new long-distance contribution sensitive to the boundary or interface. Using reflection positivity for transverse deformations of the defect rays, we derive several constraints on the coefficients of these logarithmic terms, which can be packaged into negative semi-definiteness of their angular Hessians. We also derive constraints on the continuation of these coefficients to Lorentzian kinematics. We compute these coefficients and verify the constraints explicitly in free scalar and Maxwell theories and in planar $\mathcal N=4$ super-Yang-Mills theory at weak coupling for various choices of boundary conditions. At strong coupling, we compute the logarithmic coefficients in the holographic D3-D5 defect CFT and find a Gross-Ooguri-like phase transition between competing string worldsheets driven by the geometry of the cusp relative to the interface. We also observe a close connection of the cusp free energy in this setup with holographic corner entanglement entropy.
Read the full abstract
Optimization and Control
On Nonsmooth and Relatively Weakly Convex Minimization
Composite optimization plays a central role in modern machine learning and signal processing, as it offers a natural balance between data fidelity and structural properties. In this paper, we study composite optimization in the setting where both components are nonsmooth and nonconvex. We start with a deterministic Bregman proximal subgradient method that converges under subgradient upper-bound conditions. This approach relaxes the standard requirement on the convexity of the regularization term, thus accommodating a broader range of applications. To extend this to the stochastic regime, we develop a model-based minimization method under a relative Lipschitz condition and establish a convergence rate of $\mathcal{O}(\varepsilon^{-4})$. We also extend the framework with convergence guarantees to the setting where the distance generating function and its gradient are accessible only through a stochastic oracle.
Read the full abstract
Cryptography and Security
Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
Central Bank Digital Currency (CBDC) interbank settlement systems operating on Distributed Ledger Technology (DLT) face a fundamental trade-off: blockchain transparency enables trustless verification but exposes commercially sensitive bilateral transaction flows to all network participants. We propose a confidential interbank settlement protocol for permissioned Ethereum-compatible networks that resolves this tension through a relaxed sender anonymity model tailored to regulatory AML/CFT requirements. In this model, the initiating institution remains publicly identifiable on-chain for accountability and compliance, while the receiving institution, transfer amount, and business payload are cryptographically obfuscated. We realize the protocol on Hyperledger Besu using QBFT consensus, combining Groth16 zero-knowledge proofs over BN254, Poseidon hash commitments in an incremental Merkle tree, multi-recipient ECIES payload encryption, and an on-chain NoteRegistry contract that stores encrypted notes as an append-only ledger log, eliminating trusted off-chain custody servers. The protocol supports shield, confidential transfer, and unshield state transitions. Experimental evaluation across a five-node network (three commercial banks, a central bank operator, and a securities depository) demonstrates end-to-end settlement in 8-16 s, proof verification overhead of about 1 ms (around 220k gas) via EVM precompiles, and client proof generation in 4-12 s on commodity ARM hardware. While receiver confidentiality is established at the protocol level, the current proof-of-concept NoteRegistry uses owner-indexed events, a trade-off addressable in production via uniform event broadcasting.
Read the full abstract
Probability
Strong solutions of SDEs with critical discontinuities in diffusion coefficients
We prove strong existence for Itô SDEs with diffusion coefficients that can introduce strong attraction to a submanifold. We extend and strengthen the Röckner-Zhao approach, which uses Malliavin calculus to establish compactness of the approximating solutions in Wiener-Sobolev space. At least when the diffusion coefficients are sufficiently regular in time, this provides an alternative to Krylov's recent proof of strong existence via analysis of the Itô-Duhamel series.
Read the full abstract
Soft Condensed Matter
Hierarchical organization governs nonlinear mechanical reversibility in $\iota$-carrageenan gels
Carrageenan gels are thermoreversible polysaccharide networks whose mechanical properties emerge from ion-mediated helix association, yet how their molecular organization controls nonlinear deformation remains poorly understood. Here, we investigate the temperature-dependent rheology of $\iota$-carrageenan gels formed in KCl solutions using linear and nonlinear oscillatory rheology combined with normal-force measurements. $\iota$-carrageenan forms homogeneous and mechanically reversible gels whose elastic modulus increases continuously with quench depth. Deep quenches generate pronounced strain stiffening before yielding, associated with the development of internal stresses revealed by negative normal forces. Remarkably, large deformations preserve the small-strain elastic modulus while progressively suppressing strain stiffening, demonstrating a partial mechanical reversibility of the network. We interpret these observations using a hierarchical network picture in which a persistent intermolecular network controls linear elasticity, while a more fragile mesoscale organization enables cooperative alignment and stress amplification under deformation. Our results highlight that nonlinear mechanics of thermoreversible polysaccharide gels are governed not only by molecular connectivity, but also by the reversible formation and eventually destruction of mechanically adaptive hierarchical structures.
Read the full abstract
Social and Information Networks
Understanding Venture Capital Syndication in Information Technology Sectors: A Network Formation Perspective
Venture capital syndication enables investors to pool diligence, share risk, and signal venture quality, while shaping the relationships through which investment networks develop. We examine how prior relationships, network embeddedness, and organizational similarity structure annual co-investment link formation in U.S. information technology venture finance. Using dyad-complete PitchBook panels for the hardware, software, and hybrid subsectors from 1966 to 2024, we test seven mechanisms through full-sample dyadic logit models with dyad-clustered standard errors. Across subsectors, prior collaboration is the most consistent correlate of co-investment; shared partners, geographic proximity, and organizational-type similarity are also positively associated with link formation, while domain overlap, prominence, and experience vary across settings. A static ERGM of the 2024 software network among 1,100 persistently active investors likewise produces positive estimates for triadic closure and geographic homophily and a smaller positive estimate for type homophily. By combining complete dyadic risk sets with a whole-network specification, the study shows how relational persistence, network closure, and homophily jointly structure IT venture syndication networks. In future work, we will extend the analysis with temporal network models, counterfactual simulations of market shocks, and evaluations of network-aware partner recommendations.
Read the full abstract
Fluid Dynamics
A physics-constrained machine-learning sub-grid-scale modeling approach for turbulent premixed flames
A physics-embedded training framework is used to close the sub-grid-scale dynamics of turbulent premixed flames. The trained model augments the resolved flow equations and is trained to match its predicted flow field to trusted data. An end-to-end optimization of the coupled resolved equations and embedded model leads to a model that is robust and effective for a freely propagating premixed flame in turbulence, modeled by a single-species, single-step, and irreversible chemical reaction. Important constraints are built into the training formulation for conservation, scalar boundedness, and equivariance. The model is scaled based on the residual of the resolved flow equations to focus its influence where the closure is needed. It outperforms other cases considered — no-model, dynamic closure, and the same machine learning model trained directly to fit the residual data — for a long-time simulation, correcting the turbulence dissipation and flame kinematics. Finally, it is shown how the prediction-based training better informs the model than the precise residual data.
Read the full abstract
Computer Vision
Texture Image Classification Using DWT AlexNet Feature Fusion and Deep Neural Networks
Texture image classification plays a significant role in computer vision applications, including industrial inspection, medical image analysis, remote sensing, and object recognition. Handcrafted features can capture local texture characteristics but may have limited capability to represent complex visual patterns. In contrast, deep learning models automatically learn discriminative representations but may not fully exploit the multiscale spatial-frequency information inherent in texture images. This paper proposes a hybrid feature fusion framework, termed DWT_AlexNet_DNN, which combines Discrete Wavelet Transform (DWT) features with deep features extracted using AlexNet for texture image classification.
Read the full abstract
High Energy Astrophysical Phenomena
Distinct Modes of Pulsar Glitch Activity Revealed by the Waiting-Time–Amplitude Morphology
Pulsar glitches display diverse behaviors. They are commonly labeled as "Vela-like" or "Crab-like," yet these qualitative categories do not provide reproducible quantitative boundaries. We constructed an objective classification scheme based on the joint distribution of backward waiting time $\Delta t_{-}$ and fractional glitch amplitude $\Delta\nu/\nu$. A sample of 349 glitches from 22 pulsars was compiled by cross-matching the Jodrell Bank and ATNF glitch databases. For each source, we used two-dimensional kernel density estimation (KDE) together with highest-density regions (HDRs) to derive geometric descriptors, including the HDR area, anisotropy ratio, and out-of-HDR fraction. Hierarchical clustering of the KDE–HDR descriptors revealed two morphology classes independent of visual inspection. In this convention, the Compact class is associated with small HDR areas, elevated anisotropy, and limited peripheral occupancy. The Extended class is associated with broader HDR occupancy and stronger low-density extensions. We found that bootstrap resampling and hyperparameter sensitivity tests confirmed this partition for most sources. Nevertheless, two prolific pulsars (PSR J0537-6910 and PSR J1341-6220) were found to occupy intermediate positions. Logistic regression identified the mean backward waiting time $\langle\Delta t_{-}\rangle$ as the strongest class predictor (in-sample $\mathrm{AUC}=0.88$; leave-one-out $\mathrm{AUC}_{\mathrm{CV}}=0.59$, reflecting the limited sample size). Additionally, a parallel analysis using $\Delta t_{+}$ recovered the same two-class structure but with reduced stability. The data suggest that the Compact class is consistent with near-complete reservoir depletion, whereas the Extended class reflects partial, avalanche-like releases. As a result, short-term measurements of $G$ in Extended-class pulsars may underestimate the true crustal superfluid fraction.
Read the full abstract
Solar and Stellar Astrophysics
An All-Sky Catalog of 6.5 Million Primary Red Clump Stars from Gaia DR3 XP Spectra
Red clump (RC) stars are excellent standard candles for mapping the three-dimensional structure of the Milky Way. We construct an all-sky catalog of 6.5 million primary RC stars using spectroscopic estimates of asteroseismic parameters inferred from Gaia DR3 low-resolution XP spectra. We train a mixture density network (MDN) on a cross-matched sample. The network maps each 343-dimensional corrected XP spectrum to estimates of $\Delta\Pi_{1}$, the asymptotic period spacing of dipole gravity modes, and $\Delta\nu$, the large frequency separation. We select primary RC stars using these two estimates. We release two complementary catalogs defined by different parameter-space cuts and thresholds: a high-purity Tier 1 sample of 532,189 stars with 97% purity and a high-completeness Tier 2 sample of 6,534,931 stars with 86% completeness. Both catalogs cover the full celestial sphere. We provide distances and extinction values for all stars. We obtain a median photometric distance precision of 6% for Tier 1 RC stars. Using the resultant distances, we independently calibrate the Gaia DR3 parallax zero-point offset. The three-dimensional density distribution traced by the Tier 2 sample extends continuously to $R\approx25$ kpc. Both catalogs are publicly available. These catalogs provide a valuable resource for Galactic archaeology, delivering a homogeneous dataset to trace the chemo-dynamical evolution of the Milky Way and to calibrate models of stellar populations.
Read the full abstract
Materials Science
Modifying van der Waals Materials via Cavity Vacuum Fluctuations
In the field of cavity quantum materials, vacuum fluctuations of optical cavities are used for modifying ground-state properties of quantum materials without external driving. Here, one example is the van der Waals (vdW)/dispersion interaction in layered 2D vdW materials, where non-additive long-range correlations can dominate the interlayer binding. While cavity-induced changes of such interactions have been predicted and described using ab initio methods for molecular systems, no efficient description exists yet for extended materials. In this Letter, we close this gap by introducing a periodic formulation of the photon many-body dispersion (pMBD) functional within quantum electrodynamical density-functional theory (QEDFT). Applying this method with efficient $\textbf{q}$-point sampling to bilayer hBN and graphene, we predict cavity-modified stacking, increased equilibrium interlayer distances, and softened layer breathing modes with increasing light-matter coupling strength. Our results establish cavity vacuum fluctuations as a tuning knob for the structural properties of vdW materials.
Read the full abstract
Combinatorics
Inequalities for rank-two permanents and finite free convolutions
Bang (1976) proved the inequality for matrix permanents $\mathrm{per}^2(A) \geq 2^{-2n}\mathrm{per}(A \otimes J_2)$, where $J_2$ is the $2 \times 2$ all-ones matrix and $A$ is any $n \times n$ matrix with non-negative entries. We show that, if $A$ is any $n \times n$ real-valued matrix with rank at most two (possibly having negative entries), this inequality can be sharpened, replacing the constant $2^{-2n}$ by $1 / \binom{2n}{n} = (n!)^2 / (2n)! > 2^{-2n}$. We then show that this sharpened inequality also implies new inequalities for finite free convolutions of polynomials: if $p$ and $q$ are monic real-rooted polynomials of degree $n$, then $(p \boxplus_n q)(x)^2 \geq (p^2 \boxplus_{2n} q^2)(x)$ and $(p \boxtimes_n q)(x)^2 \geq (p^2 \boxtimes_{2n} q^2)(x)$ for all $x \in \mathbb{R}$, for $\boxplus_n$ and $\boxtimes_n$ the finite free additive and multiplicative convolution operations, respectively, on polynomials of degree $n$.
Read the full abstract
Quantum Physics
Beyond sensitivity: mechanism-resolved error budgets for designing quantum sensors
Quantum sensors are specified by a headline sensitivity, yet applications also demand accuracy and reliability. The dominant limiter of one metric is often known, but no method resolves how interacting mechanisms combine into a signed, per-mechanism budget for each metric. We introduce a framework that computes a sensor's sensitivity, accuracy, and robustness from one open-system simulation and attributes each to its limiting mechanism. For a nitrogen-vacancy diamond ensemble the attribution inverts across metrics: dephasing limits sensitivity, the thermal ground-state shift limits accuracy, and optical leakage limits robustness. At identical sensitivity the recovered-field bias spans $8$ to $1500$\,nT, so tuning to sensitivity alone can miss the accuracy target by two orders of magnitude. The same modeling transfers to a cesium optically pumped magnetometer recording a human magnetocardiogram. As a digital twin, it predicts the gain from addressing each limiter, so sensors can be designed to the required metrics.
Read the full abstract
Artificial Intelligence
When Robots Mishear Us: Mapping the Safety Risks of Voice-Controlled Embodied AI
We investigate whether automatic speech recognition (ASR) errors in user input can lead to unsafe outputs from Embodied AI (EAI) models. We find that ASR errors can lead to harmful instructions being accepted and executed by EAI models, thereby reducing safety. We simulate ASR errors and combine them with existing safety benchmarks (SafeAgentBench and POEX) to evaluate how different errors affect embodied AI safety. We find that some of them preserve semantic structure but increase harmful ambiguity, while others weaken the model refusal behaviour and allow unsafe plans to be generated and executed. We show that in some cases automatic correction of ASR errors can reduce the risk, but this is not always effective. Overall, we show that ASR errors lead to significant safety risks for embodied AI.
Read the full abstract
Computer Vision
Learning the Target Priors Before Image Translation: A Decoupled Training Paradigm for Cross-Modal Image Translation in Remote Sensing
Cross-modal image translation in remote sensing must preserve source-observed content while matching the target-domain distribution. Existing methods jointly learn the target prior and cross-modal dependence from scarce paired data, overlooking a key asymmetry: only the latter intrinsically requires cross-modal correspondence. We formalize this distinction through conditional-score and denoising-risk analyses and propose Learning the Target Priors Before Image Translation (LTP-BIT), a prior-first paradigm that decouples the two learning tasks. LTP-BIT first learns a target-domain generative prior from large-scale unpaired imagery, then retains the pretrained backbone weights and learns source-conditioned control through P-DART, a parameter-efficient dual-stream architecture. Controlled experiments show that prior matching and scaling primarily improve target-domain realism, whereas instance fidelity relies more strongly on conditional adaptation. LTP-BIT achieves state-of-the-art performance across SAR-to-RGB and NIR-to-RGB benchmarks using only 9.81% task-specific parameters. On QXS-SAROPT, it retains near-full-data instance fidelity with only 25% of the paired samples.
Read the full abstract
Chemical Physics
A reaction volume bias Monte Carlo trial for sampling chemisorption in confinement
Molecular modeling of chemisorption with Monte Carlo requires the development of new trial moves to efficiently sample complex fluids such as water in Bronsted acid zeolites. Here, we develop a reaction volume bias (RxVB) Monte Carlo trial for modeling chemisorption by combining identity-switch and aggregation-volume-bias (AVB) moves. This method aims to promote the sampling of reactions by choosing reactive pairs that are within an arbitrarily specified reaction volume. The RxVB move achieves up to a 90-fold increase in accepted reaction events over unbiased moves in a single-site slit-pore model, corresponding to a 70-fold gain in statistical efficiency after accounting for computational overhead. But when the same move is applied to water in a Bronsted acid zeolite without orientational bias, there is no measurable speedup for a single MFI unit cell. We demonstrate a simple expression that predicts the maximum efficiency increase in the simplest case where selecting reactants that are near each other is the major sampling bottleneck. Dense water systems may require additional configuration-bias or orientational bias to improve sampling of the hydrogen bond network in order to increase acceptance. This new RxVB trial was made available with examples in the open-source Free Energy and Advanced Sampling Simulation Toolkit (FEASST) simulation package.
Read the full abstract
Numerical Analysis
Conformal Uncertainty Quantification Guarantees for Neural Operators
Neural operators provide fast surrogate models for approximating operators between function spaces, but their predictions often lack uncertainty quantification. We develop a split conformal framework to guarantee that a calibrated pointwise band around the neural operator output contains the true solution on at least a $1-\gamma$ fraction of the evaluation domain, with probability at least $1-\alpha$ over test and calibration inputs, where $\alpha,\gamma\in(0,1)$. Our method reduces a normalized residual field to its spatial $(1-\gamma)$-quantile and computes a scaling factor using a held-out calibration dataset. We prove marginal coverage guarantees for measurable residual fields defined on arbitrary probability spaces, covering both continuum domains and fixed discretizations. Under mild assumptions on the data distribution, we show that the coverage conditional on the calibration set follows a Beta distribution, which we verify with numerical experiments on Darcy flow and Navier–Stokes equations, where our calibration yields bands consistently tighter than existing corrections while retaining the target coverage.
Read the full abstract
Instrumentation and Methods for Astrophysics
Fast and efficient nested sampling with BEST
Nested sampling is widely used for Bayesian evidence computation, but its intrinsically sequential structure limits how efficiently it can exploit modern vectorised likelihoods and emulators. We present a new nested-sampling implementation in best, written entirely in TensorFlow and designed for efficient XLA compilation on both CPUs and GPUs. The sampler combines clustering and slice sampling with the possibility of updating several live points simultaneously. Since batching breaks the strict ordering of conventional nested sampling, we introduce sorting and history-based corrections to reduce the resulting bias in the evidence estimate. We test the sampler on Gaussian, Rosenbrock, and multimodal likelihoods and compare its performance with JAXNS and UltraNest. The results show that accurate evidence estimates can be retained for moderate batch sizes, with $m/N_{\rm live}\lesssim 0.1$ providing a useful practical regime. Finally, using a 27-dimensional cosmological likelihood emulator, we show that batched live-point updates can substantially reduce the wall-clock time while remaining consistent with sequential sampling within the reported uncertainties. The new implementation therefore extends best with an efficient nested-sampling method tailored to fast, vectorised likelihoods and emulator-based inference.
Read the full abstract
Computational Engineering
Machine-learning-assisted multiscale topology optimization of functionally graded superimposed lattice structures
Functionally graded lattice structures enable lightweight designs with spatially tunable stiffness and density, but their use in multiscale topology optimization is limited by the cost of repeated computational homogenization. This work presents a machine learning-assisted multiscale optimization framework for regular superimposed lattice structures. The unit cell is formed by combining body-centered cubic, face-centered cubic, and simple cubic lattice components, each controlled by an independent geometric parameter. Offline computational homogenization is used to generate effective stiffness data, which are then used to train a Cholesky-constrained neural network surrogate. This representation reconstructs the homogenized stiffness tensor in a physically admissible form. A separate neural network is trained to predict relative density from Monte Carlo-based density estimates. We incorporate our surrogates into a two-stage topology optimization strategy. First, a macroscale topology is obtained using the solid isotropic material with penalization (SIMP) method. The resulting solid region is then used for microscale lattice optimization, where the local lattice parameters are updated using the method of moving asymptotes (MMA). The trained stiffness and density surrogates replace repeated online homogenization during this stage. The method is demonstrated on a three-dimensional Messerschmitt-Bölkow-Blohm (MBB) beam benchmark, producing spatially varying lattice parameters and relative density fields consistent with compliance minimization under a material constraint.
Read the full abstract
Data Structures and Algorithms
Quadratic Probing Insertions Are $\epsilon^{-(1+o(1))}$ Time
First proposed in 1968, quadratic probing has stood for more than half a century as one of the simplest and most widely used hash-table designs in computer science. It is conjectured that, at load factor $1 - \epsilon$, the hash table achieves $O(\epsilon^{-1})$ expected insertion time. But even proving a bound of the form $f(\epsilon^{-1})$ for any function $f$ has remained open. In this paper, we prove that the expected insertion time is $\epsilon^{-(1 + o(1))}$. This settles the complexity of the data structure up to sub-polynomial factors in $\epsilon^{-1}$.
Read the full abstract
Artificial Intelligence
Training Communication-Efficient Mixture-of-Experts Language Models with Layer Re-Configuration
When training Mixture-of-Experts (MoE) language models with expert parallelism, all-to-all token dispatch and combine collectives can consume a substantial fraction of end-to-end training time. In this work, we study communication-efficient MoE models (CE-MoE), in which we adopt a heterogeneous layer pattern that decouples token-mixing and channel-mixing depth. Compared to conventional models which interleave MoE layers after each token-mixing layer (e.g., attention, Mamba-2), CE-MoE models concentrate expert capacity in a select few routed MoE layers, while maintaining depth by adding additional token-mixing and dense-FFN layers. Across a scaling ladder from 2B to 31.5B total parameters, under matched total and activated parameters, CE-MoE models consistently reduce training cost while matching validation loss and downstream benchmarks with full-MoE baselines. At the 31.5B scale, CE-MoE uses 33.3% fewer GPU-hours while improving average downstream score and inference throughput.
Read the full abstract
Quantum Physics
Sufficient positive maps between von Neumann algebras: Rényi divergences
We prove recovery theorems for $\alpha$-$z$ Rényi divergences under normal unital positive maps between von Neumann algebras. Previous results in this setting required 2-positivity, while recent finite dimensional work showed that this assumption can be relaxed to mere positivity. Our proof uses sufficiency for JW*-subalgebras and $L^p$-spaces over them to characterize equality in the data processing inequality. As a further application of our methods, we solve a problem discussed by Haagerup and Stormer: Every conditional expectation of a von Neumann algebra onto a JW*-subalgebra factors through a conditional expectation onto the generated von Neumann subalgebra.