Earth and Planetary Astrophysics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 5 November
We developed TitanMPAS, a new Titan global and regional climate model, to simulate atmospheric dynamics and methane cycles. It integrates the non-hydrostatic MPAS dynamical core and TitanWRF physics parameterizations, with corrections to relax the thin-atmosphere assumptions on the gravity and curvature terms. TitanMPAS improves upon TitanWRF by incorporating a better moist convection parameterization and the observed surface properties. Long-term simulations ($>$100 Titan years) with a high resolution of $1^\circ$ and the realistic topography show that TitanMPAS is able to produce the stratospheric superrotation with typical equatorial wind speed over $\rm 120\,ms^{-1}$ and the maximum zonal wind speed exceeding $\rm 170\,ms^{-1}$ . Besides the good match of temperature profiles to the Cassini CIRS observations, the simulated wind, temperature and methane abundance in the troposphere match well with Huygens probe in-situ measurements. TitanMPAS also captures the major features of seasonal methane precipitation distribution patterns inferred from the observed cloud activities, as well as the vertical and latitudinal variations of methane abundance in the reanalysis of Cassini VIMS data. Resolution sensitivity studies show that higher resolution produces faster stratospheric superrotation, as well as stronger near-surface wind due to better resolved terrain variations. We further demonstrate that, despite the weak solar insolation, the near-surface temperature, pressure, wind magnitude and methane abundance all exhibit diurnal variations. Lastly, we show potential impacts of topography on methane transport and eddy momentum flux in both troposphere and stratosphere, which should be investigated in a future study.
Data Structures and Algorithms
Adaptive Data Analysis and Adversarial Robustness on Insertion-Deletion Streams
Classical streaming algorithms and statistical mechanisms frequently fail when future inputs or queries depend adaptively on prior outputs. In this work, we resolve central open questions in both adaptive data analysis (ADA) and adversarially robust turnstile streaming by introducing a unified hierarchical estimator-corrector-learner framework. For adaptive data analysis over an unrestricted domain, we design a randomized mechanism that answers $k$ adaptively chosen statistical queries to within additive error $\alpha$ using $\tilde{O}(\frac{\sqrt{k}}{\alpha} + \frac{1}{\alpha^2})$ samples, nearly matching the lower bounds of Hardt and Ullman [FOCS 2014] and Steinke and Ullman [COLT 2015] while improving upon the classic $\tilde{O}(\frac{\sqrt{k}}{\alpha^2})$ bound of Dwork et al. [STOC 2015] and Bassily et al. [STOC 2016]. For known finite domains $U$, we combine our mechanism with private multiplicative weights to improve the sample complexity to $\tilde{O}\left(\frac{1}{\alpha^2}+ \min\left(\frac{\sqrt{k}}{\alpha}, \frac{\sqrt{\log |U|}}{\alpha^2}\right)\right)$. Building on our ADA mechanism, we construct a fixed linear sketch with a stateful decoder that answers $\tilde{O}(\frac{1}{\epsilon^2})$ adaptive $F_2$ moment estimation queries to within a $(1\pm\epsilon)$-multiplicative factor using $\tilde{O}(\frac{1}{\epsilon^2})$ bits of space. Finally, by embedding this sketch into a binary-tree recursion, we obtain the first nearly space-optimal adversarially robust algorithm for $F_2$ estimation on insertion-deletion streams. Our algorithm uses $\tilde O(\frac{1}{\epsilon^2})$ bits of space, improving upon the $\tilde{O}(\frac{1}{\epsilon^4})$ bound of Gribelyuk et al. [STOC 2026] and matching the insertion-only bound of Woodruff and Zhou [FOCS 2021]. This demonstrates that no asymptotic space overhead in $\epsilon$ is required to achieve adversarial robustness in the turnstile model.
Read the full abstract
Robotics
VICTR: Value-Informed In-Context Learning for Vision-Language-Action Models
Recent advances in robot foundation models have highlighted the potential of in-context learning (ICL) for adapting robot behavior from demonstrations without further fine-tuning. Previous work has used retrieval-based post-training to equip pretrained vision-language-action (VLA) models with the capability for ICL by teaching them to condition action predictions on retrieved visually-relevant demonstration chunks. However, the effectiveness of retrieval hinges on selecting context relevant to the current execution stage, which visual similarity alone may not capture. We introduce VICTR, a framework enabling in-context learning in VLAs via progress-informed context retrieval built around an In-Context Value Function Estimator (IC-VFE). IC-VFE conditions on a reference demonstration video, a language instruction and the current observation to estimate task-relative progress. By conditioning progress estimation on a reference demonstration, IC-VFE can align the current state with a demonstrated execution even for tasks unseen during training. VICTR uses the estimated progress to select demonstration chunks at corresponding stages of execution and supplies them to a $\pi_{0.5}$ policy post-trained for in-context action generation. On unseen out-of-domain real-world manipulation tasks, VICTR raises the success rate from 6.2% for a fine-tuned $\pi_{0.5}$ baseline to 23.8% and more than doubles the task progress rate, from 28.9% to 55.5%. Project page with code, data and videos: https://ai4ce.github.io/VICTR/
Read the full abstract
Distributed Computing
CPU Micro-Architectural Characteristic Sensitivity Study on CPU-Side Agentic Task Latency
We perform a novel study of CPU micro-architectural characteristics on how they affect agentic AI CPU side latency. Small enterprises and individual users looking to reduce costs and seeking data privacy benefit from running agents locally, motivating an investigation into the optimal performance characteristics of an edge CPU to improve user experience. We investigate the relationship between CPU core frequency, CPU uncore frequency, active physical cores, and symmetric multi threading with agentic task latency in single and multi agent configurations. Across eight experiments on an Intel edge CPU, we find that P-core frequency produces the largest median latency improvement among the evaluated parameters. Increasing P-core frequency from 2.5 to 5.5 GHz yields a 1.154$\times$ speedup for a single agent and a 1.341$\times$ speedup for eight concurrent agents. We are the first to characterize hardware micro-architectural relationships on single and multi agent configurations with TerminalBench; we also provide an open source framework and dataset for repeatable CPU side latency agentic benchmarking.
Read the full abstract
Emerging Technologies
Hybrid Quantum-Classical Annealing for Protein Side-Chain Optimization: A Feasibility Study
Hybrid quantum-classical annealing solvers are moving from research laboratories toward industrial use, but their advantage over classical optimization appears to be confined to a narrow class of problems. A recent systematic benchmark of the D-Wave hybrid solver against industry-leading classical solvers, across several classes of optimization problems, found it to be most competitive on binary quadratic programs, while noting that few industrial problems take this form. Therefore, identifying real-world industrial problems that can be modeled with this structure is a key challenge. We propose protein side-chain optimization, a core step of computational protein design, as one of these problems: it is natively a binary quadratic program, and its application context requires pools of low-energy solutions, which annealers naturally return. In this feasibility study, we test whether the competitiveness of the hybrid solver against industry-leading classical solvers extends to this problem. On 40 instances derived from 20 experimentally determined protein structures with up to about 200 amino acids and 2000 binary variables, we compare the results achieved with a hybrid solver, run for 5 seconds, against those of the commercial solver Gurobi, run for 10 seconds, 1000 seconds, and 4 hours. The hybrid solver reaches the certified optimum whenever one is available, matches Gurobi's performance on smaller instances, and outperforms it on larger instances, finding lower-energy solutions. These results show that the competitiveness of the hybrid solver on binary quadratic programs, so far observed only on a synthetic benchmark, extends to a real-world problem. This motivates comparisons with classical heuristics specific to protein side-chain optimization.
Read the full abstract
Sound
FoleyForge: Free-form, Controllable, Rectified-flow Editing of Sound Effects
We present FoleyForge, a generative model for instruction-based editing of sound effects. Given an input clip and a free-form instruction describing the desired change, it applies the edit while preserving the input's identity. A single model handles semantic, stylistic, and DSP-like changes. We introduce a data pipeline that guides an audio language model to author both DSP-based acoustic edits and similarity-preserving semantic edits, thus addressing the lack of publicly available audio editing data. Such data is then used to fine-tune a rectified-flow audio generation model, which we extend to expose attribute controls for loudness change, edit strength, and an input-derived contour envelope, each tunable via classifier-free guidance, yielding a more expressive editing model. FoleyForge achieves state-of-the-art instruction adherence at competitive audio quality and source faithfulness.
Read the full abstract
High Energy Physics (Experiment)
GeoRead: Geometry-Aware Transformer for Continuous AC-LGAD Readout Reconstruction
AC-coupled Low-Gain Avalanche Diodes (AC-LGADs) are promising silicon sensor technologies for high-precision four-dimensional tracking. Position reconstruction in AC-LGADs relies on correlations among waveforms induced on multiple readout pads, where analytically solving the signal propagation becomes difficult, motivating data-based machine learning reconstruction. Existing machine learning approaches generally assume a fixed readout pad layout and predict one hit from an isolated, temporally aligned waveform window. These assumptions limit their flexibility across sensor designs and applicability to continuous readout where signal arrival times are not known in advance and multiple hits might overlap in the same waveforms. We introduce GeoRead, a spatial-temporal Transformer enabling multi-event continuous position prediction and uncertainty estimation. We incorporate relative pad positions into attention and produces time-resolved hit position estimates with predictive uncertainties. Time-jitter and additive event-mixing augmentations are used to train the model on temporally misaligned and overlapping waveforms synthesized from single-event measurements. Using four-channel transient-current-technique (TCT) data of a 500\mum-pitch AC-LGAD, GeoRead achieves median position errors of 5.8\mum within the convex hull of the readout-pad centers and 8.2\mum over the full scanned region at 190\volt. The model maintains comparable accuracy under temporal shifts and demonstrates time-resolved reconstruction of superposed events, without predefined per-event window. These results provide a basis for extending waveform-based position reconstruction toward continuous readout and flexible sensor geometries.
Read the full abstract
Hardware Architecture
Enabling Retraining-Free Accurate Inference in Analog Compute in Memory Accelerators
Analog compute-in-memory (CIM) accelerators compute matrix-vector products directly inside memory arrays, eliminating weight movement and promising order-of-magnitude gains in inference efficiency. However, converter and device errors make pretrained models unusable on these arrays, and hardware-aware retraining is costly. We enable retraining-free, accurate inference of pretrained models on simple analog arrays with low-cost, shared calibration. Our key observation is that analog error depends on how each layer is represented on the array, and that this representation can be changed offline without changing the computation. We center the inputs and apply Hadamard rotations designed for analog arrays, which keep shared reference errors spread and confine input mixing to each array. Across CNNs, vision transformers and LLMs up to 14B parameters on PCM and ReRAM, the method brings vision models and larger LLMs within a few points of floating-point accuracy and matches or approaches published hardware-aware training without training any weights. On ReRAM with 6-bit ADCs, it restores ViT-B/16 from 37.4% to 82.9% and Phi-4 from 27.0% to 72.2%, both within 2.2 points of floating-point accuracy.
Read the full abstract
Dynamical Systems
Stability of large dynamical systems using Gershgorin Disc Theorem
Understanding the stability of large nonlinear dynamical systems is a fundamental problem in many fields, including biological, technological, and social networks. Traditional stability methods often rely on explicit eigenvalue calculations or the construction of Lyapunov functions, which become computationally difficult for large interconnected systems. In this work, we introduce a stability classifier that provides a computationally efficient way to determine the stability of complex systems without performing full spectral analysis. Our approach combines the Dynamical Jacobian Ensemble framework, which uses the network structure and the underlying dynamics to construct a Jacobian, with the Gershgorin disc theorem, which provides bounds on the eigenvalues of the system's Jacobian matrix. Using this combination, we derive an analytical classifier that predicts whether a dynamical system is asymptotically stable, unstable, or sensitively stable based on a small set of dynamical and network parameters. The analysis reveals that the stability of large dynamical systems is strongly influenced by highly connected hub nodes. This observation allows the stability condition to be simplified by focusing on the contribution of the hub-associated Gershgorin disc. Extensive numerical simulations on large ensembles of Jacobian matrices confirm that the proposed classifier accurately separates stable, unstable, and sensitively stable regimes across a wide range of dynamical parameters and network structures. The resulting framework provides a simple and scalable tool for predicting the stability of large dynamical networks while capturing the interplay between network topology and interaction dynamics.
Read the full abstract
Group Theory
The quaternionic reflection groups with imprimitive complexifications and the finite subgroups of GL(2,C)
We give a transparent development of the quaternionic reflection groups which have imprimitive complexifications, including a description of their reflections and the corresponding normal reflection subgroups. They are seen to be of rank one or rank two, and are obtained from minimal complex reflection groups by the addition of one quaternionic reflection and a complex scalar matrix of finite order. In the case of the rank two groups, we use our techniques to consider the broader question of what are the minimal irreducible subgroups of GL(2,C) with a given collineation group. This leads to a complete classification of the finite irreducible subgroups of GL(2,C) in terms of the minimal groups, with the groups giving rise to quaternionic reflection groups located within it.
Read the full abstract
High Energy Physics (Phenomenology)
Exact and hybrid neutrino oscillation probabilities via the evolution operator
We revisit the three-flavor neutrino oscillations in constant-density matter using the evolution matrix expressed in terms of the Lagrange-Sylvester interpolation. Taking advantage of Vieta's formulas for the Hamiltonian of the system, we derive exact closed expressions for the oscillation probabilities $P_{ee}$, $P_{\mu e}$, and $P_{\mu\tau}$, which are concise and simple, and structurally identical to their vacuum counterparts. The CP-violation contribution, proportional to the Jarlskog invariant $\mathcal{J}$, appears as a single, clearly separated term. Our approach does not require introducing neutrino mixing in the medium and avoids using a matter-dependent CP-violation phase, facilitating the separation of genuine CP violation from that induced by matter effects. We explicitly verify that, in the limit $V \to 0$, our expressions for the flavor transition probabilities reduce to the well-known vacuum formulas. The exact structure of the probabilities is preserved if the exact, not very enlightening, trigonometric eigenvalues are replaced by approximate expressions in radicals. We illustrate this hybrid approach with eigenvalues obtained from two successive rotations of the Hamiltonian. For an experiment like DUNE, the hybrid probability values match those of the exact probabilities within absolute errors of about $2\times 10^{-6}$ in all channels and relative errors less than $0.01 \%$ for $P_{ee}$, $P_{\mu e}$, and $P_{\mu\tau}$.
Read the full abstract
Signal Processing
A Gamma-Mixture Solution for Definite Noncentral Complex Gaussian Quadratic Forms
Finding exact solutions for the statistics of definite noncentral complex Gaussian quadratic forms (CGQFs) has long been a challenging problem. Among existing exact approaches, Raphaeli's formulation [1] remains the most computationally efficient. However, its analytical tractability is hindered by the dependence of its series coefficients on the evaluation variable, which confines their statistics to the probability density function (PDF) and cumulative distribution function (CDF). This paper overcomes this limitation by deriving novel Gamma-mixture representations for the PDF and CDF of positive- and negative-definite noncentral CGQFs. The resulting structure broadens Raphaeli's statistical framework beyond the PDF and CDF to a wider class of CGQF functionals and a substantial range of practical applications. In particular, expectations of integrable functions of definite noncentral CGQFs are expressed as weighted sums of the corresponding expectations over Gamma random variables, enabling the direct derivation of moments, transforms, and performance measures. Moreover, the proposed formulation reduces the single-point complexity from \(O\!\left(n^2K+nK^2\right)\) for Raphaeli's method to \(O\!\left(nK+K^2\right)\), where \(n\) denotes the quadratic-form dimension and \(K\) the truncation order. The proposed Gamma-mixture structure also enables closed-form approximations that, by construction, remain valid probability distributions for any truncation order. In addition, uniform PDF and CDF truncation-error bounds are derived, allowing prescribed-accuracy truncation. As a sample application, we derive the first reported exact average bit error rate expression for maximal-ratio combining receivers with an arbitrary number of branches under an arbitrary positive-definite Rician correlation structure.
Read the full abstract
Analysis of PDEs
Regularity of Weak Solutions near Singular Minimizing Cones for the One-Phase Free Boundary Problem
Alt and Caffarelli proved an Allard-type $\epsilon$-regularity theorem near the flat one-homogeneous minimizer of the one-phase free boundary problem. A natural follow-up question is whether an analogous regularity result holds near singular minimizing cones. In this paper, we prove such an $\epsilon$-regularity theorem near a strongly integrable one-phase minimizing cone with an isolated singularity. More precisely, we show that, after a suitable translation and rotation, the free boundary of any non-degenerate weak solution sufficiently close to the cone is graphical over the free boundary of a leaf of the De Silva–Jerison–Shahgholian foliation. This result is analogous to recent $\epsilon$-regularity theorems in minimal surface theory by Edelen and by Edelen–Spolaor; our proof adapts the strategy of Edelen to the one-phase setting.
Read the full abstract
Complex Variables
McShane's identity and the Brownian loop measure
We combine McShane's identity for a once-punctured torus with the length-spectrum identity of Wang and Xue. An exact identity in each primitive homology class yields a finite limit for the difference of two divergent length-spectrum sums over self-intersecting hyperbolic geodesics. The limit is $\frac18$ and is equivalent to McShane's identity. We also derive higher-iteration identities governed by integer divisors.
Read the full abstract
Optimization and Control
Compressed Per-Player Local Methods for Multiplayer Federated Learning: Exact Convergence via Increment Sharing
Multiplayer Federated Learning (MpFL), introduced by Yoon et al. (2025), extends classical federated learning to settings where clients are rational players in a game with individual objectives and strategies, seeking an equilibrium. A natural baseline is Per-Player Local SGD (PEARL-SGD), where each player performs several local SGD steps before exchanging strategies through a central server. However, the original PEARL-SGD formulation does not extend cleanly to compressed communication. Directly compressing the players' strategies can prevent convergence to the equilibrium, even with deterministic gradients. To address this issue, we reformulate PEARL-SGD so that players communicate local strategy increments rather than the strategies themselves. Without compression, the two formulations are equivalent, but with compression, increment sharing preserves exact convergence, allowing us to design the communication-efficient compressed PEARL-SGD (C-PEARL-SGD). Beyond compression, we also consider variance reduction as another axis of improvement, introducing PEARL-SVRG and its compressed variant C-PEARL-SVRG. Under the original MpFL assumptions, we establish convergence guarantees for all variants through a unified parametric inequality. Numerical experiments, including distributed spectrum sensing, demonstrate the practical benefits of our methods over vanilla PEARL-SGD.
Read the full abstract
Programming Languages
Fibered Separation Logic: Weakest Preconditions, Universal Constructions, and Local Independence
This paper introduces a categorical framework for models of higher-order separation logic including the weakest precondition modality. Weakest preconditions are interpreted by strong monads on a category fibered over a model of Moggi's computational lambda calculus. The fibered categories in question are termed bunched fibrations and shown to be equivalent to BI hyperdoctrines. Well-known heuristic techniques for obtaining weakest preconditions are shown to be expressible in categorical terms and are proved sound. The “baking in the frame rule” trick is shown to satisfy a universal property. Constructions are given for extending a program logic with cost credits. Our largest case study is parametrized by a category having local independent product (LIP) structure, a notion due to Simpson that axiomatizes name generation, randomness, and local state. From an LIP category, we construct an allocation monad, a bunched fibration, and a monad lifting. We instantiate our construction to obtain a novel probabilistic separation logic for measure-theoretic probability that both simplifies and clarifies prior work.
Read the full abstract
Artificial Intelligence
Cancellation Is Not Enough: What Retries Leave Behind in an Overloaded LLM Engine
Clients and proxies in front of an LLM engine retry calls that time out. After a transient overload, these retries can keep the engine from recovering even when calls arrive below its capacity. Since the engine may keep computing for clients that have left, propagating cancellation looks like the natural remedy. In this paper, we test it on vLLM with overload experiments on three open models, and with scheduler traces of one that follow each client attempt to the execution it creates in the engine. We find that with retries on, cancellation alone did not restore service in any run, and only 12-38% of the calls that arrived after the overload were delivered. The traces suggest why: retries that vLLM ran typically started prefill less than half a second before they timed out. Executions that vLLM later aborted took 79-85% of the prompt tokens it computed, and vLLM's prompt-token counter missed a third to half of all computed prompt tokens. A retry budget restored service by shedding retries but left many of the overload's calls undelivered. Request coalescing delivered every call from the overload onward, some late, unless cancellation had already aborted the running execution. Overload controls should thus be judged by the executions that retries add and the calls that clients receive.
Read the full abstract
Computation and Language
Compression of Emotion in Language Model Representations
Large language models (LLMs) have been evaluated on their ability to identify emotions expressed in text and produce fluent emotional language. However, output predictions alone do not reveal how fine-grained emotion distinctions are organized internally. We study seven LLMs on GoEmotions, an English Reddit dataset annotated with 27 fine-grained emotion categories plus neutral. We compare model predictions and emotion-prompted final-token representations with the 28 GoEmotions categories and with coarser emotion-family and sentiment groupings. We find a consistent pattern of $\textit{overcompression}$ relative to the fine-grained GoEmotions taxonomy. Under the tested KMeans protocol, when we cluster their hidden representations without using emotion labels, the clearest split is into two groups that largely separate positive from negative emotion. Coarser emotion groupings are also recovered with fewer clusters than the full 28-category taxonomy. Yet linear probes retain substantial fine-grained predictive information. These results suggest that fine-grained emotion information remains accessible even though broader affective structure more strongly organizes the unsupervised geometry.
Read the full abstract
Artificial Intelligence
Transporting the Past: An Optimal Transport View of Backtracking Counterfactuals
We study backtracking counterfactual inference for Structural Causal Models (SCMs) through the lens of optimal transport. In SCMs, a factual observation generally induces a posterior distribution over exogenous variables, making counterfactual inference inherently distributional. We introduce two complementary frameworks that transport this posterior onto the set of exogenous configurations satisfying a desired counterfactual query. The first constructs a natural pointwise projection and is suitable when the transported exogenous distribution can be used directly. The second enforces mutual independence among counterfactual exogenous variables, so that the transported variables remain interpretable as genuine exogenous noises of the same SCM. We show that both frameworks are consistent with the original backtracking counterfactual principle, and we propose marginal, penalty-based, and hard-constrained solvers for finite-posterior settings. Synthetic experiments on non-bijective SCMs illustrate the geometry of the problem and reveal trade-offs among transport cost, counterfactual constraint satisfaction, and preservation of exogenous independence.
Read the full abstract
Robotics
National and State-Level Approaches to Automated Vehicle Certification: A Comparative Framework for State Operational Governance
Automated vehicle (AV) deployment in the United States is expanding without a unified federal certification framework, leading to substantial variation in how states authorize and oversee AV testing and deployment. This paper examines how U.S. states regulate Society of Automotive Engineers (SAE) Level 4-5 automated driving systems (ADS), identifies common certification approaches, compares them with international practices, and evaluates the implications for North Carolina's future regulatory strategy. Publicly available state statutes, administrative regulations, agency guidance, and federal policy documents were reviewed. Ten states, selected to capture the range of regulatory approaches, were analyzed using a structured framework covering operational scope, governance and oversight, federal interaction, and implementation outcomes. Certification practices in the European Union, China, Japan, and Australia were reviewed for comparative context. Three state certification models were identified, reflecting increasing regulatory involvement: baseline legal compliance, administrative self-certification with ongoing oversight, and permit-based authorization requiring formal agency review before deployment. North Carolina currently aligns with the baseline compliance model. International frameworks are converging toward scenario-based testing, operational-design-domain-specific approval, safety-case documentation, cybersecurity assurance, and lifecycle oversight, although direct transferability to the U.S. is limited. The paper develops a three-model typology for comparing state AV certification approaches and integrates state practices with international frameworks, providing a consistent basis for evaluating differences in regulatory involvement, governance complexity, and institutional responsibilities across jurisdictions.
Read the full abstract
High Energy Physics (Phenomenology)
A Phase-Transition Portal to Enhanced Dark Matter Annihilation
We present a thermal dark matter (DM) scenario in which a phase transition after freeze-out changes both the DM spectrum and the dominant annihilation process, allowing an enhanced present day annihilation rate with suppressed direct detection. We realize this mechanism in a two-Higgs-doublet model extended by a complex scalar singlet, a Majorana fermion, and a heavier Dirac fermion. Before the transition, the Majorana state freezes out through $p$-wave annihilation into singlet scalars. The subsequent transition changes the dark fermion masses and mixing, enabling $s$-wave annihilation through a pseudoscalar portal. The surviving relic differs in mass and composition from the original state. We find relic compatible solutions with present day annihilation rates more than an order of magnitude above the canonical thermal value, without tuning to a mediator resonance, while satisfying direct detection bounds.
Read the full abstract
Algebraic Geometry
Special line bundles on tetragonal curves
One can associate a pair of vector bundles $(E, F)$ on $\mathbb{P}^1$ to every tetragonal curve: $E$ is the Tschirnhausen bundle and $F$ records numerical data of the ideal for the curve under its relative canonical embedding. In this note, we show that a Hurwitz–Brill–Noether general tetragonal curve must have balanced $E$, $F$ bundles, and provide counterexamples for the converse when $g = 8$ or $g \geq 10$.
Read the full abstract
Materials Science
Jackknife-conformal uncertainty for linear ACE potentials: calibrated forces and silicon properties compared with Bayesian and POPS baselines
Machine-learned interatomic potentials are misspecified, so Bayesian posterior variances understate their errors. For linear atomic cluster expansion (ACE) potentials we derive calibrated uncertainties from one misspecification-robust parameter covariance, the delete-one-configuration jackknife. Scaled by one conformal quantile from a held-out part of the training set, it gives per-atom force uncertainties close to their target coverage on held-out silicon data and on cracks left out of the fit; screw dislocations left out are under-covered by the smaller of the two models. With one scale fitted to the forces of a held-out test split, the same parameter distribution is propagated to 21 properties of silicon, from elastic constants to defect and surface energies, by implicit differentiation through each relaxation and by committees, and is tested against density functional theory (DFT) without tuning on any property. For a smaller and a larger model the intervals cover most properties, and the larger model's are about 4 times tighter. The Bayesian posterior with one calibrated scale has the wrong shape: it covers fewer properties and has far lower joint evidence. Pointwise optimal parameter sets (POPS), once their hypercube is numerically defined, performs comparably on the properties, but its per-atom force regions are not calibrated to a target (0.95 and 0.84 at a nominal 0.90). Where the jackknife fails is relaxed point defects, whose training cells are all hot snapshots: a bias that every configuration shares is invisible to a jackknife, but it can be measured from the training labels, and as a discrepancy term, devised after the property results were seen, it brings the coverage close to nominal.
Read the full abstract
Strongly Correlated Electrons
Thirty years of 2D MIT
The zero-magnetic-field metal-insulator transition in strongly correlated two-dimensional electron systems was experimentally discovered three decades ago, thereby triggering extensive experimental and theoretical investigations. Prior to this discovery, the occurrence of such a transition — as well as the very existence of a metallic phase in two dimensions — was regarded as forbidden within the framework of the one-parameter scaling theory of localization. In this work, we provide a comprehensive review of the transport and thermodynamic properties of two-dimensional electron and hole systems in which carrier-carrier interactions constitute the dominant energy scale. We present and critically analyze both experimental observations and theoretical developments accumulated over the past thirty years.
Read the full abstract
Solar and Stellar Astrophysics
Expanding the Volatile Abundance Inventory for High-Priority K-Dwarf JWST Exoplanet Systems
There are exceedingly few chemical abundance measurements available in the literature for K dwarf stars, especially for those with T$_{eff} <$ 4700 K due to an incompatibility of traditional analyses with their molecular-line-ridden optical spectra. To address the need for K dwarf abundance constraints, we present an elemental ([C/H], [O/H]) and isotopic ($^{12}$C/$^{13}$C, $^{16}$O/$^{18}$O) abundance analysis for six K dwarf exoplanet host stars: K2-141, NGTS-10, WASP-43, WASP-69, WASP-80, and HATS-72. Each system hosts an exoplanet targeted by JWST characterization efforts, making host star abundances especially critical as baseline references. Using MARCS model atmospheres, the TurboSpectrum spectral synthesis code, and near-infrared IGRINS spectra, we derive novel [C/H] and [O/H] abundance ratios for these high-priority K dwarf host stars. We further investigate prospects for determining $^{12}$C/$^{13}$C and $^{16}$O/$^{18}$O ratios using $^{13}$C$^{16}$O and $^{12}$C$^{18}$O lines from the 2.3 micron CO bandhead. The observed spectra are too noisy to measure $^{16}$O/$^{18}$O ratios for the sample, but we do find sub-solar $^{12}$C/$^{13}$C ratios for five out of six targets. We also derive uniform gyrochronological ages for each host star to compare with galactic chemical evolution models and identify underlying abundance-age trends. NIR H+K band spectroscopy provides an alternative to optical, atomic line-derived carbon and oxygen abundances for cool dwarf stars. The growing catalog of precise host star elemental and isotopic abundances complements ongoing observations of their companions and provides a baseline for understanding their chemical composition, origin, and evolution.
Read the full abstract
Programming Languages
A Complete Calculus for Hamiltonian Quantum Programming
Given the forces acting on a quantum particle, a Hamiltonian models its continuous evolution. Quantum computers evolve Hamiltonians to simulate physical systems, to solve optimisation problems, and to estimate eigenvalues, and even the popular circuit abstraction is compiled to Hamiltonians on the hardware. We introduce Hamilton, a process calculus whose parallel operator is the sum of interactions acting simultaneously. Its operational semantics is the Lie-Trotter product formula, which recovers a sum as the limit of ever finer sequential interleavings; compiling a program means halving it to a chosen precision and unrolling the interleaving into a circuit. The semantics is fully abstract, the expressible Hamiltonians are exactly those whose Pauli coefficients have the form $m/2^k$, the precision that successive halving reaches, and the equational theory is complete and decidable. A full implementation compiles Hamilton programs to circuits and decides their equivalence, and Agda proofs sanity-check the core metatheory.
Read the full abstract
Combinatorics
Counting Finite Maps through Functional Digraphs and Fibers
We count solutions of composition identities for maps on finite sets, first for three identities in which both maps vary and then for commutation with a prescribed arithmetic map. For $f\circ g=f\circ g\circ g$, drawing an arrow from each element to its image reduces the enumeration to rooted trees attached to directed cycles. For $f\circ f=f\circ g\circ f$, grouping elements with the same $f$-value leads instead to a partition-based enumeration. A classical rooted-forest enumeration leads in both problems to $\mathcal T(x)$, the exponential generating function for rooted labeled trees. For $f=g\circ f\circ g$, the values on the cycles of $g$ determine all remaining values. The exponential generating function $\mathcal D$ for these ordered pairs and the ordinary generating function $\mathcal A$ for endofunctions up to relabeling satisfy $\mathcal D(x)=\mathcal A(\mathcal T(x))$. Finally, we count functions on $\mathbb Z/n\mathbb Z$ satisfying $f(ax)=af(x)$, first for prime multipliers $a$ and then for a broader class of composite multipliers. In each problem, fixing one map exposes independent choices for the other through its functional digraph or its fibers.
Read the full abstract
Data Structures and Algorithms
Optimal Contention Resolution from Samples
Contention resolution schemes convert random sets which are ex-ante feasible for some constraint into sets which are feasible ex post, and their online variants have broad applications in Bayesian and stochastic optimization, including prophet inequalities and stochastic probing. In many such applications, however, full distributional knowledge is an unattainable requirement. This motivates the study of contention resolution schemes which employ a limited number of samples from the underlying distributions. We study sample-based contention resolution for $k$-uniform matroids, for both uniformly random and adversarial arrival orders, and compare their balance guarantees to the best possible with full distributional knowledge. For a single-item constraint, we show that one sample per element suffices for an optimal $(1-1/e)$-balanced ROCRS. For adversarial arrivals, however, we prove that no single-sample OCRS can be $1/2$-balanced, even for known arrival orders, separating contention resolution from prophet inequalities in the single-sample setting. Perhaps surprisingly, we show that two samples are necessary and sufficient for the optimal $1/2$ guarantee. We also present a single-sample $0.48$-balanced scheme. For general $k$, we give a simple single-sample ROCRS that achieves an optimal balance ratio of $1-e^{-k}k^k/k!$. In adversarial order, we obtain a single-sample $(1 - O(1/\sqrt{k}))$-balanced scheme, matching the optimal asymptotic dependence on $k$. Finally, we complete the picture by characterizing the minimum number of samples needed to match the optimal balance ratio achievable with full distributional knowledge. For random arrivals, one sample suffices for $k = 1,2,3,4$, and zero samples suffice for $k \geq 5$. For an adversarial arrival order, even known in advance, and any $k \geq 2$, we show that no constant number of samples suffices to achieve optimal balance.
Read the full abstract
Computers and Society
Real-World Adoption, Use, and Governance of an LLM-Based Electronic Health Record Search and Synthesis Platform
We evaluated the longitudinal adoption and use of Scout, an electronic health record-integrated large language model platform that provides cited search and synthesis of patient records, during staged deployment across a multi-hospital academic health system. Over 11 months, 2,635 users completed 80,465 tasks. 1,768 clinical users initiated use within the first 29 days of system-wide launch, which included a required training. Daily initiation increased 21.2-fold at launch, from 2.9 to 61.0 users per day. Of the 495 users who initiated use during the launch week, 310 did so in the first two days. Use spanned more than 20 recorded specialty categories, five care-practitioner roles, and 46,485 distinct prompts involving retrieval, synthesis, extraction, evaluation, and drafting, with 752 tasks saved for reuse. Among care practitioners who completed the required course, 77.9% went on to use Scout, with a median of 1.7 days after course completion. The highest-intensity user quintile accounted for 59.0% of tasks and 61.9% of tokens. Exploratory prompt analysis showed use across retrieval, synthesis, extraction, evaluation, and note-drafting. These findings suggest that rapid, broad adoption requires clinician-led task design and evaluation, traceable governance proportional to reach, centralized capacity planning and user support, and training integrated with access.
Read the full abstract
Data Structures and Algorithms
Greedy Byte-Pair Encoding Achieves 0.391 of the Optimum, Past the One-Third Barrier for Packing-Based Analyses
Byte-Pair Encoding (BPE) builds most language-model tokenisers by repeatedly merging a most frequent adjacent pair of symbols. How much shortening can this greedy rule lose against the best $k$ merges? Kozma and Voderholzer proved that greedy achieves at least one third of the optimal shortening; the best known upper bound is $(1-e^{-2})/2\approx 0.432$. We show that one third is a barrier for packing-based analyses, which see the optimum only through a pair packing, and we prove that greedy achieves at least $0.391$ of the optimum on every input, with any tie-breaking. The key idea is rule determinism: all copies of a rule of the optimum spell the same letters, so when one greedy replacement destroys three of the optimum's merge points, half a unit can be refunded on each side. A weaker bound, $0.374$, has a short proof that needs no computer; $0.391$ adds a certificate in exact arithmetic. We also show that the worst-case ratio is exactly $3/4$ for two merges and at most $7/12$ for three.