Peer Revenue Publish or profit

Papers

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

All of arXiv

Monday 7 September

Game Theory

Sequential Offering in On-Demand Platforms: On the Optimality of Greedy Ranking

On-demand platforms face the fundamental challenge of fulfilling time-sensitive jobs with independent workers who may decline offers. To minimize delays and unfulfilled jobs, platforms frequently raise the offered wage sequentially following each rejection. However, the interaction between these dynamic price adjustments and the specific sequence in which workers are approached has been overlooked. In particular, if the best-suited workers (e.g., closest to the job) are also ranked earliest in the sequence, then those workers would see the lowest offered wages and may decline, leading to poor system outcomes where less-suited workers end up seeing the raised wages and accepting the job. We study the sequential offering problem to maximize expected welfare or platform profit by jointly optimizing the ranking of workers and the pricing trajectory. Surprisingly, our main result establishes that if the reservation wage distribution exhibits a non-increasing and convex density function (e.g., Uniform, Exponential), welfare is maximized by greedy ranking and wages optimized via backward induction. For arbitrary distributions, we prove that greedy ranking achieves a tight $n/(2n - 1)$ fraction of the prophet benchmark. Numerical results for settings beyond the distributional assumptions find welfare losses well below those allowed by the universal guarantee, even in families where greedy is provably suboptimal. This suggests that rather than sending initial "low ball” offers to worse matches, platforms should stick with greedy ranking and optimize the wage offerings by appropriately taking the continuation value of the downstream offers into consideration.
Read the full abstract

Group Theory

Length-generating functions for twisted involutions of Coxeter groups

For a Coxeter system $(W,S)$ of finite rank and an involutive automorphism $\ast:W\to W$ which preserves $S$, we prove that the length-generating function $\sum_{z\in\mathbf{I}_{W,\ast}}q^{\ell(z)}$ of the set of $\ast$-twisted involutions is rational. We derive recurrence relations analogous to the well-known recurrence relations expressing the growth series $W(q):=\sum_{w\in W}q^{\ell(w)}$ in terms of the growth series $W_I(q)$ of the parabolic subgroups of $W$. Our result extends to any subset $\mathcal{C}$ of $\ast$-twisted involutions that is closed under $\ast$-twisted conjugation. We use these recurrence relations to give an alternative proof of a power-series identity for twisted involutions due to Lusztig.
Read the full abstract

Solar and Stellar Astrophysics

The Association of Solar Radio Bursts with Eruptive and Confined Flares

We classify the metric radio emission associated with eruptive (CME-associated) and confined flares using the sample of events between 2010 and 2016 identified by Kazachenko (2023). We find striking differences in the occurrence of radio bursts between the two classes of flare: for soft X-ray flare sizes above M1.4, confined flares largely lack Type II (1% association rate) and Type IV (6%) emission. Approximately 15% of the sample of $\geq$M1.4 confined flares are associated with impulsive-phase Type III bursts. On the other hand, eruptive flares are associated with Type II, Type III (both impulsive and late phase), and Type IV bursts 45-60% of the time. The different types of radio burst are associated with different drivers (IIIs with electron beams, IIs with shocks, IVs with post-flare loops), so it is striking that the connection of all three burst types to eruptive flares is so pronounced. These results can be interpreted in terms of the reconnection topology of the principle candidate flare types, viz., reconnection between closed field lines for confined flares and X-point reconnection in a CSHKP model for eruptive flares, with interchange reconnection for jet-type flares and Type III bursts.
Read the full abstract

Artificial Intelligence

Mini-Batch Risk-Averse Deep Q-Learning: A Robot Navigation Case Study

We study the control of Markov decision processes in which the quality of a policy is evaluated by a dynamic, time-consistent Markov risk measure rather than by an expected discounted cost. The main obstacle to combining such measures with reinforcement learning is that a transition risk mapping depends on the transition kernel in a nonlinear way, and therefore cannot be estimated from a single observed transition. We remove this obstacle by employing mini-batch transition risk mappings: the mapping is applied to the empirical measure of $N$ independent next-state samples, and the result is averaged. The resulting mapping is again coherent. However, as an expected value of a function of $N$ next-state values, it admits an unbiased one-sample estimator. We embed this mapping into a double deep Q-network, analyze the two sources of estimation bias that arise, and obtain a risk-averse Q-learning method applicable to state spaces far beyond the reach of tabular schemes. The method is applied to an underwater robot navigation problem, in which a vehicle must visit collection points, gather stochastic information payloads, and deliver them at transmission points, while exposed at each step to the risk of destruction. A hierarchical decomposition delegates path execution to an exact graph search and confines learning to the high-level “collect or transmit” decision. A low-dimensional feature map, invariant under the symmetries of the problem, replaces the raw state–configuration encoding. In experiments on $300$ held-out environments, the resulting policies transfer to instance sizes never seen in training, and already $N=2$ reduces the upper semideviation of the outcome distribution while simultaneously improving its mean whenever the simulator is misspecified—an empirical counterpart of the duality between coherent risk measures and distributional robustness.
Read the full abstract

