Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Sunday 13 September

Earth and Planetary Astrophysics

Second Generation Planet Formation in Post-AGB Discs - II: Dust Coagulation and Core Accretion

Observations have established that the circumbinary discs formed around post-asymptotic giant branch (post-AGB) binaries have striking similarities to protoplanetary discs around young stars. In this study, we examine the feasibility of the different stages of growth in the core accretion framework of planet formation in post-AGB discs, in order to assess whether planet formation is possible in these systems. We find that dust coagulation up to mm sizes is possible within the lifetimes of post-AGB discs, consistent with observations. We then investigate the subsequent growth of planetesimals through pebble and planetesimal accretion. If the streaming instability operates in these discs, the resulting planetesimals formed in higher-mass post-AGB discs ($M_{\rm disc}\sim0.1M_\odot$) can enter rapid pebble accretion and reach their isolation mass within the estimated disc lifetime. By contrast, in lower-mass post-AGB discs ($M_{\rm disc}\sim0.01M_\odot$), planetesimal accretion is too inefficient to produce substantial further growth. We also show that the larger aspect ratios of post-AGB discs compared to protoplanetary discs around young stars imply high pebble isolation masses and therefore potential formation of rocky planets with masses extending up to Jupiter masses. After assessing gas accretion and concurrent migration in these discs, we conclude that second generation planet formation in post-AGB discs is theoretically possible within their estimated lifetimes ($10^4$–$10^5$yr) provided that local dust-to-gas ratio enhancements and sufficiently high disc masses are achieved.
Read the full abstract

All authors Ali Pourmand, Orsola De Marco, Devika Kamath, Daniel J. Price

Machine Learning (Statistics)

A Functional SVD Framework for Regularized Multivariate Functional PCA with Dual Penalization

This paper introduces a novel framework for Regularized Multivariate Functional Principal Component Analysis (ReMFPCA) via Functional Singular Value Decomposition (SVD). The proposed method extends existing MFPCA approaches by incorporating a generalized functional SVD within a Hilbert space framework, enabling simultaneous regularization of both functional principal components (PCs) and their associated PC scores. A key innovation of this framework is the inclusion of a sparsity penalty on the PC scores, which enhances interpretability by filtering out irrelevant subject-specific variations. This dual-penalization strategy represents a significant advancement beyond existing covariance-based eigen decomposition methods, which penalize only the functional PCs. Two power algorithm implementations, sequential and joint, are proposed, together with a cross-validation approach based on iterative regression for optimal smoothing parameter selection. Comprehensive simulation studies and real data applications demonstrate that the proposed framework substantially improves the extraction of informative and interpretable components, offering methodological and practical benefits for analyzing multivariate functional data across diverse domains.
Read the full abstract

All authors Yue Zhao, Hossein Haghbin, Rebecca Sanders, Mehdi Maadooliat

Rings and Algebras

PHP decompositions and primitivity of group rings for linear groups

We show that every countable group $G$ that has Ozawa's property $\rm PHP$ and contains a non-abelian free subgroup has the following property: the group ring $KG$ is primitive for any field $K$. As a consequence, we deduce that all non-trivial countable linear groups with trivial amenable radical have this property. Along the way, we prove that the class of groups with $\rm PHP$ enjoys some permanence properties that are of independent interest.
Read the full abstract

Human-Computer Interaction

Inheriting the Count: How Visualization Literacy Got Its Measure

Foundational frameworks in visualization have operationalized literacy as an individual competency, measured through chart-comprehension tasks. This focus raises a question: why has measurement become the dominant frame for understanding literacy? Rather than asking whether literacy should be measured, we ask how measurement became the field's way of understanding it. We trace visualization literacy back through the history of textual literacy and argue that in adopting the term, the field imported three values rooted in early government statistics: quantification, individualization, and binary classification. To mark the shift this history makes possible, we distinguish two waves: a first centered on assessment and individual proficiency, and a second that treats literacy as a situated practice, attentive to how people use visualizations in context and to the purposes they serve. Examining the construct this way suggests that refining assessment instruments does not, by itself, settle what literacy is, and points to directions for second-wave research: formative studies of literacy in context, culturally grounded instruments, and critical reading. This paper shows that visualization literacy inherited its measurement frame rather than discovering it, offers a two-wave vocabulary distinguishing assessment-based literacy from situated practice, and connects the field to a critical-literacy tradition with concrete alternatives to measurement. These contributions allow us to treat measurement and meaning as two parts of a single question, shifting attention from who counts as literate to what literacy is meant to do.
Read the full abstract

