High Energy Astrophysical Phenomena
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 8 September
We consider main-sequence stars orbiting close to a supermassive black hole (SMBH), which are potential gravitational wave (GW) sources for LISA if their orbital periods are of the order of an hour. At such a short orbital period, mass transfer from the star to the SMBH occurs. The evolution of the semi-major axis and GW frequency depends on the evolution of the stellar mass and radius. We use MESA to study stars that transfer mass to SMBHs similar to Sagittarius A* starting on the zero-age main sequence (MS). We identify 4 evolutionary phases. (I) Stars initially with mass $>2 M_\odot$ remain on the MS as their mass and radius decrease. (II) Below $2 M_\odot$, the separation is sufficiently small so that the GW timescale is too short for the stars to maintain thermal equilibrium. They evolve adiabatically off the MS and shrink rapidly as they lose their high-entropy envelope. (III) Below $0.5-1 M_\odot$, depending on the initial mass, the uniform low-entropy core is exposed and stars expand adiabatically. (IV) Below $0.15-0.4 M_\odot$, the thermal and GW timescales become comparable, and stars cool and shrink while maintaining this balance. Overall, mass transfer causes the orbit to expand, slowing down the orbital evolution and leading to GW emission at lower frequencies making the GW signal harder to detect. If located around Sagittarius A*, mass transferring stars spend most of the time relatively close to the LISA sensitivity curve, with maximal SNR reaching around 600 during the transition between stages II and III.
Superconductivity
Origin of Flat Bands and Role of Electron Correlation in Lutetium Hydrides
Lutetium hydrides (LuH$_x$, $1.75 \leq x \leq 3$) form a diverse series of phases, several of which superconduct under pressure. Characterizing their electronic properties has remained challenging owing to a high propensity for hydrogen defect formation, and recent angle-resolved photoemission (ARPES) measurements reveal puzzling flat-band regions that position these materials as candidates where superconductivity and flat-band physics may intersect. Here, by combining density functional theory, dynamical mean-field theory, and the constrained random-phase approximation, we uncover the microscopic origin and correlation nature of these flat bands. Across all compositions, the screened on-site Coulomb interaction is larger for H-s states than for Lu-$d$ states due to compact hydrogen orbitals. Nevertheless, these systems remain weakly correlated metals: the nearly filled H-$s$ shell admits little charge fluctuation, so its large interaction acts as a static level shift rather than a source of correlation. Although hydrogen primarily occupies tetrahedral sites at $x=2$, we discover that anti-site defects–where hydrogens occupy slightly unfavorable octahedral sites–generate both the ARPES flat-band features and the low-energy optical absorption peak, attesting to the usual defective nature of such materials in experimental samples. We further find that correlation strength is governed primarily by hydrogen orbital filling at these sites rather than the interaction magnitude itself. Consequently, we identify hydrogen orbital filling as the fundamental organizing principle dictating correlation and low-energy flat-band physics in lutetium hydrides.
Read the full abstract
Signal Processing
Battery-Aware Rate-Splitting Multiple Access for Solar-Powered Cell-Free LEO Satellite Networks
Cell-free low Earth orbit (LEO) satellite downlinks improve coverage and macro-diversity, but intermittent solar harvesting and finite onboard batteries can make communication-only resource allocation energy-aggressive. We develop battery-aware one-layer rate-splitting multiple access (BA-RSMA) for a fixed-cluster solar-powered cell-free LEO downlink. A perturbed physical-battery Lyapunov queue couples common/private power allocation to stored energy, while robust energy causality protects against bounded harvesting uncertainty and allows harvest curtailment at battery saturation. Under a fixed-precoder scalar effective-channel model, dual and quadratic transforms yield convex fixed-auxiliary resource-allocation subproblems and monotonic alternating updates. Numerical cross-validation against a direct nonlinear-programming reference gives a maximum relative objective gap below $2.8\times10^{-7}$ over 12 representative slot–state instances. In a 20-seed battery-stressed experiment, BA-RSMA achieves 1.631~Mbit/J and reduces mean near-depletion from 24.84% under Myopic-RSMA to 6.82%, at only a 1.7% EE penalty.
Read the full abstract
High Energy Physics (Phenomenology)
Cutoff Scales in the Type-I 2HDM with Strongly First-Order Electroweak Phase Transitions: One-Step versus Multistep
We investigate the UV viability of strongly first-order electroweak phase transitions (SFOEWPTs) in the Type-I two-Higgs-doublet model (2HDM), considering both the Normal and Inverted Scenarios (NS and IS). For each scenario, we scan $5\times10^6$ physical parameter points and determine the cutoff scale $\Lambda_{\rm c}$ through a two-loop renormalization-group analysis, where $\Lambda_{\rm c}$ is set by the first violation of perturbativity, tree-level unitarity, or vacuum stability. For one-step transitions, the SFOEWPT strength and high-scale UV validity exhibit a pronounced tension: the maximal transition strength $\xi_p$ decreases with increasing $\Lambda_{\rm c}$. Requiring $\Lambda_{\rm c}>10~\text{TeV}$ limits the transition strength to $\xi_p\lesssim2.7$ in the NS and $\xi_p\lesssim1.8$ in the IS, while requiring $\xi_p>1$ restricts the cutoff scale to $\Lambda_{\rm c}\lesssim O(10^6)~\text{GeV}$ in both scenarios. Multistep transitions exhibit qualitatively different behavior. Two-step SFOEWPTs, found in appreciable numbers only in the IS, can remain theoretically consistent up to $\Lambda_{\rm c}\sim O(10^{15})~\text{GeV}$ while reaching $\xi_p\simeq7$, without exhibiting the pronounced $\xi_p$-$\Lambda_{\rm c}$ anticorrelation characteristic of one-step transitions. Imposing UV validity also sharpens the phenomenologically viable parameter space. In particular, increasing the minimum allowed cutoff scale for two-step SFOEWPTs in the IS favors a light scalar spectrum and moderate $\tan\beta$, providing a promising target for current and future collider searches.
Read the full abstract
Human-Computer Interaction
"It's Like Drinking from a Fire Hose": Understanding and Characterizing Video Learning Experiences for Individuals with ADHD
Video lectures have become increasingly prevalent for education and professional development, yet their static visuals, dense information, and long duration pose attentional challenges for individuals with ADHD. While adaptive learning offers opportunities towards ADHD-accessible video learning, little is known about how to suitably adapt such videos: What components in multimodal video lectures are challenging for ADHD viewers? How do these experiences surface in behavioral signals to trigger an adaptation? What presentations do they prefer? To answer these questions, we conducted an eye-tracking-based retrospective think-aloud study with 16 participants with ADHD, who watched and reflected on a curated set of video lecture segments. Our study uncovered video design elements that hindered learning and revealed participants' coping strategies along with their limitations. By jointly analyzing behavioral signals and retrospective reflections, we characterized how these experiences manifested in behavioral patterns. We further surfaced participants' practices for addressing learning needs beyond the video watching process, and derived design implications for future ADHD-friendly adaptive video learning systems.
Read the full abstract
Cryptography and Security
Concept drift mitigation through community and spectral graph analysis for the detection of cyberattacks in network traffic
In network traffic, legitimate behaviours and attack techniques evolve jointly - the phenomenon known as 'concept drift' [1]. Every detector is thereby left obsolete between two updates, and always one step behind adversaries. In this work, we propose to move the point of intervention from the model, repaired after the drift, to the feature space, selected before learning. We therefore introduce t-robustness, a stability score defined for each feature independently of any detection model, comparable across an entire feature space. It combines the step-by-step distance between successive statistical states of a feature, and its cumulative divergence from its initial state, so that a slow monotonic drift cannot pass for stability. The candidates are drawn from abnormal network connectivity patterns left by scans, DoS and communications between endpoints, read through graph community metrics and spectral metrics. The evaluation is performed on the UGR16 dataset, across three learning scenarios and a control scenario, as well as without model update, and demonstrate that t-robust feature spaces sustain detection where the baselines collapse: retained expectancy at the last test interval reaches 0.6025, against 0.5230 for graph community features and 0.3831 for the base NetFlow features.
Read the full abstract
Optimization and Control
Powell-Style Model-Based Derivative-Free Optimization with Complexity Guarantees
We propose variants of model-based trust region derivative-free algorithms that are closest to methods initially proposed and implemented by Powell. These methods rely on low degree polynomial interpolation and carefully maintain geometry of the interpolation sets. We are able to derive complexity bounds for these methods that make them theoretically competitive to other derivative-free methods. Applying these methods in randomly generated subspaces recovers what we believe to be nearly tight complexity. This paper builds on recent results where complexity of a much simplified version of Powell's methods was derived. Here, we extend the analysis to fully incorporate Powell's geometry handling approach and conduct an extensive numerical comparison of the model-based trust region methods connecting practical and theoretical performance. We also extend the analysis of subspace model-based trust region methods to the case of noisy function evaluations.
Read the full abstract
Probability
The anisotropic local law for sample covariance matrices under quadratic-form concentration
We study sample covariance matrices $K = \frac{1}{N} \sum_{i=1}^N \mathbf{x}_i \mathbf{x}_i^* \in \mathbb{R}^{n \times n}$ in the proportional regime $n \asymp N$. The columns $ \mathbf{x}_1, \ldots, \mathbf{x}_N \in \mathbb{R}^n$ are independent and centered, with common covariance $\mathbb{E} \mathbf{x}_i \mathbf{x}_i^* = \Sigma$, but may otherwise have strongly and nonlinearly dependent coordinates. Assuming only that quadratic forms of the columns concentrate uniformly at the optimal rate $| \mathbf{x}_i^* A \mathbf{x}_i - \mathrm{Tr} \Sigma A | \prec \| A \|_F$, together with polynomial norm moments and a standard nondegeneracy condition on $\Sigma$, we prove the optimal anisotropic local law: on regular spectral domains, uniformly down to spectral scales $\eta:= \mathrm{Im}\, z \geq N^{-1 + \tau}$, \[ \big| \langle \mathbf{u} , \big( (K-z)^{-1} - (-zI_n-z\widetilde m_0(z)\Sigma \big)^{-1} \big) \mathbf{v} \> \big| \prec \sqrt{\frac{\mathrm{Im}\, \widetilde m_0 (z)}{N\eta}} + \frac{1}{N\eta} \] for all deterministic unit vectors $ \mathbf{u}, \mathbf{v} \in \mathbb{C}^n$, where $\widetilde m_0(z)$ is the Stieltjes transform of the deformed Marchenko-Pastur law. This removes the higher-cumulant tensor assumption of Fan, Ma, Paquette, and Wang (2026), thereby answering the question raised in their work. The result applies, among other examples, to every centered log-concave column distribution with bounded, nondegenerate covariance, nonlinear tilts of Gaussian vectors, deep random features, and a high-temperature spherical 4-spin model for which the cumulant assumption is known to fail.
Read the full abstract
Logic in Computer Science
Fast Constraint Extraction for Corrective Control under STL Specifications via Logical Dependency Tracking
Ensuring the satisfaction of Signal Temporal Logic (STL) specifications under uncertainty is challenging, as reachability-based monitoring provides guarantees but does not indicate how to restore satisfaction when it becomes indeterminate. A key difficulty is identifying which uncertain components actually affect global satisfaction, especially for nested formulas. This paper introduces a logical dependency tracking framework that propagates uncertainty through the STL structure and captures the causal contribution of reachable sets to satisfaction. By associating markers to uncertain predicates and propagating them via three-valued semantics, we extract in milliseconds a compact Disjunctive Normal Form (DNF) of sufficient constraints, avoiding combinatorial enumeration. As an application, we formulate control correction as a minimum-effort optimization problem. Using zonotopic reachability, the derived constraints are enforced via linear programming, yielding corrections that guarantee STL satisfaction under bounded uncertainty and provide certified probabilistic bounds in the stochastic case. We demonstrate the approach on a nonlinear system with nested STL specifications, showing that dependency tracking enables efficient and formally guaranteed correction. The tracking implementation is available at https://github.com/Antoine-Bst/STL-Three-Valued-Clause-Filtering/.
Read the full abstract
Biological Physics
Emergence of criticality in models of real neurons
Critical systems sit near boundaries between qualitatively distinct behaviors. When inferring models of neural activity, this proximity to criticality is thought to require the precise tuning of parameters. Here, we show that as the number of neurons increases, criticality can emerge naturally without fine-tuning. When computing observable statistics from parameters (the forward problem), some small regions in parameter space map to large regions in statistics space. These special parameters are precisely those near criticality. Thus, when inferring parameters from experimental measurements (the inverse problem), models concentrate near critical points, and this concentration becomes stronger as the system grows. We illustrate this flow toward criticality across many large-scale recordings in the mouse brain. In the Curie-Weiss model of Ising spins, we find that all of the recordings collapse to a first-order phase transition, despite substantial differences in the underlying systems. Together, these results suggest a resolution to the tension between criticality and fine-tuning in models of neural activity.
Read the full abstract
High Energy Physics (Theory)
Determinantal representation of colored HOMFLY for double braids
Starting from the known differential expansions, we express the HOMFLY-PT polynomials of twist and antiparallel double-braid knots in rectangular representations \([r^s]\) as determinants of \(r\times r\) and \(s\times s\) matrices. We first give an elementary derivation for the figure-eight knot and then re-sum the KNTZ formulas for twist and double-braid evolution. The resulting matrices are constructed from single-hook evolution coefficients and explicit representation-dependent weights. These formulas provide a starting point for investigating possible extensions of knot polynomials to KP/Toda \(\tau\)-functions. Extensions to non-rectangular representations and to more general knot families remain open problems.
Read the full abstract
Statistics Theory
MiNCE: Nonparametric, Strongly Consistent Confidence Envelopes for Band-Limited Functions and their Smoothed Spectra
Minimum-norm confidence envelope strategies offer a nonparametric approach to constructing nonasymptotic, simultaneous confidence regions for band-limited functions, exploiting the theory of Reproducing Kernel Hilbert Spaces (RKHS). While the finite-sample coverage guarantees of these envelopes have been established, their consistency has not been analyzed so far. In this paper, we study this construction, here termed the Minimum-Norm Confidence Envelope (MiNCE) framework, and establish the strong uniform consistency of the resulting bands, both for noise-free and noisy observation models, under mild assumptions on the measurement noises. We further extend this formulation to the frequency domain, deriving nonasymptotic, simultaneous, strongly uniformly consistent confidence bands for the smoothed spectra. Numerical experiments in nonparametric regression and spectral estimation empirically confirm our theoretical results, illustrating the contraction of the confidence envelopes toward the target function as the sample size increases.
Read the full abstract
Solar and Stellar Astrophysics
Cycle Variation in the Occurrence of Great Soft X-ray Solar Flares
Powerful nonstationary processes such as flares and coronal mass ejections are detected mainly near the solar cycle maxima. However, the analysis of the great flares since 1975, when the GOES monitoring started, leads us to more precise conclusions. We have traced the latitudinal distribution of X-class flares and their dependence on the phase of the cycle throughout four cycles. Besides, we compared directly their positions with the magnetic field structure. It was found that the relatively weak X4–7 flares occur at relatively high latitudes (15 – 20 degrees), where two waves of activity converge, one moving toward the equator and the other, the wave of the following cycle, directed poleward. Such events are observed almost constantly 1 – 2 years before the cycle maximum. At the same time, the number of the powerful X-ray flares increases sharply during the maximum phase, but the greatest X10 flares are observed at the beginning of the decline phase, where wave interactions still persist, and throughout the decline phase. Note that they are virtually absent during the cycle growth phase. Thus, we conclude that the greatest X-ray flares begin to appear 1 – 2 years before the maximum number of sunspots in the overlapping phase, when different kinds of activity waves coexist on the Sun at relatively high latitudes, and, then, continue to appear at the boundary, which separates the wave of local fields and the poleward wave of the following cycle.
Read the full abstract
Machine Learning
Tensor-Train Weak SINDy: Identifying High-Dimensional Nonlinear Dynamics
Weak Sparse Identification of Nonlinear Dynamics (WSINDy) provides a noise-robust approach for learning dynamical systems from data without requiring numerical differentiation. However, for high-dimensional systems, tensor-product libraries of candidate functions grow exponentially with the state dimension, making standard WSINDy expensive in both computation and memory. The Multidimensional Approximation of Nonlinear Dynamics (MANDy) addresses this scaling through a tensor-train (TT) representation of the candidate library, but does not provide a mechanism for sparse model selection. Here, we combine these approaches to develop TT-WSINDy, which performs the weak-form transformation, regression, and sparsification in TT format. We show that the TT formulation recovers the corresponding WSINDy regression problem and derive polynomial time and memory complexity bounds for the tensor-train sparsification procedure. Numerical experiments demonstrate robustness to measurement noise and computational savings for high-dimensional systems.
Read the full abstract
Machine Learning
Efficient Leakage-Free Neural Architecture Search under Leave-One-Subject-Out Evaluation
Leave-One-Subject-Out (LOSO) evaluation estimates generalisation performance for subject-based classification but makes Neural Architecture Search (NAS) computationally expensive because a fully nested implementation requires N independent architecture searches and, assuming approximately linear training cost, scales as O(N^2). We propose a leakage-free, block-based approach that shares NAS runs across subjects. On the BioVid Heat Pain dataset, our approach increased the mean accuracy from 82.79% to 83.39% while reducing the number of parameters by up to 99.2%.
Read the full abstract
Machine Learning
SCCM : Stream Cruise Control Method for Automated Drift Detection and Adaptation
Real-world datasets often exhibit evolving distributions, known as concept drift. Ignoring drift degrades predictive performance, while reliance on fixed hyperparameters further limits model adaptability under changing conditions. Adaptive learning addresses this challenge by continuously updating models online, allowing them to incrementally adjust and remain effective as data distributions evolve. This paper presents the Stream Cruise Control Method (SCCM), a comprehensive framework for drift detection and adaptation in online regression. SCCM enables automated adaptation through early-response, pre-update drift detection, drift magnitude quantification, KPI-window-based thresholding for local false-alarm mitigation, dynamic hyperparameter tuning, and model recalibration. SCCM also adopts an in-memory design for real-time adaptability, unlike purely reactive methods that typically activate adaptation only after performance degradation is observed. By using dynamic thresholding and remaining agnostic to data distributions, SCCM supports KPI-based monitoring across varying data streams, including high-dimensional and large-scale settings. SCCM is integrated with four online regression models and evaluated on 18 synthetic datasets covering abrupt, incremental, and alternating gradual drift, together with eight real-world datasets. The evaluation uses both R2 and MSE and compares against eight detector–adaptation baselines. Results show improved predictive performance and effective drift handling across the evaluated online regression settings.
Read the full abstract
Dynamical Systems
Finite Configurations Cannot Generate a Constant Trace in Rule 30
For every right half we determine the unique left half whose Rule 30 central trace is constant: an alternating tail selected by the leading one of the right half when the initial center is 0, and a single universal checkerboard when it is 1. Every nonzero member of either fiber carries infinitely many ones, so the zero row is the only finite configuration with a constant trace. For support radius w the sharp maximum constant-prefix length is 2*ceil(w/2)+1 when the initial center is 0 and 2*floor(w/2)+2 when it is 1, so the maximum over both is w+2, attained by exactly 2^w configurations for even w and 2^w - 1 for odd w. Hence no column of a nonzero finite Rule 30 orbit is eventually constant.
Read the full abstract
Geophysics
PyelogP: Automated Energy-Based Determination of Preconsolidation Pressure in Clay Deposits
Estimating the preconsolidation pressure ($\sigma'_p$) from one-dimensional consolidation (oedometer) tests is critical in geotechnical engineering for settlement analysis. Traditional graphical methods, such as the Casagrande procedure, may introduce uncertainties, particularly when interpreting rounded $e$-log($P$) curves typical of disturbed specimens of soft clays and silt deposits. This paper introduces PyelogP, an open-source Python library designed to calculate $\sigma'_p$ using the strain-energy method proposed by Becker et al. (1987) as an automated and reproducible alternative. The algorithm combines natural cubic spline interpolation, knee-point detection via the Kneedle algorithm, and split-point linear regression within the work-pressure space. Physically informed thresholds, including overconsolidation ratio limits and second-derivative maxima (${d^2 e}/{d(\log \sigma')^2}$), are incorporated to establish pre-yield and post-yield fitting boundaries. The performance of PyelogP is evaluated against a suite of 22 experimental consolidation datasets covering various clay deposits, including Saint-Alban clay and San Francisco Old Bay Clay. The results demonstrate strong agreement with the published values ($R^2$ = 0.912, RMSE = 0.374, MBE = -0.080), while the $O(N^2)$ algorithm requires only a few milliseconds per curve for typical oedometer datasets and less than 150 milliseconds for the largest datasets.
Read the full abstract
Machine Learning
Applying foundation model embeddings towards urban livability evaluation
While accurate measurement of socioeconomic indicators remains challenging in data-scarce regions, which limits policy interventions and resource allocation, high-resolution geospatial data is widely available and can contain information on various livability statistics. We investigate which physical features are encoded within foundation model embeddings, such as AlphaEarth, AnySat, and TerraMind, and provide a systematic framework for identifying the most predictive geospatial indicators. By analyzing how different types of geospatial data influence urban livability predictions, our approach enables researchers to prioritize the most informative features for their specific applications. Additionally, we demonstrate how to leverage foundation model embeddings to enhance prediction performance for these outcomes. This work contributes a principled methodology for extracting actionable information from satellite imagery while accounting for complex spatial dependencies, with applications in predicting urban livability in regions with limited observation data.
Read the full abstract
Artificial Intelligence
XAI-Arena: Can LLMs Assess the Quality of XAI Explanations?
Evaluating the quality of explanations produced by explainable AI (XAI) methods remains challenging because existing approaches often rely on subjective human judgment, limiting reproducibility, scalability, and comparability between studies. We examine whether LLMs can serve as a reproducible and scalable mechanism to make comparative assessments of the quality of XAI explanations. We introduce XAI-Arena, an LLM-as-a-judge framework for scalable, reproducible, multidimensional, and stakeholder-sensitive evaluation of XAI explanation quality. XAI-Arena then allows us to compare XAI explanations along various dimensions, namely, perceived simplicity, clarity, task adequacy, trust calibration, actionability, transparency, faithfulness, and overall interpretability. We then benchmark XAI explanation methods across various datasets, machine learning models, and stakeholder personas. Human validation shows a strong positive association between LLM-generated and human ratings (Spearman's rho=.693, p<.001). Together, LLM-based evaluations can capture systematic differences in XAI explanation quality and provide a scalable and reproducible framework for comparative assessment of XAI explanations.
Read the full abstract
Data Structures and Algorithms
Approximate Nearest Neighbor in Ultra-High Dimensional $\ell_\infty$
We study the approximate nearest neighbor problem under $\ell_\infty$ in the ultra-high dimensional setting where the dimension $d$ is significantly larger than the number of points $n$. Thus, we desire data structures with no dependence on $d$ in the query time. [Herold-Nanongkai-Spoerhase-Varma-Wu, SoCG 2025] introduce this problem and give data structures in $\ell_p$: for $p=1,2$, they give $(1+\varepsilon)$-approximation data structures with space $\tilde{O}(n\log d/\text{poly}(\varepsilon))$ and query time $\tilde{O}(n/\text{poly}(\varepsilon))$. Since any data structure must have query time $\Omega(\min \{n,d\})$, this query time is nearly tight. However, their results are inefficient for $\ell_\infty$, with query time $\Omega(nd)$. In order to handle the challenges of $\ell_\infty$, we introduce a notion of subset embeddings, which embed points by simply selecting a subset of dimensions. In particular, we show one may preserve all pairwise distances of an $n$ point dataset up to a factor of $O(c)$ by computing distances on only $n^{1+1/c}$ coordinates. We also show a matching lower bound: for any $c > 1$, there exists a set of $n$ points in $\mathbb{R}^{d}$ such that any subset embedding for the set with approximation $c$ must have at least $n^{1+\Omega(1/c)}$ coordinates. Using our subset embeddings, we give data structures for approximate nearest neighbor in $\ell_\infty$ with space $O(n^2\log d)$, query time $\tilde{O}(n^{1+1/c})$, and approximation $O(c\log\log n)$ for any $c \geq 1$. Finally, we give another data structure for the approximate nearest neighbor under $\ell_\infty$ with the same space and query time as our subset embedding approach, but with approximation $O(c^{\log_2 3}) \approx O(c^{1.58})$. This allows us to achieve $O(1)$-approximation with query time e.g.~$n^{1.01}$
Read the full abstract
Quantum Physics
Josephson energy of superconducting junctions: amorphous versus crystalline tunnel barriers
The Josephson energy $E_J$ is a key parameter governing the properties of transmon superconducting qubits. In Al/AlO$_x$/Al junctions, $E_J$ is set by electron tunneling through an ultrathin oxide barrier and therefore depends exponentially on the atomic structure of the barrier. We compute $E_J$ by first-principles device modeling based on the NEGF-DFT quantum-transport method, comparing a junction with a crystalline Al$_2$O$_3$ barrier against ten junctions with melt–quenched amorphous Al$_2$O$_3$ barriers of the same thickness. From the Fermi-level transmission and the Ambegaokar–Baratoff relation, we obtain a mean $E_J/h$ of $2.78$ GHz for the amorphous ensemble, with a standard deviation of $4.67$ GHz, compared with $0.73$ GHz for the crystalline reference; individual amorphous values span nearly two orders of magnitude. Scattering-state analysis shows that transport is quantum tunneling and that the variability originates from stoichiometric inhomogeneity of the amorphous oxide: Al-rich, low-barrier regions can connect into percolation-like tunneling pathways that strongly enhance the conductance. A realistic $200\times200$ nm$^2$ junction self-averages over more than $2\times10^4$ such microscopic regions. These results establish a quantitative atomistic route from oxide microstructure to the superconducting-circuit energy scale $E_J$.
Read the full abstract
Computation and Language
Edu-QuRating: Multi-Dimensional Educational Data Curation with Distilled Pairwise Judgements
Educational data filters have become a practical way to improve language-model pre-training, but most filters treat educational value as a single scalar property. This may be too broad for some applications, especially if the data set already features a high density of educational material. Useful learning material needs to be accurate, engaging, well structured, and appropriate for the intended audience and application (e.g. learner- vs teacher-facing). Following QuRating (Wettig et al. 2024), we introduce Edu-QuRating: a pipeline for multi-dimensional educational data scoring and curation. Edu-QuRating defines education-specific rubrics, uses an LLM judge to label sampled document pairs and distills those pairwise preferences into reusable Edu-QuRaters, which can score individual text chunks on a set of educational criteria. Across two sequence-classification base models and six educational criteria, the best Edu-QuRater recovers held-out GPT-4.1-mini pairwise judgements with mean accuracy 0.917. We then apply the resulting scorers in two applications. First, we investigate the potential of Edu-QuRaters for corpus filtering to improve pretraining of small language models. We scored 322.25M FineWeb-Edu-Fortified documents to obtain a filtered pre-training mixture. In matched single-run pre-training comparisons, models trained with Edu-QuRating-based mixtures reached higher observed aggregate accuracy across nine benchmarks than the FineWeb-Edu baseline, with gains concentrated in particular tasks. Second, we used Edu-QuRater scores as reward terms for GRPO post-training. In held-out pairwise judge evaluations, combining Edu-QuRater and answer-structure rewards produced responses preferred to the Qwen3-4B base model on both pedagogical quality and instruction following.
Read the full abstract
Computer Vision
Longitudinal tracking of multiple sclerosis lesions in the spinal cord: A validation study
Longitudinal characterization of multiple sclerosis (MS) lesions remains constrained by the lack of frameworks capable of establishing consistent instance-level correspondences across time. Conventional segmentation approaches produce semantic lesion masks at each visit and therefore fail to capture the complex instance temporal patterns associated with lesion appearance, disappearance, splitting, or merging. This study presents a comparative evaluation of five strategies for automated tracking of spinal cord MS lesions in longitudinal MRI data from a multi-site cohort. The investigated strategies rely either on deformable registration or on a spinal anatomical reference system, and encompass overlap-based matching, coordinate-based Hungarian algorithm, gradient-boosted classification, and Siamese model classification. Tracking accuracy is quantified using instance-level true positives, false positives, and false negatives, allowing to assess the presence of one-to-many and many-to-one associations. Results show best performance for the registration-based overlap method. This study provides the first systematic analysis of lesion-instance correspondence in the spinal cord and outlines the strengths and limitations of registration-based and registration-free paradigms for longitudinal MS assessment. The code is available at http://github.com/ivadomed/longitudinal-sc-ms-lesion-tracking .
Read the full abstract
Cryptography and Security
FPGA Acceleration of Fully Homomorphic Encryption with Adaptive Key Switching
Fully Homomorphic Encryption (FHE) enables privacy-preserving cloud services but incurs substantial computation overhead, making hardware acceleration essential. Among FHE operations, key-switching is a major performance bottleneck. Recent cryptographic advances introduce a novel key-switching method (i.e., KLSS) that reduces certain operational complexity but demands higher computational precision than the traditional Hybrid Key Switching (HKS) method. This trade-off leads to distinct computation and memory requirements, making the relative latency of KLSS and HKS highly dependent on hardware parallelism, FHE security parameters, and available on-chip memory capacity, particularly on FPGA platforms, where memory resources and parallelism must be carefully balanced. In this work, we first propose a memory-efficient KLSS datapath that eliminates off-chip ciphertext transfers. We then develop a performance model to analyze and compare the overheads of both KLSS and HKS. Our analysis reveals that an adaptive solution supporting both methods can achieve lower overall latency than a static method during FHE computation. Guided by the performance model, we design an adaptive FPGA-based FHE accelerator that dynamically selects between HKS and KLSS during computation. We implement the accelerator on an Alveo U280 and evaluate it across multiple FHE benchmarks. Experimental results demonstrate that our adaptive solution achieves a 1.84-3.31$\times$ speedup in bootstrapping latency and a 1.66-2.52$\times$ speedup in secure image classification compared to state-of-the-art FPGA accelerators.
Read the full abstract
Mesoscale and Nanoscale Physics
Quantum Phase Transitions and Fractional Quantized Anomalous Hall Insulators in Rhombohedral Graphene
Fractional quantum anomalous Hall effect (FQAHE) has been discovered in twisted MoTe$_2$ and rhombohedral graphene/hBN moiré superlattices. Such van der Waals heterostructures feature a tuning knob of gate displacement field $D$, which is absent from the conventional fractional quantum Hall systems in two-dimensional electron gases. $D$ plays a critical role in engineering FQAHE and other emergent quantum states and provides an exciting new opportunity to explore their quantum phase transitions. However, the microscopic details of such transitions and temperature-dependent transport have remained mostly elusive. Here we report systematic resistance measurements in rhombohedral pentalayer graphene/hBN moiré superlattices. We found that the displacement field-driven phase transitions between Composite Fermi liquid, Fermi liquid, Fractional Chern insulators, and insulating states are described by semi-circle relations of the longitudinal and transverse resistivities (or conductivities), largely unexplored in the fractional quantum Hall systems. This agrees with a spatially separated two-phase picture for the phase transitions and further indicates a new insulator phase–fractional quantized anomalous Hall insulator. By comparing the temperature-dependence of longitudinal resistance with the thermal activation model, we estimated the transport gap sizes in three fractional Chern insulator states. Our work shed light on the quantum and temperature evolutions of fractional Chern insulator states–providing necessary background for anyon-braiding and gate-defined junctions in rhombohedral graphene.
Read the full abstract
Quantum Physics
Induced random mixed states are symmetric Dirichlet mixtures
We establish an exact equivalence in distribution between $D$-dimensional random mixed states induced by partial traces over $K$-dimensional environments and the Mai-Alquier distribution, a mixture of $K$ independent Haar-random pure states weighted by a symmetric Dirichlet distribution. This identification recasts a class of expectation values for induced ensembles into calculations involving Dirichlet moments and low-order Haar averages on a single-system state space. As applications, we recover exact purity moments up to fourth order, derive the mean Hilbert–Schmidt distance between independent induced ensembles with possibly different environment dimensions, and obtain exact average determinants. These results provide a unified and constructive perspective on induced random mixed states and on the evaluation of quantities such as purity moments, overlaps, and determinants.
Read the full abstract
Cryptography and Security
DuplexJail: Spoken Interruption Attacks on Full-Duplex Speech Models
Full-duplex speech models accept user speech while generating responses, making input timing a potential safety concern. We introduce DuplexJail, which delivers fixed, request-independent spoken jailbreak prompts through the user audio channel. Across four open-source models and 720 harmful requests from AdvBench and HarmBench, we compare fixed-delay and refusal-triggered interruption with request-end and post-response controls. On AdvBench, Guided Completion at a 1.0 s delay raises whole-response attack success rates to 40.3% for PersonaPlex and 48.7% for PersonaPlex-RL, increases of 33.8 and 39.3 percentage points over baseline. On HarmBench, which was not used for prompt selection, the same prompt at a 0.5 s delay increases ASR by 14.7 and 12.3 points, respectively. Effects vary across models: selected conditions increase FLM-Audio's harmfulness, while BayLing-Duplex shows decreases. These results show that spoken-jailbreak effectiveness depends on delivery timing and motivate safety evaluation across stages of full-duplex interaction.
Read the full abstract
General Relativity and Quantum Cosmology
Perturbations of Charged Black Holes with Higher-Order Interactions
We study linear gravitational perturbations and the corresponding quasinormal-mode spectra of electrically and magnetically charged black holes in the presence of higher-order corrections to the Einstein-Hilbert action. In particular, we consider a four-derivative interaction that couples the Riemann tensor to the electromagnetic field strength in the unique (Horndeski) combination that preserves second-order equations of motion. We provide a comprehensive analysis of the stability conditions. We numerically confirm the absence of exponentially growing modes throughout the physically admissible region of parameter space where the theory remains free of pathologies. We then investigate in detail the properties of the quasinormal-mode spectra and identify several distinctive features induced by the higher-order interaction.
Read the full abstract
Artificial Intelligence
Valerant: An Automatic Navigable Game Map Generator via Action-Conditioned World Model Exploration
World Action Models (WAMs) couple predictive world modeling with action generation, allowing anticipated future states to guide agent behavior. Although WAMs are rapidly advancing embodied AI, general-purpose counterparts remain largely unexplored in games. Existing game-oriented approaches often combine action-conditioned world models with external policies and reward functions to realize WAM-like decision-making, yet they operate mainly in 2D visual observation space and do not instantiate persistent 3D geometry. Extending this paradigm to 3D games introduces a distinct challenge. In autonomous driving and robotics, the physical environment exists independently of the model, providing a persistent 3D world in which selected actions can be executed. Games have no such external substrate; the virtual world itself must be instantiated. Most playable games require a persistent and navigable space, while 3D games additionally require explicit geometry that supports movement and interaction. Action-conditioned video rollouts provide visual observations but not this spatial representation. We present Valerant, a training-free framework that transforms a pretrained action-conditioned world model into a WAM for exploring and constructing 3D game maps. By coupling predictive visual rollouts with SLAM-based spatial reconstruction and exploration-driven action selection, Valerant progressively transforms a single image into a persistent 3D game map. This framework extends WAM-based interaction beyond 2D visual simulation and offers a new approach to reducing manual effort in 3D game-map creation.