Machine Learning

Sharp Structure-Agnostic Minimax Risk for Partial Linear Models

We characterize the sharp structure-agnostic minimax risk for coefficient estimation in the partial linear model when the outcome and treatment nuisances are learned by two distinct black-box learners, which resolves the open problem in double machine learning posed by Gu (2025). For each nuisance \(q\in\{\mu,\pi\}\), we characterize the available learner by an approximation-error budget \(a_q\) and a stochastic-error budget \(s_q\), with the latter controlled through localized Rademacher complexity. Writing \(\mathcal E_n\) for the minimax mean-squared error, we show that \[\mathcal E_n\asymp1\wedge\left\{\frac1n+\left(a_\mu a_\pi+\min\left\{a_\pi s_\mu+s_\pi^2,\,a_\mu s_\pi+s_\mu^2\right\}\right)^2\right\}.\] The main new ingredient is a novel lower bound for the general two-learner problem. Our proof constructs four finite-mixture testing experiments using orthogonal code functions. Across these experiments, the hidden perturbations are placed outside both learner classes, outside only the treatment learner class, outside only the outcome learner class, or inside both learner classes. These four configurations capture, respectively, the interaction between the two approximation errors, the two asymmetric interactions between one learner's approximation error and the other learner's learning error, and the joint estimation difficulty of learning both nuisances. Combining the four resulting lower bounds yields the displayed rate, which matches the latest upper bound in Gu (2026). Our result shows that standard double machine learning can overstate the intrinsic difficulty of target estimation and provides a target-specific principle for learner selection: approximation error and stochastic complexity must be jointly balanced across the two nuisance learners rather than optimized separately.
Read the full abstract

Signal Processing

Characterization of Beam-Squint and Beam-Split Effects in RIS-assisted Multi-Frequency Networks

Multi-frequency operation in beyond-5G and 6G systems renders the beam directions of large-aperture arrays frequency-dependent, giving rise to beam misalignment effects critical for reconfigurable intelligent surfaces (RISs). When an RIS phase profile is configured at one frequency but illuminated at another, the reflected field may exhibit main-lobe deviation and additional dominant lobes, degrading beamforming performance. In this paper, we develop a unified analytical framework to characterize these effects for uniform planar array-based RISs under both continuous and finite-resolution phase control. We formalize beam-squint as the deviation of the maximum-gain beam from the desired elevation-azimuth angle pair and beam-split as the emergence of additional maximum-gain beams under frequency mismatch and quantization. For continuous-phase RISs, we derive necessary and sufficient peak conditions, obtain closed-form elevation-azimuth peak families, and establish feasibility conditions as functions of the frequency ratio, incidence and configuration angles, and element spacing. Extending the analysis to b-bit phase quantization, we express the quantized beampattern as a superposition of harmonic array responses via Fourier expansion of the quantization-error phasor, leading to closed-form per-harmonic peak families, dominance ordering, and feasibility conditions. To capture peak displacement induced by harmonic superposition, we further develop a perturbation-based correction leveraging dominant-harmonic curvature and residual-harmonic gradients, improving peak-location accuracy without exhaustive two-dimensional searches. Numerical simulations validate the analysis, quantify peak deviations and beam-split probabilities, and demonstrate sum-rate gains by including analytically predicted squinted/split and harmonic candidates in multi-RIS, multi-user, multi-band networks.
Read the full abstract

Analysis of PDEs

Solvability of Semilinear Elliptic Equations on Infinite Graphs

We develop a constructive method for solving semilinear elliptic equations $\Delta u(x)=f(x,u(x))$ on locally finite, connected infinite graphs with layered structure. Using Eidelheit's theorem, we establish coupling criteria ensuring that arbitrary initial-layer data extend to global solutions for every $f$. We apply combinatorial criteria to prove solvability on leafless infinite trees, integer lattices, the triangular and hexagonal lattices, and a Cayley graph of the discrete Heisenberg group. We further establish solvability for a broad class of Cayley graphs of semidirect products $G\cong\mathbb Z\ltimes_\theta H$. In particular, $\Delta u=e^u$ has infinitely many solutions on $\mathbb Z^2$, but none of finite energy. We also extend the method to the bi-Laplacian under two-step coupling conditions, to the $p$-Laplacian under a unique-neighbor condition, and to magnetic Laplacians.
Read the full abstract

Biological Physics

Transcription rate dynamics and RNA copy number noise: General relations and data-driven predictions