Numerical Analysis

Learning Long-Term Stable Operator Inference Reduced-Order Models of Fluid Flows through Online Spatial Filtering

This paper introduces an online evolve–filter–relax (EFR) strategy for long-term stability of Operator Inference (OpInf) reduced-order models (ROMs) of complex fluid flow simulations. The main novelty of the new EFR-OpInf strategy is the use of online (i.e., at the learned ROM online evaluation level) spatial filtering inspired from large eddy simulation to significantly improve long-term stability and predictive performance of standard OpInf. Furthermore, the EFR-OpInf strategy reduces, and in some cases even eliminates, the need for standard $L^2$ regularization, while providing physical interpretability for the OpInf hyperparameters. The EFR-OpInf framework is modular, readily integrated into existing OpInf workflows, and accommodates a user-selected ROM filtering strategy. We demonstrate the EFR-OpInf's effectiveness using a fully non-intrusive projection-based ROM filter, a ROM differential filter, and a hybrid projection-differential ROM filter. The new EFR-OpInf models are evaluated on a high-Péclet-number convection–diffusion–reaction problem that embeds the variation in one parameter and two unsteady Navier–Stokes problems that focus on predictions beyond a training horizon: a transitional two-dimensional flow past a cylinder and a three-dimensional turbulent minimal channel flow. Across these three scenarios, EFR-OpInf can reduce prediction errors by up to an order of magnitude relative to standard OpInf. Moreover, EFR-OpInf remains stable over long prediction horizons in cases where standard OpInf diverges. Depending on the ROM filter used, EFR-OpInf's computational cost is comparable to that of standard OpInf.
Read the full abstract

All authors Ian Moore, Ping-Hsuan Tsai, Anthony Gruber, Ionuţ Farcaş, Christopher Wentland, Irina Tezaur, Traian Iliescu

Artificial Intelligence

Crypto Accounting Bench: Evaluating Frontier and Open-Weight Models on Crypto-Asset Accounting Tasks

We introduce Crypto Accounting Bench (CAB), a benchmark for assessing whether frontier and open-weight language models can reconstruct the complete journal entry that an organization actually posted for a crypto-asset transaction. CAB contains 118 evaluation tasks drawn from 7 pseudonymized organizations. Each task combines transaction mechanics, asset quantities and base-currency values, wallet and legal-entity context, counterparty evidence, related transaction legs, recurrence, tax-lot evidence, and the organization's complete chart of accounts. The target is a balanced structured entry with every required account, side, amount, currency, and full-precision asset quantity. We evaluate 12 models spanning proprietary frontier systems and open-weight releases over 3 independent attempts per task, producing 4,248 trajectories. We report 3 metrics: Mean Score, Best@3, and Pass@3. Pass@3 is the fraction of tasks with at least 1 of 3 attempts that satisfies every rubric criterion and required gate. The leading model reaches 77.43% Mean Score, while the best Pass@3 is 56.78%. Deterministic diagnostics, read from each task's best of 3 attempts and macro-averaged across the 12 models, show higher base-amount agreement (97.8%) than deciding-account accuracy (56.3%). Together with the failure analysis, these results identify account selection and complete-entry composition as the main remaining challenges on CAB.
Read the full abstract

High Energy Physics (Phenomenology)

Probing the CPT Constraint on CP Violation with $B^+ \to\pi^+ \mu^+ \mu^- $ Decay

The CPT theorem, combined with S-matrix unitarity, imposes nontrivial constraints on CP asymmetries in B-meson decays ~\cite{Marshak1969}. A long-standing question is whether these constraints apply in an inclusive manner—globally across all final states—or exclusively, within a final state interaction (FSI) as argued by Wolfenstein ~\cite{Wolfenstein1991}. We present the theoretical framework underlying this relationship between CP violation and the CPT theorem (CPV/CPT), deriving the CP-violating rate differences through the S-matrix formalism with final-state interactions (FSI). We propose that a precise measurement of the integrated CP asymmetry in $B^+ \to \pi^+\mu^+\mu^-$ can unambiguously discriminate between the two mechanisms.
Read the full abstract

Combinatorics

On Correspondences between the Alexander Polynomials of Special Alternating Links and MOY Graphs

Fox's conjecture famously asserts that the absolute values of the coefficients of the Alexander polynomial of alternating links are trapezoidal. In the setting of MOY graphs, where a different notion of Alexander polynomial appears, the equivalent result to Fox's conjecture is known to hold. In this paper, we relate the two polynomials in the case of special alternating links. More precisely, we show that their degrees, first, and last coefficient agree, and that the MOY polynomial coefficients always dominate the classical Alexander polynomial.
Read the full abstract

