Materials Science
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 6 September
$\beta-(Al_{0.19} Ga_{0.81})_2 O_3/Ga_2 O_3$ modulation-doped field-effect transistors (MODFETs) incorporating a high-quality Al2O3 gate dielectric and SiNx passivation are demonstrated for high-voltage operation. The devices exhibited a maximum drain current of 54 mA/mm, an on-resistance of 149 Ohm.mm, a minimum subthreshold slope of 94 mV/dec, and an ION/IOFF ratio exceeding $10^8$. Three-terminal breakdown measurements performed in Flourinert demonstrated a breakdown voltage that increased with gate-drain spacing, reaching 6.6 kV for a device with LGD = 28 microns. The corresponding average lateral electric field approached 2.4 MV/cm, while a power figure of merit of 222 MW/cm2 was achieved. To the best of the authors knowledge, the demonstrated breakdown voltage represents the highest reported value for a $\beta-(Al_x Ga_{1-x})_2 O_3/Ga_2 O_3$ MODFET and highlights the potential of modulation-doped $\beta$-Ga2O3 heterostructures for next-generation multi-kV power devices.
Statistical Methodology
Shrinkage invalidates the Hosmer-Lemeshow test: goodness of fit for penalized logistic regression, with an application to glaucoma diagnosis
Clinical prediction models are increasingly fitted by penalized logistic regression, because collinearity or many candidate predictors makes maximum likelihood unstable or impossible. Calibration is then almost always assessed by a grouped goodness-of-fit test such as the Hosmer-Lemeshow test. We show that this combination is invalid. Under ridge regression the grouped standardized residuals acquire a non-centrality induced by shrinkage, so the reference distribution used in practice is wrong, and at the penalty that most improves the fitted probabilities the test rejects correctly specified models between 92 and 100 per cent of the time. We derive the corrected law and define the shrinkage-corrected Hosmer-Lemeshow test, which subtracts an estimate of that non-centrality, restoring the maximum likelihood reference exactly to first order, and is made valid by prepivoting at a power cost we measure. We also give the attenuation law governing what any such test can detect once the linear predictor must be estimated. In glaucoma diagnosis by confocal laser tomography, where the maximum likelihood estimate does not exist, the corrected test finds the evidence for misfit weaker by more than three orders of magnitude: the fitted risks are too flat rather than mis-ordered, so the model needs recalibration rather than rebuilding.
Read the full abstract
Cryptography and Security
FoldNTT: A Multiplier- and Twiddle-Lean NTT Core with Formally Verified Arithmetic for Proth Primes
Hardware for lattice-based post-quantum cryptography spends a large share of its area on the number-theoretic transform (NTT), dominated by modular multipliers and twiddle storage. FoldNTT is a redesign of the released radix-2 CFNTT accelerator (TCHES 2022) for the Falcon / FN-DSA prime q = 12289 with one hardware multiplier per butterfly instead of three and about half the stored twiddle constants. The Proth shape q = 3*2^12 + 1 turns modular reduction into shift-and-add K-RED folds, and the bit-reversed twiddle table obeys w[N/2+j] = psi*w[j], so half the table is derived without a multiplier. Checking the released RTL against the mathematics also exposed a bug: its inverse transform omits a per-stage halving and returns 2^10*x, which the retrofit corrects. Every arithmetic block is proven by exact-width SMT and compositional SymbiYosys proofs, control-safety invariants by k-induction; the proofs are mutation-tested and the composed transform is validated by simulation, all rerun by CI. On Artix-7 in a fully open flow, the retrofit costs 3->1 DSP48 per butterfly and -50% stored twiddle bits at a whole-core Fmax cost of about 4% (best of three seeds; within the seed-to-seed spread), measured on the released datapath driven by a controller we reconstructed (the reference FSM was never released) and validated by full-core simulation; a sequential core with our own controller builds to a timing-gated Basys-3 bitstream.
Read the full abstract
Mesoscale and Nanoscale Physics
Near-Field Spin Seebeck Effect
The conventional spin Seebeck effect generates spin currents through interfacial thermal conduction. In this Letter, we establish a photon-mediated spin Seebeck effect driven by near-field thermal radiation. Using a monolayer transition metal dichalcogenide separated from a thermal emitter by a vacuum gap, we demonstrate Rashba spin-orbit coupling can convert optical orbital excitations into an electron spin polarization. This occurs via two complementary mechanisms: the direct transfer of angular momentum from chiral thermal photons, and the rectification of unpolarized thermal fluctuations by a magnetized two-dimensional electron gas. These findings unveil a radiative pathway for nanoscale electron spin manipulation.
Read the full abstract
Computation and Language
Visual Search Augmented Chain-of-Thought Reasoning for Attribute Value Extraction from Product Videos
Existing approaches to visual attribute value extraction (AVE) primarily rely on static product images, failing to capture temporal cues, multi-angle views and fine-grained visual details. Directly applying video vision-language models (VLMs) to product AVE results in limited performance due to the lack of domain knowledge, and fine-tuning them requires extensive high-quality data and substantial computational resources. Thus, we propose visual search augmented chain-of-thought reasoning (ViS-CoT), a training-free, plug-and-play pipeline that can be easily applied to any open-source video VLM for video-to-text AVE in e-Commerce. Specifically, ViS-CoT employs visual clustering to identify representative frames, followed by visual search to retrieve semantically similar product knowledge that can enrich attribute cues. Next, an interleaved CoT reasoning module iteratively refines reasoning through visually-aligned auxiliary texts derived from captioning and automatic speech recognition. Finally, the integrated information guides the model toward accurate and fine-grained attribute predictions. Extensive experiments across 14 product categories on the VideoAVE dataset show that ViS-CoT consistently enhances multiple state-of-the-art video VLMs, achieving an average improvement of 17.91 percentage points in micro-F1.
Read the full abstract
Optimization and Control
Averaged proximal reflected gradient method for monotone variational inequalities
Projected reflected gradient (PRG) method proposed by Malitsky is efficient for solving monotone variational inequality (MVI), while the existing upper bound of step size is not tight due to the inequality scaling in the theoretical analysis. In this paper, we construct an averaged variant of PRG method for more general MVI and present a novel Lyapunov function to establish convergent theory. This averaged PRG method provides an improvement of the golden ratio algorithm [Y, Malitsky, Math. Program., 184, 383-410, 2020], and the involved step size is compatible with that for the classical methods, such as Popov's extragradient and forward-reflected-backward methods. Moreover, a fully adaptive strategy without linesearch is presented to adjust step sizes, which generates closed-form and potentially much larger step sizes. Numerical experiments on the Nash-Cournot equilibrium, HpHard, and image reconstruction problems demonstrate that the proposed algorithm significantly outperforms existing state-of-the-art methods.
Read the full abstract
Emerging Technologies
Differentiable Partitioning With Dual-Max 3D Wirelength Model and Hybrid Bonding Terminal Awareness for Optimized 3D Placement
Research on 3D integrated circuits (3D-ICs) physical design has expanded rapidly in recent years, driven by the increasing adoption of hybrid bonding and the demand for higher integration density. Continued scaling of hybrid-bonding pitch supports higher vertical interconnect density and finer-grained circuit partitioning in 3D-ICs. Hybrid bonding-enabled 3D-ICs offer substantial benefits in interconnect scaling and system integration, yet tier assignment remains challenging because it jointly determines 3D wirelength and hybrid bonding terminal (HBT) assignment. This paper presents a differentiable partitioning framework that directly optimizes placement-aware tier assignment for 3D-ICs through gradient-based optimization. Discrete tier assignment is relaxed to continuous probabilities, and a Dual-Max 3D wirelength model is introduced as a placement-aware surrogate for tier-specific half-perimeter wirelength (HPWL). In addition, a terminal-aware cutsize penalty gives higher weights to cross-die nets with predicted HBT overlaps, and a local balance penalty discourages regional area overflow on each tier. On ten OpenROAD benchmarks, our method reduces final die-to-die (D2D) HPWL by 8.05% and 14.81% on average relative to hMETIS and TritonPart, respectively. On the seven benchmarks with available CoPlace results, the average HPWL reduction is 10.33%. The source code for the differentiable partitioner and the integrated 3D placement flow is publicly available to support reproducibility.
Read the full abstract
Accelerator Physics
Preliminary design of continuous wave Low-Level RF systems for S3FEL
In the Shenzhen Superconducting Soft X-ray Free Electron Laser (S3FEL), Continuous Wave (CW) Low-Level Radio Frequency (LLRF) systems perform critical functions including adjusting the power coupling of accelerator cavities, regulating the amplitude and phase of the RF field, and maintaining the resonance frequency and phase of the cavities. These functions are essential to ensure the electron beam operates at the accelerating phase. Within S3FEL, each superconducting cavity is driven by a solid-state amplifier (SSA), with each SSA paired with a dedicated LLRF system. Based on the distinct acceleration cavities employed, the CW LLRF systems for S3FEL are categorized into four types: 1. Primary accelerator LLRF systems (superconducting, 1.3 GHz; quantity: 168), 2. Harmonic cavity LLRF systems (superconducting, 3.9 GHz; quantity: 16), 3. VHF electron gun LLRF systems (room temperature, 216 MHz; quantity: 4), 4. Buncher LLRF systems (room temperature, 1.3 GHz; quantity: 2). These four LLRF system categories exhibit differing requirements for RF field and acceleration cavity control. This report presents the preliminary design schemes for these four types of CW LLRF systems.
Read the full abstract
Computation and Language
Hierarchical Wasserstein Merging for Multi-Domain Multi-Task Learning: From Specialists to a Generalist
Multi-domain multi-task learning (MD-MTL) aims to build a single generalist model that performs well across heterogeneous domains and tasks. However, joint training often suffers from interference under distribution shifts. Existing model merging methods mostly operate on model parameters while overlooking the geometric structure of latent representation distributions across domains and tasks. To address these limitations, we propose Hierarchical Wasserstein Merging (HWM), a representation-level framework that models each domain-task specialist as a distribution of hidden representations on a shared support. HWM constructs task-level and global Wasserstein barycenters to capture within-task domain variation and cross-task structure, enabling either training-free specialist aggregation by Wasserstein-derived weights or training-based generalist learning through a hybrid Wasserstein alignment loss. Experiments on four NLP tasks across four domains per task show that HWM achieves superior effectiveness and generalization capability in MD-MTL settings.
Read the full abstract
Statistical Mechanics
de Almeida-Thouless Stability and Replica Symmetry Breaking in a Hybrid Watermarking Model with Image and Message Decoding
We investigate the de Almeida-Thouless (AT) stability of the replica symmetric (RS) solution for a spread-spectrum watermarking model incorporating Bayes-estimation-based image restoration. In our previously proposed model [1], which simultaneously performs message decoding and image restoration under Gaussian channel noise, a discrepancy between the theoretical predictions of the RS solution and Markov chain Monte Carlo (MCMC) simulations was observed in specific parameter regimes. In this paper, by analyzing the blind case where both the original message and image are unknown, we explicitly derive the conditions for the AT stability of the RS solution by clarifying the structure of the replicon eigenspace for the hybrid system. Our results reveal that AT stability is broken precisely in the parameter region where the RS solution deviates from MCMC simulations, thereby successfully explaining the mechanism underlying this discrepancy in terms of replica symmetry breaking (RSB). [1] M. Kawamura, T. Uezu, K. Hayashi, and M. Okada, “Statistical mechanical evaluation of a spread-spectrum watermarking model with image restoration,” Phys. Rev. E 99, 062132 (2019).
Read the full abstract
Analysis of PDEs
Threshold for the existence of scattering states for inhomogeneous nonlinear Schrödinger equations without gauge invariance
We consider the asymptotic behavior of solutions to inhomogeneous nonlinear Schrödinger equations with non-gauge-invariant nonlinearities. The spatial coefficient in the nonlinear term may have different orders of singularity at the origin and decay at infinity. Under a coercivity condition involving the coefficient and the nonlinearity, we show that no scattering states exist for the equation below a Strauss-type threshold determined by the decay at infinity. Our class includes nonlinearities with a dominant non-oscillatory component. We also prove a complementary small-data scattering result above this threshold, using non-admissible Strichartz estimates in Lorentz spaces adapted to the singular coefficient.
Read the full abstract
Artificial Intelligence
From Concentration to Differentiation and Back: Routing Effective Rank in MoE Reasoning Cohorts
Test-time scaling produces cohorts of reasoning rollouts, yet there is no standard label-free account of how their internal computation reorganizes as inference unfolds. We introduce routing effective rank deff, the entropy-effective dimensionality of a cross-rollout graph built from MoE expert-routing similarity. Across ten MoE configurations and five math/science benchmarks, deff exhibits a reproducible low-high-low trajectory, with a prominent interior maximum in 98.5% of 3,105 model-question cohorts: routing similarity is concentrated early, maximally differentiated at intermediate budgets, and reconcentrated later, and the timing of this maximum varies systematically with architecture and reasoning effort. An exact decomposition separates cohort-wide common-mode mass from residual spectral dimensionality: common-mode reallocation accounts for about two thirds of the trajectory, while the residual spectrum contributes about one quarter and retains substantial variation beyond the common mode. The decomposition further localizes behavior: among non-unanimous cohorts, increases in common-mode concentration strongly predict same-answer recoverability, and higher reasoning effort delays the maximum by 2.59 octaves (doublings of the token budget) and consistently expands the high-rank period across all four tested architectures, locating the effort effect in timing and duration rather than peak amplitude. Correctness comparisons separate structural monitoring from answer selection, positioning routing effective rank as a decomposable, label-free diagnostic of cohort organization - a principled spectral lens on how MoE reasoning cohorts differentiate and reconcentrate over inference time.
Read the full abstract
Statistical Methodology
A Dirichlet-Quantile Bootstrap approach for the probabilistic resampling of time series
This work presents DPQBootstrap, a probabilistic resampling method for time series based on a Dirichlet quantile bootstrap and rank-based temporal reconstruction. The method aims to generate pseudo-series that preserve the main characteristics of the original series, including variability, quantiles, extreme values, and part of its temporal dependence. A simulation study compares DPQBootstrap with the Maximum Entropy Bootstrap implemented in the meboot package across eight simulation scenarios. The results show that DPQBootstrap achieves 106 wins over 86 for meboot according to the Interval Score, indicating a strong ability to preserve the statistical properties of the original time series. In addition, an empirical application was conducted within a Bayesian ARMA forecasting framework, with and without DPQBootstrap integration. The results indicate that incorporating DPQBootstrap can improve point forecast accuracy and the quality of predictive intervals, particularly when combined with appropriately specified ARMA models.
Read the full abstract
Instrumentation and Methods for Astrophysics
DustRover: A Python Package for Modelling Dust Extinction Curves (Phase I)
We introduce DustRover, an open-source Python package designed to model dust extinction curves using multi-wavelength regimes. DustRover supports optical/infrared spectroscopy, broadband photometry, and X-ray data within a unified framework, enabling robust analysis of dust extinction curves in distant galaxies. The software features a modular architecture that strictly decouples data management, dust models, and Markov Chain Monte Carlo (MCMC) based statistical fitting. The package is highly user-oriented, using simple YAML configuration files and offering built-in visualisation tools for SEDs and extinction curves.
Read the full abstract
Instrumentation and Methods for Astrophysics
PERRY: A Human-in-the-Loop GUI for Precision Alignment of MUSE Data
The Multi Unit Spectroscopic Explorer (MUSE) on the Very Large Telescope produces high-dimensional data-cubes where even minor astrometric misalignments between multiple exposures can introduce severe artifacts and compromise data quality. While automated pipelines provide a crucial baseline, subtle offsets require human intervention. To address this, we introduce PERRY, an interactive, Python-based Graphical User Interface (GUI) explicitly designed for the visual inspection and manual fine-tuning of MUSE image alignments. Playing an essential role of finding manual offset adjustments for data-cubes within the Pythonic AAO Reduction Environment (PARE), PERRY ingests automatically pre-aligned data, provides synchronized visual and quantitative diagnostics, and enables real-time coordinate translation and rotation updates. The resulting precise adjustments are preserved in reproducible configuration files, maximizing the scientific return and efficiency of advanced data reduction pipelines.
Read the full abstract
Quantum Physics
Telecom-Integrated Photonic Memory Operating Near the Mechanical Ground State
Scalable quantum networks require quantum memories that are chip-integrated, telecom-band compatible, and capable of flexible retrieval. Nanofabricated mechanical resonators meet these criteria. They offer independent tunability of optical and mechanical modes, long-lived phonon states, and design flexibility beyond atomic systems, making them strong candidates for practical integrated quantum memory. Here, we demonstrate an on-chip, absorptive optomechanical memory for telecom-band photons, based on optomechanically induced transparency (OMIT) and operating near the mechanical ground state. The device stores telecom-band photons, demonstrating compatibility with external photon sources at the few-photon level, while enabling on-demand retrieval. By placing the device in a dilution refrigerator at 20 mK and tailoring the control field to suppress optical heating, we achieve a remarkably low phonon occupancy of just 0.32 during the storage process. Our results lay the groundwork for scalable, phonon-based quantum memory devices and open new avenues for integrating mechanical systems into practical quantum network architectures.
Read the full abstract
Strongly Correlated Electrons
Signatures of spin-wave dynamics in quasiparticle interference
We investigate momentum-resolved quasiparticle interference (QPI) in a localized-itinerant antiferromagnet, where ordered local moments are exchange coupled to conduction electrons. Static antiferromagnetic order reconstructs the electronic bands, while one-magnon processes further dress the quasiparticles through a momentum- and frequency-dependent self-energy. Incorporating this dynamical renormalization directly into the Born impurity scattering, we find a characteristic crossover in the QPI spectrum. Below the lower magnon-emission edge, the modification is predominantly dispersive and governed by the real part of the self-energy, whereas above this scale its imaginary part produces pronounced broadening and redistribution of the scattering intensity. The dynamical response persists beyond the upper magnon energy and is strongly asymmetric in tunneling bias for a particle–hole-asymmetric band. These results show that Fourier-transform tunneling spectroscopy can distinguish static magnetic reconstruction from dynamical spin-wave renormalization.
Read the full abstract
Statistics Theory
Sharp Causal Bounds for Dynamic Treatment Regimes
We study dynamic treatment regimes under contemporaneous confounding: at each stage, an unmeasured factor may affect both treatment and the next observed state, but has no further direct effect on later stages. From the observational distribution, the causal graph, and specified structural restrictions on possible next states, we construct at each state–treatment pair the set of transition probabilities compatible with this information. These local sets require no sensitivity parameter and can be combined by backward induction to obtain lower and upper bounds on the expected outcome under any given treatment regime. Our main result shows that these bounds are sharp: their endpoints are exactly the smallest and largest expected outcomes generated by causal models compatible with the same observational distribution, causal graph, and structural restrictions. The same backward-induction method gives a maximin rule for choosing treatments by maximizing the worst-case expected outcome. Thus, for this class of models with contemporaneous confounding, the framework generalizes the classical g-formula of \citet{Robins1986} for evaluating treatment regimes and the Q-learning framework of \citet{Murphy2003} for selecting them. When the local transition probabilities are identified, the two recursions reduce to these classical methods.
Read the full abstract
Machine Learning
MetaRSI / RSI2: A Meta-Recursive Self-Improving System for Recursive Self-Improving Systems Themselves
Recursive self-improvement (RSI) lets a system improve the model-building machinery from its own failures, so every later model inherits the gain. Yet RSI has been validated almost exclusively on coding and formal benchmarks such as science QA and mathematics. This format bound limits RSI to improvement within a machine-checkable slice, not general capability where questions are open and correctness is settled by argument, replication, or measurement. We argue RSI must next operate across real, diverse scientific, engineering, and meta-scientific domains, not where formal evaluation is merely tractable. To that end we present MetaRSI-v1, where improvement is the scheduled composition of three typed operators over one unified paradigm. Data-RSI amplifies existing competence and marks its boundary; Harness-RSI edits a five-slot scaffold without touching weights; Model-RSI internalizes capability into parameters through bounded training. Sharing one loop kernel and artifact vocabulary, they make data, scaffold, and model changes composable rather than exclusive. A two-axis optimizer jointly decides operator order and each operator's proposal policy, while a meta-level policy revises the schedule across terms. We validate MetaRSI-v1 under the field's standard evaluations, on code and closed-form science, with no external teacher: the target model plays every role in its own loop. MetaRSI-v1 reframes self-improvement from a single-surface edit to a composition across the full model-production pipeline, opening two paths: a model route internalizing capability through training, and a harness route leaving weights untouched and thus extending self-improvement to any model reachable through an interface, with Data-RSI redefined as the shared substrate feeding both. The framework further yields refutable laws on where loops exist, how operators compose, and what supervision buys.
Read the full abstract
Disordered Systems and Neural Networks
Autonomous Chaotic Time Series Prediction using Physical Neuromorphic Networks
Physical reservoir computing (PRC) with neuromorphic networks offers a promising approach to brain-inspired information processing, exploiting emergent nonlinear dynamics of physical neural networks as a computational resource. This study demonstrates fully autonomous closed-loop prediction of the Mackey–Glass (MG) chaotic time series using a simulated neuromorphic nanowire network as the physical reservoir. Two strategies are evaluated: the virtual node (VN) method, which expands the feature space by temporal multiplexing of reservoir states, and a non-VN approach that uses all physical node readouts directly without temporal multiplexing. Results are reported for two values of the MG time delay parameter, $\tau = 18$ and $\tau = 21$, the latter representing a more complex chaotic regime not previously evaluated for this class of physical reservoir. Over a short prediction horizon of $T = 100$ timesteps, the VN approach achieves autonomous prediction accuracies of $90.4$% and $89.7$% at $\tau = 18$ and $\tau = 21$, respectively, while the non-VN approach achieves $81.5$% and $76.2$%. Long-horizon analysis over $T = 500$ timesteps shows that both approaches reproduce the qualitative attractor structure and dominant spectral content of the true MG signal, with trajectories remaining bounded throughout. These results suggest that the intrinsic dynamics of neuromorphic nanowire networks are sufficient to support meaningful autonomous chaotic time series prediction without virtual node augmentation, and that performance may improve further as physical network sizes scale to the millions of nodes achievable in hardware. As this study uses simulated networks, extrapolation to physically fabricated large-scale arrays remains to be validated experimentally.
Read the full abstract
Machine Learning (Statistics)
Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling
Massive datasets in modern machine learning have made data reduction a central challenge, particularly for clustering tasks where memory and computational constraints demand compact yet faithful summaries. A standard approach is to construct an \textit{$\epsilon$-coreset}: a small weighted subset that approximately preserves the clustering cost for every plausible choice of centers. For the \textit{$(k,z)$-clustering problem}, existing worst-case bounds on coreset size are essentially tight, ruling out substantially smaller coresets in general. However, such worst-case instances are often unrepresentative of real-world data. In this work, we show that significantly smaller coresets are possible under mild and natural assumptions on the underlying data distribution. We introduce a new correlated sampling framework, called determinantal sampling, based on a novel application of determinantal point processes. Using this framework, we obtain an efficiently constructible $\varepsilon$-coreset for $(k,z)$-clustering in $\mathbb R^d$ whose dependence on $1/\varepsilon$ has exponent strictly smaller than $2$ when $d$ is fixed. This improves over the worst-case $\varepsilon^{-2}$ barrier under our beyond-worst-case assumptions. To the best of our knowledge, this is the first result that provably surpasses these lower bounds through beyond-worst-case assumptions. Finally, we validate our approach on synthetic and real-world benchmark datasets, where it consistently achieves smaller coresets than existing state-of-the-art methods, even without explicitly enforcing the assumptions used in the analysis.
Read the full abstract
Fluid Dynamics
Transverse transport of microswimmers in oscillatory channel flows
Motile microorganisms inhabit oscillatory flows encountered in physiological and engineering systems, yet the influence of flow unsteadiness on their shear-induced preferential concentration remains less understood. We investigate transverse transport of elongated microswimmers in oscillatory pressure-driven channel flow using complementary Langevin simulations and two- and one-dimensional Fokker-Planck models. Agreement between particle-based and continuum descriptions across governing parameters establishes the fidelity of the Fokker-Planck formulation for swimmer transport in oscillatory shear flows. Our analysis demonstrates that oscillatory forcing fundamentally modifies classical steady-flow shear-trapping. We find that increasing Womersley number $Wo$ reduces centerline depletion by confining oscillatory shear to thinner near-wall regions. In contrast, increasing frequency ratio $\beta$, of swimmer rotational diffusion rate and flow oscillation frequency, promotes sustained orientational anisotropy, and leads to a saturating increase in centerline depletion. In the weak-swimming limit, we derive a hierarchy of coupled orientational moments, enabling analytical solutions at arbitrary temporal harmonic order. The asymptotic solutions establish a universal transfer law showing that, for a given swimmer shape, the normalized leading-order orientational response depends solely on $\beta$. Reconstruction of the orientational distribution yields closed-form expressions for the swimmer concentration profile and depletion index, $I_D$. Our asymptotic solution recovers the steady-flow weak-shear scaling of $I_D$ with flow Peclet number, $Pe_f$, of $I_D \propto Pe_f^2$, and reveals that oscillatory forcing attenuates this response by a factor $16\beta^2/(1+16\beta^2)$. These results provide a theoretical framework to predict transverse transport of microswimmers in oscillatory channel flows.
Read the full abstract
Statistical Methodology
Heritability estimation using genetic similarity representation
We introduce a similarity representation framework for robust heritability estimation in Genome-Wide Association Studies (GWAS). This problem parallels the signal-to-noise ratio estimation problem in linear models with a large number of predictors. Traditional fixed- and random-effects methods for heritability estimation often impose restrictive assumptions on regression coefficients or the design (genotype) matrix. These assumptions are usually violated by the heterogeneous effects of genetic variants (regression coefficients) that depend on the genotype distribution and the correlation among genotypes due to linkage disequilibrium. This leads to the non-robust estimation of heritability in practice. To overcome these limitations, we propose a SiMILarity rEpresentation method (SMILE) which models the relationship between the outcome similarity and genetic similarity through Gram matrices. SMILE represents genetic similarity using a weighted Gram matrix of genotypes, where a data-dependent weight matrix is used to disentangle the heterogeneous variant effects from the genotype distribution. SMILE includes the classical random-effects model as a special case and improves the fixed-effects model by not requiring accurate estimation of the precision matrix or the regression coefficients. We develop a scalable implementation for efficient analysis of large biobank GWAS data. Extensive simulations and the analysis of the UK Biobank data demonstrate the robustness of the proposed method over the existing methods across a range of genetic architectures, and show that SMILE provides a versatile approach for heritability estimation.
Read the full abstract
Artificial Intelligence
Building Trustworthy Graph-Agentic RAG for Social Good: Architectures, Failure Propagation, and Assurance by Construction
Graph-agentic retrieval-augmented generation combines structured evidence with adaptive controllers that can plan retrieval, traverse relations, verify intermediate claims, delegate subtasks, and use tools. This combination is useful when answers depend on relations across documents, entities, time, or institutions, but it also creates coupled failure paths: a defect in graph construction can become retrieved evidence, alter later control decisions, and propagate toward a consequential outcome. We examine how such systems should be designed and evaluated for social-good settings in which freshness, authorization, traceability, oversight, and recourse matter alongside answer quality. We organize the literature by graph substrate, graph lifecycle, agent function, coordination pattern, and authority boundary, and distinguish graph-based retrieval from observation-dependent graph control. We then synthesize reported risks as an evidence-to-action failure chain and propose an assurance-by-construction blueprint comprising five interface contracts for evidence, retrieval, reasoning, capability and delegation, and outcome. These contracts make provenance, temporal validity, authorization, uncertainty, and recoverability explicit at system boundaries. An illustrative public-benefit information design shows how the framework constrains graph structure, permissions, abstention, and operating authority. Finally, we derive an evaluation agenda spanning graph assertions, trajectories, claims, coordination, and outcomes.
Read the full abstract
Analysis of PDEs
Quantitative Estimates of the Field Excited by an Emitter in the Narrow Region Between Two Strictly Convex Inclusions in Two Dimensions
We consider the field enhancement due to the presence of an emitter of the dipole type near two perfectly conducting inclusions with $C^{2,\gamma}$ boundaries in two dimensions. We derive estimates of field enhancement in the narrow region and prove that the field is enhanced by a factor $\varepsilon^{-1/2}$ in the region far from the emitter. We construct a harmonic barrier to control the dipole term instead of using the Kelvin transformation. We also study how the location of the emitter affects the field on the shortest line segment connecting two inclusions.
Read the full abstract
Fluid Dynamics
Turbulence Decay Intensifies Clustering of Bubbles and Particles
Our understanding of inertial particle dynamics in turbulence is mostly based on flows held in a statistically stationary state, a particular regime that differs from many natural flows where energy input can often be intermittent or cyclic, or may abruptly cease. Here we investigate inertial particle and bubble dynamics in freely decaying turbulence through complementary experiments and direct numerical simulations. While particle accelerations decay monotonically in time, we find evidence that the clustering can exhibit a non-monotonic evolution, intensifying sharply before subsequently weakening. We demonstrate that both the acceleration and clustering behaviors can be mapped onto their counterparts in stationary turbulence using a dynamic rescaling of the evolving length and time scales of the turbulence. Validity conditions for the dynamic rescaling, satisfied by both the experimental and numerical datasets, are derived. The proposed mappings remain applicable across a broad range of density ratios, from light to heavy particles, and particle sizes spanning two orders of magnitude in Stokes number.
Read the full abstract
Distributed Computing
Cops and Lethal Robber on Rings: A Distributed Perspective
The Cops and Robber game is extensively studied in the sequential setting where the main goal is to capture the robber. Capturing the robber means at least one cop, and the robber will be at the same vertex together at some time. There are several variants, including variants where the goal of the cops is to surround the robber. Surrounding the robber means there is at least one cop in each of the neighboring vertices of the robber's position. In this paper, we introduce it in the distributed setting while empowering the robber by saying it can even kill cops. Specifically, in our model, the robber moves in odd rounds and has unbounded speed, cops move in even rounds, and if one or more cops move into a vertex where the robber is currently residing, all these cops get killed. We call this lethal robber. This also connects our work to the Intruder Capture and Black Hole Search problems by introducing an entity which is dynamic as well as lethal, a setting that, to the best of our knowledge, has not been studied. In this work, we introduce the lethal robber, define the cops and lethal robber problem in the distributed setting and study it on a static ring of size $n$. We prove $n$ cops are not enough, even if all start from the same vertex, and provide an algorithm starting from an arbitrary initial configuration that requires $n+\lfloor\log n \rfloor+4$ cops in the worst case.
Read the full abstract
Quantum Physics
Trapped Ion Quantum Networking and Telecommunications Coexisting on One Fiber
Research into long-distance quantum memory-based networking to date has exclusively used dark fibers. This avoids the detector background from telecommunications (telecom) traffic, but as a result excludes many fibers deployed in the field. If memory-photon entanglement and telecom signals coexist on one fiber, the entire classical fiber infrastructure becomes available for quantum links. We present the first experimental demonstration of such coexistence. Ion-photon entanglement using 1092 nm photons emitted by a Strontium-88 ion is distributed over a deployed 2.8 km fiber loop which carries Ethernet and 5G traffic. All classical control signals required to coordinate the quantum transmitter and receiver systems co-propagate on the same fiber. These include fiber sensing for polarization stabilization. Our results demonstrate that memory-based quantum networks can be realized on active classical network infrastructure.
Read the full abstract
Machine Learning
Are Verifier Errors Independent Within a GRPO Group? Evidence from Qwen2.5 Rollouts
Group-based reinforcement learning with verifiable rewards (RLVR) scoresmultiple completions per prompt using automatic verifiers. Analysesbased on independent verifier errors may overlook dependence associatedwith shared answer formats. We investigate this dependence in24,998 groups of eight completions generated by Qwen2.5-1.5B onMATH, GSM8K, and DeepMath-103K. We estimate a pooled within-groupverifier-error correlation of 0.530 (95% confidence interval:0.500–0.560). Under an exchangeable-error model, this correspondsto a design-effect-adjusted effective sample size of 1.70 for aneight-completion group. Dependence varies substantially across answerforms: fractions, radicals, symbolic expressions, and intervals exhibitstronger clustering than unit annotations and percent signs. Replayinggroup-relative advantages across four rule-based verifier configurationsidentifies at least one advantage-sign disagreement in up to 0.83% ofgroups. Because a group is repeated sampling for one prompt, thiswithin-group clustering may reflect shared prompt difficulty as well asshared answer form, and we do not attempt to separate the two here.Unlike studies of correlated judgments across multiple evaluators, ouranalysis examines dependence across completions scored by the sameverifier. These findings motivate prompt- and answer-form-aware analysesof verifier noise rather than characterizations based solely onaggregate error rates.
Read the full abstract
Computer Vision
Scaling 3D Generative Priors to Large-Scale Scene Meshes from Multi-View Images
Pretrained 3D generative models produce detailed geometry and appearance but are primarily designed for object-centric generation within a limited spatial extent. Recent approaches address this limitation by partitioning large scenes into smaller spatial regions and applying pretrained 3D generative priors to each region. However, scaling tiled generation to large multi-view scenes makes it challenging to maintain local geometric continuity and global appearance consistency. We present a training-free framework for large-scale textured mesh generation from multi-view images. Our key idea is to scale tiled generation to large scenes with increased spatial detail while coordinating generation both locally and globally. We introduce local context tiled generation to improve geometric continuity between neighboring regions and global appearance alignment to reduce appearance discrepancies across distant regions. An adaptive scene decomposition further determines the number of tiles according to the input scene geometry. Experiments demonstrate improved geometric and appearance fidelity over existing approaches while enabling fine-grained generation of large-scale scenes.