Stochastic models of gene expression typically begin with a microscopic model of transcription and propagate its statistics to the RNA distribution. Here we develop a doubly stochastic framework in which RNA production is Poisson conditional on a time-varying transcription rate $\lambda(t)$. For RNA lifetimes drawn independently from an arbitrary finite-mean distribution, we derive the RNA Fano factor in terms of the lifetime survival function and the autocovariance of $\lambda(t)$. For a Poisson degradation process with rate $\mu$, the survival kernel provides an exponential temporal filter, and the result depends only on the mean, variance, and normalized autocorrelation of $\lambda(t)$. These quantities may be calculated from an explicit rate model or, under ergodicity and adequate sampling, estimated from a sufficiently long rate trajectory. We validate the data-driven estimator using simulated transcription-rate trajectories, without supplying the known autocorrelation to the estimator. We also obtain exact analytical results for transcription-rate dynamics modeled by a discrete M/M/1 process and by drift-diffusion with reflecting, periodic, or first-passage-reset boundaries, and verify each result by direct simulation of the coupled transcription-rate and RNA copy-number processes.
Read the full abstract

All authors Amara McCune, Ido Golding, Shlomi Reuveni, Sarah Kostinski

Dynamical Systems

Exact Fragmentation and Terminal-Cluster Selection in One-Dimensional Finite-Range Normalized Alignment

Finite-range alignment can end either in a single flock or in several noninteracting clusters, yet convergence results rarely determine which outcome follows from a given finite-particle state. We study a one-dimensional normalized alignment model with a hard interaction cut-off and obtain exact predictions in an expansive regime. Velocity order is invariant, so pair separations are nondecreasing and the communication graph evolves through finitely many irreversible edge deletions. On each fixed graph, the group inverse of the random-walk Laplacian gives the total relative displacement remaining before relaxation. Comparing this displacement with the available interaction slack selects the next deletion and yields a finite recursion for the complete switching sequence, terminal partition, limiting cluster velocities, and internal geometry. For path configurations, an explicit Green kernel gives a necessary-and-sufficient fragmentation criterion and a sharp critical alignment rate, including asymptotic boundary contact at criticality. A spectral-geometric condition extends the theory to an open set of initially nonordered velocities, while a common self-weight extension covers both self-excluding and self-including local averages. Numerical computations reproduce the thresholds and multi-event cascades. The results provide an exact finite-size theory of fragmentation and terminal state selection for a class of finite-range interacting particle systems.
Read the full abstract

Astrophysics of Galaxies

Origins of complex organic molecules in L1551 IRS 5: Interplay of thermal heating and accretion shocks

Complex organic molecules (COMs) are typically observed in the warm inner envelopes of Class 0 protostars. In more evolved Class I sources, COM emission is confined to the compact inner disk and obscured by high dust opacity, but the FU Orionis-type binary L1551 IRS 5 offers a valuable opportunity to probe disk chemistry, as its outburst luminosity thermally sublimates ices out to large radii. We sought to spatially resolve the origins of COMs in this system to distinguish between central radiative heating and shock-induced chemistry driven by heterogeneous accretion pathways. We analyzed high-angular-resolution ALMA archival data, focusing on COMs (e.g., CH3OH, CH3OCHO) and the shock tracer SO, and compared their spatial morphologies and kinematics to diagnose the excitation conditions associated with different accretion flows. We find that the COM emission in L1551 IRS 5 arises from both radiative heating and localized accretion shocks. In the northern source, the widespread low-excitation COM emission is primarily consistent with thermal heating by the recent outburst. This source also exhibits dual-mode accretion with distinct chemical signatures, with COMs along the spiral arm tracing steady equatorial circumbinary disk-to-circumstellar disk accretion and high-excitation COMs with bright SO along the eastern disk surface tracing a vertical envelope-to-disk streamer impact. In the southern source, methanol is confined to the southeastern streamer impact site, whereas SO forms a ring-like structure at the tidal truncation radius. We attribute this difference to differential chemical survival timescales. L1551 IRS 5 thus serves as an ideal laboratory to investigate how shock chemistry and binary-regulated accretion shape the chemical structure of protostellar disks.
Read the full abstract

All authors Ji-hyun Kang, Jeong-Eun Lee, Seokho Lee, Shigehisa Takakuwa

Machine Learning

HyCO: A Hybrid Neural Solver for Combinatorial Optimization

Sequential reinforcement learning (RL) solvers and global diffusion model (DM) solvers for neural combinatorial optimization exhibit complementary failure modes under an optimization-regret view. The former enjoys small marginal regret in the early construction stage, but suffers from horizon-wise compounding errors with super-linear regret growth; the latter avoids horizon compounding but incurs linear or sublinear regret w.r.t. the dimension of the remaining unsolved subspace. We propose Hybrid Neural Solver for Combinatorial Optimization (HyCO), a hybrid inference algorithm that constructs a solution prefix with an RL solver and adaptively switches to a conditional DM to complete the remaining decisions. To characterize why such hybridization helps, when to trigger the handover, and how to realize it in practice, we first develop a unified error-scaling theoretical framework and prove that, under explicit error-scaling assumptions, i) the hybrid structure achieves strictly lower expected regret than either backbone alone, and ii) there exists a unique optimal trigger step that minimizes the hybrid regret. We then design a lightweight adaptive trigger that combines policy entropy and RL-DM disagreement to detect trajectory-level signals of the regime shift as a practical proxy, since the optimal trigger step is defined at the expected-regret level and is not directly computable on individual trajectories. Experimental results on diverse benchmarks demonstrate that HyCO achieves consistent improvements over both backbones and support the empirical effectiveness of adaptive triggering. Our code and checkpoints are available at https://github.com/wmd3i/HyCO.
Read the full abstract