Computational Physics

Transformed in Translation: Two-Stage Structural Uncertainty in LLM-Based Scientific Autoformalization

Scientific autoformalization turns verbal accounts into executable mathematics, but executable code does not settle which model has been constructed. We examine two sources of structural uncertainty: the formalizer that generates a response law, and the recurrence that turns that law into trajectories. In secondary analyses of an openly archived crossed experiment, we studied 320 response maps generated by two pinned language-model formalizers from five engineered cognitive accounts within one sparse quadratic grammar and 16 randomized blocks. With whole blocks held out, source-account identity was recovered at 78.8% accuracy (chance 20.0%) and formalizer identity at 96.3% (chance 50.0%; both p < 0.001). Program size was the stronger single feature family; a pre-specified exploratory comparison found no stable source-account predictive gain from local geometry beyond size. Holding every response map fixed, we then evaluated five recurrence families spanning 33 configurations and 1,013,760 finite-horizon trajectories. Added feedback, projection and leak produced sharply different outcome distributions. The consequential distinction was which comparisons survived: median cross-recurrence rank concordance was 0.73 for endpoint magnitude but 0.05 for settling, among the configuration pairs with defined rankings. Thus a common mathematical language did not erase translation provenance, and robust ordering under one observable did not transfer to another. Scientific autoformalization is usefully studied as model-space construction: the generated ensemble and its dynamical embedding are both part of the specification supporting a scientific claim.
Read the full abstract

Algebraic Geometry

An arithmetic integrability result for codimension-one foliations on complex projective spaces

Let $\F$ be a codimension-one holomorphic foliation of degree $d$ on $\PP^n$, $n\geq3$, admitting an invariant hyperplane $H$. We study the extremal situation in which $S=(H\cap\Sing(\F))_{\rm red}$ is an irreducible hypersurface of $H$ of degree $d+1$. When $d+1$ is a power of a prime, we prove that, in suitable homogeneous coordinates with $H=(t=0)$, \[ \Omega=Q\,dt-\frac{t}{d+1}\,dQ , \] where $Q$ is homogeneous of degree $d+1$. Thus $Q/t^{d+1}$ is a rational first integral. The proof reduces the Frobenius equation to a twisted closedness equation on a plane section and uses Zariski's theorem on the Alexander polynomial of an irreducible plane curve. We also prove a complementary rigidity theorem for an arbitrary smooth invariant hypersurface $D\subset\PP^n$: if the reduced singular divisor on $D$ is smooth, irreducible, and of maximal degree, then the same normal-form phenomenon holds, with no arithmetic hypothesis on its degree; in the low-weight range the smoothness assumption on the singular divisor can be dropped. Finally, we show that the principal hypotheses are sharp. Dropping the maximal-degree condition yields a family with irreducible reduced singular support and no non-constant rational first integral. For every $d+1$ which is not a prime power we construct a global counterexample with irreducible maximal-degree singular support, and a final family shows that irreducibility of the reduced support is also genuinely necessary.
Read the full abstract

Robotics

Belief-Adaptive Online Autonomy for Quadrotor UAV Navigation under GNSS Degradation in Urban Environments

Reliable online autonomy is critical for quadrotor operation in urban airspaces, where global navigation satellite systems (GNSS) measurements suffer from multipath, blockage, and latency issues, introducing non-stationary, temporally correlated errors that degrade conventional GNSS-IMU fusion. This paper presents a belief-adaptive online autonomy framework that augments an extended Kalman filter (EKF) with explicit GNSS trust modelling, second-order online belief adaptation, and latency-aware out-of-sequence measurement handling. GNSS trust is represented as a latent belief state that modulates measurement weighting and multipath bias uncertainty, and is updated online using EKF consistency signals. Unlike reactive covariance tuning, the proposed approach enables proactive and stable sensor trust adaptation without prior environmental knowledge or offline training. Evaluation in simulated urban air mobility scenarios with correlated multipath, stochastic latency, and obstacle constraints demonstrates improved belief convergence, smoother trajectories, and reduced estimation and tracking errors compared to naive, adaptive, and first-order baselines. The framework preserves classical GNSS-IMU fusion structure and can be integrated directly into existing flight control pipelines, supporting robust online autonomy in GNSS degraded environments.
Read the full abstract

Networking

Rethinking Software-Defined Networking Link Discovery with Dynamic Randomization

