Astrophysics of Galaxies
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 14 September
The dense environment of galaxy clusters suppresses star formation and alters the kinematic properties of infalling satellites through gas stripping, tidal interactions, gravitational harassment and starvation. Projected phase-space diagrams connect the present-day distribution of cluster galaxies to their accretion histories. We combine SAMI Galaxy Survey integral field spectroscopy with the TNG-Cluster simulation to investigate how the stellar spin parameter ($\lambda_R$), $(g-i)$ colour, and sSFR vary across projected phase-space infall regions. At $z = 0$, TNG-Cluster reproduces the direction and broad strength of the phase-space trends observed in SAMI, including the weak yet significant $\lambda_R$-clustercentric distance correlation. Leveraging this agreement, we extend the analysis across the last 8 Gyr, tracing the statistical evolution of galaxy properties within each infall region, and complement this with individual orbital histories of representative satellites. While colour and sSFR show clear monotonic gradients with both phase-space position and cosmic time, $\lambda_R$ behaves differently: it remains largely uniform across the outer infall regions, with only the virialised core exhibiting systematically lower values, and displays a slow monotonic decline toward the present day across all regions. We find that angular momentum suppression driven by the cluster environment is a slow, cumulative process requiring several Gyr of exposure to the cluster core, modulated by orbital history and stellar mass. This gradual nature explains why the $\lambda_R$-environment correlation appears weak across phase-space regions in statistical samples; the effect emerges when individual satellite histories are tracked, revealing a sustained dynamical response to prolonged cluster residence.
Instrumentation and Methods for Astrophysics
Commissioning the AIP's ultrafast laser Inscription facility: defining the parameter space for type-I waveguide fabrication
Astrophotonics offers a compact, stable alternative to bulk optics in traditional astronomical instrumentation, spanning high-precision spectroscopy to high-contrast interferometry. However, the strict requirements for throughput, accuracy, precision, and stability require tailored manufacturing processes that go beyond standard telecommunications technology. This work presents the iterative experimental and statistical methods used to determine the optimal laser-writing conditions for passive waveguides in silica glass using a femtosecond laser inscription setup. We systematically explored the parameter space by varying pulse energy, repetition rate, translation speed, and scan numbers to identify the optimal conditions for Type-1 waveguides, characterized by a positive refractive-index modification in their cores. We report on the refinement of these parameters to manufacture single-mode, high-throughput waveguides that operate in the astronomical J-band (1300-1400 nm). A key focus of this optimization is to match the mode field diameter (MFD) to the SMF28 fibre and minimize insertion losses. This development is critical for astrophotonics devices, such as photonic reformatters, beam combiners, and pupil remappers, as well as post-fabrication correction of phase errors in photonic components fabricated using traditional photolithographic methods. Some of these components will be used for future on-sky validation at the Calar Alto Observatory and the CHARA array.
Read the full abstract
Fluid Dynamics
Stratified jet with wall effects
Jets in stratified flows are ubiquitous in geophysics. A fundamental question is whether the instabilities and coherent structures generated by the flow interact with the physical boundaries and, if so, how. To this end, a simple canonical model flow is employed: a parallel Bickley jet confined between walls in a uniformly stratified fluid. We first show that short wavelength Kelvin-Helmholtz instability can generate asymmetry in the mean flow. Although the fluctuations decay rapidly away from the jet, the asymmetric mean flow does not. We then examine long-wavelength coherent structures that can emit internal gravity waves, which decay slowly towards the walls or, in some cases, radiate away from the jet. These waves transport momentum and distort the mean flow, reducing the jet centreline velocity significantly. When radiation occurs, whether the instability persists at high Reynolds numbers depends strongly on the boundary conditions imposed at the walls. Moreover, we found an instability and associated nonlinear coherent structures that persist at Richardson numbers above the Miles-Howard criterion. The existence of this viscous mode does not rely on the presence of the walls.
Read the full abstract
Human-Computer Interaction
Context-Aware Emotionally Adaptive Voice Assistants: A Multimodal Framework for Empathetic Human-Agent Interaction
Voice-assistant interruptions tend to be intrusive because existing systems fail to consider the affective state, cognitive load and situational context of the user when deciding when and how to interrupt.Voice-assistant interruptions tend to be intrusive, since existing systems do not consider the affective state, cognitive load or situational context of the user when determining when and how to interrupt. In this paper, EmpathicVA, a closed-loop framework integrating physiological sensing, vocal-affect analysis, contextual modeling and reinforcementlearning interruption policy, is introduced. A hierarchical fusion model involves integrating HRA, EDA, respiration, acousticprosodic features, linguistic embeddings, and contextual cues and computing the probabilities of five affective states. A Double Deep Q-Network selects immediate response, brief or extended delay, empathetic response, or silent mode based on these probabilities, context and interaction history. The multimodal model obtained an accuracy of 92.3% and an F1-score of 0.922 at the macro level on a held-out test set, outperforming the highest accuracy unimodal model by 6.0 percentage points. Comparing the six-week within-subject field study with 48 participants with a baseline and context-only assistants, there was a corresponding increase in satisfaction, trust, and appropriateness of timing, as well as a large reduction in interruption-related stress episodes. The results suggest that affect-aware timing and restraint are both important in voice interaction in addition to the response wording.
Read the full abstract
Instrumentation and Methods for Astrophysics
Optomechanical design of an ADC and image rotator for the HJST Coudé Spectrograph at McDonald Observatory
High-resolution spectroscopic observations require stable slit illumination and mitigation of atmospheric refraction effects that degrade throughput and spectral fidelity. We present the optical and mechanical design of a Rotational Atmospheric Dispersion Corrector (RADC) for the coudé Tull Spectrograph on the Harlan J. Smith 2.7 m Telescope. Atmospheric dispersion introduces wavelength-dependent image displacement that increases with zenith distance and reaches approximately 4 arcsec across the 350 - 1000 nm wavelength range at a zenith angle of 65{\deg}, leading to wavelength-dependent slit losses and non-uniform slit illumination. The RADC employs a pair of counter-rotating Amici prisms to provide continuous correction over the operational zenith-angle range while maintaining image quality and compatibility with the existing coudé pre-slit optics. The optical and mechanical design of the deployable ADC subsystem, its integration within the limited relay envelope, and its expected impact on throughput and slit illumination stability are presented. In addition, we discuss a K-mirror image rotator as a potential future upgrade for observations of extended and non-point-like targets, where maintaining a fixed slit position angle on the sky may be desirable during long integrations. Preliminary optical studies of the image-rotation concept and its integration considerations within the HJST coudé relay are briefly summarized. Together, these developments support enhanced observing capabilities for high-resolution spectroscopy on the HJST.
Read the full abstract
Machine Learning
How Good Are Time-Series Foundation Models for Pedestrian Crowd Count Forecasting? A Cross-Dataset Comparative Study
Pedestrian-count forecasting supports pedestrian-oriented Intelligent Transportation Systems (ITS), including crowd monitoring, pedestrian-traffic staffing and routing, and proactive risk mitigation during surges. Recent time-series foundation models (FMs) report strong zero-shot accuracy on heterogeneous forecasting benchmarks, but it remains unclear whether these gains transfer reliably to pedestrian sensing deployments. We benchmark seven univariate forecasting approaches spanning four paradigms: Seasonal Naive, gradient-boosted trees (LightGBM, CatBoost), deep learning models (N-HiTS, PatchTST), and two pretrained FMs (TimesFM, Chronos-2). Experiments cover two complementary regimes: (i) a five-day special event dataset SAIL2025 at 3-minute resolution with limited in-domain history; and (ii) Melbourne pedestrian sensors as a multi-year hourly dataset (2010–2017) with strong seasonality. We compare the MAE and RMSE results per sensor across datasets and multiple forecast horizons. Results show three consistent findings. First, with limited historical data, Seasonal Naive remains a strong baseline for long-horizon forecasting on high-volume sensors, while trained models can degrade when the next day differs substantially from prior days. Second, boosted trees can be competitive on lower-volume sensors but exhibit higher sensitivity on high-volume sensors under event-driven shift. Third, FMs excel in the seasonal and data-rich regime under long-context configuration. The findings highlight the importance of choosing pedestrian forecasting models based on both the underlying data conditions and the forecasting horizon.
Read the full abstract
Exactly Solvable and Integrable Systems
The Nakamura Conjecture Revisited: Toda Molecules and Stationary Axisymmetric Gravity
We revisit the Nakamura conjecture, which relates the Tomimatsu-Sato solutions of stationary axisymmetric gravity to finite Toda molecules. While the conjecture has been established partially, its general rotating sector remains an open problem. We show that the Toda determinants underlying the conjecture possess a natural weight grading. In particular, the two functions entering the Ernst potential have weights n^2 and n^2-1, and this grading extends systematically to shifted determinants labelled by partitions. In coordinates adapted to the Toda generators, each differentiation corresponds to adding one box to the associated Young diagram and increases the weight by one. The same integer n^2 also appears in the zero-order term of the Nakamura bilinear operator, revealing a compatibility between the differential equation and the determinant grading. The partition structure further explains the previously unresolved behavior of second derivatives. Repeated differentiation in one direction produces an internal sector and an external sector requiring only a one-step extension of the Wronskian hierarchy; the latter is reduced by a local three-term Pluecker relation. Thus weight grading, Young-diagram growth, Wronskian enlargement, and Pluecker reduction emerge as parts of a single determinant structure. The unit weight relation n^2 = (n^2-1) + 1 also singles out the elementary Toda seed as a natural third object, suggesting a possible route toward a genuine trilinear formulation. Although no trilinear closure is assumed here, the present construction reduces the remaining general-n Nakamura problem to definite determinant-minor identities and provides a structural framework in which such a formulation can be investigated.
Read the full abstract
Optics
A Programmable Optics Cloud Laboratory
Laboratory automation can improve experimental throughput, accessibility, and reproducibility, but many robotic laboratory systems remain difficult to reconfigure. This challenge is especially pronounced in free-space optics, where experiments are built from heterogeneous components, require precise alignment, and are frequently rearranged as experimental goals change. In this work, we present the Programmable Infrastructure for Cloud Optics (PICO), a robotic cloud-laboratory architecture designed to make reconfigurable optical experiments easier to program, operate, and reproduce. PICO provides a common domain-specific abstraction and software layer through which experimental configurations and actions can be controlled across different user interfaces. This enables the same physical laboratory to support remote interactive use, scripted experiments, autonomous routines, and features such as version control. We implement PICO on a robotic free-space optics platform and demonstrate it through an experimental case study.
Read the full abstract
Social and Information Networks
On the Expressive Power of Implicit Line-Graph Higher-Order Weisfeiler–Leman
Whitney's theorem allows isomorphism testing for connected simple graphs, apart from $K_3$ and $K_{1,3}$, to be formulated as distinguishing their line graphs. However, the relation between fixed-dimensional Weisfeiler–Leman (WL) expressivity on line graphs and on their roots remains unresolved. We study this relation through Implicit Line-Graph WL (ILG-$k$-WL), which is exactly $k$-WL on $L(G)$, executed over the edges of $G$ with line-graph relations derived from endpoint incidence and without explicitly constructing $L(G)$. On the Whitney-general class, the relation between root-domain and line-graph WL depends on $k$. For $k=1,2$, ILG-$k$-WL adds no distinguishing power beyond root-domain $1$-WL and misses some pairs that $1$-WL separates. For $k=3$, we prove the backward containment $L(G)\equiv_{3\text{-WL}}L(H)\Rightarrow G\equiv_{3\text{-WL}}H$. Strongly regular witness pairs, including the Shrikhande/rook pair, show that ILG-$3$-WL is strictly more expressive than $3$-WL. The backward containment also extends to disconnected graphs with no isolated vertices when every connected component is Whitney-general. Deterministic ILG-$3$-WL separates all three substructure-counting witness pairs, all $105$ pairs in SR25, and $359$ of $400$ BREC pairs. An untrained dense ILG-$3$-GNN gives the same pairwise verdicts on these evaluations.
Read the full abstract
Analysis of PDEs
Well-posedness and Blow-up in a semilinear heat equation with variable-order Scarpi memory
We study the semilinear heat equation ${}^{S}D_0^{\alpha(t)}u=\Delta u+u^p$ on $\RR^n$, where $p>1$ and the Scarpi order changes exponentially from $\alpha_1$ to $\alpha_2$, with $0<\alpha_1,\alpha_2<1$. We establish local and maximal mild well-posedness for abstract Scarpi–Volterra equations. For the whole-space heat problem, positive resolvent families yield nonnegative solutions, comparison, a mass identity, and an $L^\infty$ blow-up alternative. To study finite-time growth, we use a Gaussian version of Kaplan's weighted-moment method. It reduces the PDE to a scalar nonlinear Volterra inequality and requires no pointwise lower estimate for the non-self-similar Scarpi heat kernel. Consequently, every nontrivial solution blows up in finite time when $1<p<1+2/n$, and sufficiently large data blow up for every $p>1$. For $u_0=A\varphi$ with fixed nonzero $0\le\varphi\in L^1\cap L^\infty$, the maximal lifespan satisfies \[ T_A\asymp A^{-(p-1)/\alpha_1} \qquad(A\to\infty), \] while a subcritical small-amplitude upper bound is governed by the long-time order $\alpha_2$. The lifespan bounds are expressed through the inverse of the integrated memory. In the numerical section, we complement these estimates by comparing the Scarpi dynamics with both Caputo endpoint models. Continuous Laplace inversion shows that the logarithmic slope of the integrated memory varies nonmonotonically across the transition. At large amplitudes, the growth thresholds approach those of the Caputo $\alpha_1$ model. A nonlinear space–time rescaling probes the long-time regime and reveals nonmonotone threshold-time ratios relative to Caputo $\alpha_2$. For fixed-width initial profiles, increasing the transition rate delays the prescribed growth threshold at larger tested amplitudes but advances it at smaller ones.
Read the full abstract
Statistical Computation
bayprior: Structured Bayesian Prior Elicitation, Conflict Diagnostics, and Regulatory Reporting
Bayesian clinical trials require a well-specified prior distribution, and regulators increasingly expect that specification to be documented, diagnosed for prior-data conflict, and shown to be robust to reasonable alternatives, yet few R tools connect the full workflow of prior construction, validation, and regulatory justification into a single package. We introduce bayprior, an R package and Shiny application that implements structured expert elicitation via quantile matching, moment matching, and the SHELF roulette method across six distribution families; linear and logarithmic expert opinion pooling with Bhattacharyya agreement diagnostics; derivation of meta-analytic-predictive (MAP) priors from historical trial data via random-effects meta-analysis; prior-data conflict assessment using the Box p-value, S-value (surprisal) surprise index, information divergence, Bhattacharyya overlap, and multivariate Mahalanobis distance; hyperparameter sensitivity analysis with tornado and influence heatmap visualisations; and robust, sceptical, and power prior alternatives. A regulatory reporting module generates self-contained HTML, PDF, or Word documents addressing expectations in the FDA's 2026 draft Bayesian methods guidance and in EMA guidance on incorporating external and historical information. The package is demonstrated on a synthetic oncology Phase II trial. bayprior is available on CRAN and includes a fully modular Shiny application for interactive use.
Read the full abstract
Computer Vision
Reasoning with Image Generation
Chain-of-thought reasoning has revolutionized natural language processing by enabling large language models (LLMs) to decompose problems into intermediate steps before answering. Yet confining reasoning to the textual domain presents limitations for tasks requiring direct manipulation of visual representations. Recent efforts augment multimodal LLMs with external visual expert tools such as depth estimation or object detection modules, but these remain fundamentally limited by their reliance on narrow, rigid operations that cannot flexibly generate or transform visual content. We propose ReImaGin, which leverages image generation models as a flexible visual reasoning mechanism for multimodal LLMs: unlike fixed-function tools, they accept natural language commands and can perform open-ended visual operations, like removing an occlusion or generating a floorplan from multiple disjoint views of a room. Across six diverse visual reasoning tasks including multi-view spatial reasoning and collision prediction, ReImaGin consistently outperforms both text-only reasoning and specialist vision-tool baselines, with gains of up to 25%, demonstrating the advantage of flexible, generative visual reasoning.
Read the full abstract
Computational Physics
Highly Parallel Real-Space Random Phase Approximation Using Lanczos Quadrature and Interpolation
We present a highly parallelizable, matrix-free, real-space method for computing the random phase approximation (RPA) correlation energy within Kohn-Sham density functional theory. In particular, we avoid the explicit construction and eigen-decomposition of the response function matrix and use Lanczos quadrature to evaluate the trace of a matrix function on a real-space grid. We also show it is possible to exploit the spatial smoothness of the RPA correlation energy density in real-space to reduce computational cost. Specifically, we compute the energy density on a coarse grid, then reconstruct an approximation to the full, fine grid via interpolation. We implement this formulation within the SPARC electronic structure package and demonstrate its convergence, accuracy, agreement with planewave results, and scaling. Interpolation can enable an $8\times$ reduction in the computational prefactor. Given the embarrassingly parallel nature of the proposed method, we achieve near-ideal speedups and near-cubic scaling, thus allowing us to compute the RPA correlation energy for a silicon system with 256 valence electrons at chemical accuracy in less than 30 minutes on 4,096 CPU cores.
Read the full abstract
Information Retrieval
Balancing Trial and Reorder: A Hybrid Sequential Transformer-GBDT Ranker for On-Demand Delivery
On a delivery platform, personalized store ranking greatly influences what users find and order. Unlike digital-only domains, candidate stores are local and bound by real-time availability and delivery operations. One central modeling tension is between surfacing new stores for trial and preserving ranking quality for sessions with reorder intent. We present Universal Venue Ranker (UVR), a production system deployed at Wolt that pairs a bidirectional transformer encoder for sequential user modeling with a GBDT ranker integrating contextual, user, and store features. Trained across all stores and domains of a country while enforcing local delivery constraints at inference, UVR replaces four previously separate ranking models (three for restaurants, one for retail) with a single unified system. Label smoothing and trial-biased sample weighting steer the model toward new stores, lifting offline trial MRR by +12% to +30% over production while regressing reorder MRR in five of six countries. These regressions leave Global CVR, our core online metric, which blends trial and reorder sessions, statistically unchanged. We validate UVR in three consecutive A/B tests, the first two across Wolt's largest operating markets and the third spanning all operating countries and both domains. UVR V1 delivers +5.5% Merchant Trial Rate and +0.16% Global CVR over the previous production ranker; V2 adds a further +0.45% Merchant Trial Rate on top; and V3, our cross-domain unification of the restaurant and retail rankers, adds a further +1.31% Retail Merchant Trial Rate, together accounting for substantial incremental gross order value and a materially simplified serving stack.
Read the full abstract
Numerical Analysis
Physics Informed Random Feature Neural Networks for Solving PDEs
Machine learning-based partial differential equations (PDEs) solvers have attracted significant attention in recent years. Most progress in this area has been driven by deep neural networks such as physics-informed neural networks (PINNs) and kernel method (such as physics-informed Gaussian Processes). We introduce a physics-informed random feature method for countering part of the spectral bias which PINN-based solvers are facing for a certain class of PDEs. Random feature method was originally proposed to approximate large-scale kernel machines and can be viewed as a specialized randomized neural network. Compared to other state-of-the-art PINN-based solvers which require a large number of collocation points, our proposed method reduces the computational complexity. In this paper, we develop a rigorous approximation error analysis and derive high-probability error bounds on the $H^1$ norm. We provide extensive numerical tests for verifying our theoretical guarantees on error decay rates, as well as several comparison tests to showcase our claimed capability for combating spectral bias in these deep learning based methods.
Read the full abstract
Robotics
Collision-Aware Humanoid Whole-Body Control under Imperfect Tracking Targets
Humanoid robots often execute motion commands through whole-body controllers (WBCs) that track targets while maintaining balance and stability. However, most WBCs are blind to scene geometry, which can lead to collisions from imperfect target motions that are geometrically unsafe due to perception, planning, or teleoperation errors. We propose RECAL, a Robot–Environment Cross-Attention Layer that wraps a blind WBC to trade off target tracking against collision avoidance using external scene geometry. RECAL supports collision-aware tracking of floating-base and end-effector commands, including collision avoidance for held objects. It represents the robot, held objects, and environment as point clouds, using cross-attention between robot/object points and the environment to produce geometry-aware control features. In simulation, RECAL improves collision avoidance while preserving target-tracking performance across frozen-arm and adaptive-arm locomotion, object-carrying, and standing-manipulation scenarios relative to alternative geometry-aware WBC architectures. We further demonstrate the controller on a real Digit V3 humanoid robot.
Read the full abstract
Computational Engineering
DiffRayve: Differentiable Ray-Wave Method for Polarized and Unpolarized Diffractive-Refractive Optical Systems
Current deep optics simulations struggle to balance high fidelity with computational efficiency, particularly for complex polarized and diffractive systems. To address this, we introduce a fully differentiable Shooting and Bouncing Ray (SBR) algorithm that simultaneously models geometric and physical optics fields. Unlike standard wave optics methods, our approach enables accurate, gradient-based optimization of polarized compound refractive-diffractive systems without the computational cost of full-wave simulations. We validate our method against analytical Fraunhofer diffraction patterns and state-of-the-art Fourier optics and wave optics methods. We showcase the practical utility of our differentiable engine through one application: designing a wide field-of-view achromatic lens with multiple Diffractive Optical Elements (DOEs).
Read the full abstract
Cryptography and Security
Implementing a White-Box Undetectable Backdoor for Random Fourier Features
Goldwasser et al. showed that undetectable backdoors can be planted in machine learning models trained with the Random Fourier Features (RFF) algorithm, under a hardness assumption tied to the Continuous Learning With Errors (CLWE) problem. Under standard cryptographic assumptions, even a full white-box audit of a model's weights cannot detect this class of backdoor. The construction is stated in terms of cryptographic reductions and probabilistic lemmas, without a reference implementation, and relies on secondary machinery such as the Sparse Gaussian Pancakes distribution and a homogeneous CLWE conditional density. Its realizability in ordinary numerical code is not obvious from the paper alone. This paper implements the white-box CLWE-RFF backdoor construction end to end using only numpy and scipy, to test whether this threat is realizable with commodity scientific-computing tools or requires specialized cryptographic infrastructure. We give two samplers for the core $GP_d(b_k)$ distribution. The first is a rejection-sampling proxy. The second is an exact closed-form sampler derived from the homogeneous CLWE density and verified against its own analytic form. Using this implementation, we run statistical indistinguishability tests, covering both weight-space and functional black-box comparisons. We find no evidence of detectable difference between backdoored and clean models across a range of sparsity ratios $\rho = d_{\text{sparse}}/D$. We report which parts of the construction were straightforward to realize, which required derivation not spelled out in the paper. We also highlight which parts we did not attempt to reproduce, including the underlying lattice hardness reduction. We see this work as a contribution to understanding the practical realizability of the Goldwasser white-box CLWE core, not as a new theoretical result.
Read the full abstract
Computational Engineering
Privacy-Preserving Coordinated Operation of Multi-Player Industrial Network Using Secure Aggregation
Electrified chemical industries with operational flexibility can reduce operating costs by shifting production and distribution decisions in response to time-varying electricity prices. However, chemical plants operate within process networks where coordinated demand response can exploit flexibility across multiple stakeholders. Centralized coordination requires access to stakeholders' local scheduling models and proprietary operational data, often incompatible with data-privacy requirements. Distributed optimization with an independent central coordinator (ICC) avoids direct model sharing, but iterative exchange of coupling variables can still reveal private model parameters. We propose a privacy-preserving distributed coordination framework for coordinated demand response in industrial networks. The framework integrates secure aggregation with an ICC-based alternating direction method of multipliers (ADMM) algorithm, so plant-level messages are numerically masked and become useful to the ICC only after aggregation. We test the framework on a multi-plant industrial gas network in which three air-separation units jointly schedule production and shipments to shared customer regions. To support stable participation, we incorporate a two-phase revenue-sharing mechanism that reallocates savings so every plant improves relative to its decentralized status quo. In a 31-day rolling-horizon simulation with synthetic data representing heterogeneous electricity prices and demand, the coordinated policy reduces total network cost by 19.77% relative to decentralized operation and achieves a full-month cost within 3.08% of a centralized social-welfare-maximization benchmark. We further quantify a conservative worst-case collusion mode, showing how unmasked iterates and auxiliary information can expose private objective parameters.
Read the full abstract
Computational Complexity
A Resolution of Friedgut's Conjecture on Influential Coalitions
We prove that, for every constant $\varepsilon>0$ and every function $f:\Sigma^n\to\{0, 1\}$, there is a coalition of $O(n/\sqrt{\log n})$ coordinates and a target output $b\in\{0, 1\}$ such that, after the remaining coordinates are sampled uniformly and independently, the coalition can choose its values to make the output equal to $b$ with probability at least $1-\varepsilon$. The bound is independent of the alphabet size and also holds for monotone Boolean functions on $[0,1]^n$, resolving a conjecture of Friedgut (Combinatorics, Probability and Computing, 2004). Unlike the Boolean cube setting, where Kahn, Kalai, and Linial (FOCS, 1988) give a coalition bound of $O(n/\log n)$, no sublinear bound independent of the alphabet size was previously known. In collective coin flipping, our result gives the first sublinear bound on the number of bad players needed to force a fixed output with probability at least $1-\varepsilon$ in any one-round protocol with independent uniform messages, regardless of the message length. A key ingredient in our proof is an encoding that lets us relate the influence of a function on a product space to the $p$-biased influence of the encoded function. We then rely on a structure theorem of Hatami (Annals of Mathematics, 2012) for functions with small $p$-biased influence to bias the encoded function.
Read the full abstract
High Energy Physics (Theory)
Edge observables in Maxwell theory on null boundaries
We study edge observables in three-dimensional Maxwell theory on null boundaries using a Hamiltonian formulation adapted to null foliations. We consider three backgrounds: Minkowski spacetime, the BTZ black hole, and de Sitter space, where the relevant boundaries are, respectively, null infinity, the black hole horizon, and the cosmological horizon. In all three cases we find, besides the usual $U(1)$ charge, a second edge observable associated with an intrinsic symmetry on the null boundary. The two charges are well defined quasilocally. They form a centrally extended algebra which, in Fourier modes, becomes two independent Abelian Kac-Moody algebras with opposite levels. Thus, the same centrally extended edge structure appears at both asymptotic and finite-distance null boundaries.
Read the full abstract
Spectral Theory
An inverse problem on eigenfunction triple products
On a connected closed smooth Riemannian manifold, the algebraic structure of the Laplace eigenfunctions, as described by eigenfunction triple products, uniquely determines the geometry. We refine this correspondence by introducing the notion of an $N$-product eigenbasis, which consists of eigenfunctions whose pairwise products may be written as linear combinations of at most $N$ basis elements. We prove that a manifold admits a $2$-product eigenbasis if and only if it is a flat torus. We also prove an analogous result for Laplace eigenvectors of bounded-degree graphs.
Read the full abstract
Combinatorics
Polynomial Length Cycles In Tough Graphs
We prove that every $n$-vertex $15$-tough graph contains a cycle of length $\Omega(n^{1/20})$.
Medical Physics
Geant4 Simulation of an X-ray Beam Monitoring Detector based on plastic scintillators
Beam monitoring detectors play an important role in experimental control and radiological protection by enabling the real-time characterization of particle and photon beams. They provide information on beam intensity, position, and scattering, helping to ensure measurement accuracy, protect sensitive detectors, and quantify stray radiation in the surrounding environment. In this work, a Geant4 simulation was developed to investigate the performance of an X-ray beam monitoring detector (BMD) composed of six hexagonal BC404 plastic scintillators arranged to provide high granularity, using a reflector with a realistic reflectivity of 93%. Under the simulation conditions considered in this study, the detector exhibited an intrinsic time resolution of 100.8 $\pm$ 2.0~ps. The results indicated that only about 10% of the incident photons interacted with the detector, suggesting that the proposed design could be used for beam characterization while minimally perturbing the primary beam. In addition, the X-ray multiplicity decreased with distance according to an inverse-square dependence. A backscatter study performed using a water phantom showed that approximately 6% of the incident beam was detected as scattered radiation. These results suggest that the proposed detector may be a useful tool for X-ray beam characterization and for studies related to scatter radiation and radiological protection. Further experimental validation is required to confirm these findings.
Read the full abstract
Computation and Language
Negation Beyond the Verbal Channel: Temporal Multimodal Correlates in Dialogue
Negation is typically modeled through its linguistic realization, although spoken interaction is accompanied by tightly coordinated nonverbal behavior. We ask whether contexts centered on spoken negation cues contain measurable multimodal behavioral information: whether they can be distinguished from matched control contexts without lexical or acoustic input, where this information occurs in time, which modalities carry it, and whether it extends to the dialogue partner. We study 27 human-human interviews conducted in virtual reality, comprising temporally aligned gaze, facial, head, body, hand, and finger behavior and 964 annotated negation cues. Treating classification as a predictive probe, we compare 20 time-series models while excluding lexical and acoustic information, and then systematically vary temporal context, interactional source, modality availability, and event timing. Across grouped 10-fold cross-validation, the strongest probes reach up to .75 mean held-out AUROC from speaker-side behavior. Temporal analyses show that predictive information is concentrated around cue onset but remains detectable over a broader surrounding interval, while dialogue-partner behavior carries weaker predictive information with a comparatively diffuse temporal profile. Ablation and timing perturbations further show that facial features produce the largest modality-ablation effect and that the trained probe is sensitive to the temporal organization of the observed events.
Read the full abstract
Computers and Society
Silicon sampling answers with country-level assumptions, not individual attitudes: Cross-national evidence from the European Social Survey
Silicon sampling uses large language models (LLMs) to simulate survey respondents. Whether it recovers cross-national variation, and why, remains unresolved. This study evaluates it against European Social Survey Round 11 (30 countries, 42 items) with two open-weight LLMs under first- and third-person prompts, plus backstory and response-format experiments. Aggregate recovery is moderate and uneven across items. Adding the country name to a three-variable demographic backstory raises the median per-item correlation between simulated and observed country means from -0.03 to 0.52, and the richer profiles tested add no consistent gain. The respondent's country label acts as a country-level assumption that respondent detail does not revise. Naming the response-scale endpoints in words stops the model from ranking countries backwards, so the answer format sets the direction of the ranking. Individual-level recovery remains negligible in every condition and does not track aggregate recovery across countries. An average of neighboring countries, using no LLM, recovers country levels more accurately than every model condition and ranks them about as well. Silicon sampling can thus support exploratory country-ranking comparison after item-level validation and with the response format reported. It does not support individual or distributional inference.
Read the full abstract
High Energy Astrophysical Phenomena
Properties of the circumstellar matter around the pair-instability supernova candidate SN 2018ibb revealed by its light curve
SN 2018ibb is one of the best pair-instability supernova (PISN) candidates identified to date. It, however, showed unexpected blue flux excess in late-phase spectra, likely originating from the interaction between supernova (SN) ejecta and dense circumstellar matter (CSM). We develop synthetic light-curve models of PISNe interacting with dense CSM and estimate the CSM properties of SN 2018ibb by comparing the synthetic and observed light curves. We found that the bolometric luminosity evolution of SN 2018ibb from 150 d after the peak can be well reproduced by the interaction with the CSM formed by a mass-loss rate of 0.01(v_CSM/1,000 km/s) Msun/yr, where v_CSM is the CSM velocity. The observed luminosity break at around 300 d from the peak indicates that the CSM interaction ended at this time and the dense CSM radius was 8.5e16 cm. The CSM radius then implies that the mass loss of the progenitor was enhanced for 28/(v_CSM/1,000 km/s) yr before explosion. We conclude that PISN progenitors may experience short-term mass-loss enhancement within decades before explosion, similar to what is often observed in progenitors of core-collapse SNe.
Read the full abstract
Computation and Language
ParsHate: A Benchmark Dataset for Hate and Target Detection in Persian
We introduce ParsHate, a manually annotated dataset of 10,000 Persian tweets spanning 2013-2022, representing the first decade-long benchmark for hate speech detection in Persian. The dataset contains 31% hateful content and supports both hate detection and multi-label fine-grained target identification across seven structured target categories. ParsHate also distinguishes explicit and implicit hate, marks explicit and implicit targets, and provides span-level rationales. Data collection combines random and score-stratified temporal sampling to reduce keyword-driven bias while preserving natural label distributions. Applying SOTA models for Persian hate-speech detection on ParsHate shows moderate performance (79% F1), especially with samples from earlier years, and low performance with target identification (25.5% macro-F1). This emphasizes the diverse sampling of hate speech in ParsHate and its challenging nature that requires more advanced methods for better performance. Dataset is made publicly available.
Read the full abstract
Number Theory
Twisted Rational Zeros and Local-Global Principles for Linear Recurrence Sequences
The Skolem Problem asks whether a given linear recurrence sequence (LRS) has a zero term, and is equivalent to proving an effective version of the Skolem-Mahler-Lech theorem, which states that a non-degenerate LRS has finitely many zeros. Decidability of the Skolem Problem however, has remained open for many decades. Bilu et al. (2022) showed that the Skolem Problem for simple LRS is decidable subject to the weak $p$-adic Schanuel Conjecture and the Skolem Conjecture (also known as the exponential local-global principle), the latter of which states that an LRS has an integer zero if and only if it has a zero modulo every integer $m$. This paper works towards understanding the Skolem Conjecture. We provide an example showing that a natural strengthening of the Skolem Conjecture, where we restrict $m$ to be a prime power, is false. This failure is accounted for by the relationship between $p$-adic zeros of LRS (which arise naturally in the proof of the Skolem–Mahler–Lech theorem and have been studied algorithmically by Bacik et al. (2026)) and twisted rational zeros (introduced by Bilu et al. (2025)). By studying this relationship further, we are able to prove the main result of this paper: a local-global principle for simultaneous zeros of two coprime LRS, subject to the $p$-adic Schanuel Conjecture. A fundamental step in proving this result is characterising when twisted rational zeros are (or are not) $p$-adic zeros for infinitely many primes $p$, which we do unconditionally. This also answers two open questions of Bilu et al. (2025). Finally, we conjecture that the existence of twisted rational zeros is the only way that the aforementioned strengthened Skolem Conjecture may fail, which is supported by a heuristic argument.
Read the full abstract
Information Retrieval
Where Post-Training Quantization Breaks Text Embedders: A Measured Map Across Four Embedder Families
Weight-only post-training quantization is the cheapest way to shrink a retrieval embedder, and the received advice for applying it – protect the embedding table, allocate bits by module sensitivity, prefer a ranking-aware objective over weight reconstruction – was carried into LLM quantization largely intact. We test that advice on retrieval embedders directly, quantizing five checkpoints from four architecture families across a grid of bit widths and group sizes, and isolating the embedding, attention and feed-forward blocks at each width. Every heuristic fails to transfer as stated. The embedding table never emerges as the dominant isolated protection priority in any family, despite being the largest tensor in several of them. Module sensitivity does not survive as a transferable ordering: at INT4/g16 the spread between modules is too small to allocate against, at INT3 the ordering becomes family-dependent and joint damage stops being the sum of its parts, and at INT2 comparable reconstruction error accompanies retention ranging from 1.3 to 65.9 percent of full precision. A cheap reconstruction proxy is useful for screening uniform bit widths but substantially less reliable for choosing which tensors to protect; its apparent strength across the whole grid is a range-extension artifact. A distilled 109M student at INT3 holds 78.04 NDCG@10 in 68.4 MB and dominates the extreme-PTQ arm of its own 0.6B teacher, 297.9 MB at 64.46, on both size and quality – but only inside the task it was distilled for. Sizes are byte counts of files that exist rather than arithmetic estimates, and the measurement repository carries the byte provenance for every one of them.