All authors Yuheng Li, Di Yang, Haipeng Chen, Yanhai Xiong

Trading and Market Microstructure

Regimes in the Order Flow

Financial markets alternate between periods of relative stability and instability, with structural breaks marking the transitions between these regimes. Identifying such breaks in real time is a central requirement for any trading or risk system operating at high frequency. This report studies Bayesian Online Changepoint Detection (BOCPD) and two extensions proposed in the literature, and applies them to the signed order flow of NASDAQ-listed equities.
Read the full abstract

Combinatorics

Local Clique Covers and Chromatic Number

The local clique cover number $lcc(G)$ is the minimum valency of an edge-clique cover of $G$. We prove the conjectured inequality $lcc(G)+\chi(G)\le |V(G)|+1$ for every finite simple graph. The proof gives an independent set improvement of an endpoint-cover estimate and applies the resulting construction to an induced four-vertex path. We further prove that the cover can be chosen so that every nonuniversal vertex has valency at most $|V(G)|-\chi(G)$. Consequently, every graph attaining equality has a universal vertex. The stronger statement follows by reducing a counterexample of minimum order to a prime double-critical graph and refining the induced path extension. We also show that an induced matching of size $m\ge2$ yields $lcc(G)+\chi(G)\le |V(G)|+3-m$, which improves the general bound when $m\ge3$, and determine the restrictions imposed by equality on deletion of an induced $2K_2$.
Read the full abstract

Artificial Intelligence

When Can LLM Digital Twins Reduce Human Measurement? From Behavioral Fidelity to Statistical Substitutability

LLM-based digital twins promise to reduce repeated human data collection by generating person- specific responses, yet existing evaluations provide little evidence about whether they can reduce human measurement while preserving valid inference. To address this, we introduce statistical substitutability, an inferential criterion that evaluates the extent to which twin predictions can reduce human measurement for a particular estimand while preserving valid inference. We develop a framework, grounded in mixed-subject and prediction-powered inference, that evaluates statistical substitutability along four dimensions: aggregate fidelity, paired respondent-level signal, finite-sample human-label recovery, and stability across populations. Across two empirical evaluations spanning behavioral experiments, multiple models, and alternative respondent representations, we find that digital twins can reproduce average human effects while providing little information about which individuals differ from those averages. Newer models and richer respondent information improve some dimensions of performance but do not reliably translate into human-data savings. Human calibration can reduce aggregate prediction error, yet limited labeled samples often fail to produce stable precision gains. Importantly, these findings demonstrate that behavioral fidelity is neither necessary nor sufficient for statistical substitutability. More broadly, they suggest that AI-generated evidence should be evaluated based on its ability to support valid scientific inference rather than its ability to reproduce human outcomes alone. Digital twins should therefore be judged for confirmatory use by whether they reduce uncertainty about human quantities, not merely by whether they reproduce human means, distributions, or effects.
Read the full abstract

All authors Steven Wang, Kyle Hunt, Shaojie Tang, Kenneth Joseph

Machine Learning

Automated Chest CT Protocol Selection via Large Language Model Derived Text Embeddings from Imaging Request Text

Purpose: Accurate CT protocol selection is critical for diagnostic quality and patient safety, yet the current process is manual, time-consuming, and prone to inconsistencies. Prior Machine Learning methods using keywords or bag-of-words lack contextual understanding and perform poorly on rare protocols. We propose a decision support system using large language model (LLM) features to recommend protocols from free-text clinical indications, capturing clinical nuance and phrasing variation for more consistent, efficient selection. Methods: In this REB-approved retrospective study, 285,123 chest CT imaging requests from a large academic medical center (2017-2024) were split into training (228,099, 80%) and held-out test (57,024, 20%) sets. Each request included procedure names, clinical indication, HIS comments, and the selected protocol. Clinical text was embedded using a fine-tuned LLM, Meta's LLaMA-3.1-70B; these features input a logistic regression classifier predicting 18 protocol labels (e.g., PE, LDCT). Results: The pipeline achieved a weighted precision of 0.84, weighted F1-score of 0.81, and overall accuracy of 79% across 18 CT protocols. On 300 independent cases with expert consensus, the LLM reached an overall accuracy of 80% versus 83% for radiologists, with no significant difference (p = 0.263). Performance was comparable across most classes, with the LLM exceeding radiologists for some challenging categories, and entropy analyses indicated more balanced protocol use, suggesting reduced variability. Conclusion: An LLM-based recommendation system can leverage general knowledge from a large natural-text corpus to accurately assign chest CT protocols from free-text imaging requests, and may serve as a viable foundation for protocol recommendation tools where inputs require language understanding.
Read the full abstract

All authors Zahra Hosseini, Mahan Pouromidi, Farzad Khalvati, Patrik Rogalla

Optics

