Information Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 9 September
Affine Grassmann codes, introduced by Beelen, Ghorpade and Høholdt, are linear codes over $\mathbb{F}_q$ obtained by evaluating linear combinations of minors of a generic matrix. The weight spectrum of the affine Grassmann code $C^{\mathbb{A}}(2,m)$ was determined by Piñero and Singh via a case analysis on the rank of an associated alternating matrix. We give an independent and more streamlined derivation, valid for all $m\ge4$ and every prime power $q$, in which each codeword is written in a compact matrix form and its Hamming weight is expressed through a single closed formula involving two explicit affine subspaces and their intersection.
Information Theory
Frame-Coded Legged Locomotion over Noisy Terrain
Open-loop multilegged locomotion over rough terrain has been interpreted as matter transport over a noisy channel: leg-ground interactions are discrete basic active contacts, terrain deletes or perturbs those contacts, and spatial redundancy concentrates the resulting thrust and arrival time. That construction is repetition-like because every module carries the same scalar locomotion task. It consequently provides neither a positive task rate nor a decoder that changes with the surviving contact set. Here we formulate locomotion instead as a quantized finite-frame expansion with erasures. A d-dimensional body-level command is mapped into N>d heterogeneous local contact commands. Rough terrain erases or corrupts frame coefficients, while a contact-gated compliant morphology physically realizes the weighted active-subframe decoder. For a linear-Gaussian model, mechanical equilibrium is exactly the posterior mean, tangent stiffness is posterior precision, and mechanical compliance is posterior covariance. Equal-norm Parseval frames are shown to be minimax optimal against one missing contact, two-contact robustness is governed by frame coherence, and a harmonic frame gives a directly realizable gait family. For independently surviving contacts of probability q, random Gaussian gait frames admit exact reconstruction at every analog dimension rate R<q, with a binomial reliability exponent, whereas recovery of arbitrary commands is impossible for R>q. Residual contact noise yields an asymptotic per-mode amplification 1/(q-R) and a vanishing mechanical stiffness margin at the threshold. An information-locomotion inequality and an exact incremental-redundancy rule direct the next gait component toward the softest task-relevant unresolved mode. The resulting analog frame-coding theorem establishes a finite relative redundancy and converse as part of a fundamental limit theory of legged locomotion.
Read the full abstract
High Energy Physics (Theory)
Unorientable supersymmetric compactifications of M-theory
We discuss orbifold compactifications of the type II string, where the orbifold combines a free action on a base manifold and the $(-1)^{\boldsymbol{F}_{\text{L}}}$ symmetry which acts by -1 on left-moving Ramond sectors. Such backgrounds can preserve minimal supersymmetry and lift to M-theory compactification on smooth unorientable manifolds.
Read the full abstract
Computers and Society
Senseful Consense: Towards Simplified Cookie Banners using Plain Language
While the GDPR and ePrivacy Directive mandate that consent information must be clear and accessible, most modern cookie banners remain obscured by technical jargon, vague phrasing, and frequent content overload or underload. This feasibility study investigates the impact of applying plain language (Einfache Sprache) to cookie banners within the IAB Transparency & Consent Framework (TCF). In our study, we analysed cookie banner texts from 200 websites, using AI-based mapping to categorise extracted content into standardised processing purposes. By substituting complex legal terms with simplified descriptions, we successfully demonstrated that the comprehension barrier can be lowered from a college-graduate level to a 7th-grade level. However, the effectiveness of plain language is inherently constrained by the informativeness of the original content; it cannot compensate for banners that omit legally required details. We conclude that while plain language is a vital tool for digital accessibility, it must be paired with standardised implementation guidelines to ensure that cookie banners are both readable and informative.
Read the full abstract
Astrophysics of Galaxies
Cosmic-ray electron propagation in the peculiar barred spiral galaxy NGC 2442
Face-on spiral galaxies offer a favorable geometry for studying magnetic-field structures and cosmic-ray (CR) propagation because projection effects and structural overlap are reduced. We investigate cosmic-ray electron (CRE) transport in the nearby face-on spiral galaxy NGC 2442 and assess how its environment and magnetic-field structure influence propagation. We combine radio continuum (RC) observations from ASKAP at 943 MHz, MeerKAT at 1.28 and 1.7 GHz, and ATCA at 5 GHz with optical H$\alpha$ and infrared data, and compare them with 2D CRE transport simulations. NGC 2442 has a steep integrated RC spectrum, with $\alpha=-0.96\pm0.04$ for the total emission and $\alpha_{\rm nt}=-1.21\pm0.04$ for the synchrotron emission over 408 MHz-5 GHz. A break near 1 GHz indicates substantial radiative aging. Under equipartition, we derive a mean magnetic-field strength of $10.8\,\mu{\rm G}$. RC-SFR smoothing gives effective CRE propagation lengths of $\sim0.65$-$0.89$ kpc at 943-1700 MHz and $\sim0.44$ kpc at 5 GHz, corresponding to diffusion coefficients of order $10^{28}\,{\rm cm^2\,s^{-1}}$. We identify a steep-spectrum synchrotron “island” in the southeast, with $\alpha\sim-1.09$ and no clear H$\alpha$, infrared, FUV, or NUV counterpart, indicating that CREs are unlikely to be injected in situ. Our 2D CRPropa simulations show that anisotropic diffusion along ordered magnetic fields enables CREs to reach the island more efficiently than isotropic diffusion. NGC 2442 therefore shows that environmental disturbances and ordered magnetic fields can strongly regulate CRE propagation in disturbed spiral galaxies.
Read the full abstract
Analysis of PDEs
Singular Forces on the Whole Space: Sobolev Density Thresholds and Energy Approximation
We derive whole-space distribution results from the established compact, smoothly forced Navier–Stokes blowup construction of OpenAI. For every fixed positive viscosity and deadline, smooth forces causing classical breakdown from rest on $\mathbb R^3$ are dense in the relative $L^1_tH^s_x$ topology exactly when $s<1/2$, and in the relative $L^2_tH^s_x$ topology exactly when $s<-1/2$. The positive results preserve every fixed initial velocity in $H^\infty_\sigma(\R^3)$. They follow from a compact divergence-free removal of a regular background, followed by exact insertion of a single whole-space singular packet. Separate critical estimates prove non-density; low spatial frequencies are controlled explicitly, without a periodic mean or a Poincaré inequality. The conclusions hold for spacetime-compact forces and for the rapidly decaying data class in the Clay formulation. We also obtain density in the usual completed energy-force spaces, strong energy-and-dissipation approximation of regular trajectories, and exact equality of cell observations on a prescribed finite family of whole-space grids. Initial-state spaces, forcing spaces and numerical error regularity are distinguished throughout. No claim of fixed-force instability, loss of weak existence or new formal verification is made.
Read the full abstract
Differential Geometry
Local Topology of Riemannian Manifolds with Lower Intermediate Ricci Curvature Bounds
We prove a vanishing theorem for the local Betti numbers of closed, $n$-dimensional Riemannian manifolds with a lower volume bound, an upper diameter bound, and a lower intermediate Ricci curvature bound. This generalizes and interpolates between known results under lower sectional and Ricci curvature bounds. Moreover, the methods extend to open manifolds, yielding a corresponding vanishing theorem for the global Betti numbers.
Read the full abstract
Data Structures and Algorithms
Optimal Non-Adaptive Vantage Point Selection
We study the vantage point selection problem, introduced by Ashvinkumar, Chowdhury, Gao, Goswami, Mitchell, and Polishchuk [WADS'25] to model the problem of estimating bottleneck capacities on the Internet. The input is a weighted undirected graph with unique shortest paths where every edge has a distinct unknown capacity. When the algorithm queries a vertex $v$, it reveals the minimum-capacity edge on the shortest path from $v$ to every other vertex reachable from $v$. The goal is to maximize the total number of revealed edges. The quality of an algorithm is measured by its competitive ratio against an optimal algorithm that knows all edge capacities a priori. We first consider the foundational single-query setting, where both the algorithm and the optimal algorithm are restricted to a single query. There is a trivial upper bound of $O(n)$ on the competitive ratio and the best known lower bound was $\tilde{\Omega}(\sqrt{n})$. We provide an algorithm and matching lower bound (up to polylogarithmic factors) showing that the best possible competitive ratio is $\tilde{\Theta}(n^{2/3})$. Furthermore, we extend our results to the general setting where the optimal algorithm is allowed $k$ queries and our algorithm is allowed $\alpha k$ queries for $\alpha\geq 1$. We present a randomized non-adaptive algorithm and matching lower bound (up to polylogarithmic factors) showing that the best possible expected competitive ratio for non-adaptive algorithms is the following surprisingly complex bound: $$ \tilde{\Theta}\left( \min\left\{ \frac{n}{\alpha k}, \max\left( \sqrt{\frac{n}{\alpha}}, \frac{n^{2/3}}{\alpha k^{1/3}} \right) \right\} \right). $$
Read the full abstract
Computation and Language
KVShareArena: KV-Cache Reuse Across Contexts and Model Checkpoints
Reusing key-value (KV) caches speeds up LLM inference by avoiding repeated computation on shared text. Standard prefix caching reuses a KV cache only when the LLM is the same and all preceding text is identical, but real workloads often break both conditions: RAG systems place different documents before the same one, agents with different system prompts read the same file or tool output, multi-agent workflows use specialized LLMs on shared material, and an updated model reads documents cached by its previous version. Because KV caches depend on both the preceding text and the model weights, direct reuse can reduce answer quality. Many methods repair or compress the reused cache, but each paper uses its own tasks, models, and cost measures, and existing benchmarks mainly test long-context processing or reuse of an unchanged prefix. We introduce KVShareArena, a benchmark and open evaluation framework for comparing them under the same conditions. KVShareArena has (1) reuse tests on 2,150 questions from three QA datasets, where the preceding text, the cache-writing LLM, or both change while the answering LLM and input stay fixed; (2) five dense and mixture-of-experts LLMs (4B-30B) and six LLM pairs where one version of an LLM reads caches written by another, for 33 model-dataset settings; (3) 11 repair and compression methods from six method classes; (4) four evaluation perspectives: answer quality, prefill computation, KV-cache memory, and latency; and (5) a common interface for adding new methods and an interactive leaderboard. Experiments yield two findings. First, both the quality loss from reuse and which repairs help depend on the LLM, even between two 8B models. Second, most repairs keep their quality when another LLM version wrote the cache, but a trained repair adapter loses quality in 12 of 18 pair-dataset tests. Code and data: https://github.com/xishi404/KVShare-Arena
Read the full abstract
Audio and Speech Processing
Pushing the Boundaries of Streaming Multi-Speaker ASR: A Systematic Study of Architectural Trade-offs
Streaming multi-speaker ASR is a challenging task that must balance accuracy, latency, and efficiency while handling overlapping speech and maintaining coherent long-context modeling over extended conversations in an online fashion. We present a unified framework that categorizes streaming multi-speaker ASR into four architectural strategies based on how diarization and ASR are integrated. Using a shared pair of open-source streaming ASR and diarization models as a common foundation, we derive four multi-speaker ASR systems that differ in whether they employ multiple model instances, fine-tuning, or both. We evaluate these systems across multi-speaker accuracy, single-speaker accuracy degradation, memory footprint, and training complexity. Through this systematic architectural analysis, we clarify the design space for streaming multi-speaker ASR and provide practical guidance for selecting the most suitable approach under diverse deployment constraints.
Read the full abstract
Cryptography and Security
Maverick: Private and Verifiable LLM Inference Made Practical via Matrix-Vector Multiplication Delegation
Open-source large language models (LLMs) are increasingly competitive with closed-source models while offering transparency and the ability to run inference without exposing user inputs to a service provider. However, running large-scale models locally requires substantial computational resources. In practice, users may still resort to a third-party provider, giving rise to privacy and correctness concerns. Existing solutions that address these problems often impose substantial server overhead or introduce additional trust assumptions. In this paper, we present Maverick, a novel approach to private and verifiable LLM inference based on a protocol for delegating matrix-vector multiplication, a dominant operation in LLMs. At its core, Maverick provides, to our knowledge, the first information-theoretically sound verification protocol for matrix-vector multiplication delegation with transparent preprocessing, efficient (batch) verification, and virtually no server overhead. We combine this verification primitive with LPN-based pseudorandom masking to provide input privacy. We implement our matrix-vector delegation primitive and use it to build an end-to-end prototype of Maverick, which we evaluate on Qwen3-4B by measuring throughput in tokens per second. We evaluate client configurations with 1-8 threads. With one client thread and a CPU server using up to 128 threads, Maverick achieves throughput gains over local inference of up to 17x when privacy masks are generated online, 45x when they are precomputed, and 44x when only verification is required. With four client threads, the corresponding gains are 13x, 18x, and 17x. When server computation is no longer the bottleneck, client-side microbenchmarks with simulated network delay show speedups of 12x-20x, 34x-135x, and 38x-157x.
Read the full abstract
Artificial Intelligence
What Should an Agent Forget? Separating What Is Stored from What Is Used
Persistent language agents need stored experience to remain available across time, while each answer requires evidence suited to a particular question. A superseded fact can mislead a current-state answer and still be essential for a historical query. We present RD-Forget, a training-free framework that separates what an agent stores from what it uses. A retained source archive preserves observations, and a query-conditioned memory view controls their influence on the current answer. A frozen language-model curator extracts relevant evidence, groups facts into semantic slots, and preserves the relations needed for multi-hop reasoning. Same-slot replacement links suppress superseded values in current-state contexts, while intent-aware retrieval makes earlier evidence eligible again. A rate-distortion formulation guides construction of the answer-time view within a memory budget. Experiments span conversational memory, knowledge updating, fact consolidation, long-context reasoning, and personalization under a shared answering pipeline. The results associate accurate answers with both query-relevant evidence construction and control over obsolete alternatives. Configurations without forgetting or query conditioning have the largest score deficits, while slot grouping, historical access, and relation preservation contribute complementary functions. Retaining history while selectively controlling its use offers a practical way to accommodate changing facts and future questions.
Read the full abstract
Analysis of PDEs
Density of Forces Producing Navier–Stokes Blowup
We study the density of smooth external forces for which the three-dimensional Navier–Stokes equations lose classical regularity by a prescribed time $T>0$. Starting from the compact forced blowup solution of OpenAI, we construct a blowup solution near every given smooth solution while preserving its initial velocity. A smooth cutoff of a local vector potential makes the given velocity vanish near the support of a rescaled blowup solution. The two velocities then have no nonlinear interaction, and the resulting force remains smooth through the blowup time. For fixed viscosity and zero initial velocity, such forces are dense in the relative $L^1_tH^s_x$ topology on both $\mathbb{T}^3$ and $\mathbb{R}^3$ exactly when $s<1/2$.
Read the full abstract
Computer Vision
When Fusion Fails: Corruption-Aware Rebalanced Fusion for Multi-Modal Medical Image Segmentation
Multi-modal medical image segmentation leverages complementary diagnostic information, yet fusion can underperform single-modality baselines when spatially aligned inputs differ in quality. Here, "corruption" primarily denotes resolution-induced degradation rather than misalignment or complete modality absence, while synthetic noise is evaluated only as an auxiliary setting. We identify a critical optimization-inference inconsistency: degraded modalities can receive weak training updates yet substantially affect predictions, indicating active interference with fusion. We attribute this failure to resampling-induced feature corruption and optimization bias, where noisy features propagate through skip connections and encourage unreliable modality selection. We therefore propose CoReFuse-Med, a Corruption-aware Rebalanced Fusion framework that suppresses corruption during feature transmission and rebalances modality contributions during high-level fusion. Experiments on EPVS, BraTS, and WMH, including multiple Z-axis slice-retention ratios and an auxiliary noise test, demonstrate improved accuracy and robustness under modality-quality discrepancies. Our code is available at https://github.com/lrever/CoReFuse.
Read the full abstract
Cryptography and Security
Are Unreachable Nodes Truly Safe? Fully Eclipsing Monero's P2P Network!
Eclipse attacks isolate a blockchain node by monopolizing its network connections. Existing attacks on Monero (NDSS'25), Bitcoin (USENIX'15/21, S&P'20) and Ethereum (WWW'26) implicitly assume that the adversary can establish inbound connections, thereby excluding a large and practically dominant class of nodes: unreachable nodes operating behind NATs. Such nodes are widely believed to enjoy stronger networks. We challenge this assumption and show that unreachability does NOT imply the expected resilience! We present the first eclipse attacks tailored to unreachable nodes in Monero's P2P network. Our attacks require no inbound access to the victim. Instead, they first poison the peerlist of reachable nodes, which subsequently act as propagation relays to contaminate unreachable nodes' whitelists. The adversary then exploits Monero's built-in outbound connection refresh logic to evict benign neighbors and eventually monopolize all outbound connections. We instantiate this strategy in two attacks: Nyx, which targets long-running unreachable nodes and achieves a complete and persistent eclipse through network-wide poisoning; and Moros, a stealthier attack that exploits the bootstrapping phase to rapidly eclipse newly joined unreachable nodes. We ethically evaluate both attacks. Nyx is validated via large-scale simulations on a Monero network constructed using the SEED Emulator, while Moros is demonstrated on the Monero mainnet against controlled targets. Our results show that unreachable nodes can be reliably driven into stable, long-lived eclipse states. We also propose countermeasures.
Read the full abstract
Instrumentation and Detectors
Optimization and Underground Implementation of the KAPAE Phase II Detector for an Invisible New Particle Search in Positronium Decay
The KAPAE Phase II detector was developed to search for invisible decays of positronium as a probe of physics beyond the Standard Model. The detector geometry was optimized with Geant4 simulations, and the scintillation and readout performance were evaluated experimentally. The temperature dependence of the BGO scintillator and several readout configurations were studied to find the operating condition giving the best energy resolution. The background level was then measured both at the surface and underground. At the surface, the positron-gamma coincidence background was of order 1 Hz, with occasional bursts up to about 65 Hz. Underground, it decreased to below about 3 \times 10^{-4} Hz, more than three orders of magnitude lower.
Read the full abstract
Astrophysics of Galaxies
The solar Galactocentric distance and local kinematic parameters from Gaia DR3 using Bottlinger's equations
The solar Galactocentric distance, $R_0$, together with the local kinematic parameters of the Milky Way, provides fundamental constraints on the Galactic structure and rotation. Their accurate determination has become possible with the hight astrometric precision of Gaia DR3 catalogue. We determine the Galactocentric distance, the Solar peculiar motion components $(u_0,v_0,w_0)$, and the local angular velocity of Galactic rotation, $\omega_0$, using a self-consistent approach based on Bottlinger's equations within a nonlinear least-squares framework. Bottlinger's equations were applied to approximately 13 million luminous giant stars $(M_G<4)$ selected from Gaia DR3. The analysis was carried out for two subsamples: a thin disk dominated sample (|z|<0.5 kpc) and a mixed thin and thick disk sample (|z|<1.0 kpc). The kinematic parameters were estimated using a nonlinear generalized least-squares method. We obtained $R_0=8.165\pm0.024$kpc and a local angular velocity of Galactic rotation $\omega_0=28.477\pm0.002$ km/s/kpc for the thin disk dominated sample. The Solar peculiar motion components are $(u_0,v_0,w_0)=(9.261\pm0.006,16.593\pm0.008,7.686\pm0.008)$km/s. Including mixed thin and thick disk stars resulted in a systematic shift in $R_0$, yielding $R_0=8.333\pm0.022$kpc, while the Solar peculiar motion and local angular velocity remain consistent within uncertainties. The Galactic kinematic parameters derived are consistent with recent independent determinations. The Solar peculiar motion parameters and the local angular velocity remain stable for different vertical selections, the recovered Galactocentric distance exhibits a systematic dependence on the adopted stellar sample, indicating that the vertical structure of the tracer population should be taken into account when determining $R_0$.
Read the full abstract
Metric Geometry
An approximate counterexample to the Barker–Larman problem in dimension $4$
The Barker–Larman problem asks if a convex body $K \subseteq \mathbb R^n$ containing the Euclidean ball $\mathbb B_n$, such that all the sections of $K$ by hyperplanes tangent to $\mathbb B_n$ have constant $(n-1)$-dimensional volume, must necessarily be a Euclidean ball. In this paper we show a result pointing to a negative answer in dimension $4$. Taking $\lambda_0 = 4 \sqrt{3}\pi$ and any $N \in \mathbb N$, we obtain the existence of a family of convex bodies $K_{\lambda,N}$ with $\lambda \in (\lambda_0-r_N, \lambda_0 + r_N)$, such that the sections of $K_{\lambda,N}$ by hyperplanes tangent to the Euclidean ball, have area within $c |\lambda - \lambda_0|^{N+1}$ of $\lambda$, while the difference between outradius and inradius of $K_{\lambda,N}$ is larger than $C |\lambda - \lambda_0|$. The bodies $K_{\lambda,N}$ are constructed via radial functions as \[\rho_{K_{\lambda,N}}(t) = \cos\left( \sum_{n=0}^N \frac{(\lambda-\lambda_0)^n}{n!} \varphi_n(t) \right)^{-1},\] where $t \in [0,2\pi), \lambda \in \mathbb R$ and $\varphi_n$ are trigonometric polynomials that can be computed explicitly. The convergence of the inner power series when $N \to \infty$ (which is left open) would imply a negative answer to the Barker–Larman problem in dimension $4$. As an example we obtain a convex body whose outradius and inradius differ by more than $0.176$, and the area of the sections oscillate by less than $3 \times 10^{-7}$.
Read the full abstract
Computational Engineering
Integrated Population Balance and Multiphysics Modeling for Predicting Undesired Agglomeration in Small Molecule Manufacturing
Agitated filter dryers (AFDs) are a crucial unit operation in small molecule manufacturing that enables simultaneous filtration, washing, and drying of active pharmaceutical ingredients. One of the key challenges in AFDs is associated with undesired agglomeration, where the presence of hard agglomerates results in off-spec products, equipment damage, and additional downstream processing. This article presents a novel mechanistic model that describes the formation of soft and hard agglomerates during agitated filter drying. By integrating population balance and multiphysics modeling, the model can accurately predict the evolution of the product temperature, moisture content, and particle size distribution, and hence quantify the extend and impact of undesired agglomeration across various operating conditions. Our proposed model-based framework enables the rational design and operation of AFDs for improving the product quality and process reliability.
Read the full abstract
Combinatorics
Sharp Bounds on the Number of Small Cuts
A $k$-cut of an undirected graph is a minimal edge set whose removal leaves at least $k$ connected components, and its cost is the sum of its edge costs. Write $\lambda_k$ for the minimum cost of a $k$-cut. For fixed $k\ge2$ and $\alpha\ge1$, we show that in any $n$-vertex graph with $n\ge k$ and nonnegative edge costs, the number of $k$-cuts of cost strictly below $\alpha\lambda_k$ is $O(n^{\lceil\alpha k\rceil-1})$. This implies an $O(n^{\lfloor\alpha k\rfloor})$ bound for $k$-cuts of cost at most $\alpha\lambda_k$, sharpening the $O(n^{\alpha k})$ bound of Gupta, Harris, Lee and Li. For $k=2$, our strict bound resolves a conjecture of Henzinger and Williamson and an open question of Karger. The exponent $\lceil\alpha k\rceil-1$ is optimal for $k$-cuts for every $k\ge2$ and $\alpha>1$.
Read the full abstract
Analysis of PDEs
Quantitative analysis of ground states for the fractional logarithmic Schrödinger equation
Let $N\geq1$ and $0<s<1$. We study positive ground states of the fractional logarithmic Schrödinger equation \begin{equation*} (-\Delta)^sQ=Q\log Q \quad\text{in }\mathbb{R}^N. \end{equation*} We prove that for every $N\geq1$ and $0<s<1$, the positive ground state is unique up to translations and nondegenerate. More precisely, for the linearized operator $L_Q=(-\Delta)^s-1-\log Q$, it holds that \begin{equation*} \ker L_Q=\operatorname{span}\{\partial_{x_1}Q,\cdots,\partial_{x_N}Q\}. \end{equation*} A main difficulty is that the potential $-1-\log Q$ is unbounded in $\mathbb{R}^N$, which prevents a direct application of the available radial oscillation theory for fractional Schrödinger operators with bounded potentials. We overcome this difficulty by a bounded-potential approximation. Using also the fact that the associated quadratic form has Morse index one and an angular decomposition, we obtain the nondegeneracy. Based on the isolation of logarithmic ground states and the uniqueness theory for the fractional power equation, we prove uniqueness by a variational approximation with subcritical power nonlinearities. As an application, we establish sharp fractional logarithmic Sobolev inequalities and characterize all cases of equality.
Read the full abstract
Computation and Language
DiSCo: A Distribution-First Steering and Cultural Prior Evaluation Framework for Measuring Cultural Preference Bias in LLMs
Large language models (LLMs) are increasingly deployed in globally used assistants, yet their default choices in culturally grounded everyday situations can systematically favour some cultures over others, affecting localisation, user trust, and equitable behaviour. Existing cultural benchmarks evaluate accuracy against a single "correct" answer, making it difficult to characterise an LLM's cultural preference prior when multiple culturally grounded responses are all valid; they also conflate default preferences with context-driven adaptation. We propose DiSCo, a distribution-first forced-choice evaluation framework that isolates default cultural priors and tests steerability via a four-level context gradient (C0–C3). Using DiSCo-Bench (304 items) derived from BLEnD spanning 12 cultures, we evaluate six diverse instruction-tuned LLMs. Default priors are heavily concentrated, with UK and US together absorbing approximately 35% of all selections despite representing only 2 of 12 cultures. Most critically, prompt-based steering consistently widens the selection gap between high- and low-resource cultures, and injecting explicit cultural facts produces negligible distributional disruption, confirming that cultural preference bias cannot be resolved through prompt-based personalisation alone.
Read the full abstract
Optics
Surrogate-Assisted Inverse Design and Temperature-Dependent Electrothermal Analysis of an All-Oxide Narrowband Thermophotovoltaic Emitter
A narrowband emitter aligning with the bandgap of the underlying solar cell is essential for improving the spectral efficiency and thermal stability of thermophotovoltaic (TPV) systems. Emitters based on oxide materials present a promising solution to the optical and mechanical performance degradation of traditional emitters, which employ metal-dielectric structures that experience metal oxidation and structural deterioration at high temperatures. Here, we presented a surrogate-assisted inverse-design framework for a narrowband 1D grating emitter comprising ITO and Al2O3 layers on a sapphire substrate. We performed Bayesian optimization over the trained ExtraTrees surrogates on a penalty-augmented objective containing a peak-emission constraint (E_peak > 0.90) while minimizing the full width at half maximum (FWHM) and maximizing the fraction of emission concentrated within the selected peak-centered spectral band to acquire a high, narrowband peak emission. The surrogate model was trained using a dataset of emission spectra obtained from the finite-difference time-domain (FDTD) by systematically varying the layers' thicknesses and the structure's period as the input features, and the narrowband emission's figure of merit (FOM) ((E_peak), wavelength of peak emission (_peak), FWHM, in-band fraction (f_in) for determining the amount of emission outside the peak band, and concentration of peak emission near the peak) was used as the prediction target. The resulting set of predictions for the optimized structure was further validated using the FDTD method.
Read the full abstract
General Relativity and Quantum Cosmology
Pulsar Timing Response and Spatial Correlations of Shear Modes in Torsionless Palatini Spacetime
In the nanohertz band, spatial correlations between pulsar timing residuals provide a key observable for characterizing stochastic gravitational-wave backgrounds and probing their polarization content. In torsionless Palatini spacetime, nonmetricity can generate two additional shear modes, referred to as the shear-$x$ and shear-$y$ modes. In this work, we investigate the pulsar timing response produced by the shear-induced motions of the emitting pulsar and the receiving Earth. Assuming that the electromagnetic field is minimally coupled to the physical metric and that the Earth and pulsar possess non-negligible effective hypermomentum responses, we derive the single-pulsar redshift, the frequency-domain two-point correlation function, and the corresponding spatial correlation. For a stationary and isotropic stochastic shear background, the normalized overlap reduction function (ORF) for distinct pulsars reduces in the short-wavelength limit to the pure dipolar form $\Gamma_{ab}^{\mathrm{sh}}(\zeta)=\cos\zeta$, where $\zeta$ is the angular separation between the two pulsars. The same dipolar correlation can also be produced by isotropic Solar System ephemeris errors, leading to a spatial degeneracy between the two signals. This degeneracy highlights the importance of information beyond the angular correlation for identifying Palatini shear signatures in PTA data.
Read the full abstract
Quantum Physics
An analysis of iterative refinement for quantum linear system solvers
We present and analyze an iterative refinement (IR) framework for improving the precision dependence of algorithms that combine a quantum linear system algorithm (QLSA) with quantum state tomography. Existing QLSAs achieve polylogarithmic dependence on the inverse error tolerance to prepare a quantum state encoding the solution, but extracting a classical description of such a state via tomography typically introduces a polynomial dependence on the target precision. To retain polylogarithmic dependence in the inverse error tolerance throughout the entire process, we develop an IR scheme that solves a sequence of related linear systems to progressively refine the solution while requiring only fixed-precision quantum subroutines, finally obtaining a classical description of a high-precision solution. We analyze the proposed framework under three input models: quantum-read/classical-write RAM (QRAM), linear combinations of unitaries (LCU), and sparse-access oracles. We evaluate the proposed scheme through numerical experiments on both quantum simulators and real quantum hardware. The results demonstrate that iterative refinement efficiently improves the precision of the solution and exhibits robustness to hardware noise.
Read the full abstract
Geophysics
Holistic law of aftershocks
The paper is devoted to the phenomenological theory of aftershocks occurring in the source of a tectonic earthquake following the main shock. The theory was developed by the author jointly with A.D. Zavyalov and O.D. Zotov during the course of a long-term study of aftershocks. The theory is based on the concepts of source deactivation and the source's proper time. The holistic law governing the decay of aftershock activity over proper time follows from the theory. The damping decrement is equal to the source deactivation coefficient. The main focus of this paper is the analysis of the logical structure of the theory. The paper also contains a brief description of the experimental results obtained using the theory. Keywords: earthquake source, aftershocks, Omori's law, Utsu's law, deactivation coefficient, proper time, underground clock, foreshock convergence, aftershock divergence.
Read the full abstract
Software Engineering
A-JIT: Agentic Just-In-Time Software Construction
Traditional software delivery assumes a static paradigm: code is constructed prior to execution and deployed as a fixed artifact. We present Agentic Just-In-Time Software Construction (A-JIT), a paradigm that replaces static binaries with dynamic, software systems that can perpetually evolve to meet changing demands. In A-JIT, an application is an integrated assembly comprising code, a runtime harness, and an embedded AI agent that continuously observes system usage and live execution traces. Much like a traditional JIT compiler specializes machine code to runtime execution paths, A-JIT specializes software logic, workflows, and tool interfaces to meet the specific needs of the end-user. By integrating synthesis directly into the ambient application lifecycle, A-JIT enables applications to dynamically construct missing implementations, generate new capabilities on the fly, and continuously adapt to end-user behavior. We demonstrate how this model supports trace-driven human-AI co-construction and opens a new design space for adaptive, self-evolving software.
Read the full abstract
Soft Condensed Matter
Characterizing particle rearrangements in sheared highly polydisperse materials
We compare three particle-scale measures of rearrangement in highly polydisperse materials under driven flow: (a) nonaffine motion defined relative to the time-averaged mean flow, (b) changes in nearest-neighbor connectivity, and (c) $D^2_{\min}$, which measures nonaffine motion relative to an affine deformation fitted locally in space and time [Falk and Langer, Phys. Rev. E 57, 7192 (1998)]. We apply these measures to previously published two-dimensional simulations [Jiang, Sussman, and Weeks, Phys. Rev. E 108, 054605 (2023)] and granular-flow experiments [Illing and Weeks, Phys. Rev. E 111, 045422 (2025)] with polydispersities up to $\delta\approx0.50$. Changes in connectivity and $D^2_{\min}$ both require a definition of neighboring particles, making the choice of neighborhood nontrivial in highly polydisperse systems. For detecting changes in connectivity, we recommend radical Delaunay triangulation, which provides a size-aware topological definition of neighbors. For calculating $D^2_{\min}$, we recommend a size-aware pairwise cutoff distance method. We further show that changing the neighborhood definition can reverse the apparent dependence of $D^2_{\min}$ on particle size in experimental data. Thus, trends in $D^2_{\min}$ cannot be interpreted independently of the neighborhood used to calculate it. Overall, the three measures presented provide complementary information about rearrangements in highly polydisperse systems.
Read the full abstract
Cryptography and Security
Meme Coin Factories: Uncovering Large-Scale Manipulations on pump.fun
Once complex, creating and deploying a new cryptocurrency has become trivial. Coin launchpads now allow users to generate a new coin with merely a few clicks, at a minimal cost. Launchpad popularity has grown in tandem with the rise of "meme coins," which usually do not offer any novel technological properties and are purely created for fun. The most prominent coin launchpad, pump.fun, has gained significant traction, grossing over 100 million USD in daily trading volume. The mass adoption of coin launchpads, however, also enables strategic actors to easily manipulate trading signals, unbeknownst to inexperienced traders who then buy certain coins, and enable these strategic actors to profit from rapid and unsustainable price increases ("pumps"). To identify such manipulations at scale, we conduct a large-scale study of pump.fun, collecting information on all 15 million coins launched in the last two years, and performing analysis on large, random samples of transaction data. We identify five classes of manipulation strategies: 1) wash trading, 2) creator address obfuscation, 3) coordinated sell, 4) copycat coins, and 5) social media manipulation. We find that strategic actors often bypass the platform interface and implement these strategies in a highly automated and low-latency fashion, by interacting directly with the blockchain. We further uncover the existence of "Market-Manipulation-as-a-service (MMaaS)," third-party tools that enable users to perform these manipulations without any technical expertise. We conclude by devising mitigations and proposing recommendations for traders, pump.fun, wallets or chain scanners, software development platforms, and regulators.
Read the full abstract
Number Theory
Inertial multiplicity bounds for two dimensional projective representations and bounds for the number of $\operatorname{PSL}_2(\mathbb{F}_q)$ and $\operatorname{PGL}_2(\mathbb{F}_q)$ number fields
We prove upper bounds for certain number field counting functions using Serre's modularity conjecture (now a theorem of Khare–Wintenberger). These results are comparable to sharp upper bounds for the number of abelian extensions with fixed or bounded discriminant, with Serre's modularity conjecture playing the role of class field theory.