Instrumentation and Detectors
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 15 September
The Zero-Degree Calorimeter (ZDC) at the proposed Electron-Ion Collider in China (EicC) is essential for detecting forward-going neutral particles and supporting the core nucleon spin and 3D imaging physics programs. In this work, a highly compact Spaghetti Calorimeter (SPACAL) architecture is proposed and optimized as the baseline design for the ZDC hadronic section. To systematically and quantitatively evaluate its physics capabilities, a comprehensive end-to-end Geant4 simulation framework was developed, integrating energy deposition, optical photon transport, photo-detection, and modeled front-end signal digitization. The optimized detector demonstrates excellent performance for neutron detection, achieving an energy resolution of $33.42\%/\sqrt{E/\mathrm{GeV}} + 1.47\%$ and a timing resolution of approximately 500 ps, outperforming the targeted specification. Furthermore, full-system simulations incorporating the upstream electromagnetic calorimeter yield a sub-centimeter transverse position resolution. Moreover, topological shower shape analysis across the full detector system provides robust particle identification (PID), with photon-neutron separation accuracy reaching over $99\%$ for high-energy incident particles. These quantitative results confirm that the SPACAL design fully satisfies the stringent operational and physics requirements of the EicC forward kinematic region.
Computation and Language
Nameless Tokenization: A Lossless Tokenizer-Level Defense Against Control-Token Forgery in Open-Weight LLMs
Open-weight language models publish the strings their chat templates use to mark turns, roles and tool results, which the tokenizer maps back to the reserved identifiers the model obeys. Anyone who controls text in a prompt can therefore write a turn boundary indistinguishable from one the serving stack wrote. We audit 256 deployed chat tokenizers. All are forgeable, and the flag usually recommended as a fix leaves 56.6% forgeable because it misses the tool and reasoning markers agent systems rely on. We propose nameless tokenization, which leaves the control entries with a reserved identifier and no surface string, so the content encoder cannot emit one and message content reaches the model unaltered. Across five tokenizer families it reproduces the standard token stream exactly on attack-free data and lifts accuracy on a probe of delimiter-bearing text from 8.5% to 59.9%, where sanitizers lose it. Separating a delimiter's appearance from its identifier shows the identifier matters little against a bare task instruction, but carries most of a forged tool result and most of any forged turn once the system message tells the model to treat user content as data.
Read the full abstract
Numerical Analysis
Nonlinear filtering stabilizations for the quasi-geostrophic equations
Numerical simulations of ocean flows typically require fine computational meshes to resolve the Munk scale, leading to high computational costs. Filtering-based large eddy simulation (LES) provides a way to relax the mesh size requirement by modeling the effects of the unresolved scales. For the implementation of this strategy, we propose a three-step algorithm called Evolve-Filter-Relax (EFR) that requires (i) the solution of a QGE problem, (ii) a nonlinear Helmholtz filter for the potential vorticity field leveraging an indicator function, and (iii) a final relaxation step. We show that the EFR algorithm can be interpreted as a splitting scheme for a perturbed QGE problem with additional dissipation and provide a practical choice for the relaxation parameter. For comparison, we also investigate a nonlinear Bardina regularization of the QGE. Numerical results on a classical benchmark show that both the EFR approach and the nonlinear Bardina regularization significantly improve the accuracy and stability of coarse mesh simulations with no LES model. Additionally, the EFR method with a deconvolution-based indicator function delivered the best balance between accuracy, stability, and computational efficiency in a test case involving a more realistic geometry (Mediterranean Sea).
Read the full abstract
Astrophysics of Galaxies
Pushing HST to the limit: Detection completeness and morphology robustness of faint galaxies in the EGS field
Reliable catalogs at the faint limit are essential for statistical studies of galaxy evolution. However, detection and structural measurements of faint galaxies remain challenging. We evaluate detection completeness and structural parameter uncertainties of faint galaxies in the CANDELS/EGS field using mock images and observations from the HST and JWST. The framework is also applicable to large high-redshift surveys, including Euclid, the upcoming CSST, and the Nancy Grace Roman Space Telescope. We detect sources in the EGS F160W mosaic using a 1.5\sigma threshold and quantify detection completeness and false-detection rates with realistic mock images. Mock galaxy-pair tests assess blending effects on both source detection and structural measurements in sersic fitting. In addition, the overlap with CEERS observations is used to derive an empirical criterion for separating true faint galaxies from fake detections using HST photometry. We identify 72,467 sources in the CANDELS/EGS field, including 57,444 fainter than 25 mag in F160W. Detection completeness exceeds 95% for objects brighter than 25 mag but declines to <50% beyond 27 mag (with false detection rate>50%). Structure parameters from single sersic modeling are reliable down to mH = 25 mag. For galaxies at 25<mH<27 mag, systematic biases in the sersic index reach \Delta n \approx 5-70%, while \Delta q decreases from approximately -0.03 to -0.27. Close companions (~0.3 arcsec) introduce measurable biases in recovered sersic magnitudes and shapes, while the impact becomes negligible at larger separations. An empirical criterion based on mH, F814W-F160W color, R50, and zphot separates true faint galaxies from false detections, reaching 72% completeness and 84% purity. It yields a final catalog of 59,646 objects consistent with previous CANDELS measurements at bright magnitudes while reaching fainter limits.
Read the full abstract
Optimization and Control
The Unified Separation Condition: A General Constraint Qualification for Smooth and Nonsmooth Optimization
We introduce the Unified Separation Condition (USC) - a simple and general constraint qualification for finite-dimensional nonlinear programming. The USC requires that the origin be uniformly separated from the subdifferential of the constraint violation function in a neighborhood of the feasible set. The main result of this paper is two-fold. First, we show that the classical Mangasarian–Fromovitz constraint qualification (MFCQ) for inequalities and the linear independence constraint qualification (LICQ) for equalities imply the USC. Conversely, USC is strictly more general: it remains applicable in nonsmooth settings where classical conditions are not defined, and it may hold even when MFCQ fails. The proof that MFCQ implies USC is based on Gordan's theorem; the implication from LICQ to USC follows from the linear independence of the gradients of the active constraints. We also introduce a local version of USC and discuss its computational verification via convex quadratic programming. The USC provides a unified framework for constraint qualifications, bridging classical smooth theory and nonsmooth optimization.
Read the full abstract
High Energy Physics (Theory)
Constraints on Kasner Exponents from Holography and Energy Conditions
A central question in bottom-up holography is whether a given bulk effective theory admits a consistent holographic dual. In this work, we explore whether the near-singularity Kasner scaling of planar AdS black hole interiors can serve as a useful diagnostic based on interior-sensitive holographic probes. By examining the metric combinations that control interior-sensitive observables, including Complexity=Volume (CV), the bulk contribution to Complexity=Action (CA), Hartman-Maldacena (HM) entropy, and the thermal $a$-function, we derive algebraic bounds on the Kasner exponents $(p_t,p_s)$ for the relevant semi-classical regimes: finite-radius late-time branches of CV and HM, finite CA complexity, and a finite near-singularity thermal $a$-function. The resulting inequalities delineate the corresponding regions of Kasner space in which the terminal scaling alone is sufficient to realize these behaviors. Furthermore, we demonstrate that classical energy conditions, specifically the null and dominant energy conditions, provide simple sufficient criteria ensuring that the Kasner exponents fall within these holographically allowed regions. These results establish a direct connection between classical bulk energy conditions and the interior geometry selected by holographic probes, and suggest that Kasner scaling can provide a complementary diagnostic in bottom-up holography.
Read the full abstract
Numerical Analysis
Well-posedness, Regularity, and Strong Approximations of Superlinear Stochastic Reaction-Diffusion Equation
This paper develops a general framework for the well-posedness, regularity, and strong approximation of the stochastic reaction–diffusion equation (SRDE) with superlinear drift and diffusion coefficients. We first extend the well-posedness results in W. Liu and M. Röckner, J. Funct. Anal., 2902–2922, 2010 and W. Liu, J. Differential Equations, 572–592, 2013 to the case of superlinear diffusion in the Gelfand triple \(V \hookrightarrow H \hookrightarrow V^*\), with \(V\) equipped with the norm \(\|\cdot\|_V\), and derive a moment estimate by establishing a new Itô formula for \(\|X\|_V^p\) with general \(p \ge 2\). We then apply this abstract result to the SRDE, establish higher spatial regularity \(\dot H^{1+\gamma}\) for any \(\gamma \in [0,1]\) whenever the initial datum lies in the same Sobolev space, and obtain temporal Hölder regularity. Finally, we construct a family of tamed finite element methods (tamed-FEMs) for the SRDE under general assumptions on the tamed functions, derive their long-time unconditional stability, and establish optimal strong convergence rates. To our knowledge, this is the first strong approximation result for SPDEs with superlinear diffusion coefficients.
Read the full abstract
Analysis of PDEs
Dimension-dependent symmetry breaking in a diffusive nonlocal interaction model
We study the equilibrium structure and long-time behavior of a nonlinear Fokker–Planck equation with diffusion and nonlocal interactions generated by squared simplex volumes. For $1\leq n<d$, the stationary states are isotropic Gaussian measures, and every solution converges to the equilibrium determined by its conserved mean. At $n=d$, the free energy fixes only the covariance determinant, allowing a continuum of anisotropic Gaussian equilibria when $d\geq2$. We establish global well-posedness for arbitrary initial probability measures with finite second moment, identify stationary states with the global minimizers of the free energy, and prove convergence in quadratic Wasserstein distance with explicit exponential rates.
Read the full abstract
Machine Learning
Structural Negative Transfer in Federated Graph Neural Networks: Diagnosis, Causal Investigation, and the Limits of Divergence-Aware Mitigation
Federated learning lets multiple participants train a shared model without pooling raw data, by exchanging locally trained model updates instead. Federated averaging assumes that averaging local models is a reasonable way to solve one shared problem when participants' data are broadly similar. Work on non-IID federated learning has shown that this assumption can withstand differences in label and feature distributions. We ask whether it survives a different strain specific to graph neural networks, where client graphs differ not in label or feature distribution but in structure itself, requiring the same shared weights to operate over fundamentally different topologies. We call the resulting harm structural negative transfer. In a federation of real citation networks and synthetic structural proxies, a structurally atypical client lost more than half its achievable accuracy simply by joining. In an initial six-client federation, two label-free structural statistics computable before training were strongly associated with this harm. Expanding to twenty clients showed that degree divergence remained associated with harm, although more weakly, and survived removal of domain contrast. Spectral divergence did not replicate, which we trace to a confound caused by the composition of the reference pool used for leave-one-out statistics. A causal intervention isolating topology found no significant effect. A degree-normalization mechanism held across twenty-four seeds but did not explain the harm when corrected. The best of five candidate fixes beat a tuned baseline only until a matched, structurally blind control was applied, after which the gain disappeared. What survives is a modest, partially replicated, degree-specific signal that is not yet a validated predictor at scale.
Read the full abstract
Statistics Theory
Exact finite-sample inference for multi-mixed fractional Brownian motion with drift
In this paper we study a linear drift perturbed by a superposition of $m$ independent fractional Brownian motions with known Hurst parameters and a common scale, observed at $N$ equidistant times. Inference for such models is usually asymptotic; we show that here it is exact. We derive the maximum likelihood estimators of the drift $\theta$ and of the scale $\alpha^{2}$ in closed form and obtain their exact finite-sample joint law: $\widehat\theta$ is Gaussian, $N\widehat\alpha^{\,2}/\alpha^{2}$ is chi-square with $N-1$ degrees of freedom, and the two are independent. As this law is free of every model parameter, we deduce Student and chi-square confidence intervals and tests of exact level for every $N\ge2$, whatever the Hurst vector. We also prove that the estimators are uniformly minimum variance unbiased with $\widehat\theta$ attaining the Cramér–Rao bound at every $N$, that both are strongly consistent and asymptotically normal, and that the drift estimators form, in law, a Brownian motion run along their own variance scale. A sharp non-asymptotic bound shows that the accuracy of the drift is governed by the length of the observation window and not by the mesh, and a Monte Carlo study confirms exact coverage, even at small sample sizes, and quantifies what is lost when the Hurst vector is misspecified.
Read the full abstract
Quantum Physics
Spin Grid States for Quantum Metrology in Atomic Clocks Limited by Spontaneous Emission
Entanglement can enhance precision in phase estimation and in frequency estimation with atomic clocks, but it remains a central challenge to identify useful states and measurements under realistic noise processes. Here, we study quantum metrology with an ensemble of atoms subject to spontaneous emission, which limits frequency estimation by constraining the useful interrogation time. We identify spin grid states (SGSs) as the relevant near-optimal probes beyond a crossover at an ensemble size of 51, where GHZ-like states cease to be optimal. SGSs display a periodic grid on the Bloch sphere and can be generated with two one-axis-twisting (OAT) operations separated by a collective rotation. By optimizing the quantum Fisher information over permutationally symmetric states, we find that SGSs perform close to the globally optimal probes for intermediate and large ensembles, which turn out to be spin GKP states. We further present a sequential readout strategy that nearly saturates the corresponding quantum Fisher information. This strategy uses an OAT echo to map spontaneous-emission events onto collective rotations, making the corresponding jump sectors distinguishable and allowing the measurement basis to be conditioned on the number of decay events. Together, these results show that SGSs provide a practical route to quantum-enhanced phase and frequency metrology in atomic ensembles limited by spontaneous emission.
Read the full abstract
Operator Algebras
Invariant random subgroups of $C^*$-simple groups
Let $\Gamma$ be a countable discrete $C^*$-simple group. Let $\mu$ be a $\Gamma$-invariant Borel probability measure on $\text{Sub}(\Gamma)$, i.e., an IRS. We show that $\mu$-almost every subgroup $H$ is $C^*$-simple.
Instrumentation and Methods for Astrophysics
Hardware-efficient neural networks for FPGA-based radio triggering of extensive air showers
We present a hardware-efficient hybrid trigger for FPGA-based radio detection of extensive air showers. The hybrid design consists of a lightweight denoiser that cleans raw ADC traces and a compact classifier that operates on the denoised output, enabling robust near-threshold pulse detection in high-interference environments. Both neural networks are trained quantization-aware. Signals are generated from detector-folded CoREAS/CORSIKA simulations and embedded into measured noise to form a realistic benchmark. The trigger reaches an AUC of 0.992 while fitting comfortably within the resource budget of a Zynq-7000 Z-7020, with microsecond-scale latency and sub-watt power consumption. RTL validation confirms agreement between the fixed-point hardware and the quantized software model, demonstrating that neural denoising combined with classification provides reliable, low-cost radio triggering in noisy environments.
Read the full abstract
Astrophysics of Galaxies
The UV-to-FIR environments of nearby Type Ia supernovae with the DustPedia Galaxy Catalogue – I. Local versus global host properties
The ongoing use of Type Ia Supernovae (SNe Ia) as standardisable candles relies on an additional correction for the relationship between their standardised brightnesses and host galaxy properties. Currently, this correction is built on host stellar mass, typically derived from optical-only SED fitting, which recent analyses suggest may not fully capture the underlying environmental properties. This relationship is stronger when considering the regions closest to the SNe, rather than the galaxies as a whole. I use a sample of SNe Ia in DustPedia galaxies and CIGALE SED fitting to compare the local environments of 90 nearby SNe Ia against the global properties of their hosts. The UV-to-FIR coverage of DustPedia enables improved dust constraints, and helps break the age-dust degeneracy that limits optical-only studies; to my knowledge this coverage has not been previously applied to the sub-galactic regions around SNe Ia. Stellar mass and dust mass are lower locally simply because the aperture encloses less of the galaxy; however, for colour, sSFR, and dust attenuation, local values differ from the host average by more than measurement uncertainty alone allows, with attenuation showing the strongest discrepancy ($p=6.3\times10^{-5}$). Only mass-weighted age is consistent locally and globally. Galaxy-integrated properties therefore do not capture the true conditions at the SN location. SN siblings (sharing a host galaxy) only emphasise this effect. Siblings sampling the same galaxy structure, such as two SNe in spiral arms, have consistent environments, whilst others diverge. Standardising on global properties may therefore mask the differences that drive the brightness-environment relationship.
Read the full abstract
Machine Learning (Statistics)
Splitting the Difference: Interpretable Causal Forests for Treatment Effect Heterogeneity and Bias
In various fields, such as medicine and marketing, accurately predicting individual treatment effects holds significant promise. However, achieving reliable predictions alone is often insufficient for making informed decisions; it is equally important to understand why the treatment effect is higher for some individuals than for others. To address this two-fold challenge of prediction and interpretation, we introduce an algorithm based on decision trees and random forests for estimating individual treatment effects. Our algorithm is simple: it operates exactly like a standard random forest, but with a different splitting criterion, and requires no additional workarounds such as double machine learning or orthogonalization as used in Generalized random forests. It handles observational studies with varying treatment propensities without requiring separate estimation of the full propensity function. This is achieved by combining two splitting criteria—one targeting heterogeneity in the treatment effect, the other targeting bias correction for the average treatment effect—which together improve split point selection and automatically distinguish confounders from features responsible for heterogeneity. As a result, interpretation follows directly from the fitted tree structure itself, that is, from which features the trees split on and with which split statistics, without requiring separate post-hoc analysis. For the theoretical analysis of this algorithm, we consider a change point model with step functions for potential outcomes and treatment propensity and provide insights into the theoretical underpinnings of our approach. Simulation studies show that our simple algorithm achieves comparable, and often better, prediction accuracy than existing methods, while substantially improving interpretability.
Read the full abstract
Functional Analysis
IDA symbols and Schatten–Lorentz theory for Toeplitz operators on weighted Fock spaces
We study complex-symbol Toeplitz operators on weighted Fock spaces. The weight has a uniformly positive and bounded real Hessian. Local analytic distance is unchanged when an entire function is added to the symbol. We combine this distance with a complex ball average or the Berezin transform to control the local size of the symbol. Under a matching Lorentz condition on the distance, we characterize membership in every Schatten–Lorentz class. The local symbol exponent can be any $1\le q<\infty$ and is independent of the two Schatten–Lorentz indices. The proof uses positive Toeplitz estimates, Hankel estimates, and a local decomposition that preserves the initial domain. Two examples show why the local exponent and the secondary Lorentz index must be kept. We also obtain mixed mapping criteria and regular singular-value decay estimates. An error operator with a lower-order counting function does not change the leading coefficient. This gives explicit Weyl constants for quadratic weights. A radial example shows that uniform Hessian bounds alone do not imply such a constant.
Read the full abstract
Mathematical Physics
Operator-theoretic and analytic properties of a driven single-mode Kerr cavity in Bargmann space
We study the stationary spectrum of a coherently driven single-mode Kerr cavity in Bargmann–Fock space. For positive Kerr coupling the Hamiltonian is self-adjoint, bounded below, and has compact resolvent. For nonzero drive, a minimal-solution continued fraction yields an exact scalar spectral condition, with all eigenvalues simple. A Liouville transformation identifies the eigenvalue equation with a degenerate double-confluent Heun problem and classifies its singularities. An Olver-type Volterra construction gives normalized sectorial solutions at infinity with explicit error bounds. In the strong-drive regime, the leading turning-point energy coefficient is proved, whereas the next coefficient remains conditional on a stated global-connection conjecture; independent Bogoliubov and complex-WKB calculations provide consistency checks. A formal weak-drive expansion is verified from the Bargmann recurrence, and its upper-edge tridiagonal series is summed in closed form. Exploratory WKB iteration portraits are included only as visual aids and do not establish the conjectural global connection.
Read the full abstract
Econometrics
Rate-Agnostic Wald Inference for Dyadic Regressions
This paper develops Wald inference for least-squares estimation of linear regression models on dyadic data, accommodating configurations where multiple observations share the same pair of units (e.g., directed flows, multilayer networks, and dyadic panels). We establish that the dyadic-robust Wald statistic is asymptotically $\chi^2_q$ for an arbitrary nonrandom sequence of full-rank restrictions, under a single condition on the accumulation of dependence. Throughout, no convergence rate is assumed or estimated, permitting the condition number of the score's variance matrix to diverge. We further propose a delete-one-unit jackknife alternative that is positive semidefinite by construction. This jackknife statistic attains the same asymptotic limit under one additional condition on dyad multiplicity and remains asymptotically conservative when that condition fails. A supplement contains all proofs, Monte Carlo experiments featuring estimated coefficients that converge at heterogeneous rates, and an empirical gravity application to bilateral trade.
Read the full abstract
Computation and Language
Target-Language Generation in Multilingual Models: Activation Steering and Optimal Control
Ensuring that multilingual language models generate coherent text in a specific target language is a major issue in multilingual language modeling. We develop an optimal control method for target-language text generation as well as a framework for evaluating the quality of generated text in terms of language adherence, linguistic coherence, and semantic coherence. We find that the proposed method performs at least as well as the prominent difference-in-means activation steering method for the majority of models tested, with substantially less hyperparameter tuning required.
Read the full abstract
Number Theory
Powers of the Thue–Morse Series: 2-Adic Valuations and Automatic Odd Parts
Let $T(x)=\prod_{j\ge 0}(1-x^{2^j})=\sum_{n\ge 0}t(n)x^n$ be the Thue–Morse generating function, and write $T(x)^m=\sum_{n\ge 0}t_m(n)x^n$ for a positive integer $m$. For a nonzero integer $a$, let $\nu_2(a)$ be the exponent of $2$ in $a$ and put $\operatorname{odd}(a)=a/2^{\nu_2(a)}$. For every $s\ge 1$, we prove that the sequence $(\operatorname{odd}(t_m(n))\bmod 2^s)_{n\ge 0}$ is $2$-automatic when $m=2^r$, $r\ge 1$, or $m=3\cdot 2^r$, $r\ge 2$. In both families, $\nu_2(t_m(n))=\nu_2\binom{n+m-1}{m-1}$. The valuation identity for $m=2^r$ is known; our proof recovers it and also establishes the automaticity assertion. For $m=6$ we prove $\nu_2(t_6(n))=\nu_2\binom{n+5}{5}+\mathbf{1}_{n\equiv 3\pmod 4}$ and show that its odd parts modulo every $2^s$ are $2$-automatic.
Read the full abstract
Instrumentation and Detectors
Synchronization of PLC Subsystems with the Timing Distribution System at the European XFEL
The European XFEL generates bursts of up to 4096 ultra-short X-ray flashes with a spacing of only 222 ns every 100 ms. These flashes are produced in the linear electron acceler- ator by undulators and guided 1 kilometer in vacuum pipes until they reach the scientific experiments. Accurate synchronization and the availability of information about all configurable pulses within a single burst, which can vary every 10 Hz cycle, enable the full potential of control, monitoring, and measurement in terms of accuracy and utilization. The MicroTCA-based timing system provides all the necessary capabilities. However, the industrial programmable logic controllers (PLCs), which manage most of the control electronics of the beamlines and experiments, are only synchronized on a millisecond-level through UART and NTP interfaces. This paper presents a new development based on an FPGA SoC EtherCAT solution in MicroTCA that implements an interface to the PLC using distributed clocks to achieve synchronization on nanosecond-level and provide beam-related information in a deterministic manner.
Read the full abstract
Computation and Language
HUMAID-NER: A Disaster Tweet Dataset for Joint Named Entity Recognition and Event Classification via Uncertainty-Weighted Multitask Learning
Rapid extraction of structured information from social media is important for humanitarian response, yet existing disaster tweet resources mainly provide document-level category labels without span-level entity annotations. We introduce HUMAID-NER, the first named entity recognition dataset built on the HumAID benchmark, containing 60,000 English disaster tweets annotated in BIO format across ten operationally motivated entity types and yielding approximately 175,000 labelled entity spans. Annotations are generated through a reproducible three-stage hybrid pipeline combining a spaCy transformer model, disaster-domain EntityRuler patterns, and structured regular expressions with priority-based overlap resolution. We also propose a joint multitask learning framework that performs disaster-specific named entity recognition and humanitarian event classification using a shared RoBERTa-large encoder. To reduce task conflict during joint training, the model uses homoscedastic uncertainty weighting with learnable task parameters and a two-stage training schedule that freezes the lower 18 of 24 encoder layers in the second stage. On the HUMAID-NER validation set, the proposed system achieves NER span micro-F1 of 0.841 and classification macro-F1 of 0.761 simultaneously. A real-time web dashboard demonstrates end-to-end deployment. The dataset, models, and pipeline code are released to support reproducibility and future crisis informatics research.
Read the full abstract
Physics and Society
Assessing transport resilience to heavy rainfall: An integrated modelling framework with metrics
Road passenger transport faces acute disruption risks from flash flooding from heavy rainfall. To capture system complexity and dynamics for assessing its flood resilience, this study (a) proposes performance metrics to quantify disruption impacts from physical, operational, environmental, social, and economic dimensions, and (b) develops an integrated modelling framework to assess selected metrics by combining rainfall modelling, surface water flood modelling, and agent-based transport modelling to simulate asset-level disruptions and user behavioural responses. This methodology is demonstrated through a 1-in-30-year rainfall event in Tyne and Wear, North East England. Three behavioural response scenarios to rainfall are simulated, including a worst-case scenario, an ideal-response scenario, and an early-warning scenario. Results highlight the potential of behavioural adaptation in enhancing road flood resilience by reducing journey delays, cancellations, and economic losses. The framework and multidimensional performance metrics offer a transferable approach for stress-testing rainfall scenarios and evaluating interventions, supporting evidence-based climate-resilient transport planning.
Read the full abstract
Artificial Intelligence
Affect-Prototype Guided Fusion for Open-Vocabulary Incomplete Multi-modal Emotion Recognition
Open-vocabulary multimodal emotion recognition (OV-MER) aims to generate open natural-language emotion labels from multimodal affective cues. In real-world scenarios, however, complete and synchronized modal data are difficult to obtain due to limitations of acquisition devices and user privacy constraints. Existing OV-MER methods are largely designed for full-modal inputs, and fail to perform effective feature fusion under modal missing conditions. Meanwhile, current fusion approaches designed for incomplete modalities mainly focus on fixed-label recognition context, and cannot satisfy the demand for fuse emotional cues guided with arbitrary emotion semantics in OV-MER context. To tackle these challenges, this paper proposes an Affect-Prototype-Conditioned Fusion (APCF) framework for incomplete open-vocabulary emotion recognition. As a candidate-free generative framework, APCF extends modal contribution learning to scenarios guided by arbitrary emotional semantics. Specifically, we construct an affect-prototype library to explicitly model multimodal contribution characteristics corresponding to diverse emotions, which provides dynamic constraints for modal fusion under different emotional semantic perspectives. Conditional retrieval and feature aggregation are conducted based on available modal features. The refined fused affective representations are then fed into an LLM decoder to produce open-vocabulary emotion labels. Experiments on the OV-MERD+ and MER-FG datasets demonstrate that APCF substantially outperforms state-of-the-art baselines.
Read the full abstract
General Relativity and Quantum Cosmology
Limits on the Inferred Hubble Constant Bias from a Local McVittie Gravitational Field
We examine the exact propagation of light in a McVittie spacetime to quantify the observational bias introduced on the inferred Hubble constant $H_0$ by a localized central mass embedded in an expanding asymptotically de Sitter background. By integrating the Sachs optical equations for radial null geodesics, we derive linearized analytical expressions for the areal and luminosity distances to first order in the dimensionless Hawking-Hayward coupling parameter $\mu = H_{\text{dS}} m_H$. We evaluate the magnitude of this local gravitational field effect across realistic astrophysical scales, ranging from supermassive black holes ($\text{Sgr A}^*$) to galaxy cluster halos. We show that while a McVittie central mass induces a coordinate-invariant path-focusing effect on incoming photons, the quantitative correction for local galactic parameters ($\mu \sim 10^{-16}$) is negligible ($\sim 10^{-15}\%$), proving that a localized galactic mass alone cannot resolve the $\sim 8\%$ Hubble tension. We establish strict upper bounds on the extent to which local spacetime inhomogeneity can bias low-redshift distance ladder measurements.
Read the full abstract
Number Theory
An additive problem in connection with some quadratic real fields with class number one
Analysis of PDEs
Rigidity results via a Poincaré type formula for stable solutions of quasilinear anisotropic elliptic equations
In this paper we prove some one-dimensional symmetry results for stable solutions to quasilinear anisotropic elliptic equations in $\mathbb R^2$ and $\mathbb R^3$. In this regard, we give an extension of a formula obtained in \cite{SZ1,SZ2, FSV}. The techniques used are inspired by the works of \cite{Fhdr,FSV}.
Read the full abstract
Robotics
Waggle Dance Inspired Motion Communication for Multiple UAVs in MuJoCo
The honeybee waggle dance motivates a communication mechanism in which one agent's movement conveys spatial information that guides other agents' actions. This paper presents a MuJoCo system that extends the point-to-point motion communication setting of MoCom to one performer and multiple observers. A performer broadcasts a six-bit navigation payload using four flight primitives and explicit null signals. Each of one to five observers processes its own onboard RGB images, extracts optical-flow trajectories, recognizes symbols, parses the message, and starts navigation only after confirming its own complete frame. Reception states and execution triggers are separate across observers, while simulation control and safety checks use shared ground truth. With stationary observers, 25 Hz image input, and ideal state-feedback control, a fixed standard suite yielded 44 correct complete messages from 53 receiver exposures across 17 nominal broadcasts; 13 broadcasts passed all group-level decoding and execution checks. Three additional no-message or input-fault controls met their expected outcomes. A separately reported supplemental suite, using the same frozen code at the default geometry, achieved 14 successful receiver exposures across three broadcasts. Near-range and wide-angle configurations exposed tracking and recognition failures, while unsuccessful receivers remained stationary. These finite simulation results support the feasibility of a waggle-dance-inspired broadcast-to-action mechanism under the tested conditions and identify the present perceptual and protocol limits.
Read the full abstract
Rings and Algebras
Reduction techniques for the derived delooping levels
The derived delooping level is a recently introduced homological invariant that provides an upper bound for the finitistic dimension of the opposite algebra. In this paper, we employ two reduction techniques-cleft extensions and recollements-to study the finiteness of the derived delooping level of finite-dimensional algebras over a field. By applying the theory of cleft extensions to bound quiver algebras, we establish arrow-removal operations that preserve the finiteness of the derived delooping level. In parallel, using recollement techniques, we develop vertex-removal operations with the same finiteness-preserving property. We conclude with several examples illustrating the applicability and effectiveness of these reduction methods.
Read the full abstract
Probability
Amnesic Elephant Random Walk with Polynomially Decaying Step Sizes
In this paper, we introduce an amnesic elephant random walk with polynomially decaying step sizes. The walk retains the loss of memory effect of amnesic ERW, however its step sizes decay polynomially over time. We study the effect of step-size exponent and memory parameter on the long-time behaviour of the walk. Two critical thresholds are identified that determine its phase diagram. We obtain almost sure convergence results, law of iterated logarithm, asymptotic normality and mean square displacement rate of the walk across different parameter regimes. The polynomial decay of step sizes gives rise to a subdiffusive regime while classical diffusion is recovered in the absence of decay. Also, we identify localization regimes in which the walk converges almost surely to a finite random variable.