Beam angle-locked loop in laser interferometry

Maintaining precise beam coalignment is essential in laser interferometry, particularly for interspacecraft missions where angular misalignments introduce tilt-to-length coupling noise and risk complete link failure. This work presents a comprehensive theoretical and experimental framework for the beam angle-locked loop, which maintains coalignment between two interfering beams. Minute angular misalignments are detected via differential wavefront-sensing signals, which are used as the error signal for feedback control. A detailed linear control model incorporating an angle detector, a digital filter, a proportional-integral-double-integral servo, a digital-to-analog converter, and a beam-steering mechanism is developed. Using loop transfer functions, we establish a noise-propagation model that quantifies the contributions of individual components to both out-of-loop and in-loop angle errors. The analytical results are experimentally validated using a transponder-based interferometric link spanning two optical benches, with a hexapod simulating spacecraft attitude jitter. The measured transfer functions and coalignment performance agree well with theoretical predictions, yielding a pointing stability better than 10 urad$/\sqrt{\text{Hz}}$ between 0.2 mHz and 1 Hz. Furthermore, a loop-optimization strategy is demonstrated to minimize angle misalignment within a target frequency band by tuning the servo gain, without requiring hardware modifications. This validated framework provides a reliable architecture for designing and optimizing active beam alignment in laser interferometry.
Read the full abstract

All authors Daikang Wei, Christoph Bode, Vitali Müller, Juan José Esteban Delgado, Gerhard Heinzel

Artificial Intelligence

From Event Logs to Governed Action: A BlueSky Agenda for Agentic Process Mining

Process mining has long turned event logs into process knowledge: discovered models, conformance evidence, bottleneck diagnoses, and runtime predictions. Agentic AI changes the target. Process-aware agents will not only ask what happened. They will ask whether a proposed action should be taken, given the available evidence, privacy budget, organizational authority, and downstream risk. This BlueSky paper proposes event-to-action process mining: a process-mining agenda for transforming heterogeneous operational event data into governed action. The goal is not another dashboard, a generic enterprise simulator, or a language interface over logs. We argue that the community needs four mineable artifacts: event-object representations, action evidence packages, governance contracts, and benchmarks where act, defer, ask, and refuse are all valid outputs. This agenda is timely because agentic business process management (BPM), LLM-assisted process mining, object-centric event standards, causal process monitoring, and privacy-preserving learning are maturing separately. Bringing them together defines a data-mining target inside process mining: mining logged organizational behavior for accountable action, not only retrospective insight.
Read the full abstract

All authors Yiyuan Yang, Zheshun Wu, Yong Chu, Zhenghua Chen, Zenglin Xu, Qingsong Wen

Machine Learning

Solving the Elastic Wave Equation with Physics-Informed Neural Networks: A Robust and Critical Assessment

Physics-Informed Neural Networks (PINNs) have recently emerged as a promising approach for solving Partial Differential Equations (PDEs), offering a meshfree alternative that integrates physical principles into the learning process. This presents a new paradigm compared to traditional discretization methods and purely data-driven machine learning techniques. While promising, PINNs are not a panacea; they inherit challenges such as spectral bias and unstable convergence. Moreover, their potential in seismology remains largely unexplored. In this work, we provide a robust and critical assessment of PINNs for solving the elastic wave equation in seismology. We investigate the performance of PINNs on problems with varying degrees of complexity across various seismic sources and parameter models, from constant to highly heterogeneous settings. A pivotal aspect of our work involves investigating whether embedding physical principles directly into the network architecture enhances convergence and accuracy. We test an extensive range of neural architecture designs, from unrestricted, uninformed PINNs to highly specialized ones. We find that integrating an understanding of wave physics into the network design significantly improves accuracy. For instance, introducing a custom wavelet or plane wave layer, coupled with encoder and decoder layers, consistently yields a relative $L_2$ error approximately half that of the standard PINN, as evidenced across numerous experiments. We further demonstrate that this novel architecture enhances accuracy when applied to the acoustic wave equation, underlying the versatility of our network. Another key contribution of our research is the successful conditioning of PINNs on seismic source locations. This signifies a considerable advancement towards rapid seismic hazard detection and seismic analysis.
Read the full abstract

Machine Learning

Semi-Supervised Learning under Spatially Biased Sampling

Standard semi-supervised learning (SSL) typically relies on labelled and unlabelled data sharing a common marginal distribution. This assumption is often violated by biased spatial sampling mechanism, when labels are collected under spatially biased or preferential site selection. We treat this marginal mismatch, spatial autocorrelation, and spatial non-stationarity as three distinct mechanisms, varied independently via a labelled-sampling concentration parameter, a spatial length scale, and a non-stationarity strength parameter, and ask how mismatch degrades SSL, whether the cluster and manifold assumptions survive it, and how the resulting failure can be diagnosed. Using a controlled synthetic framework alongside PovertyMap-WILDS, California housing, socio-economic and US air quality monitoring datasets, we systematically vary the degree of mismatch while accounting for spatial autocorrelation and non-stationarity. Through a series of analyses including a segmented-regression changepoint, we show that in the synthetic generator, SSL performance does not degrade gradually but instead exhibits a threshold-like breakdown between approximately 0.71 and 0.77 once distribution mismatch becomes sufficiently severe. We further demonstrate that spatial non-stationarity contributes to performance loss independently of marginal mismatch and that models become increasingly overconfident outside the regions where labels are available. To support practical deployment, we evaluate several distribution-divergence measures as indicators of reliability and introduce a kernel-weighted local divergence metric that provides a more stable estimate of spatial mismatch than a naïve localised approach. These findings provide empirical evidence and diagnostic tools for better documenting the risk of incorporating unlabelled spatial data into semi-supervised learning workflows.
Read the full abstract