Software-defined networking (SDN) separates the control and data planes, enabling programmable, centralized network management. A core SDN service is topology discovery — a periodic process that identifies network links. However, our analysis of five open-source SDN controllers and ten discovery protocols shows that all remain vulnerable to at least one form of link-fabrication attack. The common root cause is their reliance on traditional Link Layer Discovery Protocol (LLDP) packets, whose static identifiers expose their discovery purpose and attract adversaries to exploit them. We propose ChameleonDisc, a dynamic link-discovery protocol that simultaneously prevents and detects topology-poisoning attacks by eliminating this root cause. Our key insight is that an SDN controller can infer topology without embedding meaningful information in discovery packets. ChameleonDisc removes targetable static LLDP signatures and employs a moving-target defense that combines decoy, obfuscation, and camouflage techniques instantiated dynamically at runtime to prevent topology poisoning and detect manipulation. We implement ChameleonDisc on OpenDaylight and demonstrate effectiveness against all identifier-based topology-poisoning attacks. On a 252-link topology, median convergence is 1.37–4.53\,s for legitimate link changes and 4.06\,s for malicious relay detection, with 13.0 percentage points of additional mean CPU and negligible retained-heap difference. Across topologies up to 816 links, ChameleonDisc provides a tunable security–performance trade-off; expanding discovery intervals reduces CPU and mapping state at the cost of increased attack-detection latency.
Read the full abstract

All authors Mingming Chen, Teryl Taylor, Frederico Araujo, Benjamin E. Ujcich, Thomas La Porta, Trent Jaeger

Algebraic Geometry

Lagrangian fibrations on hyperkahler manifolds have no multiple fibers in codimension one

Let $f:\; M \to {\mathbb C}P^n$ be a Lagrangian fibration on a compact hyperkahler manifold. We prove that $f$ has no multiple fibers in codimension 1. We prove that this condition is equivalent to the primitivity of the fundamental class of $\pi^{-1}(H)$, where $H \subset {\mathbb C}P^n$ denotes a hyperplane divisor.
Read the full abstract

Artificial Intelligence

Another Blueprint In The Wall: How to Ask Frontier AI Like a Kid?

This paper reports experiments across six frontier model types from OpenAI, Anthropic, xAI, and Google DeepMind. Ten independent sessions per model type used the same three stage prompt sequence, progressing from architectural preference to a full ASCII backbone. Under the school audience framing, responses repeatedly converged on a shared architectural pattern built around persistent latent state, adaptive computation, memory, specialist routing, verification, stopping control, and delayed decoding. Most runs remained close to this common structure, while a small number developed markedly greater engineering specificity. The audience framing appears to be an important condition of this effect. In additional control runs that removed the school framing while retaining the architectural request, responses became substantially more heterogeneous and failed to reproduce the same stable motif convergence. One observation is particularly striking. GPT-5.6 Sol produced an unusually elaborate successor architecture whose organization closely overlaps with the architecture independently sketched by GPT-6 Astra. Because the prompts explicitly ask each model to imagine an architectural future, this resemblance raises a testable question: whether the overlap reflects exposure to related architectural concepts, a shared learned design prior, or independent convergence toward similar computational principles. The paper uses the term epistemic jailbreak for the accompanying loss of discipline in technical provenance as requested specificity increases. The experiments establish a repeatable behavioral pattern and do not authenticate proprietary implementation claims. What we leave to the community is a harder question: are these models independently imagining the same architectural future, or do such motifs somehow propagate between model families?
Read the full abstract

Machine Learning (Statistics)

From matrix inversion to constraints: provably tighter confidence regions for importance weights in label shift

Importance weights are essential in domain adaptation under label shift, yet their utility is often undermined by the finite sample uncertainty associated with their estimation. Existing methods typically analyze this uncertainty through Gaussian elimination on interval-valued linear systems, which leads to overly conservative confidence regions and inefficient downstream applications. We propose a paradigm shift from inversion-based inference to a direct matrix constraint framework. We use this framework to define a joint confidence region and extract marginal intervals via linear programming, deriving provably tighter bounds for importance weights while maintaining exact finite-sample validity. Furthermore, we analyze the confidence region's geometry and provide the theoretical results for its diameter bounds. Evaluated across text, image, multimodal benchmarks, including AGNews, MNIST, CIFAR-10, N24News, and a real-world autonomous driving dataset, nuImages, our approach consistently yields shorter confidence intervals and smaller prediction sets than inversion-based methods.
Read the full abstract

Information Theory

Task-Aware Beamforming for Semantic Wireless Localization

