Statistical Methodology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 8 September
Background: Platform trials improve efficiency by enabling early stopping of ineffective arms, shared controls, and addition of new treatments without compromising statistical properties. However, delays in observing primary outcomes may reduce these benefits. Investigators must either pause recruitment, delaying identification of effective treatments, or continue recruitment, potentially enrolling participants who cannot benefit from interim decisions. We assess the impact of outcome delay on platform trial efficiency using a novel metric. Methods: We propose Expected Throughput (ET), defined as the expected number of treatment arms evaluated per 1000 participants. ET accounts for participants recruited while awaiting outcomes. We consider a multi-stage sequential design for each treatment arm and assess ET across different outcome delays, assuming uniform patient accrual. Results: Outcome delays substantially reduce platform trial efficiency, with the impact dependent on recruitment rate and delay length. At a recruitment rate of 10 patients per month, severe losses occur when delays exceed 12 months. When outcome delay exceeds two-thirds of the time required to recruit a single arm, substantially fewer treatment arms are evaluated than anticipated. Conclusion: Outcome delay can markedly reduce platform trial efficiency. Recruitment rates and expected outcome delays should therefore be considered during trial planning.
Optics
Encoding Propagation Invariance into Light
Diffraction governs the axial evolution of optical fields, whereas conventional holographic synthesis primarily controls their transverse structure. Here we add axial diffraction management as an additional design freedom to the transverse_field programmability of holography, enabling the transverse optical function and its diffraction-driven axial evolution to be co_designed. By incorporating established propagation_invariant dynamics into computer_generated hologram and meta_hologram synthesis, we realize task_selectable axial responses in user_defined monochromatic, full-colour and vectorial fields. On a spatial light modulator, the same scalar user_defined field is configured either for a rapidly evolving 1.2_cm depth of field or for an approximately 75_cm propagation_invariant range. Millimetre_scale metasurfaces further enable metre_scale refocusing_free full_colour projection and vectorial colour fields with polarization textures preserved over more than 30 cm. This transverse_axial co_design framework extends holographic field synthesis beyond transverse programmability, providing a broadly compatible route towards task_configurable optical systems and compact multidimensional photonics.
Read the full abstract
Artificial Intelligence
Personalizing LLM Agent Memory Using Biometrics
Personalized memory helps LLM agents deliver stable, tailored assistance by storing and reusing user-specific data across interactions. In multi-user scenarios, however, retrieval must consider not only semantic similarity but also whether the current requester matches the identity associated with the stored memory. We propose Bio-Memory, a biometric-aware memory architecture that conditions memory retrieval on both semantic similarity and biometric matching. Built on top of A-Mem, Bio-Memory augments each atomic memory note with a biometric embedding and uses biometric matching to form the retrieval candidate pool before semantic ranking. We evaluate Bio-Memory on LoCoMo in a 10-user shared-agent setting over 7 face benchmarks and 10 palmprint protocols. Across datasets, Bio-Memory consistently separates owner and non-owner queries. Under face-based personalization, the largest average gap reaches 27.29% / 21.15% in F1 / BLEU-1 on CALFW; under palmprint-based personalization, the corresponding gap is 25.75% / 19.22% on MS_Blue. These results support biometrics as a practical control signal for personalized memory retrieval in shared environments.
Read the full abstract
Symplectic Geometry
Classification of Legendrian doubles and suspensions
We define a construction of Legendrians inside contact manifolds that arise by doubling an exact Lagrangian filling in the page of an open book decomposition. This can be seen as a generalization of a previous construction by Courte and Ekholm to arbitrary open books. These Legendrians, called Legendrian doubles, are shown to admit regular flexible exact Lagrangian fillings, and they are thus classified up to Legendrian isotopy by classical data. Finally, we show that the Legendrian suspension construction, as defined by Arikan and the author in previous work,-this is a Legendrian contained inside a page of an open book that is obtained by using Seidel's suspension of Lefschetz fibrations- is a Legendrian double.
Read the full abstract
Earth and Planetary Astrophysics
MAD-LEO: A Maneuver-Annotated Orbital Dataset for LEO Satellites with Tiered Multi-Source Evidence
With the rapid development of aerospace technology and the large-scale deployment of low Earth orbit (LEO) constellations, the risk of orbital collisions has increased, creating a growing demand for reliable observations of satellite maneuvers. However, public datasets containing real maneuver records remain scarce. We present MAD-LEO, a Maneuver-Annotated orbital Dataset for LEO satellites. The mission-reported subset contains 1,134 maneuver events from eleven geodetic and altimetry satellites spanning 1992 to 2026, with labels taken directly from mission-published maneuver histories. Each event is checked against two-line element (TLE) data, precise orbit products, and satellite laser ranging (SLR) observations, with evidence tiers assigned according to data availability. The operational subset pairs operator-published ephemerides for 6,785 Starlink satellites with cataloged TLE records over a continuous 107-hour period. Technical validation across seven machine-readable experiment suites confirms the cross-source consistency of the labels and the evidence products.
Read the full abstract
Quantum Physics
Kinematic Control and Dephasing Dynamics of Quantum Resources in $e^{+}e^{-}\to\tau^{+}\tau^{-}$
We characterize several quantum resources carried by the spins of the $\tau^{+}\tau^{-}$ pair produced in $e^{+}e^{-}$ annihilation. At the Belle-II energy, $\sqrt{s}=10.579\,\mathrm{GeV}$, Bell nonlocality, steerability, entanglement of formation, and coherence are governed by the production angle and are largest for transverse emission, $\vartheta=\pi/2$. Their common kinematic origin is exposed by expressing the spin state as a velocity and angle-dependent mixture of a separable contribution and a maximally entangled component. Within the physical production domain, this representation connects the weakly correlated threshold state at $\sqrt{s}=2m_{\tau}$ to the Bell-state limit approached at ultrarelativistic energies. We then propagate the two-spin state through a phenomenological correlated-dephasing channel to determine how environmental memory and inter-channel classical correlations affect the available resources. Memory effects generate collapses and revivals that are absent from the monotonic Markovian evolution. The analysis therefore separates the kinematic mechanism that creates the spin correlations from the noise properties that control their subsequent survival.
Read the full abstract
Machine Learning
Not All Variables Agree: Reliability-Aware Variable-Wise Gradient Surgery for Multivariate Time-Series Forecasting
In data-driven training, multivariate time-series forecasting is usually optimized with a scalar loss averaged over samples, variables, and horizons. This averaging is convenient, but the optimizer sees only the aggregated gradient, which does not reveal whether the variable-wise contributions align or oppose one another. To quantify how often this disagreement arises, we measure the variable-wise gradients directly and find that 30.6% of their pairwise cosine similarities are negative on average across seven datasets. However, conflict and harm are not the same thing. Under shared training 35 of the 64 variables do worse than a full-input single-target oracle, and the harmed fraction is not reliably predicted by how often gradients conflict. We propose Per-Variable Surgery (PV-Surgery), an optimizer-side training strategy for backbones with cache-compatible layers. One backward pass builds variable-wise gradient proxies from output-side signals and keeps the pointwise forecasting loss. Reliability-aware selection targets layers whose proxy sums closely approximate their shared-gradient slices. Conditional pooling forms anchor and conflict pools without dropping variables. Common-direction surgery aligns variable or pooled gradients with their normalized mean and restores input norms to avoid reweighting. In experiments across five backbones, seven datasets, and four horizons, PV-Surgery lowers MSE by 3.61% and MAE by 2.93% on average. For multivariate forecasting, this indicates that the variable-wise structure hidden by mean-loss training is a usable optimization signal.
Read the full abstract
Combinatorics
Fundamentals of the cocyclic development of Hadamard matrices over loops
This paper establishes a formal framework for the cocyclic development of Hadamard matrices over loops based on a novel cohomology theory with associativity obstructions. In this context, we formalize the notion of a loop-cocyclic Hadamard matrix, so that both the classical cocyclic Hadamard matrices over groups and the recently introduced pseudococyclic Hadamard matrices over loops are naturally embedded within this broader algebraic architecture. To validate the computational viability of this framework, we prove the existence of four new Hadamard equivalence classes of order 24 and eight new classes of order 28 that are strictly non-cocyclic over any finite group, arising uniquely as loop-cocyclic developments over Moufang and right Bol loops.
Read the full abstract
Optics
Universal Broadband Linear Optical Transformations by an Interlaced Structured Integrated Photonic Processor
Reconfigurable photonic integrated circuits enable applications in a wide range of fields. They represent a powerful platform for signal processing due to the ability to perform parallel computations. In this work, we demonstrate a photonic processor based on a six-channel universal chip fabricated by femtosecond laser writing with an interlaced architecture comprising multiport beam splitters. We exploit and enhance a previously demonstrated calibration procedure for a single building block, and extend it to a complete six-channel interferometer, reconstructing the corresponding interferometer models over a broad spectral range. We validate them by measuring a set of 100 Haar-random unitary matrices, achieving mean amplitude fidelities of 95.9 %, 98.0 %, and 96.0 % for radiation wavelengths 910, 945, and 980 nm, respectively, without on-device optimization. Furthermore, we experimentally realize spectral demultiplexing and multiplexing at these wavelengths, yielding routing fidelities ranging from 90.1 % to 96.5 % and total crosstalk values ranging from -9.6 to -14.4 dB, confirming the applicability of the fabricated photonic processor to practical wavelength-routing tasks.
Read the full abstract
Plasma Physics
Demonstration of a 10-metre-long discharge plasma source for plasma wakefield acceleration
The AWAKE experiment at CERN uses high-energy proton bunches to drive plasma wakefields capable of accelerating electron bunches up to hundreds of GeV in a single plasma. Realising this potential requires a plasma source that can extend to tens of metres while maintaining high longitudinal uniformity and reproducibility. Towards this goal, we report on the first experimental characterisation and beam-based validation of a 10-metre-long pulsed-DC discharge plasma source (DPS) used as an alternative to the laser-ionised rubidium vapour plasma source (VPS). The DPS reliably delivered plasma densities in three noble gases (He, Ar, Xe) at electron densities between 10$^{14}$ and 10$^{15}$ cm$^{-3}$. Proton bunch self-modulation was observed with all three gases, and the resulting modulation frequency was used as a beam-based diagnostic of the plasma density, showing good agreement with laboratory interferometry measurements. The event-to-event modulation frequency was demonstrated to be reproducible to within 0.63%, comparable to that of the VPS. These results establish the DPS as a valid alternative plasma source for beam-driven wakefield experiments, and support its further development towards longer plasma lengths. The present design is tailored to AWAKE requirements, but the underlying discharge concept provides a route to long, reproducible plasma sources with straightforward density control through discharge-beam timing for other beam-plasma experiments.
Read the full abstract
Computation and Language
CreaMem: A Scene-Aware Memory Architecture for Personalized Agents
Long-term memory is a core capability for personalized LLM agents. To support it, existing memory systems organize information using various criteria such as topic segments or summary hierarchies. However, we identify two major limitations in these designs. First, they lack scene awareness: memories from unrelated life scenes share the same retrieval space, which inflates the search space and introduces cross-scene interference. Second, they encode each memory from a single perspective, making it difficult to retrieve complementary views of the same event. In this paper, we propose the CreaMem architecture, which enables scene-aware memory organization by partitioning memory into several Life Scene Memories to reduce cross-scene interference at retrieval. To go beyond the single perspective and achieve cross-memory synergy, entries are dual-coded from both episodic and trait-based perspectives within each memory. We further devise a permemory balanced sampling strategy at retrieval time. Extensive experiments on two long-term memory benchmarks show that CreaMem improves QA accuracy across all evaluation metrics, with particularly large gains on multi-hop reasoning performance, validating scene-aware partitioning and cross-memory synergy. To enhance reproducibility, we release our code in a public GitHub repository.
Read the full abstract
Number Theory
A geometric Jacquet–Langlands correspondence for Shimura varieties
We formulate a conjecture predicting the existence of exotic isomorphisms between Igusa stacks associated to different Shimura data whose underlying groups are pure inner forms of each other, and prove it in many cases of interest. In combination with the spectral action of Fargues–Scholze, this allows us to relate the cohomology groups of the two Shimura varieties, giving a geometric incarnation of the Jacquet–Langlands correspondence. An important ingredient in our proofs is the work of Xiao–Zhu on exotic Hecke correspondences between the perfect special fibers of different Shimura varieties, which we reinterpret in terms of exotic isomorphisms of perfect Igusa stacks.
Read the full abstract
Strongly Correlated Electrons
Schwinger boson perturbation theory for spin-$S$ Kitaev-Heisenberg magnets: phase diagram and dynamical response near Kitaev spin liquids
We develop a Schwinger boson perturbative framework for the spin-$S$ Kitaev-Heisenberg model. The spin-liquid saddle point of the pure Kitaev model is used as the unperturbed state, and magnetic instabilities and dynamical spin correlations are evaluated around this saddle point. We decompose the Hamiltonian exactly into two parts by exploiting the Klein duality intrinsic to the Kitaev-Heisenberg model. We perform the random-phase approximation by taking the part invariant under the duality transformation as the unperturbed term and treating the remaining term, which changes sign under it, as the perturbation. We determine the phase boundaries separating the quantum spin-liquid regimes from the adjacent magnetically ordered phases for $S=1/2$, $1$, $3/2$, and $2$. The spin-liquid regions shrink rapidly with increasing $S$ and become very narrow at $S=2$. We also compute the spin dynamics of the spin-$S$ Kitaev-Heisenberg model, focusing on $S=1$, and find that the dressed dynamical spin structure factor retains a broad two-spinon continuum at finite energies, while the low-energy spectral weight softens at the ordering wave vectors of the adjacent magnetic phases. Our framework thus enables thermodynamic-limit calculations of spin dynamics near magnetic instabilities.
Read the full abstract
Biomolecules
Multi-ligand simultaneous docking of Carica papaya leaf phytochemicals, Carpaine and Rutin, reveals multi-mechanism inhibition of cancer proteins BCL-2 and WWP1
Cancer remains a major global health concern due to chemotherapy resistance and toxicity from high-dose treatments. To overcome these challenges, new therapeutic strategies targeting key proteins in cancer progression are essential. This study evaluates two phytochemicals, Carpaine (Car) and Rutin (Rut), from Carica papaya leaves, for their potential in enhancing cancer therapy by targeting B-cell lymphoma 2 (BCL-2) and WW domain-containing protein 1 (WWP1) proteins. We assessed their additive, allosteric, and synergistic effects using molecular docking, multi-ligand simultaneous docking (MLSD), molecular dynamics (MD) simulations, and MMPBSA analysis. Car and Rut showed an additive effect on BCL-2 by binding at distinct regions within the same pocket. MLSD revealed an improved binding affinity of -13.13 +/- 0.08 kcal/mol, compared with individual ligands or the commercial inhibitor Venetoclax. For WWP1, Car bound near the H-site and Rut near the Le-site, exhibiting an allosteric effect that increased Car's binding affinity in MLSD to -15.59 +/- 0.39 kcal/mol. Furthermore, Rut combined with bortezomib (Bort) demonstrated a synergistic interaction with WWP1. Binding energies were -7.64 +/- 0.156 kcal/mol for Bort, -10.26 +/- 0.07 kcal/mol for Rut, and -15.59 +/- 0.39 kcal/mol for MLSD, suggesting a more stable complex through synergy. These results suggest Car and Rut, particularly in combination with Bort, as promising candidates against cancer-related proteins BCL-2 and WWP1. Further experimental validation is warranted to explore their therapeutic potential.
Read the full abstract
Number Theory
Symmetric power L-functions of a weighted hyper-Kloosterman family
As a natural generalization of the classical hyper-Kloosterman family studied by D. Haessig and S. Sperber, we study the $k$-th symmetric power $L$-functions attached to a weighted hyper-Kloosterman family $$Kl_{n,m}(t;x_{1},\cdot\cdot\cdot,x_{n})=x_{1}^{m}+x_{2}\cdot\cdot\cdot+x_{n}+\frac{t}{x_{1}x_{2}\cdot\cdot\cdot x_{n}}.$$ Under suitable conditions, we determine the bounds of degrees of these $L$-functions and prove that their $q$-adic Newton polygons admit uniform lower bounds.
Read the full abstract
Emerging Technologies
Movable-Element STAR-RIS for 6G: From Programmable Propagation to Programmable Geometry
Reconfigurable intelligent surfaces (RISs) make the wireless propagation environment programmable, while simultaneously transmitting and reflecting RISs (STAR-RISs) extend this capability to users located on both sides of a surface. However, conventional STAR-RIS architectures retain a fixed physical geometry after deployment. Movable-element STAR-RIS (ME-STAR-RIS) introduces an additional spatial degree of freedom by allowing the surface elements to reposition within prescribed regions while maintaining electronic control of their transmission and reflection responses. This combination of electromagnetic and geometric reconfiguration can alter propagation distances, multipath combinations, spatial correlation, interference, near-field focusing, and sensing geometry. This article presents a system-level perspective on ME-STAR-RIS through the concept of programmable geometry. We discuss its operating principles, movement architectures, and promising applications in communications, security, near-field systems, sensing, and high-mobility networks. A representative case study comparing optimized fixed and movable STAR-RIS architectures illustrates measurable spectral-efficiency gains from limited local displacement and the resulting saturation behavior. Finally, key hardware, channel-acquisition, electromagnetic, energy, reliability, and control challenges are discussed toward practical ME-STAR-RIS deployment.
Read the full abstract
Mesoscale and Nanoscale Physics
Equivalent Circuit Representation and Thermodynamic Limitations of Non-Adiabatic Spin-Transfer Torque effect
We present an equivalent circuit representation of the Thiele equation for the current-driven domain walls. We show that the non-adiabatic spin-transfer torque (\beta-term) cannot be represented by passive elements alone (such as resistors, inductors, and capacitors) and necessarily requires active elements, corresponding to negative dissipation. Consequently, assuming that the driving current is the only power source for the texture dynamics, directly incorporating the \beta-term introduces a fundamental contradiction with thermodynamic principles. This equivalent circuit theory indicates that the interpretation of experiments solely through the \beta-term does not fully capture the underlying physics, highlighting the need to account for effects distinct from the spin dynamics.
Read the full abstract
Computer Vision
STSG-VQA: Evidence-Grounded Temporal Question Answering from Surgical Spatio-Temporal Scene Graphs
Despite recent advances in surgical vision-language models (VLMs), temporal reasoning remains limited because existing supervision is largely frame-centric. Frame-level scene graphs (SGs) have proven effective in providing structured representations of surgical environments but do not explicitly model the dynamics of surgical workflows. To explicitly model how surgical states evolve across time, we introduce a multi-level structured temporal supervision methodology that augments frame-level surgical SGs with object-level continuity, event-level interaction continuity, and procedure-level connectivity. We then execute temporal queries over the resulting spatio-temporal scene graphs (STSGs) to generate evidence-grounded question-answer pairs, which together form the STSG-VQA benchmark. Each question is linked to the temporal interval and STSG evidence used to derive its reference answer, enabling traceable verification. The benchmark contains 18,458 question-answer pairs across seven temporal categories. Fine-tuning Qwen3-VL-4B and Hulu-Med-4B with STSG-derived supervision improves question-level micro accuracy by 24.39 and 19.56 percentage points over their zero-shot baselines and by 16.50 and 14.25 points over static scene-graph supervision, respectively. These gains span all temporal categories, indicating that STSG-derived supervision helps surgical VLMs reason over temporally grounded interactions rather than isolated frames. The code and dataset will be made publicly available upon acceptance.
Read the full abstract
Audio and Speech Processing
Spatial Audio Coding Through Relative Room Impulse Response Estimation
Immersive virtual listening relies on spatial audio technologies such as Higher-Order Ambisonics (HOA), which represent sound scenes as multichannel signals. As the desired spatial resolution increases, so does the number of channels, making efficient compression essential for transmission over bandwidth-limited networks. Moreover, to facilitate deployment by network operators, the target bitrate for immersive audio coding should ideally remain close to the 25 kbps currently allocated to VoLTE audio services. State-of-the-art parametric codecs, such as the recently standardized Immersive Voice and Audio Services (IVAS) codec, achieve compression by transmitting spatial metadata together with a reduced number of transport channels. However, recent studies have shown that IVAS performance degrades on reverberant content, particularly at low bitrates, a limitation that suggests its inability to accurately model room acoustics. In this paper, we propose a novel HOA coding scheme based on the explicit and blind estimation of the Relative Spatial Room Impulse Response (ReSRIR), using a beamformed version of the HOA signal as a reference signal. By exploiting the structure and sparsity of the estimated ReSRIR, we derive an efficient parametric representation for immersive audio coding. Experimental evaluations show that the proposed method achieves higher compression than IVAS in the single-transport-channel regime, while maintaining comparable to slightly better quality.
Read the full abstract
Mathematical Finance
Variance-Optimal Hedging in the Rough Hawkes–Heston Model
We study variance-optimal stock hedging and the convergence of approximate strategies in the rough Hawkes–Heston model. Starting from the model's affine conditional transform and the affine Volterra jump framework, we obtain semi-explicit hedges for European calls and a representation of the minimum quadratic error through the Galtchouk–Kunita–Watanabe projection. Our main approximation result keeps the original stock, variance driver, and information flow fixed while regularizing the kernel used to evaluate the hedge. To handle singular memory and common marked jumps, we construct the approximate holdings from histories available before trading and preserve the conditional transform's random modulus envelope. Riccati–Volterra stability and weighted truncation then yield convergence in the original stock's trading norm on compact Fourier intervals. For calls, a joint choice of kernel regularization and Fourier cutoff gives convergence of the initial capitals and strategies, uniform-in-time square-mean convergence of continuous-time gains, and convergence of the terminal mean-square error to the variance-optimal value. A numerical experiment with shifted fractional kernels illustrates the construction on common original-market paths.
Read the full abstract
Combinatorics
When chromatic polynomials coincide with list-color functions: a threshold linear in the maximum degree
Let $G$ be a simple graph with maximum degree $\Delta\ge 3$, and let $P(G,k)$ denote its chromatic polynomial. For each positive integer $k$, the list-color function $P_{\ell}(G,k)$ is the minimum number of $L$-colorings of $G$ over all $k$-assignments $L$. In this paper, we prove that $P_{\ell}(G,k)=P(G,k)$ for every integer $k\ge 23.41\Delta$. This gives a threshold for equality that is linear in the maximum degree and independent of the number of vertices or edges. It improves the known sufficient condition $k\ge |E(G)|-1$ for graphs with sufficiently many edges relative to their maximum degree.
Read the full abstract
Complex Variables
Real-analytic realization of universal Teichmüller space via complex-structures on $H^{1/2}$
Let $H$ be the Hilbert transform, let $h$ be a quasisymmetric homeomorphism of the unit circle $S^1$, and set $V_hu=u\circ h$ and $J_h=V_hHV_h^{-1}$, defined on the Sobolev space $H^{1/2}(S^1)$. We prove that $h\mapsto V_h$ is nowhere continuous in operator norm, although it is continuous in the strong operator topology. By contrast, the induced map $h\mapsto J_h$ is a real-analytic diffeomorphism onto its image in the operator-norm topology. Based on this, we further compute the differential at the identity and show that it is precisely the Calderón commutator. In graph coordinates, the tangent map admits a weighted Hankel matrix representation, whose Hilbert-Schmidt norm recovers the Weil-Petersson tangent quadratic form.
Read the full abstract
Rings and Algebras
A vanishing criterion for Lie elements in a free Novikov algebra
Every Novikov algebra is Lie-admissible: the commutator turns it into a Lie algebra. We give a finite criterion for a multilinear element of the free Novikov algebra to belong to the Lie subalgebra generated by the free generators. By the differential realization of free Novikov algebras, the multilinear component of degree $n$ is identified with the space of homogeneous polynomials of degree $n-1$ in $n$ variables. We prove that a multilinear element is a Lie element if and only if its symbol vanishes at every integer point $(a_1,\ldots,a_n)$ with $a_i\le 1$ and $a_1+\cdots+a_n\ge 2$. Equivalently, the symbol is annihilated by two explicit linear differential operators of orders two and three. The proof combines the Witt algebra, a specialization argument for a symmetric block of variables, homogeneous interpolation and Molev's description of the multilinear component of the Lie algebra generated by the free generators as a module over the symmetric group. As applications we show that a nonzero multilinear Lie element is never a total derivative, recover the dimension of the multilinear Lie component, and illustrate the criterion by examples in degrees $4$, $5$ and $6$.
Read the full abstract
Optimization and Control
The Exact Time-Uniform Rate Frontier for Stochastic Gradient Descent on Smooth Convex Objectives
We study the time-uniform convergence of the raw iterate of standard stochastic gradient descent (SGD) for unconstrained smooth convex objectives. We prove that, under standard noise assumptions, the time-uniform convergence rate gets arbitrarily close to $\sqrt{\log n / n}$ but never reaches it. More specifically, we prove that for every positive, eventually nondecreasing sequence $h$ satisfying $h(n) = o(\sqrt{n})$, a bound of order $h(n)/\sqrt{n}$, holding simultaneously for all $n$ with probability at least $1-\alpha$ and uniformly over the problem class, is achievable if and only if \[ \sum_{j = 1}^{\infty} \frac{1}{h(2^j)^2} < \infty. \] The constructive sufficiency result follows from a dyadic horizon-free schedule together with an additive conditional-restart inequality. The necessity counterpart applies to every deterministic nonnegative schedule and holds even for a one-dimensional analytic smooth convex objective with Gaussian noise.
Read the full abstract
Symbolic Computation
Physical Law Ecology: mapping multi-mechanism ecologies as the zeroth step of data-driven scientific discovery
Every data-driven equation discovery method assumes (implicitly and without verification) that the target system obeys a single governing law ($K{=}1$). Here we show that this assumption is the primary bottleneck limiting scientific discovery in multi-mechanism systems, and introduce Physical Law Ecology, a framework that makes $K^*$ (the number of coexisting independent mechanisms) itself the first quantity to be determined from data. The framework automatically mines a pool of topologically distinct candidate equations, constructs a continuous dominance weight field across parameter space, and discovers analytic evolution laws governing mechanism succession—with optional monotonicity constraints encoding irreversible physics. Across four unrelated systems (elastomer mechanics, pool boiling, galactic dynamics, and droplet evaporation), BIC consistently identifies $K^*{=}3$ independent governing topologies. Applied to 163 SPARC galaxies (3,269 spatially resolved measurements), the framework autonomously recovers three gravitational laws whose coexistence provides evidence against the single-universal-acceleration hypothesis of MOND ($p<10^{-34}$). In engineering applications, multi-law weighted prediction reduces error by 67-72% over single-equation baselines while retaining full interpretability. By establishing the determination of $K^*$ as the zeroth step of scientific discovery-prior to and independent of equation search—this work opens a direction orthogonal to existing symbolic regression: not finding better equations, but mapping the ecology of mechanisms that govern complex systems.
Read the full abstract
Mesoscale and Nanoscale Physics
Memory Control of Ice Growth During Non-Equilibrium Freezing of Water
Freezing of supercooled water is a classic non-equilibrium problem, yet the influence of thermal history on crystallization remains unclear. Using molecular dynamics simulations with the TIP4P/Ice model, we investigate how the initial temperature $T_i$ shapes freezing following rapid quenching to 250 K. By monitoring the evolution of hydrogen-bonded ring structures, we find a non-monotonic dependence of the freezing time $t_F$ on $T_i$, with the slowest crystallization occurring near 300 K. Remarkably, this means that initially hotter water can freeze faster than cooler water, a molecular-scale analogue of the Mpemba effect. A non-stationary generalized Langevin equation framework shows that two-time memory kernels retain information about the system's thermal past, directly influencing crystallization dynamics. Structural analysis further reveals that five-membered rings act as kinetic traps, while correlations among ring types regulate the accessibility of ice-like motifs. These results uncover a molecular origin of memory-driven freezing and establish structural memory as a key driver of non-equilibrium phase transitions.
Read the full abstract
High Energy Astrophysical Phenomena
Nuclear equation-of-state effects on the two-dimensional post-outburst thermal evolution of magnetized neutron-star crusts
We present a controlled two-dimensional study of nuclear-equation-of-state (EOS) effects on the post-outburst thermal relaxation of magnetized neutron-star crusts. Six EOS models are evolved at a fixed gravitational mass of $1.4 M_{\odot}$ with EOS-specific TOV backgrounds, crust compositions, and transport inputs under identical magnetic-field and heating prescriptions. Our analysis combines self-consistent multi-EOS evolution with a BSk-family factorization that separates structural, microphysical, and interaction contributions, together with an accepted-step energy ledger and a numerical-sensitivity budget. The models show EOS-dependent changes in both the early response and the later redistribution of heat between the surface, crust, and inner boundary; light-curve crossings near $10^2$ days demonstrate that the EOS effect is not a simple luminosity rescaling. By 1000 days the cumulative surface-photon energy fraction differs by less than one percentage point, whereas the internal energy partition differs much more strongly. The updated sensitivity tests show that the late-time luminosity differences and the largest peak contrasts exceed the corresponding BSk24 numerical-sensitivity scales, while the smallest early peak contrast remains less securely resolved. The calculations are intended as a reproducible EOS-sensitivity benchmark rather than an observational fit.
Read the full abstract
Analysis of PDEs
Global large solutions of the Cauchy problem for the NS-NPP equations with Fujita-Kato type initial data
In this paper, we prove the global well-posedness of the Cauchy problem for the NS-NPP equations with some large Fujita-Kato type initial data. Specifically, we show that there exist two positive constants $c_{0}$ and $C_{0}$ such that if the initial data $(u_{0}, N_{0}, P_{0})$ satisfies the following condition: \begin{equation*} \left(\|u_0\|_{\dot{H}^{-1+\frac{d}{2}}}+\|N_{0}-P_{0}\|_{\dot{H}^{-2+\frac{d}{2}}}\right)\exp\left\{C_{0}\big(\|N_{0}+P_{0}\|_{\dot{H}^{-2+\frac{d}{2}}}^2+1\big)\right\} \leq c_{0}, \end{equation*} then the NS-NPP equations admits a unique global solution. This result implies global existence of solutions without any smallness conditions imposed on the sum of initial particle densities of negative and positive electric charge in the framework of Sobolev spaces.
Read the full abstract
Information Retrieval
Individual Text Corpora Predict User-Specific Knowledge: Benchmarks of Individualized Knowledge Simulation
This study examines whether individual text corpora (ICs) from search histories can be used to simulate individual knowledge. We collected ICs from 316 adults, who answered 36 multiple-choice knowledge items, and compared several large language models (LLMs) on this task, of which only Qwen3-1.7B proved viable. After task-specific fine-tuning via Low-Rank Adaptation (LoRA), Qwen3-1.7B outperformed both participants and a representative German norm sample on publicly available items. On non-public questions, however, the LLM performed worse than our participants, suggesting possible training data contamination for the public questions. When integrating ICs into retrieval-augmented generation to predict individual responses, LLM-participant Match accuracies significantly exceeded chance, which demonstrates a detectable individual knowledge signal. The probabilities assigned to the participants' answers were, however, low and far below the probability of correct answers, indicating poor calibration toward individual response patterns. Knowledge-gap prediction was sub-optimal, though it improved for corpora exceeding five million tokens. We discuss our entropy based evaluation benchmarks as calibration indices for individualized knowledge simulation.
Read the full abstract
Information Theory
The Fusion Frame Phase Retrieval
The phase retrieval problem involves reconstructing a function or signal solely from the magnitude of linear measurements. Most theoretical analyses of phase retrieval algorithms rely on i.i.d. Gaussian random measurements or sub-Gaussian random measurements. In this paper, our focus is on the fusion frame phase retrieval problem, where the sampling matrices are i.i.d. rank-$r$ orthogonal projections drawn from the Haar measure. We present concentration inequalities for functions on the set of rank-$r$ orthogonal projection matrices. These inequalities are crucial for the theoretical analysis of the fusion frame phase retrieval problem. Based on these inequalities, we demonstrate that gradient descent, combined with a two-stage initialization, achieves linear convergence to the target signal up to a global phase with a measurement complexity of $O(d\log^2 d)$ when the rank $r = O(1)$. We verify this convergence through numerical results.