All authors Bright Wiredu Nuakoh, Francky Fouedjio, Stephen Bradshaw, Yaw Kwaafo Awuah-Mensah, Wei Hong Tan, Emet Arya, Ebenezer Afrifa-Yamoah

Sound

Clean Accuracy Does Not Guarantee Provenance Robustness: A Prospective Codec-Stress Evaluation of Audio Attribution

Audio provenance attribution - which system produced a synthetic utterance - is reported at near-ceiling accuracy on clean benchmarks, yet audio reaching an analyst has usually been transcoded. We report a prospectively registered measurement of closed-set attribution after single-stage codec transport, with the analysis region fixed from fidelity metadata before any attribution model was trained. On two corpora, in-support losses reach 53.5 [43.5, 63.6] and 70.3 [63.0, 77.5] Macro-F1 points for WavLM-Base+, and 61.0 [56.8, 65.1] and 49.8 [41.6, 57.9] for W2V2-BERT 2.0, under simultaneous component-level bands. Degradation is strongly condition- and representation-dependent: within one in-support grid WavLM losses run from -0.4 to +53.5 points, and the two encoders differ beyond a prespecified +/-5-point margin at six of twelve conditions. A clean-qualified ECAPA-TDNN and a Proxy-Anchor head degrade comparably, so the effect is not confined to one representation family or a weak linear head. The registered matched-fidelity comparison was not estimable on this grid, and waveform and perceptual measures order the conditions differently: MP3 at 8 kbit/s ranks mid-grid on SI-SDR but last on PESQ-WB while causing the largest loss. For the tested tasks, corpora, representations and codec grid, a clean accuracy figure does not by itself characterise deployment robustness.
Read the full abstract

Classical Analysis and ODEs

Boundary value problems for linear differential-algebraic equations: solvability via the Kronecker canonical form

The solvability of two-point boundary value problems for constant-coefficient differential-algebraic equations is investigated. Unlike previous studies, which often assume that the matrix pair associated with the equation is regular, we consider the general singular case. Using the Kronecker canonical form, we decompose the problem into simpler subsystems, enabling a systematic analysis of solvability. The method of parameterization reduces the boundary value problem to a system of algebraic equations. We derive criteria for the existence and uniqueness of solutions and provide a comprehensive framework for solving such boundary value problems. Several illustrative examples are presented and show the applicability of the results.
Read the full abstract

All authors Anar Assanova, Carsten Trunk, Roza Uteshova, Henrik Winkler

Computational Geometry

The Stretch Factor of Planar Delaunay Triangulations Is Nearly Determined

The Delaunay triangulation is a classical geometric structure on a finite set of points in the plane. Its stretch factor is the largest ratio of the shortest-path distance along its edges to the Euclidean distance between the same two points. Determining the worst-case stretch factor of planar Delaunay triangulations is a long-standing open problem. We prove a uniform upper bound of 1.5949, improving the previous bound of 1.998 and narrowing the gap to the best known lower bound of 1.5932 from 0.4048 to less than 0.0017, nearly pinpointing the worst-case stretch factor. A central difficulty is that the line segment between two points may cross arbitrarily many triangles. Our progress accounting framework addresses this by converting the global bound into a family of local inequalities, each involving only a fixed number of real parameters regardless of the number of triangles crossed. Two further geometric lemmas make computer-assisted verification tractable: the pencil lemma decomposes each local transition into two geometrically independent stages, reducing verification over infinitely many possible next disks to a single differential condition; and the corner lemmas handle degenerate boundary cases where direct verification would fail. With these reductions, the proof ends with a finite verification of an explicit potential in exact rational arithmetic and outward-rounded interval arithmetic. Numerous geometric network constructions use the Delaunay stretch factor as a black box, so the tighter bound directly improves stretch-factor guarantees for a range of downstream applications, including bounded-degree plane spanners and low-weight spanners.
Read the full abstract

Cosmology and Nongalactic Astrophysics

Interacting fluid cosmologies from the metric-affine framework