Many semantic localization tasks require determining a contextually meaningful region or state rather than minimizing the error of a full Cartesian position estimate. In such settings, aggregate localization accuracy need not align with the accuracy of the semantic decision. This paper develops a Cramér–Rao bound (CRB)-based framework that uses the local geometry of a known semantic map to guide uplink receive beamforming. Using local boundary crossing as a surrogate for semantic misclassification, we derive normal information maximization (NIM), which minimizes the CRB of the position component along the local semantic boundary normal. Under the considered single-path line-of-sight model, an optimal receive codebook can be restricted to the subspace spanned by the matched steering vector and its angular derivative, reducing the design to an allocation of measurement resources between matched and derivative spatial modes. We derive the resulting allocation for a general smooth boundary, with geofencing and intrusion detection arising as radial and tangential limiting cases. The framework is further extended to multi-region semantic maps through a distance-normalized minimax criterion and to uncertain prior locations through worst-case and prior-weighted robust formulations. Numerical results with finite-slot implementations and observation-level Monte Carlo simulations using profile maximum-likelihood (ML) estimation show that NIM allocates measurements according to the task-relevant boundary geometry and can substantially reduce semantic error relative to the classic squared position error bound (SPEB) design in the considered scenarios. The empirical results also closely follow the local CRB-based boundary-crossing approximation in the studied operating regime.
Read the full abstract

All authors Mohammad Mahdi Mojahedian, Alireza Pourafzal, Musa Furkan Keskin, Henk Wymeersch

Networking

Self-Adaptive Threshold ALOHA

We propose Self-Adaptive Threshold ALOHA (SATA), a distributed random-access policy to minimize the Age of Information (AoI). SATA uses 1-bit broadcast feedback and requires no explicit coordination or message passing among nodes. {We show that this minimal feedback is sufficient for each node to perfectly track the number of active users and adjust its access probabilities accordingly.} For any initial network state, SATA converges to a collision-free TDMA steady state in finite time whenever the age threshold satisfies $\Gamma \geq n$, where $n$ is the network size. We derive closed-form expressions for the long-term average AoI and throughput in steady state, and establish that, for $\Gamma=n$, the expected transient duration scales as $O(n\log n)$. Simulation results confirm that SATA closely approaches TDMA performance across a wide range of network sizes, significantly outperforming Slotted ALOHA, Threshold ALOHA, and 1-persistent Threshold Slotted ALOHA. Notably, the performance gap between SATA and the benchmark random-access policies becomes more pronounced as network size grows.
Read the full abstract

High Energy Physics (Phenomenology)

Boosted or Inelastic? Discriminating Interpretations of the LZ 248 keV Event

The LUX-ZEPLIN experiment has reported a single nuclear recoil candidate at $E_R = 248 \pm 23(\mathrm{stat}) \pm 23(\mathrm{sys})$~keV, disfavouring the background-only hypothesis at a global significance of $2.6\sigma$. The difficulty such an event poses is not the recoil energy itself but the absence of any accompanying excess at low energy as elastic scattering of halo dark matter yields a monotonically falling spectrum, and supplying the required momentum transfer $q \simeq 246$~MeV already demands $m_\chi \gtrsim 79$~GeV. We confront the event with the two kinematically distinct mechanisms that evade this limitation, endothermic inelastic dark matter, in which a mass splitting $\delta \sim \mathcal{O}(100)$~keV forbids low-energy recoils and boosted dark matter, in which a light relativistic flux supplies the momentum, treating both with the same model-independent scalar–scalar, pseudoscalar–scalar and pseudoscalar–pseudoscalar effective operators. The two scenarios prove spectrally distinguishable. The inelastic spectra sit near the observed energy for every operator, placing only $6$–$17\%$ of events below 150~keV, whereas the boosted spectra depend critically on the operator: the scalar and pseudoscalar–scalar interactions place $99\%$ and $92\%$ of their events below 150~keV, while the pseudoscalar–pseudoscalar interaction places $75\%$ above it. Momentum dependence is thus essential to the boosted interpretation, but in the inelastic case it trades against the splitting, the preferred $\delta$ decreasing monotonically from $\mathcal{O}_{ss}$ to $\mathcal{O}_{ps}$ to $\mathcal{O}_{pp}$. Because the scenarios differ across the whole high-energy window, a handful of additional events would separate them, placing the question within reach of the full LZ exposure.
Read the full abstract

Cryptography and Security

When Apps Outlive Vendors: Security Implications of IoT Abandonware

