Statistics Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 4 September
We study estimation and inference for a semiparametric class of time series models that specify only the conditional expectation, which is a known link function applied to a linear combination of past observations and covariates. The class covers count, binary, bounded and conditionally heteroskedastic responses within a single formulation, and the parameter is estimated by a quasi-likelihood estimating equation based on the first conditional moment. Under stationarity and a weak-dependence condition expressed through the functional dependence measure, we establish two results. First, using a Fuk–Nagaev inequality for weakly dependent sequences, we show that the estimator is localized in a shrinking neighbourhood of the true value with probability $1-o(n^{-1/2})$. Second, combining a Berry–Esseen bound for weakly dependent sequences with a Gaussian anti-concentration argument to control the remainder of the linear expansion, we obtain a Berry–Esseen bound for linear projections of the estimator, uniform over projection directions. From the projected bound we derive studentized confidence intervals with explicit coverage error and a conservative Bonferroni test for linear hypotheses on the parameters. For real data analysis, we extend the Beta autoregression for double-bounded data to an arbitrary link given by the inverse of a distribution function, and apply it to ten pairwise realized correlations of large-cap technology-stock returns, using Nasdaq and Dow~Jones index returns as covariates.
Complex Variables
Boundary Geometry and Surjective Linear Isometries of Weighted Hardy Spaces
Let $D\subset\mathbb C^n$, $n\geq 2$, be a bounded pseudoconvex domain with smooth boundary, and let $H^p_\omega(D)$ be the Hardy space defined using a weighted boundary measure $\omega\,d\sigma$, where $\omega$ is bounded above and bounded away from zero. For every $0<p<\infty$, $p\neq2$, we prove that each surjective linear isometry $T$ of $H^p_\omega(D)$ has the rigid form \( Tf=T(1)(f\circ\varphi), \) where $\varphi\in\operatorname{Aut}(D)$. This extends the classical Forelli-type classification beyond highly symmetric or polynomially convex domains to arbitrary smoothly bounded pseudoconvex domains. The principal difficulty is not the construction of a holomorphic symbol, but proving that this symbol takes values in $D$ and is in fact biholomorphic. We overcome this difficulty by combining equimeasurability methods of Rudin and Schneider with boundary uniqueness, holomorphic approximation, plurisubharmonic exhaustion functions, and removable-singularity arguments across analytic sets. We also solve the complementary geometric problem of determining when an automorphism of $D$ gives rise to an isometry. The answer depends decisively on the boundary measure. We construct two natural measures for which every automorphism induces an isometry: one obtained from an invariant defining function when $\operatorname{Aut}(D)$ is compact, and the other given by Fefferman's invariant surface measure. In sharp contrast, we exhibit domains with noncompact automorphism group—including domains biholomorphic to the unit ball—for which the analogous conclusion fails for ordinary Euclidean surface measure. Thus the isometric structure of Hardy spaces detects not only the biholomorphic geometry of the domain, but also the finer interaction between that geometry and the chosen boundary measure.
Read the full abstract
Artificial Intelligence
$\tau^\tau$-Bench: An Environment for End-To-End, Realistic Agent Construction
LLM agents are rapidly becoming production software, deployed to handle customer service, adjudicate disputes, and operate internal systems. Notably, the work of building them is increasingly handed to coding agents, yet existing benchmarks say little about whether an AI system can deliver one under the conditions of a real client engagement. We introduce $\tau^\tau$-bench (pronounced hyper-tau-bench), a benchmark that makes agent construction the task. A developer agent is given the records a business actually keeps, a client who holds requirements, a production API that operations must run through, a codebase to inherit, and limits on serving cost and models: the same starting point a real engagement provides. From these it must deliver a complete customer-service agent, scored by deploying that agent against held-out simulated users. Across 53 tasks spanning four domains, the strongest configuration, Claude Opus 5 under Claude Code, passes just 23.9% of evaluation simulations. Meanwhile, an expert-authored reference ceiling scores 82.2%. The failures mirror ones human agent developers see: models issue shallow queries in place of deep comprehension of the records, communicate almost nothing to the client, and experiment too little with agent architecture and serving spend, shipping the first design that runs. We aim for $\tau^\tau$-bench to turn the work of cooperative agent building into a measurable target for coding agents.
Read the full abstract
Probability
A note on Ursell functions for the Blume-Capel model
We study the sign structure of Ursell functions in the Blume–Capel model. For $\Delta \le \log 2$, we give a short proof of the alternating sign property using an Ising representation. We then construct counterexamples for every $\Delta > \log 2$, showing that the condition $\Delta \le \log 2$ is sharp.
Read the full abstract
Distributed Computing
CIERA: Cross-Iteration Exponent Reuse for Lossless Allgather in Sharded MoE Training
In training Mixture-of-Experts (MoE) models, sharded data parallelism partitions each expert's parameters across GPUs, requiring an Allgather operation to reconstruct the full weight matrix before each layer executes. This communication often dominates iteration time. Prior work often reduces this overhead using lossy compression methods that sacrifice numerical fidelity, while existing lossless methods do not exploit cross-iteration exponent stability. In this paper, we propose Cross-Iteration Exponent Reuse Allgather (CIERA), a lossless, system-aware communication method for sharded MoE training. We observe that after a brief warmup phase, the exponent values of most weights remain unchanged across iterations. Based on this, we cache exponents locally and transmit only the sign and mantissa when exponents are unchanged. The receiver reconstructs the original weights exactly by combining the cached exponents with the received data. Since parameter matrices vary in shape across layers, compression is applied only when it yields net time savings. Moreover, the compression operation is overlapped with both Allgather communication and computation. Our real experiments and large-scale trace-driven simulator show that on OLMoE-1B-7B at 16 GPUs, CIERA achieves a 3.70x speedup over the lossless baseline and 3.68x over the lossy baseline, projected to reach 4.28x and 4.42x respectively at 128 GPUs, while preserving bitwise-exact parameter reconstruction in all evaluated runs.
Read the full abstract
Statistical Methodology
Visualizing Class Specific Heterogeneous Tendencies using R
In this paper we introduce the R package mccca, which implements multiple-class cluster correspondence analysis (MCCCA) proposed in M.Takagishi et al., (2022). MCCCA is a statistical method that identifies and visualizes heterogeneous tendencies specific to “classes” (e.g., gender and nationality) in a low dimensional space. In MCCCA, two kinds of variables, external and active variables, are distinguished. External variables directly define classes whereas the active variables are used to derive class-specific clusters of observations (individuals). In this paper, we show how to apply MCCCA and how to visualize its results using mccca. We illustrate the procedure for performing MCCCA by applying it to two data sets.
Read the full abstract
Robotics
Open-Set 3D Scene Graphs for Field Robotics: An Outdoor Case Study
Three-dimensional scene graphs (3DSGs) have emerged as a promising approach for building geometrically grounded, semantically informed, hierarchical general-purpose maps to support high-level robotic reasoning. However, the behavior of 3DSGs in real-world outdoor deployments remains poorly understood, particularly when combined with open-set vision-language models (VLMs). In this field report, we analyze the components common to most 3DSG representations across five outdoor robotic datasets to characterize challenges that arise in complex outdoor environments. Using the recently proposed Terra 3DSG as a case study, we investigate semantic point embeddings, place-node graph navigation, region-level understanding, and memory size across the five diverse datasets. We additionally introduce novel consistency metrics to evaluate whether semantic and structural graph properties remain stable across repeated traversals of the same environment. Our analysis reveals that outliers and multiple modes are common in VLM point embeddings across all tested datasets with outlier ratios above $0.1$ for around $30\%$ of points. We demonstrate the feasibility of outdoor 3DSGs for navigation-based object retrieval, achieving success rates near $70\%$, though performance is limited by traversability failures and inefficient routing, with trajectories averaging approximately $66\%$ suboptimal path efficiency. Region-level understanding remains challenging in complex natural environments, with low average F1 scores around $0.359$. Overall, our results show that outdoor 3DSGs can maintain compact (less than $600$MB for multi-kilometer trajectories) and relatively consistent large-scale environment representations, while highlighting open challenges in handling multiple semantic modes, incorporating traversability into graph structures, and improving higher-level region understanding.
Read the full abstract
Fluid Dynamics
Transport fidelity and domain of validity of compact Gaussian kinetic representations for rarefied flows
Compact representations of rarefied flows must retain nonequilibrium transport information while identifying their range of validity. We investigate a common localized-Gaussian strategy for discrete-velocity-method (DVM) states in monatomic normal shocks and lid-driven cavities. The strategy is specialized to the available kinetic state: a positive phase-space mixture represents shock distributions and regenerates their moment hierarchy by quadrature, whereas a shared-support physical-space map represents 20 cavity fields. Localized support, continuous evaluation, transport fidelity, and coefficient-count accounting therefore provide the common structure across the two benchmarks. For separately fitted Mach-3 and Mach-5 shocks, the method gives sub-percent errors in conserved quantities and approximately 1–2% errors in transport and higher-order moments. At the same 4608-coefficient budget, the tested multilinear grids produce 89–98% errors in these nonequilibrium quantities. For both cavity cases, the Gaussian map also outperforms matched bilinear and singular-value-decomposition baselines, reducing maximum errors by factors of approximately 7–24. In the Mach-conditioned tests, a correspondence-preserving local basis reduces the withheld Mach-6 distribution error from $42.86\pm5.40\%$ to $11.45\pm0.94\%$ at fixed storage, while its transport errors remain 30–40%; a normalized-coordinate guard rejects Mach 12 outside the training range. Independent grid studies confirm that these trends are not dominated by DVM discretization error. The results establish localized Gaussian representations as storage-efficient transport-fidelity maps for fitted kinetic states and provide quantitative acceptance criteria for parametric use.
Read the full abstract
Materials Science
Light alkali metal functionalized two-dimensional C5N monolayers for enhanced hydrogen storage
This work presents a density functional theory (DFT) investigation of a two-dimensional (2D) C5N monolayer functionalized with Li, Na, and K for hydrogen storage. Pristine C5N exhibits weak H2 adsorption, while alkali-metal functionalization significantly enhances its storage capability. The C5N monolayer can stably accommodate up to six metal dopants, with binding energies stronger than the corresponding cohesive energies, indicating resistance to metal aggregation. Ab initio molecular dynamics simulations further confirm the thermal stability of the functionalized systems at 300 K. Charge transfer from the metal dopants to C5N enhances polarization and strengthens H2 adsorption. Each dopant can adsorb up to eight H2 molecules, yielding a maximum of 48 H2 molecules per unit cell and gravimetric storage capacities of 9.42, 8.61, and 7.93 wt% for Li-, Na-, and K-functionalized C5N, respectively. The average H2 adsorption energies of -0.16 to -0.17 eV/H2 indicate moderate interactions suitable for reversible storage. Thermodynamic analysis further demonstrates favourable H2 adsorption/desorption under practical operating conditions, while desorption-temperature, recovery-time, and volumetric analyses support the potential reversibility and storage performance of these systems. Overall, alkali-metal-functionalized C5N emerges as a promising 2D material for efficient and reversible H2 storage.
Read the full abstract
Statistics Applications
The Periodically Correlated Components of Measles in New York City using the Variable Band-pass Periodic Block Bootstrap
Measles, a highly contagious, deadly virus, is at risk of losing its eradication status in the Unites States. Understanding the pattern, including seasonality, of measles could provide great benefit for forecasting, prevention, and public health preparedness as the virus re-emerges. The novel Variable Band-pass Periodic Block Bootstrap (VBPBB), which suppresses noise and interfering signals, is more efficient and statistically powerful to find periodic components compared to other existing methods. Using this method, we have found several significant periodic components in historical New York City measles cases which other methods were incapable of identifying. These findings give us a reusable method for understanding measles and other diseases and greater insight into what may occur should measles vaccine rates continue to fall.
Read the full abstract
Computer Vision
An Evaluation Framework for Generating Multi-View Images of a Person in a Scene
Recent generative image-editing Diffusion Transformers (DiTs) demonstrate impressive semantic editing capabilities but still struggle with spatially consistent camera angle changes. A primary bottleneck in training foundation models to execute free-form, promptable camera angle changes is the lack of specialized training data. While multi-view datasets exist for generic 3D environments and objects, there remains an absence of paired, multi-view datasets featuring human subjects at fixed locations in natural scenes, including frontal and side-profile views. Capturing such multi-camera data in unconstrained environments is logistically challenging and unscalable. In this paper, we first experiment with multiple state-of-the-art image editing models to create this data synthetically, but find that the outputs are frequently prone to hallucinations involving how much the subject's head turns relative to the background, often producing inconsistent environments. To address this issue, we propose the Head Scene Rotation Difference (HSRD) metric to quantitatively evaluate camera movements around a person. The proposed metric operates by decoupling camera movement from localized head pose manipulation. As demonstrated by the extensive experimentation, HSRD provides the pipeline necessary to evaluate 3D spatial parallax for a person in a scene, paving the way to reliably construct high-quality multi-view synthetic datasets.
Read the full abstract
Robotics
NavArena: Automated Construction of Goal-Oriented Navigation Benchmarks from 3D Gaussian Splatting Reconstructions
Fixed 3D Gaussian Splatting (3DGS) reconstructions provide realistic novel views but lack the traversability constraints, valid goals, and closed-loop protocols required for navigation evaluation. We introduce NavArena, an automated framework that transforms fixed 3DGS reconstructions into benchmarks for goal-oriented visual navigation. NavArena integrates a frozen 3DGS model for egocentric RGB-D rendering, an occupancy costmap derived from Gaussian density and height statistics for reachability and collision queries, and semantic goal candidates lifted from multi-view open-vocabulary masks. These components support the automatic generation and unified closed-loop evaluation of goal-oriented navigation episodes. Across more than 2{,}000 scenes, NavArena generates 22.2 million expert trajectories. Spatial and semantic evaluations assess the derived navigation representations, while policy rollouts demonstrate the diagnostic value of the unified evaluation protocol. NavArena enables scalable and reproducible navigation evaluation on large-scale 3DGS reconstructions, and all benchmark-generation tools, evaluation protocols, and derived assets will be released publicly.
Read the full abstract
Probability
Stochastic epidemic models with pulse vaccination, varying infectivity and waning immunity
We introduce a fully stochastic, non-Markovian SIRS-type epidemic model that incorporates varying infectivity, waning immunity and a pulse vaccination strategy that may not confer permanent immunity. The model is constructed at the individual level, where each person is characterized by random infectivity and susceptibility functions, and vaccination campaigns occur at the jump times of a Poisson random measure with arbitrary intensity. We rigorously derive the epidemic dynamics as the large-population limit of an interacting stochastic particle system, leading to a system of nonlinear Volterra-type integral equations governing the average susceptibility and total force of infection. We establish a functional law of large numbers(FLLN) for the empirical processes and provide explicit expressions for the limiting compartmental proportions. The long-term behavior of the system is analyzed: we prove that the infection-free solution is globally asymptotically stable when the basic reproduction number falls below a critical threshold, and that the disease persists when this threshold is exceeded. The threshold is given by the harmonic mean of the maximal susceptibility across individuals and generalizes previous results by incorporating vaccination and memory effects. Our framework provides a probabilistically grounded extension of classical deterministic pulse vaccination models and offers new insights into the control of epidemics through scheduled immunization policies.
Read the full abstract
Materials Science
Demonstration of room-temperature, magnetic-field-free, and ultralow-power spin-orbit torque logic device based on composition-uniform van der Waals magnet Fe3GaTe2
Van der Waals magnets have received blooming interest in material science and spintronics for the advantages of low magnetization, flexible stacking, strong tunability, and dangling-bond-free interfaces. However, there has been no report of room-temperature magnetic-field-free spin logic device based on a van der Waals magnet. Here, we demonstrate a room-temperature, field-free, low-power, scalable spin-orbit torque in-memory computing logic device utilizing a van der Waals magnet Fe3GaTe2 bit with strong perpendicular magnetic anisotropy and a Pt channel with strong spin Hall effect, high electrical conductivity, and electric asymmetries. Current pulse width-dependent switching measurement reveals a low intrinsic critical magnetic-field-free switching current of 1.8e7 A cm-2, a high thermal stability factor of 50, and the potential of an ultralow write power of 1.5 fJ per bit at 1 ns pulse width for a typical industrial-level device dimensions (40 times lower than the industrially optimized W/FeCoB device). These results suggest a great potential of van der Waals magnets in dense, ultralow-power, scalable in-memory computing technologies.
Read the full abstract
Analysis of PDEs
Three asymptotic regimes for a Keller–Segel system with volume-filling effect
We study three asymptotic regimes for a parabolic–elliptic Keller–Segel system with porous-medium diffusion and the volume-filling sensitivity function $u(1-u)$. First, when $D=\epsilon^2\to0$, $\delta=1$, $1\le m<2$, and the chemotactic sensitivity coefficient is below an explicit $m$-dependent parabolicity threshold, we prove strong convergence to a scalar nonlinear diffusion equation. Second, as $\delta=\epsilon\to0$ with $D=1$, we obtain a hyperbolic–elliptic Keller–Segel limit by means of a kinetic reduction argument. Third, under the scaling $\chi=\epsilon^{-1}$, $D=\epsilon^2$, $\delta=1$, and for characteristic initial data of finite perimeter, we prove convergence on fixed time intervals to the time-independent initial patch in $BV(\Omega;\{0,1\})$. Because the sensitivity function is nonlinear in the density, weak convergence alone is insufficient to identify the chemotactic flux. Strong compactness of the density is therefore required in all three regimes and is obtained, respectively, through energy–entropy estimates, kinetic reduction, and $BV$ compactness.
Read the full abstract
Computation and Language
PetQA: Benchmarking Veterinary Knowledge and Clinical Reasoning
We introduce PetQA, a Korean long-form question-answering (QA) benchmark for evaluating veterinary knowledge and clinical reasoning in large language models (LLMs) and large vision-language models (LVLMs). PetQA contains 10,076 text-only and 8,751 multimodal QA pairs derived from real-world questions about dogs and cats, paired with answers from expert veterinarians. Its test split, PetQA-Bench, further includes annotations for question types and clinical conditions. We evaluate eighteen models using ROUGE, BERTScore, and LLM-as-a-judge metrics for factuality and helpfulness under three settings: zero-shot inference, retrieval-augmented generation (RAG), and supervised fine-tuning (SFT). The benchmarking results provide an overview of the strengths and limitations of current models in addressing veterinary clinical queries and highlight the need for more effective adaptation methods to develop clinically reliable AI systems for veterinary care. To facilitate broader use, we additionally provide translated versions of PetQA-Bench in five languages.
Read the full abstract
Earth and Planetary Astrophysics
Retrieving Ocean Glint Reflectance Signatures from Directly Imaged Earth-like Exoplanets
Future space telescopes searching for extraterrestrial life require methods to detect environments that can potentially support life. Liquid water is considered essential for life as we know it and its presence is therefore an important observable when characterizing potentially Earth-like exoplanets. Remotely inferring the presence of surface liquid water on a world from spatially unresolved observations is an outstanding challenge where the detection of ocean glint could provide supporting evidence. This study assesses the feasibility of detecting ocean glint from Earth-like exoplanets using simulated data from NASA's Habitable World Observatory (HWO). We conducted retrievals on these simulated observations using a model that included a glint contribution and performed model selection against retrievals that did not include glint. We find that over a range of spectral signal-to-noise ratios from 5 to 25, a phase angle of at least 120 deg is necessary for glint detection. Our results offer the opportunity to shape mission development by providing constraints on key telescope observing requirements.
Read the full abstract
Combinatorics
An Improved Upper Bound for Multicolour Ramsey Numbers
Let $R_r(k)$ denote the diagonal $r$-colour Ramsey number. We prove that there exist absolute constants $c,K>0$ such that $R_r(k)\le r^{rk}\exp\!\left(-c\frac{k}{r\log^2(2r)}\right)$ for every $r\ge2$ and every $k\ge Kr^2\log^6(2r)$. This improves the exponential saving in a recent bound of Yang and Mao by a factor of order $r\log^2(2r)$. The proof proceeds through an off-diagonal bound, which asymptotically improves the classical multinomial bound throughout a neighbourhood of the diagonal.
Read the full abstract
Differential Geometry
Michell-Prager type truss structures constructed from integrable discrete power function and discrete logarithmic function
The Michell-Prager type truss structures are constructed from the integrable discrete power and logarithmic functions. It is demonstrated that specific sublattices, subject to suitable boundary conditions, yield approximate Michell trusses, which are theoretically optimal structures achieving force equilibrium with material economy. The result of shape optimization minimizing the Michell functional is provided for numerical evidence of their optimality.
Read the full abstract
Materials Science
Initialization-free ultralow-power programmable spin-orbit torque logic devices enabled by chirally asymmetric switching
Spin logic is of great interest for the development of high-performance, non-Von Neumann artificial intelligence chips. Of particular advantage is the programmable spin-orbit torque logic that can achieve the complete set of the 16 Boolean logic operations within a single device in an initialization-free, low-power, and scalable manner, which is, however, a challenge despite remarkable efforts over more than two decades. Here, utilizing chirally asymmetric switching, we demonstrate an initialization-free, low-power, programmable spin-orbit torque logic device that is capable of the complete set of 16 Boolean logic operations within a single device with only three inputs and ultralow power of < 1 fJ/bit. We also propose the first initialization-free, all-electrical spin-based cascading computing devices, including a half adder, a three-level full adder, a two-level full adder, and a Transfer/NOT selector. These compact and scalable computing devices are enabled by the chirally asymmetric spin-orbit torque switching of a Ta/FeCoB bilayer with a significant perpendicular Dzyaloshinskii-Moriya interaction field. These results pave an intriguing way for the development of next-generation high-performance large-scale in-memory computing chips based on chirally asymmetric spin-orbit torque switching.
Read the full abstract
Machine Learning
GNN-Guided Graph Coarsening and Adaptive QUBO Penalties for the Capacitated Vehicle Routing Problem with Time Windows on a Quantum Annealer
Graph coarsening reduces the large Quadratic Unconstrained Binary Optimization (QUBO) formulations arising when vehicle-routing problems are solved by quantum annealing. Nearby customers with compatible time windows are merged into super-nodes, the reduced problem is solved, and the solution is expanded to the original graph. For the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW), existing coarsening heuristics require family-specific tuning and remain unreliable on random instances. We address these limitations on the Solomon benchmark using simulated annealing and a D-Wave Advantage2 processor. We first introduce adaptive penalty calibration. Uniform penalty scaling has little effect, whereas controlling the internal coefficient range substantially improves raw samples. Removing non-binding constraints, normalising binding ones, and scaling the remaining penalties reduces mean raw constraint violations from 33.0 to 0.06 at the same solver budget (p=3.7e-11, n=56). A variable-count-preserving control attributes this gain to conditioning rather than problem size. Second, we replace the hand-tuned merge score with a graph neural network (GNN) using one configuration across all families. At N=10, it achieves 100% feasibility across all Solomon families, including R-type (100% vs. 80% for the tuned heuristic). Across N=10,...,100, feasibility is 83% vs. 69%, with the GNN better or tied on 85/90 instance-size pairs. At N=80,100, the difference is significant (p=0.002; 25/25 pairs), while the QUBO remains approximately 5-6 times smaller. Finally, hardware experiments reproduce the conditioning effect at fixed logical variable count: feasible samples increase from 0.02% to 39% across 13 instances. Classical repair with local search remains a reference bound for end-to-end solution cost.
Read the full abstract
Computer Vision
Hidden In Plain Gaze: Gaze Representations as Privacy Controls for Utility and Re-identification Risk in XR
Intelligent extended reality (XR) systems increasingly use eye and head tracking to infer user intent, task, and attention, but the same signals can also reveal biometric identity. We study whether gaze data representation choice can serve as a lightweight privacy control at feature extraction, before adding perturbation or formal privacy mechanisms. Using the egocentric HoloAssist dataset, we compare three gaze representations under matched model capacity: raw gaze, spatial attention heatmaps, and engineered eye-movement features. We evaluate each representation on action recognition as task utility and closed-set user re-identification as privacy leakage. Representation choice substantially changes the privacy-utility tradeoff. Engineered features retain roughly 85% of raw gaze's action-recognition accuracy while reducing re-identification by about an order of magnitude, to roughly four times the chance rate across 206 identities. This reduction attenuates rather than eliminates identity leakage, and the differences across representations show that abstraction alone does not guarantee privacy. Engineered features expose interpretable and auditable structure, giving designers a transparent privacy lever that complements mechanisms such as differential privacy.
Read the full abstract
Metric Geometry
Balanced Support Calibrations for Moser's Worm Problem: Exact Certificate and Bound of Triangular Cover
Moser's worm problem asks for a planar region of minimum area containing a congruent copy of every rectifiable planar arc of length one. We study the Bellman's lost-in-a-forest problem escape path for the isosceles triangle \[ T=\text{conv}\{(-c,0),(c,0),(0,s)\},\qquad s=\frac{766}{\sqrt{625565}},\qquad c=\frac{197}{\sqrt{625565}}. \] The paper gives an exact positive four-source support calibration, a continuum to standard-polygonal reduction, a selected $\Lambda$-gap estimate, a corrected high-angle side-meeting argument, and exact finite ledgers. The original inner-anchor ledger covers 25 temporal orders: its 275 nonzero suffix states reduce to 13 exact squared norms and satisfy $\|R\|<27131/25000$. If either near anchor fails, a new delimiter-gap lemma produces one or two omitted hull edges whose normals range over an exact compact fan interval. A dependency-free rational replay checks 512 one-delimiter orders over 1540 signed half-angle intervals and 4096 two-delimiter orders over a finite signed rectangle cover. These three exhaustive branches give unconditionally \[ E(T)\ge D:=\frac{82074390584}{84861020075} =0.9671624323094728\ldots \] Hence, the convex universal cover of Moser's worm \[ \frac{\text{area}(T)}{D^2} =\frac{11511821678274125}{44639604443512928} =0.257883595112076188\ldots. \]
Read the full abstract
Computer Vision
Dual-Part Multi-Lateral Branched Network for Multi-Class Segmentation in Cardiovascular Catheterization Angiograms
Catheterisation image processing requires segmentation models that are fast, accurate and explainable. While most of the existing studies usually focus on binary segmentation, there is a recent demand for simultaneous segmentation of multiple structures found in catheterization scenes. In this study, a dual-part MLBNet architecture is designed with multi-lateral encoder blocks and multi-head decoder branches for class-aware segmentation in cardiovascular catheterization scenes. Lateral branches in the encoder enable repeated feature extraction to learn diverse shared representations, while multiple decoder heads are used to introduce class-skewed branches that specialize in different structural properties in catheterization scenes. To analyze the performances of the dual-part MLBNet architecture, several multi-class segmentation angiogram data obtained during cardiovascular catheterization in phantom models, synthetic human-simulated aorta, and animal model are used for model training and evaluation. Results obtained showed the dual-part models could effectively separate guidewire, catheter, vessels and background pixels to their classes of memberships with high probability. The results demonstrate that all models were able to distinguish the dominant background class from foreground structures with high overall accuracy.
Read the full abstract
Combinatorics
Quaternary Legendre Pairs of Lengths 42, 46, 52, 58, 66, 72, and 80
A quaternary Legendre pair of length $\ell$ is a pair of sequences over the fourth roots of unity whose periodic autocorrelations sum to $-2$ at every nonzero shift. Each such pair yields a quaternary Hadamard matrix of order $2\ell+2$ and a binary Hadamard matrix of order $4\ell+4$. Fourteen even lengths up to 100 remained open in the 2025 tables of Kotsireas, Koutschan and Winterhof and of Jedwab and Pender. We settle seven of them — the four smallest open lengths, 42, 46, 52, and 58, together with 66, 72, and 80 — and print every pair in full. Checking one takes a few lines of code and exact arithmetic over the Gaussian integers, so the main results can be confirmed without running any of our software. Each search writes a pair as four binary sequences under a Gray map, restricts to reflection-symmetric rows, imposes an exact spectral constraint at the midpoint frequency, and matches candidates meet-in-the-middle on their autocorrelation vectors; from length 52 onward, exact compression along divisor chains shrinks the search before any candidate is lifted. Everything is deterministic: no seed, heuristic stopping rule, or floating-point value enters an acceptance decision. At lengths 64, 70 and 76 the same machinery ran to exhaustion and found nothing: the reversible four-block queue built at each length contains no pair. These are exhaustions of a specific recorded queue, not nonexistence results, and the certificates do not by themselves establish that the queue captures every reversible object of its length. A closing section sorts every claim in the paper by what a reader must accept in order to believe it, and states exactly how far the accompanying artifacts support each one.
Read the full abstract
Optimization and Control
Stochastic Maximum Principle for McKean-Vlasov Control with Discrete Path Dependence
We study a class of McKean-Vlasov control problems with discrete path dependence. The coefficients and cost functional may depend on finitely many past values of the controlled state, observed at fixed deterministic times, and on their joint law. We establish well-posedness of the controlled state equation and derive necessary and sufficient optimality conditions through a stochastic Pontryagin maximum principle. The adjoint process is characterized by a backward stochastic differential equation with jumps at fixed observation times. Each jump represents the conditional sensitivity of future costs with respect to the corresponding observed state and its distribution. In the linear-quadratic case, we prove global solvability of the resulting forward-backward system by combining a continuation argument with a mean-field Riccati reduction. We finally discuss an application to time-series generation, where the terminal cost is given by a kernel-based discrepancy between the law of the sampled path and a target path distribution.
Read the full abstract
Optics
Band Gaps and Localization of Surface Waves at Hyperbolic Material and Topological Insulator Interfaces
We develop analytical criteria for surface electromagnetic waves at interfaces between hyperbolic materials and topological insulators. The analysis identifies propagation conditions, field penetration depths, and spectral band gaps. In the lossless model, the band edge is governed primarily by dielectric contrast, while the bulk topological coupling produces only a small shift and a weak correction to the dispersion. For structures combining hexagonal boron nitride with bismuth selenide, a thin topological insulator film on a dielectric substrate with low permittivity can substantially broaden the accessible propagation window. We also analyze a dissipative titanium and silicon hyperbolic effective medium interfaced with bismuth selenide. To make the complex branch structure visible, this lossy calculation uses an intentionally enhanced interface response and is therefore illustrative rather than a quantitative prediction for a conventional topological insulator. In the lossy case, a root of the dispersion relation represents a physical guided mode only when the fields decay away from the interface, attenuate consistently along the propagation direction, have finite penetration depths, and exhibit a consistent energy flow profile. Apparent gaps and jumps can occur when the complex quantities controlling transverse decay approach square root branch cuts. These results provide design guidelines for controlling dispersion, confinement, band gaps, and propagation loss in mid-infrared photonic structures.
Read the full abstract
Functional Analysis
Fixed Point Theorems for Paired Contractive Mappings in $b$-Metric Spaces
In this paper, we develop a fixed point framework for paired contractive mappings in complete $b$-metric spaces. We introduce the class of paired-Chatterjea contractions and establish a corresponding fixed point theorem. We further show that every Chatterjea-type contraction is a paired-Chatterjea contraction, whereas the converse implication does not hold, demonstrating that the paired formulation properly extends the Chatterjea-type class. Additionally, we establish a fixed point theorem for Paired contractions under the condition $\alpha\in[0,1)$, thereby extending the admissible range of the contraction constant from $[0,\frac1s)$ in Bouker et al.~(2026) to [0,1). Furthermore, we examine the Paired-Kannan fixed point result of Bouker et al.~(2026) and provide an example showing that the stated coefficient condition does not guarantee the claimed fixed point conclusion in $b$-metric spaces. Motivated by this observation, we establish a corrected Paired-Kannan fixed point theorem under a complete and appropriately formulated set of hypotheses. Under suitable contractive conditions, we prove that the contractions under consideration have fixed points if and only if they have no periodic point of prime period 2. Moreover, we show that each of these contractions has at most two fixed points. Several examples are presented to illustrate our results and distinguish the proposed paired contractive mappings from existing ones.
Read the full abstract
Programming Languages
JLIR: A Julia-Native MLIR-Inspired Intermediate Representation with Automatic JACC Kernel Extraction
The Multi-Level Intermediate Representation (MLIR) has made reusable compiler infrastructure practical for domain-specific computation. However, MLIR's strong compile-time type requirements and low-level (C++) extension model can be a poor match for high-level, dynamically specialized languages such as Julia. MLIR has several drawbacks for dynamic programming languages in terms of the type system and level of abstraction. It is thus extremely challenging for non-compiler or scientific computing users to introduce new programming abstractions and express algorithm implementations in a form that remains both natural and optimizable. As a result, library interfaces for linear algebra, mesh processing, partial differential equations, and related domains often sit outside the compiler optimization path. We present JLIR (Julia-native Level Intermediate Representation), a Julia-native intermediate representation framework that brings the main benefits of MLIR-style multi-level, dialect-oriented compilation into the Julia ecosystem while remaining usable as ordinary Julia code. JLIR represents Julia programs before low-level lowering, supports extensible operations and transformation passes through Julia's language mechanisms, and allows partially typed programs to remain transformable until concrete types are known. The framework includes built-in dialects for arithmetic, control flow, functions, structured loops, and memory operations, and it also includes a lightweight mechanism for adding new domain operations without modifying the core system. To demonstrate JLIR's capabilities, we applied it to automatic Julia for Accelerators (JACC) kernel generation.
Read the full abstract
Analysis of PDEs
Linear Growth and Nonlinear Stability of Two-Dimensional MHD Couette Flow with Vertical Dissipation
We study the two-dimensional incompressible magnetohydrodynamic system near the Couette equilibrium $\bigl((y,0)^{\rm T},(\beta,0)^{\rm T}\bigr)$ on $\mathbb T\times\mathbb R$, in the anisotropic regime where both viscosity and magnetic diffusivity act only in the vertical direction. For the inviscid linearized problem with $|\beta|>1/2$, we prove sharp linear-in-time growth of the vorticity and current density at the level of the time rate. In contrast, the horizontal components of the velocity and magnetic perturbations remain uniformly bounded, while the vertical components exhibit quantitative inviscid damping at the rate $\langle t\rangle^{-1}$. For the nonlinear problem, we introduce shear-adapted Fourier multipliers that simultaneously capture enhanced dissipation, critical-time effects, and echo-type resonant interactions. Under a suitable horizontal background magnetic field and a quantitative compatibility condition between the magnetic field strength, viscosity, and magnetic diffusivity, we establish global nonlinear stability for divergence-free perturbations satisfying $ \left\| \bigl( \mathbf v_{\rm in}-(y,0)^{\rm T}, \mathbf H_{\rm in}-(\beta,0)^{\rm T} \bigr) \right\|_{H^N} \leq \varepsilon_0\min\{\mu,\nu\}^{1/2}, N\geq4$. Moreover, the nonzero horizontal Fourier modes decay in a shear-adapted $H^N$ norm at the enhanced-dissipation rate $e^{-c\min\{\mu,\nu\}^{1/3}\,t},$ and the vertical velocity and magnetic components gain an additional inviscid-damping factor $\langle t\rangle^{-1}$.