Metric-affine gravity provides a natural geometric framework in which spacetime curvature, torsion, and non-metricity are treated as independent degrees of freedom, leading to novel cosmological dynamics beyond General Relativity. A generic consequence of such theories is the emergence of effective interactions among the cosmological fluids, even in the absence of explicit phenomenological couplings. Interestingly, the above happens while the Standard Model of Particle physics remains unmodified. In this work, we investigate interacting cosmological models that arise from metric-affine gravity and analyze their implications for the background evolution of the Universe. We derive the modified continuity equations governing the matter, radiation, and dark-energy components, highlighting the geometric origin of energy exchange in the dark sector. We discuss how these interactions modify the expansion history and can effectively mimic evolving dark-energy behavior. The resulting cosmological scenarios are confronted with the most recent observational data from Type Ia Supernovae (Pantheon+), Cosmic Chronometers, and Baryon Acoustic Oscillations (DESI DR2). Moreover, using model selection criteria, e.g., Akaike Information Criterion, Bayesian Information Criterion and the Bayesian Evidence, we compare the aforementioned models against the standard $\Lambda$CDM model. We find that the proposed framework performs slightly better than $\Lambda CDM$, in the light of the data sets considered here. Our analysis demonstrates that metric-affine-induced interactions constitute a viable and theoretically motivated alternative for the description of the Universe.
Read the full abstract

Combinatorics

Magnitude and motivic zeta functions of matroids

We prove that the magnitude of the tope graph of a simple oriented matroid is the specialization at $x=-1$ of the motivic zeta function of its underlying matroid. This refines the Las Vergnas–Zaslavsky theorem and defines magnitude for arbitrary matroids. For simple orientable matroids, we compute the order of the pole at $q=-1$ from chains of flats and identify it with the Varchenko–Gelfand degree of the tope parity function. Comparing pole orders, we construct a rank-six real arrangement $\mathcal A$ such that $\operatorname{Mag}(\mathcal A;-t)$ has infinitely many negative coefficients, disproving Koizumi–Liu's eventual sign alternation conjecture. We then construct a canonical multiplicative Varchenko–Gelfand filtration on the mod-$2$ magnitude cohomology of a simple oriented matroid and show that its graded dimensions recover the full motivic zeta function.
Read the full abstract

Cosmology and Nongalactic Astrophysics

Non-linear Pairwise Velocities as a Cosmological Probe

Peculiar velocities trace gravitational dynamics directly, complementing density-based clustering as wide-field spectroscopic surveys (DESI, Euclid, PFS) and kinetic Sunyaev-Zel'dovich (kSZ) measurements enter the precision era. Observational analyses of pairwise velocities and the pairwise kSZ signal remain largely restricted to linear and quasi-linear scales ($\gtrsim20-30$ $h^{-1}Mpc$), despite substantial cosmological information available at smaller separations. We present a simulation-calibrated likelihood for $v_{12}(r,a)$, built on the exact pair conservation equation and PyCAMB HMcode-2020 non-linear clustering, and validate it against the QUIJOTE and TNG300-3 suites across resolution, particle sampling, box size, and redshift. Using QUIJOTE, we show that extending the fit to non-linear scales tightens the $1\sigma$ uncertainty on $\Omega_\mathrm{m}$ and $\sigma_8$ by $74\%$ and $81\%$ at $z=0.5$ ($r_{\rm min}=4$ $h^{-1}Mpc$), and by $70\%$ and $74\%$ at $z=0$ ($r_{\rm min}=8$ $h^{-1}Mpc$), relative to the linear-regime baseline ($r_{\rm min}=50$ $h^{-1}Mpc$) (all at fixed $r_{max}=140$ $h^{-1}Mpc$); $\sigma(f\sigma_8)$ tightens by up to $86\%$, and the joint $\Omega_\mathrm{m}$-$f\sigma_8$ Figure-of-Merit improves by up to $9.1\times$ relative to the same baseline. These constraints are conditional on $h$ fixed at its QUIJOTE fiducial value, due to a near-degenerate response with $\sigma_8$; jointly sampling $h$ shifts and widens them substantially. This framework provides a validated route to exploiting that information in upcoming direct peculiar-velocity, redshift-space, and kSZ analyses.
Read the full abstract

All authors Mariana Jaber, Antonela Taverna, Rasmus Strid, Wojciech A. Hellwing

Machine Learning

Heat Field Signatures: From Point Clouds to Smooth Geometry

Bringing multiscale geometric analysis directly to irregular point clouds remains difficult: quantities such as local dimension, anisotropy, density variation, and geometric transitions are typically estimated through explicit neighborhood, manifold, or graph constructions, or left for neural networks to infer from coordinates. We introduce Heat Field Signatures (HFS), which lift a point cloud to a multiscale family of smooth ambient heat fields, providing a direct interface from discrete samples to geometric analysis. From this field, HFS computes closed-form global and local signatures directly from pairwise distances, capturing heat concentration, intrinsic dimension, anisotropy, and scale transitions. We further introduce the Heat Dimension Spectrum (HDS), a compact summary of multiscale geometric composition. HFS can be used as a closed-form descriptor, a lightweight learned representation, or a geometric feature channel for neural point-cloud models. Across synthetic and real-world benchmarks spanning subcellular, neuronal, tree, and protein data, HFS outperforms strong point-cloud and multiparameter-persistence baselines while substantially reducing end-to-end cost. On SCOP protein-fold classification, HFS improves over the strongest deep baseline by nearly $24$ percentage points using coordinates alone, while standalone HFS representations are exactly rotation-invariant by construction. More broadly, HFS turns a classical heat field into a practical interface for multiscale geometric analysis in modern point-cloud learning.
Read the full abstract