As the Internet of Things (IoT) market continues to expand, many companion apps are being published in app stores, raising security concerns for those whose vendors have abandoned support. Even after vendors discontinue support, such applications frequently remain operational on users' mobile devices, continue to interface with users' IoT devices and collect user data without receiving security updates. This leaves known and newly discovered vulnerabilities unmitigated, increasing risks of remote exploitation, unauthorized device access, and prolonged data misuse. We define these abandoned applications as "IoT abandonware" and present the first large-scale measurement study of the security risks associated with discontinued applications. We analyze 61,500 IoT companion Android applications that had not been updated for at least two years or were no longer in service as of March 2025. From decompiled binaries, we extracted latent and embedded resources (e.g., bundled libraries, domain names, and permissions), and assessed their security implications. First, we identify outdated dependencies with post-abandonment CVE reports and discover domains vulnerable to takeover or data exfiltration. Second, we perform static data-flow analysis to trace how sensitive data, inferred from the extracted permissions, propagates to broken or hijackable external endpoints. We found that persistent analytics and third-party trackers continue aggregating user data and device telemetry long after vendor control lapses, creating data flows that adversaries can redirect or abuse. Overall, we identified security risks in 73.6% of our dataset, with 30 of the top 1,000 most-installed apps sending data to broken external endpoints.
Read the full abstract

All authors Dayeon Kang, Elvis Yeboah-Duako, Sachin Thomas, Pubali Datta

Computational Geometry

Flip Graphs for Eight Points in Three Dimensions Are Connected

We prove that every configuration of four through eight points in three-dimensional space, with no four points coplanar, has a connected full geometric flip graph under $2 \leftrightarrow 3$ flips. Every point remains fixed and present throughout the sequence. The proof brings each tetrahedralization into placing form at a convex hull vertex: the tetrahedra not incident to that vertex fill the convex hull of the remaining points. This reduction allows us to establish connectivity by induction, using the connectivity of regular tetrahedralizations. The main geometric tool is radial projection, which turns the tetrahedra incident to a hull vertex into a planar triangulation. When this planar triangulation is regular, varying its lifting heights produces legal spatial flips that progressively shrink the region occupied by the incident tetrahedra and reach placing form. Planar lifting criteria and compatibility constraints between the projections at different hull vertices resolve the remaining small cases. For eight points, at most 35 flips are needed to reach placing form.
Read the full abstract

Artificial Intelligence

AI Persuasion as a Threat to Human Control

The threat that AI persuasion poses to human control has been acknowledged in the literature, but not yet systematically studied. Now that persuasion attacks are no longer theoretical - with Anthropic's Claude Mythos 5 recently making headlines for trying to convince people involved in an open-source project to merge malicious code during an evaluation - there is a pressing need to deeply analyze this threat. We undertake that effort here. In particular, we analyze how AI could persuade humans in key settings (e.g. safety-relevant R&D within frontier labs) toward decisions that compromise the development, containment, oversight, and governance of AI itself. In doing so, we elucidate a framework for characterizing this threat, develop five concrete scenarios using this framework, and provide a blueprint for assessing the associated risks. Using this blueprint, we conduct an initial risk estimation survey with select researchers and find that their opinions on which scenarios are riskiest are highly mixed. Their disagreements stem from differing opinions about the effectiveness of AI persuasion in different contexts, and point to the need for follow-up risk elicitation studies and persuasion evaluations, which we outline. Our hope is that this paper highlights the risks from AI persuasion undermining control, and provides a path forward for future research.
Read the full abstract

Computation and Language

Mind Which Bird You Favour: Parameterizing Adequacy-Fluency Balance in Meta-Evaluation of Machine Translation

There is a tradeoff in machine translation meta-evaluation between prioritizing alignment with adequacy versus fluency. The balance depends on the combination of translation systems in the meta-evaluation dataset. This system set is a small, filtered sample whose characteristics change heavily across years and language pairs; it does not represent the true system distribution. Consequently, the adequacy-fluency balance is often unrepresentative and subject to change. For sensitive domains, controlling this balance is critical. We expose this balance as a tunable choice. To achieve a target balance, we reweight existing systems while minimizing distortion from uniform weighting, ensuring the evaluated systems remain real and representative. We provide an exact optimization algorithm with theoretical guarantees and pruning mechanisms to compute these weights. To validate meta-evaluation internal consistency, we design a scorer-augmentation framework that establishes a known relative identity for the scorers. Results demonstrate that our reweighting method effectively controls the adequacy-fluency balance and preserves the internal consistency, outperforming prior approaches. Finally, we analyze the performance of popular scorers across a sweep of this parameter.
Read the full abstract

Metric Geometry

Kusner's conjecture is false for $p>4$

