Instrumentation and Methods for Astrophysics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 15 September
The Hobby–Eberly Telescope High Resolution Spectrograph (HET–HRS) is undergoing a major instrument upgrade to improve its performance over the 360–1000 nm wavelength range. As part of this effort, a new fiber-feed system has been developed to increase throughput and enhance illumination stability. This paper presents the optical and opto-mechanical designs of the upgraded HRS Input Head Module Package and lens-based Double Scramblers. The Input Head incorporates a static Atmospheric Dispersion Corrector (ADC) and relay optics optimized for the HET operational zenith-angle range, reducing the residual atmospheric dispersion to less than 0.42 arcsec while improving wavelength-dependent fiber coupling. Separate Double Scrambler designs were developed for the 260 \textmu m and 320 \textmu m science fibers to exchange the near-field and far-field illumination distributions. Geometrical image analyses demonstrate stable near-field and far-field illumination, reduced coupling losses, and acceptable angular acceptance across both fiber geometries. The opto-mechanical designs supporting the Input Head and Double Scrambler are also presented to provide the alignment accuracy and mechanical stability required for the upgraded fiber-feed system. These results establish the proposed architecture as a practical solution for improving the optical performance and illumination stability of HET–HRS.
Robotics
UniDex-ViTac: Learning Unified Visuo-Tactile Dexterous Manipulation Policy from Human Video Data
Human videos provide demonstrations of dexterous manipulation but lack robot-executable actions and tactile measurements. We present UniDex-ViTac, a framework that uses human-video-guided simulation to generate robot demonstrations paired with fingertip contact observations for training a deployable visuo-tactile policy. Object-specific residual reinforcement learning specialists adapt annotated human-object interaction references to a robotic arm-hand system. Their successful rollouts pair final robot action targets with robot-side fingertip contact observations. From 50 human demonstrations across ten objects, we collect 10,000 simulated trajectories to train a single Action Chunking with Transformers (ACT) based generalist. The policy combines point clouds, proprioception, and four binary contact signals encoded through fingertip labels and a separate token, without requiring human references or privileged object identity and pose at deployment. The contact-augmented configuration achieves 68.3% macro-average success in simulation, compared with 55.5% for the point-cloud-only baseline. Without real-robot demonstrations or policy fine-tuning, it succeeds in 73/110 physical trials (66.4%) across six seen and five unseen objects, compared with 60/110 (54.5%) for the baseline, an increase of 11.8 percentage points. These results support the feasibility of learning a unified visuo-tactile dexterous manipulation policy from video-guided simulated interactions. Project page: https://unidex-vitac.github.io/
Read the full abstract
Robotics
Dense to MoE Adaptation for Compact Vision Language Action Policies
Vision language action (VLA) policies continue to grow in parameter count, making deployment on resource-constrained robot platforms difficult. The central goal is to reduce the number of LLM-side parameters retained in the deployed policy while preserving downstream task performance. Our approach, AdaDE, adapts selected dense feed forward blocks into mixture of experts (MoE) layers and derives expert retention masks from router statistics during fine tuning. The Dense2MoE conversion preserves the original dense FFN function at initialization, so expert deactivation can start without a separate recovery stage. Instead of using a fixed shutdown rule, expert masks are updated dynamically from router usage statistics, with staged training and expert protection to avoid early collapse. With 40% of the LLM parameters deactivated, AdaDE retains 95.7% average success in LIBERO and 42.0% average success across all 50 RobotWin2.0 tasks. These results suggest that dense to MoE adaptation with dynamic expert deactivation is a practical direction for reducing active VLA model size without severe performance loss.
Read the full abstract
Optics
Simulating multimode nonlinearities at very high mode count via parallel factor decomposition
A variety of problems at the frontier of nonlinear optics involve strongly multimode interactions. Simulating these dynamics is often computationally challenging due to the complexity of evaluating a large number of nonlinear overlaps. This is especially acute in ultrafast Kerr effect physics, where simulations in a modal representation have a generic complexity scaling quartically with the number of modes. This has limited the largest number of modes retainable in simulations in practice to a few tens of modes (often fewer), even when run on modern GPUs. Here, I show how by taking advantage of parallel factor decompositions of the nonlinear overlap tensor, a far larger number of modes can be accommodated. Realistic values for generic index profiles without special symmetries or separability can be in the thousands, and with special symmetries, far larger. I show that simulations with $>$1,000 modes can be done on modern hardware, illustrating this with the example of a multimode soliton propagating over a meter of GRIN fiber. I further show that the improved scaling immediately makes it practical to consider statistical effects, illustrating with the example of noise amplification in soliton fission. These results, implemented in public code with examples, should enable access to simulating the most demanding regimes of multimode nonlinear optics. Compression of the nonlinear interaction tensor may provide a route for more efficient simulation of nonlinear wave dynamics across a variety of other systems including acoustics, water waves, phononics, magnonics, and Bose condensates.
Read the full abstract
Computation and Language
Beyond the Name: Demographic Leakage in De-Identified Résumés and Evaluation Artifacts in LLM Bias Audits
De-identified résumé screening assumes that redacting explicit fields prevents ethnocultural inference; however, recent audits attribute residual leakage to declared languages. We investigate whether eliminating language fields resolves this leakage across nine open-weight models and 620 counterfactual résumés. By holding language attributes strictly identical, we isolate unstructured prose across five ethnocultural conditions and three cue-salience tiers. Target-group recovery averages 0.757 overall and saturates at 1.000 under high salience, demonstrating that non-language prose sustains demographic inference. Crucially, models diverge only under faint cues (0.086-0.690), establishing salience as an essential evaluation axis. Furthermore, pairwise LLM-as-a-judge outcomes are highly sensitive to evaluation design: forbidding ties yields an apparent selection-rate ratio of 0.39 alongside strong position and content effects, whereas permitting ties produces near-universal ties for most models ($\ge94\%$). Downstream scoring shows only very small between-condition differences, highlighting the need to distinguish demographic signals recoverable from résumé content from effects introduced by the evaluation protocol.
Read the full abstract
Machine Learning
High-Performance Tensor Formulation of the Viterbi Algorithm for Hidden Semi-Markov Models
Hidden Semi-Markov Models (HSMMs) are fundamental probabilistic models widely adopted across diverse domains, from computational biology to finance and signal processing. The Viterbi algorithm decodes the most likely state sequence given an HSMM and can be applied iteratively for ab initio model learning. However, existing Viterbi implementations remain sequential, and GPU-accelerated solutions are entirely absent, making HSMM decoding impractical for large-scale workloads. We present a tensor-based formulation of the Viterbi algorithm for HSMMs, restructuring the inner loops into tensor operations that naturally map onto SIMD units and massively parallel architectures. Building on this formulation, we provide optimized implementations spanning single- and multi-core CPUs, and, for the first time, GPU. Experimental evaluation demonstrates speedups of up to 14x on a single core, over 200x with multi-core, and over 570x on GPU over the state-of-the-art sequential baseline, establishing a new performance baseline for large-scale HSMM decoding.
Read the full abstract
Populations and Evolution
Anomalous First Passage in Evolution: Edge-KPZ Theory
The pace of evolution depends on how rapidly new phenotypes arise. We show that neutral Wright-Fisher evolution exhibits anomalous first passage despite diffusive mutations. The mean time for the first individual to reach a prescribed phenotypic distance scales approximately as $(\sigma^2)^{-3/2}$ with mutation variance $\sigma^2$. Two crossovers bound this regime, with inverse-variance scaling on either side. Combining coalescent theory with Kardar-Parisi-Zhang (KPZ) fluctuations at the dilute population edge, we develop an edge-KPZ theory of all three regimes. The anomaly persists under weak selection.
Read the full abstract
Digital Libraries
Geospatial Metadata Improves Discoverability by Connecting Datasets Across Scientific Disciplines
Research data repositories are essential infrastructure for scientific inquiry and for ensuring that datasets follow FAIR (Findable, Accessible, Interoperable, and Reusable) principles. However, repository reuse depends on the quality and completeness of geospatial and thematic metadata, which researchers generally provide voluntarily. Given limited curation resources, it is unsurprising that even Harvard Dataverse, the world's largest general-purpose research repository, contains many incomplete metadata records. Missing fields represent lost information and reduce interoperability. We find that datasets with more missing metadata receive fewer downstream citations and have fewer resolvable connections to other datasets. The implications are particularly important for geospatial datasets: only 0.3% of research datasets include a bounding box, and most represent archival points rather than complete geographic shapes. Our analysis shows that geospatial metadata helps connect concepts across disciplines. After embedding Harvard Dataverse datasets in a metadata knowledge graph, we find that datasets are twice as likely to connect across scientific disciplines through shared geospatial metadata as through keywords. This suggests that geographic metadata is a more reliable basis for cross-disciplinary interoperability than keyword vocabularies, which often remain discipline-specific. We train and fine-tune a small language model using datasets from Harvard Dataverse. Through geospatial metadata enrichment, we increase the share of datasets from different disciplines connected through metadata elements from 58.5% to 63.2%.
Read the full abstract
Statistical Methodology
Locally calibrated and mesh-free inference for spatial point distributions: closed-form null, contamination law, and detectability threshold
Local inference for spatial point distributions is dominated by Monte Carlo calibration. We develop an alternative based on the Tweedie–Miyasawa identities of empirical Bayes, which relate locally weighted moments of a point distribution under a Gaussian kernel to derivatives of its log-intensity in scale space. We first establish a rigidity theorem showing that the structure of these identities forces the Gaussian kernel. Under complete spatial randomness, we derive a closed-form null distribution for a bounded inter-scale contrast, yielding a calibrated simulation-free pointwise test. In experiments, the measured type I error is 0.070 at a nominal level of 0.05, with a calibration cost 199 times smaller than Monte Carlo for the same local statistic. We then derive a contamination law for structures of dimension m and width w embedded in a uniform background, together with an explicit detectability threshold. For a filament in three dimensions, the threshold is 16 pi. The resulting scale-resolved local dimension estimator has no free parameters. Applications to California seismicity, a trefoil knot, and 10,071 SDSS galaxies show that the method separates local structures across scales without a spatial mesh and reproduces published cosmic web fractions. All experiments are reproducible from a single public script.
Read the full abstract
Software Engineering
AI Policies: Help or Hindrance? A Software Developer's Perspective
AI policies introduced by software organisations to mitigate LLM-related risks such as sensitive information leaks and unauthorised usage are not useful if software developers do not engage with them. We draw on 19 software developer interviews to show how AI policies help and hinder developers. We suggest approaches to support managers and decision makers with a developer-centric approach to introducing AI policies.
Read the full abstract
Audio and Speech Processing
Segmental Posterior Decoding for Audio Moment Retrieval
Audio moment retrieval (AMR) identifies temporal segments in long recordings that best match a free-form text query. Existing systems largely rely on fixed-slot DETR decoders that assign proposal-level confidence scores without explicitly normalizing over competing explanations of the full timeline. We propose segmental posterior decoding, which defines a globally normalized distribution over temporal segmentations and scores each candidate moment by its exact segment marginal posterior computed through forward-backward inference. We further expand the training segmentation space by treating a foreground span and its adjacent subdivisions as distinct hypotheses, thereby increasing competition among alternative segmentations. On CASTELLA, our method achieves 41.15% R1@0.7 and 34.68% mAP, outperforming the same network decoded with DETR slot confidence by 10.91 and 9.20 percentage points, respectively.
Read the full abstract
Statistical Methodology
Salient Bayesian Clustering for Proportional Data via a Multivariate Beta Mixture Model
Neighborhoods are multifaceted entities whose attributes span sociocultural, economic, and environmental dimensions. Clustering neighborhoods based on social determinants of health (SDoH) can inform the allocation of public health resources and interventions tailored to community needs. Continuous and bounded data, as seen in aggregated neighborhood-level SDoH data, can pose challenges for widely used clustering methods (e.g., k-means or Gaussian mixture models) that rely on Euclidean distances or normality assumptions. Moreover, not all SDoH variables contribute equally to meaningfully characterize neighborhood clusters, and the inclusion of irrelevant or weakly informative determinants can obscure the underlying structure. To address this issue, we propose a Bayesian Salient Multivariate Beta mixture (SAMBA-Mix) model that flexibly models proportional data with embedded feature saliency to identify relevant variables for clustering. Our model showed improved accuracy in cluster identification and structure, compared to existing models. Using data from the U.S. Agency for Healthcare Research and Quality(AHRQ) SDoH database, we demonstrate the utility of our model to derive neighborhood-level SDoH profiles in Massachusetts and identify key determinants that best characterize differences amongst the different profiles.
Read the full abstract
Artificial Intelligence
From Manual Construction to AI-Driven Scenario Emergence: Rethinking Catastrophe Risk Modeling
Traditional catastrophe (CAT) risk models rely on costly manual construction to generate extreme weather scenarios, an approach largely unchanged since the 1990s. As climate extremes intensify, this creates mounting challenges to the entire risk transfer chain. This study proposes the TAISE framework, which repurposes AI weather forecasting models to produce coherent extreme weather sequences at a fraction of traditional costs. Through self-iterative generation, the framework produces continuous global atmospheric fields from which extreme events emerge. A proof-of-concept experiment demonstrates an order-of-magnitude reduction in computational cost compared with conventional methods, while capturing temporal continuity and cross-regional correlations absent in snapshot-based approaches. These findings suggest a pathway toward democratising catastrophe risk quantification and enabling dynamic, comprehensive portfolio assessment for insurers, reinsurers, ILS fund managers and public-sector risk managers.
Read the full abstract
Fluid Dynamics
Inertialess turbulence in viscoelastic pipe flow
Turbulence is synonymous with inertia dominated fluid motion, entailing high velocities and large spatial scales. Conversely, in complex fluids, elastic material properties can promote and sustain turbulent-like motions even at arbitrarily small inertia. The common route to this purely elastic state of turbulence, however, strictly occurs only in specific flows with curved streamlines, thus excluding canonical cases such as pipe flow. Investigating dilute polymer solutions in pipe experiments across an unprecedented elasticity and viscosity range, we trace an instability, previously assumed to require finite inertia, to Reynolds numbers four orders of magnitude below the theoretically predicted minimum level. At sufficiently high polymer concentrations and large shear rates, an abrupt drop in the transition threshold confirms that the vanishing inertia limit has been reached, and consequently that the fluctuating motions observed are of purely elastic origin.
Read the full abstract
Distributed Computing
PipeSwift: Revisiting Pipeline Parallelism for Large-Scale Completion-Oriented Agentic LLM Serving
LLM agents execute long-horizon workflows where each model response determines the progress of subsequent tool interactions and environment transitions. Unlike chatbot serving, where TTFT and TPOT SLO constraints are critical, agentic workloads are completion-oriented and increasingly governed by job completion time (JCT). This shift challenges existing LLM serving designs optimized around token SLOs. Through a systematic exploration of scheduling and parallelism, we uncover a previously overlooked principle for agent serving: JCT is governed by the balance between prefill and decode efficiency. A prefill-prioritized scheduling policy achieves the best TTFT and the highest decode throughput, yet fails to attain the lowest JCT. This principle further reshapes the parallelism landscape: we show that pipeline parallelism (PP), long overlooked because it offers little decode-latency advantage, can reduce JCT by providing a more favorable balance between prefill and decode efficiency. Based on these insights, we build PipeSwift, an optimized open-source pipeline-parallel runtime integrated with a tailored micro-batch partitioning strategy co-designed with schedule considering the above trade-off, and pipeline-integrated multi-token prediction. Evaluated on real coding and web-search agent trajectories with two 360B+ MoE models on 64 H800 GPUs, PipeSwift reduces overall JCT by up to 1.45$\times$ over SGLang wide-EP, 2.33$\times$ over vLLM PP2, and 1.54$\times$ over today's state-of-the-art open-source PD-disaggregated deployment. PipeSwift is open-sourced at https://github.com/wsjdsg/PipeSwift.
Read the full abstract
Quantum Physics
A complete classification of the existence of finite-dimensional quantum solutions to inconsistent linear constraint systems
Linear constraint systems (LCS) provide a compact algebraic language for nonlocal games and state-independent contextuality. In the binary case the Mermin–Peres square shows that inconsistent LCS can be solved by promoting variables to local Pauli operators, whereas a series of no-go results excludes analogous Pauli-, Clifford- and monomial unitary-based constructions at odd prime modulus. We first isolate the reason for this difference: for tensor-product quantum solutions, the obstruction to a classical solution of a LCS over $\mathbb{Z}_n$ decomposes into obstruction classes carried by the individual factors. As a consequence, a genuinely global obstruction cannot arise solely by tensoring locally unobstructed systems. The argument is specific to odd modulus; at even modulus the reordering phase need not vanish, as in Pauli-based examples. Given this distinction, we instead associate LCS to finite arrangements of rank-one projectors and resolutions of the identity in finite-dimensional vector spaces. Quantum solvability for such LCS is automatic and the search for a quantum-classical gap rests entirely on proving classical unsatisfiability of the underlying modular incidence problem of the arrangement. By relating such LCS with group-valued frame functions, we identify a family of examples in the work of [Harding, Jager, and Smith, Int. J. Theor. Phys. 44, 539 (2005)]. To establish the (non)existence of classically unsatisfiable LCS over $\mathbb{Z}_n$ with quantum solutions in all dimensions $d$ and for all $n\in\mathbb{N}$, we further construct explicit examples for the cases $d=n$ prime. Our main result thus positively resolves the existence problem of such LCS beyond the binary case: such systems exist if and only if $d\geq 3$ and $\gcd(n,d)>1$. Moreover, we establish the existence of LCS with a quantum-classical gap over finite fields if and only if $d\geq 3$ and $p\mid d$.
Read the full abstract
Machine Learning
Decoder Design Matters for ECG Delineation
Electrocardiogram (ECG) delineation identifies the boundaries of P waves, QRS complexes, and T waves, providing structural annotations that can guide AI models in learning to interpret ECGs. However, training accurate delineation models requires manual annotations that are scarce and time-consuming to obtain. Recent work addresses this limitation through semi-supervised learning (SSL), but the design of the architecture, particularly the decoder, has received less attention. To this end, we propose R-U-Net, an ECG delineation model that pairs a ResNet-18 encoder with a U-Net decoder. On SemiSegECG, R-U-Net outperforms the strongest evaluated ResNet-18 + fully convolutional network (FCN) head baseline in each of the 16 in-domain settings by 3.3-13.0 mIoU and achieves 82.6 mIoU in the cross-domain setting, an improvement of 8.1 mIoU. Controlled ablations show that decoder design contributes more to performance gains than the evaluated SSL methods, motivating further exploration of architectures for ECG delineation. All code is open-source at github.com/ELM-Research/ECG-Delineation.
Read the full abstract
Quantum Physics
Error-Bounded Fixed-Point Design of Super-Sample-Rate IIR Filters for Real-Time Superconducting Qubit Flux Predistortion
Flux-activated two-qubit gates in superconducting processors require correction of line distortion, which otherwise produces residual detuning, conditional-phase error, and leakage. Prior demonstrations of cryoscope-based distortion calibration have generally used commercial solutions that specify the filter models but not their FPGA implementation. These details matter for custom and open-source systems, where the fixed-point coefficient and datapath formats set how accurately the correction is realized, and the IIR feedback loop in its standard form does not meet timing at the required clock rate. We derive the coefficient formats of the correction filters from a step response error tolerance, using bounds on the quantization-induced displacement of the poles and zeros over the physical parameter range of each distortion, and the accumulator format from the smallest input change that must remain resolvable at the output. The same analysis gives the conditions under which quantization preserves filter stability. We implement the resulting FIR/IIR cascade on the QubiC platform at a fabric clock rate of \SI{500}{MHz}, using a super-sample-rate structure with scattered look-ahead pipelining, which removes the feedback recursion from the critical path without changing the target transfer function. A representative cascade for our \SI{1}{GS/s} flux lines, comprising an integrator, a second-order section, and a 20-tap FIR, consumes 88 DSP slices and adds \SI{162}{ns} of latency. We confirm the hardware implementation by correcting characteristic bias-tee distortion, an intermediate step toward full cryoscope-based calibration.
Read the full abstract
Artificial Intelligence
Skill-based Agentic Evaluation for Real-time Data Science Tasks
We present a framework for evaluating data-science agents on live, continuously updated data using executable ground truth and format-agnostic factoid scoring. Consider this example query: "what were last week's audience sizes"—the reference answer changes as the underlying data changes, so static references become outdated and standard LLM-as-a-judge pipelines cannot verify responses against a fixed ground truth. Our central contribution, ground-truth-as-code, encodes each expected answer as an executable reference function that recomputes the answer directly from live data at evaluation time, ensuring the reference remains consistent with the system it describes. We combine this with a factoid-level, format-agnostic judge that decomposes both the agent's response and the computed ground truth into atomic claims and scores precision, recall, and accuracy over them, irrespective of the response format (prose, list, table, HTML, etc.). The approach is applicable to agents whose expected outputs can be expressed as executable data computations. We validate the framework through a human–LLM agreement study on an internally developed machine learning skill deployed in production, using a synthetic database constructed to reproduce production schemas and entity relationships. Relative to a natural-language ground-truth baseline, our method achieves a 29% improvement in the Matthews Correlation Coefficient (MCC)—a class-balanced measure of agreement between expert annotators and LLM-as-a-judge predictions—and a 16% reduction in token consumption per test case, while a self-directed baseline lacking explicit ground truth is anti-correlated with human judgment. Agents that perform multi-source data integration and computation over non-stationary data are routinely deployed in industry; we propose ground-truth-as-code as a practical methodology for their evaluation.
Read the full abstract
Computer Vision
VPRef: A Cross-Domain Benchmark for Referring Remote Sensing Image Segmentation
Rapid advancements in vision-language models have propelled Referring Remote Sensing Image Segmentation (RRSIS) to the forefront of Earth observation. However, practical deployments suffer severe performance degradation under a coupled dual-drift paradigm: visual domain drift from cross-spatial-resolution mismatches and spectral variations, alongside textual logic drift from unconstrained, variable user-input granularities. To mitigate these bottlenecks, this paper establishes the first cross-domain RRSIS benchmark, designated as the Vaihingen-Potsdam Referring (VPRef) dataset, comprising 46,972 language-image-annotation triplets organized into a three-tier linguistic hierarchy. Building upon this benchmark, we develop a tailored parameter-efficient domain adaptation baseline anchored on the Segment Anything Model (SAM3) via Low-Rank Adaptation (LoRA). Our framework counteracts visual distribution discrepancies through pseudo-label-driven self-training and addresses textual logic drift via random multi-granularity text prompt mixing. Crucially, the distribution of empirical metrics across ablative variants suggests a potential decoupling between cross-modal semantic robustification and visual domain alignment, demonstrating that linguistic variance drives fine-grained semantic invariance while pseudo-label propagation governs macro-scale spatial grid alignment. Extensive benchmarks demonstrate the proposed framework achieves superior cross-domain segmentation boundaries while modifying merely 1.08% of the foundational parameter footprint, establishing a robust baseline for future multi-modal remote sensing domain adaptation research. The dataset and code will be available at https://github.com/quanweiliu/VPRef.
Read the full abstract
Machine Learning (Statistics)
Certified Inference and Training for Deep Equilibrium Networks: A Continuation Framework with Polynomial Complexity Guarantees
We develop a certified continuation framework for inference and training in deep equilibrium networks (DEQs), with training posed as interpolation to accuracy $2^{-b}$. For inference, input homotopy selects an equilibrium branch from a supplied start root, and a rounded tracker follows it under quantitative conditioning, derivative, boundary, and tube-radius certificates. The framework includes structured factorized certificates, sequential block elimination, inheritance of contraction guarantees in adapted coordinates, and bordered continuation through simple folds. For smooth multidimensional DEQs, including tanh networks, rational local tests can construct and validate oriented continuation charts under explicit geometric promises. For training, programmable dormant bilinear rank-one channels provide output-preserving residual-aligned repairs. Loaded Tikhonov solves diagnose insufficient parameter-to-output directions, while certified gate realization, column stability, well-posed inference, and finite-update error budgets control each pass. Under polynomially bounded certificate, encoding, precision, and backend costs, both inference and training have bit complexity $O(\mathrm{poly}(L+b))$, where $L$ is the encoded instance length; training uses $O(b+\ell)$ passes and reserve channels from an initial residual bounded by $2^\ell$. A budgeted implementation returns either certified success or inconclusive termination. The quantitative core and local certificate machinery are machine-checked in Lean 4, while numerical experiments illustrate the training mechanism.
Read the full abstract
Fluid Dynamics
Extensible membranes in inviscid flow: aerodynamics and singular limits
We develop a two-dimensional inviscid model for extensible membranes with continuous vortex shedding from both edges, coupled to a weak spectral Galerkin discretization of the membrane equation that permits direct computation at zero bending rigidity. Viewing the pressure jump as a flux for bound vorticity explains how membranes respond to concentrated fluid loading. For fixed-fixed membranes, compliance draws the body toward the leading-edge vortex, delaying its detachment and enhancing lift primarily during start-up; after periodic shedding develops, compliance mainly amplifies the force oscillations rather than mean lift. Vortex detachment can unload heavy membranes into compression, producing bending-regularized wrinkles. For $R_2>0$, the membrane equation remains well-posed independently of the sign of the tension, provided the membrane remains an immersion. Releasing the trailing edge creates an intrinsic degeneracy: the tension vanishes at the free endpoint, making the $R_2=0$ problem formally underdetermined, while the weak formulation selects its bounded-energy branch. This vanishing-tension endpoint traps pressure disturbances and drives rapid tip-snapping; the dominant frequency and effective wave number approach their zero-rigidity limits with an inverse-logarithmic correction arising from a singular Bessel branch. Finally, decreasing the stretching modulus destabilizes periodic flutter, and the repeated fluid-driven departure and elastic return suggest a homoclinic tangle underlying the transition from periodic to chaotic flutter.
Read the full abstract
Mesoscale and Nanoscale Physics
Entropy-driven transitions between extended integer and fractional quantum Hall regimes
Electronic states with coexisting Wigner-crystal order can sometimes exhibit a quantum Hall effect over a finite range of electron densities—i.e., exhibit “extended” quantum Hall (QH) plateaus in the absence of disorder. Such an extended quantum Hall state can then compete with other QH states over the same density range, allowing a first-order thermal transition between them. Here, we analyze several settings in which the entropy associated with Goldstone modes (e.g., magnons or phonons) or soft gapped modes (e.g., magnetoroton) drives a finite-temperature transition between competing QH regimes. Applying this framework to moiré rhombohedral graphene, we argue that a soft magnetoroton in a fractional quantum anomalous Hall state provides a plausible bulk mechanism for the observed thermal evolution from an extended integer QH to a fractional QH regime.
Read the full abstract
Human-Computer Interaction
"ChatGPT, what am I missing?": Designing AI Workflows around Professional Task Structure to Shape Analytic AI Use
General-purpose AI lets users choose what support to request, but leaves them to structure the support a professional task requires. We examine how interactive workflows can embed professional task structure without prescribing how users engage with AI. We designed two scaffolded interfaces around the same negotiation scaffold: one presented a completed AI analysis, while the other supported user-directed, incremental development. A four-condition randomized experiment with 800 participants compared these interfaces with no-AI and an AI chat interface. AI-supported conditions improved preparation coverage over unaided work; the scaffolded workflows further improved coverage over chat. Although the scaffolded workflows produced similar coverage, the user-directed workflow elicited a broader repertoire of analytic requests and lower subjective effort. Professional scaffolding therefore depends not only on displayed structure but on how workflows organize users' engagement with it. Effective professional AI must structure how users and AI build analysis together.
Read the full abstract
Analysis of PDEs
Finite inverse nodal problems for singular weighted Sturm–Liouville equations: variational selection and spectral matching
The recent work \cite{HeWuXiaZhang2025} introduced a finite-data inverse nodal framework for regular one-dimensional Sturm-Liouville operators. Nevertheless, formulating a multidimensional inverse nodal theory for Schrödinger operators remains a challenging open problem. This paper addresses this gap by establishing a finite radial inverse nodal theory for the radial spectral branch of Schrödinger operators in balls. In contrast with the interval case, the nodal data are the radii of spherical nodal hypersurfaces of radial eigenfunctions. The exact radial reduction preserves this PDE nodal geometry and leads naturally to a singular weighted Sturm–Liouville problem with weight $w(r)=r^{n-1}$, rather than to a regular interval model. We minimize the PDE distance $\|Q-Q_0\|_{L^p(B_R)}$ , equivalently the weighted distance $\|q-q_0\|_{L^p_w(0,R)}$, among all radial potentials matching finitely many prescribed spherical nodal radii. For the associated nodal constraint sets, we prove spectral regularity, nodal differentiability, weak closedness, exact realization, and a finite-codimensional $C^1$ manifold structure. Crucially, without the variational selection imposed by \(q_0\), the prescribed finite nodal radii fail to determine the potential uniquely: the admissible potentials are invariant under constant shifts, and the finite nodal constraints yield locally infinite-dimensional level sets at regular points.
Read the full abstract
Analysis of PDEs
Asymptotic Stability of Multi-Solitons for Coupled Nonlinear Schrödinger Equations via the $\bar{\partial}$-Method
The Riemann-Hilbert problem for the focusing coupled nonlinear Schrödinger (CNLS) equation is formulated on the basis of the corresponding $3\times3$ matrix spectral problem. We remove the discrete spectrum of initial RHP with the aid of Darboux transformations. Based on the $\bar{\partial}$-steepest descent method, we establish the long-time asymptotic behavior of solutions to the CNLS equation for initial condition in the weighted Sobolev space. Compared to the improved nonlinear steepest descent method, we improve the error estimate up to order $\mathcal{O}\left(t^{-3/4}\right)$. Furthermore, we obtain the asymptotic stability of multi-soliton solutions for CNLS equation and analyze the law of multi-soliton collision in the view-point of Yang-Baxter map.
Read the full abstract
Dynamical Systems
A Heterogeneous FitzHugh-Nagumo Model Exhibiting Local and Regional Dynamics that Mimic Spontaneous Atrial Fibrillation
We study two-dimensional networks of FitzHugh-Nagumo oscillators in regimes that mimic cardiac tissue. The networks include small layers of cells that have fast-recovery characteristics and adjacent layers of cells that have slow-recovery. Numerical simulations show that the boundary between the fast- and slow-recovery cells can initiate fibrillatory-like behavior when activated by a single, healthy wave in the network. We discuss possible connections between these structures and the onset of atrial fibrillation, with the goal of improving our understanding and treatment of this costly condition. Our main conclusion is that a single, normal excitation of small areas of heterogeneity embedded in healthy tissue can initiate arrhythmias and the two dimensional network can then sustain irregular firing patterns in the form of double swirling-back curves and spiral waves. This occurs with a very simple model of excitable cells and we give a clear mechanistic description of the arrhythmia. The model illustrates how increasing heterogeneity in heart tissue can progressively cause first intermittent and then persistent arrhythmic behavior. Another conclusion is that the center of problematic firings can drift away from the heterogeneity into healthy tissue, thus presenting phantom targets for treatment.
Read the full abstract
Numerical Analysis
A Matrix-free Augmented High Order Compact Solver for Variable-Coefficient Biharmonic Problems
We propose an augmented high-order compact finite difference method for biharmonic equations with clamped boundary conditions and variable coefficients. Standard mixed-type formulations introduce an auxiliary variable, but its boundary values are unavailable, leaving the resulting discrete systems globally coupled and difficult to solve at large scales. Our key contribution is the development of a new augmented formulation that treats these unavailable boundary values as additional unknowns, reduces the global coupling to a lower-dimensional Schur complement system, and yields decoupled second-order subproblems. The Schur complement is solved by matrix-free GMRES, while the subproblems are handled by FFT-based fast solvers. The method achieves fourth-order accuracy using compact stencils, and has $O(n\log n)$ computational complexity, enabling the solution of the biharmonic equation with $1024^3$ degrees of freedom within several minutes. To the best of our knowledge, this level of computational efficiency has not previously been achieved in either the literature or practice. Using energy estimates and Fourier analysis, we derive a new $L^2$-estimate for Poisson equations with inexact Dirichlet boundary and then prove the convergence of the proposed scheme. We provide ample numerical experiments to confirm the accuracy, efficiency, and further apply the fast and accurate solver to triharmonic equations, high-wavenumber problems, Stokes flow, and plate bending problems.
Read the full abstract
General Relativity and Quantum Cosmology
Correlated Galactic Confusion Foreground for the LISA-Taiji-TianQin Network and Its Impacts on Resolvable-Source Analysis
The millihertz gravitational-wave sky is expected to be observed by a network of space-based detectors (LISA, Taiji, and TianQin) in the 2030s. A dominant noise in this band is the confusion foreground produced by O(10^7) unresolved Galactic binaries (GBs). Because the same population projects onto the time-delay interferometry (TDI) channels of the different detectors, the foreground is necessarily correlated across the network. We construct the full foreground noise covariance matrix for the LISA-Taiji-TianQin network from a catalogue of ~3 x 10^7 GBs through numerical simulation, and we derive an analytic model of the cross-detector foreground coherence that provides a cross-check and physical interpretation of the numerical results. We derive the overall sensitivity of the detector network based on this covariance matrix, and further characterize the frequency- and time-dependent cross-detector foreground correlations. Taking massive black hole binaries (MBHBs) and GBs as representative transient and continuous sources, we further compare the block-diagonal (i.e., neglecting the cross-detector foreground correlation) and full-covariance noise models in terms of their impacts on the signal-to-noise ratio (SNR), parameter uncertainties, and Bayesian posteriors. The impact is confined to specific signal regimes, affecting primarily high-mass (M_c ~ 10^7 M_sun) MBHBs and low-frequency (f_0 <~ 2 mHz) GBs, with SNR relative differences of up to ~30% and ~10%, respectively. No statistically significant parameter bias arises under either noise model, as verified by probability-probability tests. Parameter estimations for MBHBs and GBs are performed using the network analysis pipelines implemented in the Triangle-BBH and Triangle-GB codes. Both repositories, together with the simulated foreground data and network sensitivities, are publicly released for diverse scientific investigations.
Read the full abstract
Astrophysics of Galaxies
The Study of Detailed Morphology of Milky Way Dwarf Galaxies: Draco and Boötes I
We present a photometric study of the outer stellar structures of the Milky Way dwarf spheroidal galaxies (dSphs) Draco and Boötes I, using deep wide-field imaging data. The old main-sequence stars are used to trace their spatial distributions beyond their tidal radii. We derive global structural parameters and radial profiles of number density, ellipticity, and position angle from their stellar distributions. Draco and Boötes I show contrasting features. Draco shows no prominent extended stellar distribution, although weak elongations are detected toward the eastern and northwestern directions. Its stellar distribution remains relatively compact compared with its estimated Jacobi tidal radius ($r_J=57.2^{+13.5}_{-11.1}$ arcmin), suggesting that the stellar component is tightly bound by its gravitational potential. In contrast, the radial number-density profiles of Boötes I along several directions show excess from the best-fit exponential profile outside of around $r\sim20$ arcmin, near the estimated Jacobi radius ($r_J=21.6^{+9.3}_{-7.6}$ arcmin). In addition, the ellipticity of Draco decreases with radius, whereas that of Boötes I increases toward larger radii. Bo"otes I also exhibits a prominent S-shaped stellar structure extending approximately along its orbital direction. Together, the radial density excess, increasing ellipticity, and S-shaped morphology suggest that the outer stellar structure of Boötes I may trace tidal tails produced by interactions with the Milky Way. The contrasting morphologies of Draco and Boötes I further suggest that the response of dwarf galaxies to the Milky Way tidal field may depend not only on their orbital histories, but also on the internal structure of their dark-matter halos.