Computational Geometry

A $(3+\epsilon)$-Approximation for Fair $k$-Means and a Matching Lower Bound

Fair clustering aims to prevent algorithmic bias against protected groups. We study Euclidean fair $k$-means, in which the proportion of each protected group in every cluster lies between prescribed lower and upper bounds. Because these constraints violate the nearest-center assignment property, center selection is coupled with point assignment. We introduce the drift-regularized relaxation, a new convex relaxation solved by a modified Frank-Wolfe method with linear-programming iterations, whose optimality condition controls the cost of converting its solution into $k$ fair clusters. Combined with any $\rho$-approximation algorithm for weighted $k$-means, the relaxation yields an exactly fair fractional solution of cost at most $2\rho+1+\epsilon$ times the fractional optimum, improving the previous ratio $1+4\rho+\epsilon$. In fixed dimension, this improves the best known ratio from $5+O(\epsilon)$ to $3+O(\epsilon)$. The fractional solution can be rounded to an integral one without changing the centers or increasing the cost, at a bounded additive violation of the fairness bounds. We also show that a $(3-\delta)$-approximation is NP-hard for every fixed $\delta>0$, even on the line with fractional assignments, so $3$ is the exact approximation threshold for fractional fair $k$-means in fixed dimension. The same guarantees hold for $k$-sparse Wasserstein barycenters, a special case of fractional fair $k$-means. More generally, they hold whenever every cluster must satisfy given homogeneous linear inequalities in the fractions of its points, such as a bound on the ratio between two groups or on the average of a numerical attribute in every cluster.
Read the full abstract

All authors Kangke Cheng, Guanlin Mo, Shihong Song, Hu Ding

Soft Condensed Matter

Substrate-induced crystallisation in polymers: Exceptional impact of prefreezing versus heterogeneous nucleation on kinetics and morphology

Crystallisation of liquids often occurs at solid surfaces, via heterogeneous nucleation or prefreezing. Understanding this process is crucial for controlling crystal morphology in thin films and developing efficient nucleating agents - especially for polymers, typically processed in a molten state. However, the efficiency of nucleation and prefreezing with respect to crystallisation kinetics and semicrystalline polymer morphology has not been well studied and remains unclear. Here, we address this challenge by conducting a systematic study of substrate-induced crystallisation in dewetted droplets of the model polymer poly($\varepsilon$-caprolactone) (PCL) on various crystalline and amorphous substrates. Using polarized light optical microscopy, droplet crystallisation temperature was monitored and varied across the substrates, revealing three scenarios: close-to-homogeneous nucleation on glass and silicon; heterogeneous nucleation on ordered and disordered carbon-rich substrates; and prefreezing on graphene. The temperature-dependent nucleation rate was analysed and found to obey classical nucleation theory for all systems except PCL on graphene, where it diverges as all the droplets crystallise simultaneously. The highest in- and out-of-plane PCL crystal orientation is found on graphene, where the epitaxially grown lamellae extend vertically over several hundred nanometres. These results demonstrate that prefreezing has a superior influence on crystallisation kinetics and crystal morphology, making prefreezing substrates perfect nucleating agents.
Read the full abstract

Quantum Physics

Quantum Wavefunction Augmentation via Variational Autoencoders

Sample-based quantum diagonalization (SQD) has emerged as a promising route for quantum-centric supercomputing, relying on classical diagonalization of the molecular Hamiltonian within a hardware-sampled determinant subspace. However, its accuracy degrades in strongly correlated regimes where the relevant determinant space exceeds what finite-shot sampling can capture. In this work, we introduce Quantum Wavefunction Augmentation via Variational Autoencoders (Q-WAVE), a hybrid method that combines determinants sampled via SqDRIFT Krylov circuits and configuration interaction singles and doubles (CISD) determinants with generative machine learning. Using a custom $\beta$-annealed variational autoencoder (VAE) model, Q-WAVE iteratively expands this basis toward the variational ground state. The VAE learns the wavefunction's primary support structure from the combined hardware and CISD seed in a continuous latent space, generating new dominant determinants beyond any fixed excitation hierarchy. The resulting compact wavefunction exceeds what can be extracted from raw hardware samples alone. We demonstrate sub-millihartree accuracy compared to full configuration interaction for $\text{H}_2\text{O}$ and $\text{N}_2$ dissociation. Finally, we establish Q-WAVE's scalability on a 52-qubit ethylene system (achieving sub-millihartree accuracy versus CCSD(T)) and a highly correlated 60-qubit $\text{Cr}_2$ stress test that attains chemical accuracy upon a final perturbative correction.
Read the full abstract