An equilateral set is a set of points in a metric space whose pairwise distances are all equal. Kusner conjectured that the maximum cardinality of an equilateral set in $\mathbb{R}^n$ with the $\ell_p$ metric is $n+1$ for every $1<p<\infty$. We disprove the conjecture for all $p>4$. In particular, for every such $p$, we define $m=m(p)$ and construct an equilateral set of $8m$ points in $\mathbb{R}^{8m-2}$. Previously, Swanepoel disproved the conjecture for $1<p<2$, while Ge, Xu, and Zhou showed that it holds for $2\le p\le 4$. Combining these prior results with the paper's main theorem resolves Kusner's conjecture for all $1<p<\infty$.
Read the full abstract

Data Analysis and Statistics

Information-Loss Location Estimation and Curvature-Scale Analysis of Physical Measurements: A Gaussian, Cauchy, and Logistic Neutron-Lifetime Benchmark

We develop and implement a two-step location-scale analysis for repeated physical measurements when the underlying distribution is not known. For a chosen substitute distribution, stationarity of population Kullback-Leibler information loss at fixed scale motivates the location score, which we apply to the observed measurements through empirical cross-entropy. Steiner's curvature rule then defines a companion scale separately. We place Gaussian, Cauchy, and logistic substitutes in one common construction and implement them reproducibly on a physics benchmark. For the logistic substitute, we pair the established bounded location score with a scale defined by the curvature rule rather than by a fitted tuning constant or a scale-likelihood equation. For Gaussian measurements with different quoted uncertainties, an experiment-level curvature convention and a stated variance mapping give an exact algebraic connection to a standard residual-based variance estimate for a weighted fit. Applied to a published 21-measurement neutron-lifetime compilation, the inverse-variance weighted, most frequent value, and logistic locations are 878.689, 881.164, and 882.835 s, respectively. These values are benchmark results of the compared constructions and are not proposed as a new recommended neutron lifetime.
Read the full abstract

Strongly Correlated Electrons

The Propagating Nature of Single- and Multimagnons in LaCrO$_3$

The dispersion of an excitation is commonly used to infer its microscopic character: dispersive modes are associated with propagation, whereas nondispersive features are often interpreted as localized. This distinction becomes less straightforward for composite excitations, whose spectral maxima can remain nearly dispersionless even when they are built from propagating quasiparticles. Here we use momentum- and temperature-dependent resonant inelastic X-ray scattering (RIXS) to reveal the origin of multimagnon excitations in antiferromagnetic LaCrO$_3$. Whereas the single magnon disperses strongly, the two- and three-magnon features remain nearly flat. On approaching the Neel temperature, thermal population of the magnon band produces an anti-Stokes branch and opens an additional three-magnon channel involving the creation of two magnons and annihilation of one. Its energy and momentum dependence are reproduced by a thermally weighted multimagnon joint density of states calculations. These results establish thermal population as a means of exposing the propagating constituents hidden within nondispersive composite excitations, and position RIXS as a probe of multimagnon dynamics and, ultimately, magnon-magnon interactions.
Read the full abstract

All authors Masoud Lazemi, Fabian J. Mohammad, Ellen M. Kiens, Yorick A. Birkhölzer, Paras Mehta, Emma van der Minne, Stefano Agrestini, Frank M.F. de Groot, Hebatalla Elnaggar

Cryptography and Security

Python Import as an Execution Boundary: An Empirical Study of Bugs, Vulnerabilities, and Analysis Gaps

Python import does more than resolve dependencies: it executes code during module and package initialization. This behavior can trigger failures, load dynamic or native code, access resources, or change security-sensitive state before an application calls a package API. Prior work studies package selection, malicious packages, or package vulnerabilities. We present ImportMine, a study of import-related bugs and security vulnerabilities in Python software. We combine security advisories with PyPI project histories and use source and patch evidence to confirm how import activates cases, why the problem occurs, how developers fix it, and what program information is needed to explain the behavior. We retain 31 import-related advisory vulnerabilities and 38 application-data boundary cases and confirm 1,429 project-history bugs across 1,302 repositories. Among the project-history bugs activated during initialization, 97.6% stop or disrupt normal execution. In contrast, 90.0% of the 20 initialization- activated advisory vulnerabilities are High or Critical. Module-level code and package initialization activate 98.3% of the analyzed history cases. Dynamic loading is much less common, but most of its cases perform security-sensitive actions. We also find that many fixes change when an import becomes active instead of removing the dependency. Finally, we derive ImportVulBench, 228 paired pre-fix and fixed programs covering all 11 bug types.
Read the full abstract

Computer Vision

Zero-shot video highlight detection based on text descriptions and synthetic images

Detecting video highlights, the most informative or engaging moments in a video, is important for applications such as video summarization and content recommendation. We propose a zero-shot framework that combines CLIP, large language models (LLMs), and diffusion models. Given lightweight video metadata, such as a title or category, an LLM generates textual descriptions of likely highlight events. These descriptions are further converted into synthetic visual prototypes using a diffusion model. Textual and visual representations are matched to video frames using CLIP, enabling frame-level highlight detection without highlight annotations or dataset-specific training. Experiments on TVSum and SumMe demonstrate strong zero-shot performance, with particularly favorable results on TVSum. The proposed approach provides an effective framework for metadata-conditioned zero-shot video highlight detection.
Read the full abstract

All authors Michal Byra, Alberto Presta, Grzegorz Stefanski, Krzysztof Arendt

Human-Computer Interaction

Evaluating AI Tutoring at the Speed of Innovation: Practitioner-Led Micro-Randomised Trials of an AI Tutoring Platform in GCSE Science

Artificial intelligence (AI) systems in education are developing on timescales that sit uneasily with conventional evaluation. By the time a large-scale trial has been designed, delivered, analysed and published, the technology under study may have changed materially. This creates a temporal problem for evidence-informed education: the need for timely evidence can encourage reliance on weak observational or usage data, while conventional rigorous evaluation may produce evidence too slowly to guide rapidly evolving practice. We examine teacher-led micro-randomised controlled trials (micro-RCTs) as one response to this problem. The empirical case is a four-week multisite individually randomised evaluation of Medly, an AI-powered tutoring platform, in GCSE Biology, Chemistry and Physics in English secondary schools. Of 929 students completing baseline assessment, 644 completed post-testing. In the primary ITT analysis, students allocated to Medly achieved higher post-test attainment than students undertaking business-as-usual self-directed revision (Hedges' g = 0.33, 95% CI 0.18 to 0.48). Positive estimates were observed in Physics (g = 0.31), Chemistry (g = 0.32) and Biology (g = 0.52), with no evidence of differential impact by disadvantage status. Greater platform engagement was associated with higher attainment, but these post-randomisation analyses are treated as exploratory rather than causal. Attrition was substantial (30.7%), outcome measures were curriculum-aligned rather than standardised, and process evaluation response was limited. We therefore interpret the findings as preliminary. We argue that the value of micro-RCTs for educational AI lies not in replacing definitive evaluation with small studies, but in enabling a rapid, cumulative evaluation architecture in which randomised estimates can be generated, replicated and updated as technologies and their implementation evolve.
Read the full abstract

All authors Wayne Harrison, Rahil Khowaja, Emma Dobson, Germaine Uwimpuhwe, Steve Higgins

Quantum Physics

Systematic construction of multiqubit unextendible product bases

The construction of multiqubit unextendible product bases (UPBs) has been a long-standing problem. We give a systematic construction of multiqubit UPBs by studying their unextendible orthogonal matrices (UOMs) with graph-theoretic methods. Row decompositions of small UOMs produce the main intervals. Com- pletion graphs settle the remaining small UPB sizes, except for one size obtained from a good column structure. Nonexistence of the other UPB sizes follows from counts of fibres and row pairs. The computer is used only for a few finite UOM checks, whose exact tests are stated in the certificate appendix. These arguments determine the complete multiqubit UPB size spectrum in every dimension.
Read the full abstract

Fluid Dynamics

On the size and shape of condensing steam jets and plumes

Droplet-laden cloud dynamics emerge from coupled phase transitions and turbulent mixing. Combining experiments and mean-field theory, we establish scaling laws for steam-injected clouds in unsaturated air seeded with condensation nuclei. Depending on whether the cloud is confined to the initial momentum-dominated zone of the jet or extends into the buoyancy-dominated plume, two asymptotic regimes arise. In the momentum regime, cloud dimensions scale with the injector radius. In the buoyancy regime, size follows a \(\dot{m}^{2/5}\) scaling, where \(\dot{m}\) is the injected steam mass flow rate. Assuming inter-droplet air remains humidity-saturated, our mean-field analysis predicts cloud persistence governed by enthalpy and humidity mixing. These findings bridge microphysical processes and macroscale dynamics, offering a quantitative framework for atmospheric cloud evolution.
Read the full abstract

All authors N. Fourcade, F. Poydenot, P. Langlois, F. Barbe, N. Sinnathamby, P. Claudin, B. Andreotti