Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Sunday 13 September

Optics

Square-shaping of sturdy optical vortex droplets in quasi-phase-matched photonic crystals

We elaborate a scheme for controllable shaping of self-trapped vortex states in a quasi-phase-matched three-dimensional photonic crystal with the combination of self-focusing quadratic and defocusing cubic material nonlinearities. The setting gives rise to sturdy droplet-like vortex modes, capable to adapt to externally imposed strong geometric constraints. The application of a square-shaped modulation in the transverse $\left(x,y\right) $ plane and periodic quasi-phase-matching to the quadratic nonlinear coefficient $d_{z}$ along the propagation direction $z$ leads to the formation of square vortex droplets (VDs) with fourfold rotational symmetry ($C_{4}$). These states preserve the vortical phase circulation and exhibit robust propagation in a broad parameter region. In the oversaturated regime dominated by the cubic self-defocusing, the square-shaped VDs obey the anti-Vakhitov–Kolokolov stability criterion. The results, which are produced, chiefly, for the VDs with topological charge $S=1$, and also, in a partial form, for $S=2$ and $4$, reveal an unexpected universality: the vortex robustness is not contingent upon the circular symmetry. Thus, the combination of the competing nonlinearities and geometric confinement provides not only an effective method for the formation of self-trapped vortex states, but also new insight into generality of the topological protection in nonlinear optical fields.
Read the full abstract

All authors Xuening Wang, Yimin Zhang, Qiuyi Ning, Bin Liu, Li Zhang, Hexiang He, Boris A. Malomed, Yongyao Li

Analysis of PDEs

On passive recovery of structured elastic density and initial states

We study simultaneous recovery of the (variable) mass density, initial displacement, and initial velocity for the three-dimensional isotropic elastic wave equation with known constant Lamé parameters. The data are the complete displacement trace on an enclosing boundary. We first assume that the density-weighted initial displacement and velocity have fixed known profiles in one spatial direction. The $s^0$ and $s^1$ coefficients of the zero-frequency Laplace expansion identify these weighted states. The $s^2$ and $s^3$ coefficients then give static Lamé orthogonality identities for the density difference. The exact difference expansion through order $s^3$ has an $O(s^4)$ remainder, uniformly on bounded spatial sets and bounded density-contrast and weighted-state classes. Under alignment of the two initial states and a nonzero moment of the density-weighted initial velocity, the two density identities reduce to a constant-vector static transform. Two opposite elastic null phases give uniqueness for one or two fixed vertical density profiles when the profile family is two-sided Laplace nondegenerate. When $\lambda+\mu\ne0$, each nonzero normal root has partial multiplicities $2$ and $1$ and admits a length-two Jordan chain. The associated polynomial–exponential Lamé mode produces derivatives of the bilateral profile transforms. The resulting Hermite–Laplace system gives uniqueness for aligned classes with up to four fixed vertical profiles and independent horizontal coefficients, provided that the profile system is Hermite–Laplace nondegenerate. Distinct translations of one compactly supported profile provide an explicit four-profile class. We also prove rigidity of the alignment reduction and exhibit an infinite-dimensional kernel for the reduced transform on unrestricted densities.
Read the full abstract

Computational Engineering

Topology optimisation of adsorption beds for cost-effective direct air capture

The performance of adsorption systems is sensitive to the geometry of the adsorbent. To achieve feasibility for large-scale implementation of CO2 direct air capture systems in line with the latest Intergovernmental Panel on Climate Change objectives, significant improvements to current adsorption systems must be made. In this study, we employ a topology optimization to the macrostructure of a swing adsorption bed using an experimentally verified numerical model. We unveil a simple blunted cone design, which achieves an estimated cost range of \$49-116/t-CO2 removed from the atmosphere for the system. This represents an improvement over the benchmark monolith design, which incurs a cost of \$75-140/t-CO2 considering the same process parameters.
Read the full abstract

All authors Connor Mallon, Aaron Thornton, Matthew Hill, Santiago Badia, Nora Grutering

Distributed Computing

Partition-Aware Scheduling for Mobile Heterogeneous Inference Co-Execution

Modern mobile inference runs on heterogeneous platforms combining mobile GPUs with multiple CPU core clusters. Existing optimizations typically exploit either inter-operator parallelism, by assigning entire operators to CPU cores or to the GPU, or intra-operator parallelism, by partitioning each operator for CPU-GPU co-execution. We consider these two forms of parallelism together, to improve inference latency of tasks that can be represented by a static DAG of operators with predefined input/output tensor shapes (e.g., CNNs or vision transformers). We define the problem of partition-aware DAG scheduling for mobile heterogeneous inference, illustrating that the best strategy depends on the structure of the inference DAG, thus motivating a joint formulation capturing operator partition choices, device assignment, and execution order. We propose an online iterative search framework, which decomposes large DAGs into stages, focuses search on critical operators, and uses latency predictors to estimate partitioned execution without exhaustive profiling. Across representative mobile inference workloads, our approach achieves latency close to an offline solution while keeping scheduling overhead to a fraction of the model initialization cost, allowing platform-specific scheduling at deployment time.
Read the full abstract

Mathematical Finance

Gaussian Normalized Coordinates and Risk-Neutral CDF Deformations

Normalized implied-volatility coordinates reveal no-arbitrage structure that is less transparent in strike space. This paper centers on a single quantity that gives those coordinates a direct probabilistic interpretation.

Distributed Computing

ECAS: An Edge-Controlled Agentic System for Validation-Gated Scientific Application Execution

Scientific applications increasingly rely on high-performance computing (HPC), yet translating a scientist's high-level goal into a correct target-scale execution remains brittle and labor-intensive. Large language model (LLM) agents promise to automate this, but two obstacles remain: granting a cloud-hosted model direct HPC access exposes credentials and execution authority, while withholding it demands continuous human supervision; and one-shot generation cannot adapt when generated artifacts fail in a site-specific HPC environment. We present ECAS, an Edge-Controlled Agentic System for closed-loop execution of scientific computing campaigns with limited human intervention. ECAS separates reasoning, control, and execution: a cloud-hosted LLM proposes plans, artifacts, and repairs; a user-controlled edge agent retains credentials, workflow state, and execution authority while enforcing policy and resource constraints; and the HPC system computes. Its core mechanism is validation-gated execution: generated artifacts pass static checks and small-scale validation, failures trigger repairs from sanitized execution feedback, and target-scale execution is permitted only after validation and policy checks pass. ECAS also draws on an edge-resident library of expert-distilled, site-specific skills that is never disclosed to the cloud. In preliminary experiments with three scientific applications on two production ALCF systems under six injected fault types, closed-loop repair improves application success from 0/6 to 6/6 over one-shot generation, validation gating prevents all three observed target-scale failures, and skill conditioning improves success from 4/6 to 6/6. These results show the feasibility of delegating adaptive reasoning to the cloud while retaining execution control at the edge.
Read the full abstract

Cryptography and Security

Enc53: DNSSEC-Anchored Stateless Tickets for Post-Quantum Authoritative DNS

DNSSEC authenticates RRsets, but does not provide endpoint authentication or channel security. DNS-over-TLS (DoT) and DNS-over-QUIC (DoQ) can facilitate such needs, but were designed for the stub-to-resolver hop, where stable long-lived connections amortize the expensive initial setup. The recursive-to-authoritative path's high fan-in and nonuniform per-resolver query frequency invert said dynamics. Post- quantum primitives further sharpen this mismatch: an ML-DSA WebPKI certificate chain crosses TCP's initial window, a cold PQ DoQ may incur up to about 140 times the total bytes of the same query over UDP. A survey of TLD and 2LD nameservers further bounds connection lifetimes, with almost half surveyed imposing limits on even non-idle connections. We present Enc53 – a stateless session ticket protocol enabling efficient authenticated authoritative DNS encryption. Enc53 splits DNS encryption into 2 phases: a short-lived, DNSSEC-anchored, TLS- authenticated provisioning on the initial query in the 1st, and a steady state of 1-RTT AEAD-encrypted UDP DNS queries in the 2nd. Enc53 is server-side stateless: recursive resolvers hold the traffic secret and session ticket, authoritative nameservers hold only a symmetric STEK. We implemented Enc53 in Knot DNS. After provisioning, a steady state Enc53 exchange costs about 570 B – roughly 3 times a plain UDP query – and lands within 1 ms of the unencrypted UDP baseline. Resumed PQ-ADoT pays 7.7 times the bytes and 3 times the latency; resumed PQ-ADoQ pays 10 times the bytes for the same latency. When evaluated against a root server query trace, Enc53 achieves 2-fold compute efficiency over ADoT/ADoQ, 3-fold memory efficiency over ADoT, and 12-fold memory efficiency over ADoQ. Finally, when deployed in conjunction with FN-DSA-512 PQ-DNSSEC, the joint Enc53-DNSSEC UDP datagram remains below the 1232B buffer limit.
Read the full abstract

Mathematical Physics

Pauli Supported Invariants for Periodic Graphs-Derived Hamiltonians

We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods. Given a rooted h-hop neighborhood, we construct a local adjacency operator, embed it into a common Hilbert space dimension, and define its Pauli-support set as the collection of Pauli strings appearing with nonzero coefficients. For periodic graphs, we prove invariance under lattice-compatible graph equivalence and establish converse results under root-separation hypothesis. The framework naturally extends to Lie closures, commutants, and Cartan-type structures generated by the associated Pauli supports. We further discuss extensions to aperiodic graphs with finite local complexity and make connections to cut-and-project models of quasicrystals and notably, Penrose tilings. From a quantum information perspective, the resulting invariants provide a operator-theoretic description of graph-based Hamiltonians and offer a new mechanism for comparing graph-based quantum systems through Pauli-support data.
Read the full abstract

All authors Sarah Chehade, Andrew Vlasic, Rebekah Herrman, Rick Mukherjee

Robotics

ITA-LaCAM: A Complete and Scalable TAPF Solver via Assignment-Aware Configuration-Space Search

Combined Target Assignment and Path Finding (TAPF) requires assigning targets for agents while simultaneously planning collision-free paths. We present ITA-LaCAM, a complete and scalable TAPF solver inspired by LaCAM and ITA-CBS. In ITA-LaCAM, each joint-configuration node carries an agent-to-target matching. When a successor is generated, ITA-LaCAM incrementally repairs the matching for the agents that moved and uses the targets to guide PIBT successor generation. This design enables adaptive reassignment without explicitly enumerating the combinatorial assignment space, while preserving LaCAM's completeness and scalability. Across 9,760 benchmark instances on eight maps with 5–200 agents, ITA-LaCAM solved 100% of the instances, compared with 95.6% for IR-TAPF configured with DBS-Hungarian. ITA-LaCAM found an initial solution faster in 84.0% of the comparisons and achieved a lower sum of costs in 65.0% of the instances solved by both methods.
Read the full abstract

All authors Yimin Tang, Han Zhang, Shao-Hung Chan, Junsoo Kim, Erdem B{\i}y{\i}k, Sven Koenig, Jingkai Chen

Computation and Language

Learning to Refer from Estimated Listener Gaze

We propose to finetune vision-language models to generate more pragmatically optimal referring expressions by transforming observations of incremental listener comprehension, in the form of gaze scanpaths, into learning signals. During training, referring expressions are sampled from the speaker policy being optimized, conditioned on images and target referents; then, a neural listener estimating human gaze behavior maps from images and sampled referring expressions to scanpaths, each represented by a sequence of fixations, with each fixation corresponding to a word in the referring expression. We experiment with several approaches to convert fixation sequences and target referents into token- and sequence-level rewards, which are used to optimize policy parameters. Through evaluation with human listeners, we find that speaker policies trained with gaze-estimating listeners result in significantly more pragmatically-optimal references than base models, reducing sequence length from 15.4 down to 4.0 words while increasing referential success from 75.2 up to 80.0%. Our work demonstrates a promising opportunity for learning to generate utterances through language-based interaction, not only from the explicit signal of communicative success, but also from implicitly-available observations of a listener's process of comprehension.
Read the full abstract

Differential Geometry

The two cubic separable minimal surfaces: $\mathcal D_1\mathcal D_2\mathcal D_3=1$ and $\mathcal C_1+\mathcal C_2+\mathcal C_3=3\,\mathcal C_1\mathcal C_2\mathcal C_3$

A minimal surface in $\mathbb{R}^3$ is $\textit{separable}$ if it is the zero set of $f(x)+g(y)+h(z)$, and $\textit{isotropic}$ if moreover $f=g=h$. We announce that there are exactly two non-planar isotropic separable minimal surfaces up to homothety and rigid motion, that they are conjugate, and that they are Schwarz's diamond surface $\mathrm{D}$ and Schwarz's primitive surface $\mathrm{P}$. In lattice-normalized coordinates their implicit equations are \[\mathrm{D}:\; \mathcal{D}(x)\mathcal{D}(y)\mathcal{D}(z)=1,\] \[\mathrm{P}:\; \mathcal{C}(x)+\mathcal{C}(y)+\mathcal{C}(z) =3\,\mathcal{C}(x)\mathcal{C}(y)\mathcal{C}(z),\] where $\mathcal{D}(t)=\frac{\operatorname{sn}\operatorname{dn}}{\operatorname{cn}}(K[\frac{1}{4}]t,\frac{1}{4})$ and $\mathcal{C}(t)=\operatorname{cn}(2K[\frac{3}{4}]t,\frac{3}{4})$. The first equation is classical – it is due to Schwarz, later Cayley, and appears in Nitsche's $\textit{Lectures}$ – we identify Nitsche's transcendental function exactly as $\operatorname{sn}\operatorname{dn}/\operatorname{cn}$ at parameter $\frac{1}{4}$. The second appears to be new; it is the symmetric member of the two-parameter family of Kim and Ogata (2024), and it proves their assertion that the family contains $\mathrm{P}$. Both surfaces are governed by one differential equation with two signs, \[\varphi'^{\,2}=1+2\cosh 2\varphi\ \ (\mathrm{D}),\] \[\varphi'^{\,2}=1+2\cos 2\varphi\ \ (\mathrm{P}),\] the two signs of the separation constant of the classical reduction; and in that common normalization the two lattice periods are $2K[\frac{1}{4}]$ and $2K[\frac{3}{4}]$, whose ratio is Schwarz's 1866 constant $K'[\frac{1}{4}]/K[\frac{1}{4}]=1.2792615...$, the necessary scale ratio for a conjugate pair. Proofs will appear in [D, P].
Read the full abstract

Computational Engineering

CAST: A Cross-Asset State-Space Trading System for Drawdown Control in Stock Markets

Managing drawdown, the peak-to-trough decline in an investment portfolio's value, is a precondition for long-term survival in practical investment management. However, mainstream stock forecasting methods predominantly optimize returns or Sharpe ratios under the independent and identically distributed (i.i.d.) assumption. Real markets do not follow this assumption, triggering catastrophic drawdowns. We propose a cross-asset state-space trading system (CAST), consisting of two components: The predictor, Cross-Asset Collaborative Kalman Filter (CoKF), estimates each asset's latent state online, coupling all assets through their correlations and adaptively fusing multiple integrated-random-walk orders. The controller, Model Predictive Control (MPC), converts the predictor's forecast into trades, using forecast uncertainty as an explicit risk penalty that controls drawdown. We evaluate CAST on four real-world stock markets over a 15-year test window and show that it consistently occupies the return-drawdown Pareto frontier, achieving strong risk-adjusted performance while maintaining substantially lower maximum drawdown than competitive baselines. A stress test across crisis periods further demonstrates robust behavior under market shocks and distribution shift. Because the predictor and controller interact only through the predicted price path, both are plug-and-play, making CAST a modular, interpretable trading system. The code is available at https://github.com/FanBroWell/CAST
Read the full abstract

High Energy Astrophysical Phenomena

The LGRBs Redshift and Jet Opening Angle Distributions and the Hubble Constant $H_0$

Using the Swift-Perley sample, Le, Ratke, & Mehta performed a study of the rate density of LGRBs with an assumed broken power-law GRB spectrum. They obtained a GRB-burst-rate functional form that fits the preSwift~and Swift~redshift cumulative distributions at all redshifts with an assumed Hubble constant of $H_0 = 72 \, {\rm km \, s^{-1} \, Mpc^{-1}}$. Further analysis indicated that the cumulative redshift distribution is weakly sensitive to variations in the Hubble constant $H_0$, whereas the corresponding differential burst-rate distribution exhibits greater sensitivity. In this paper, we extend this analysis by comparing model predictions for different values of $H_0$ with the observed cumulative and differential redshift and jet-opening angle distributions, while adopting the same GRB framework and observational samples. We find that both the cumulative and differential distributions depend only weakly on variations in $H_0$, and the model predictions using $H_0 \approx 68 - 80 \, {\rm km \, s^{-1} \, Mpc^{-1}}$ provide agreement with the observed LGRB distributions.
Read the full abstract

Quantum Physics

Trace-Norm Overlaps of Quantum States: Interpolation, Equality, and Data-Processing Rigidity

Let $\rho$ and $\sigma$ be density operators on a separable Hilbert space. For $0<\alpha<1$, we study the directed trace-norm overlap $\Phi_\alpha(\rho,\sigma)=\|\rho^\alpha\sigma^{1-\alpha}\|_1$ and its symmetrized form $\mathcal F_\alpha(\rho,\sigma)=\frac12\bigl(\Phi_\alpha(\rho,\sigma)+\Phi_{1-\alpha}(\rho,\sigma)\bigr)$. At $\alpha=\tfrac12$, both quantities coincide with the root Uhlmann–Jozsa fidelity. Our aim is not to introduce a new notion of fidelity, but to understand how these overlaps vary with the parameter and when equality occurs in the resulting inequalities. We first prove that $\alpha\mapsto\Phi_\alpha(\rho,\sigma)$ is log-convex. This yields a sharp lower bound for $\mathcal F_\alpha$ in terms of the root fidelity, together with a stronger intermediate geometric-mean bound. We also show that $\Phi_\alpha$ is the trace functional $Q_{\alpha,1/2}$ associated with the $\alpha$-$z$ Renyi divergence, which connects the directed overlap with the known $\alpha$-$z$ Renyi theory. We then determine the exact data-processing behavior of the symmetrized family. Universal monotonicity under quantum channels holds only at $\alpha=\tfrac12$; for every other value of $\alpha$, it already fails under diagonal pinching of faithful real qubit states. In finite dimensions, we give a complete spectral description of the equality cases and provide explicit noncommuting examples. We also discuss some natural questions about overlap-preserving maps. Finally, we prove that the difference between the Petz overlap and the directed trace-norm overlap vanishes exactly when $\rho$ and $\sigma$ commute, without requiring either faithfulness or any additional support assumption.
Read the full abstract

Number Theory

Mahler's Problem on Liouville Numbers I. Analytic Rigidity

In 1984, Mahler asked whether a transcendental entire function can map the set of Liouville numbers $\mathscr{L}$ into itself. We answer this question in the negative by proving a local rigidity theorem for real-analytic functions. More precisely, if $U\subset\mathbb{R}$ is an open interval and $f:U\to\mathbb{R}$ is real-analytic with $f(\mathscr{L}\cap U)\subseteq\mathscr{L}$, then $f$ is the restriction to $U$ of a rational function in $\mathbb{R}(x)$. Quantitatively, there exists an absolute constant $\tau>2$ such that, for every nonrational real-analytic function $f$ and every nonempty open subinterval $V\subset U$, the set of $\xi\in V\cap\mathscr{L}$ satisfying $\mu(f(\xi))\leq\tau$ contains a Cantor set. The proof combines a two-height counting estimate near analytic graphs with a nested-interval construction.
Read the full abstract

Probability

Correlation comparisons and critical curves for disordered XY models

We prove a lower comparison for disorder-averaged ferromagnetic XY correlations: independent nonnegative random couplings $K_e$ can be replaced by $-\frac12\log\mathbb{E}e^{-2K_e}$. Ginibre's inequality makes each normalized correlation convex in $1-e^{-2K_e}$, so conditional Jensen and thinning compare Bernoulli bond densities; two star-wise Jensen passes handle site dilution on bipartite graphs. Together with the phase-existence theorem of Dario and Garban, these comparisons give local Lipschitz regularity of both the averaged algebraic-phase and susceptibility-divergence thresholds throughout the supercritical density intervals on $\mathbb{Z}^2$. The clean finite-domain criterion of van Engelenburg and Lis also yields explicit finite-size susceptibility lower bounds in a weak-dilution region. For bounded centered bond noise, the possible suppression of the algebraic-phase temperature is at most quadratic in the noise amplitude. Finally, at finite positive thresholds we prove total-variation continuity for bounded iid coupling laws whose essential supremum equals the common support cap, with local Lipschitz control when the reference law has an atom at that cap.
Read the full abstract

Geometric Topology

Torus knots as loop-edges in three-sphere triangulations

We present a procedure that, given a pair of coprime integers, produces a one-vertex triangulation of the three-sphere containing the corresponding torus knot as an edge. The construction is canonical, and produces a three-sphere triangulation from a pair of minimal layered triangulations of the solid torus. The size of the triangulation is, in the worst case, linear, but can be as small as logarithmic in the crossing number of the knot, motivating this triangulation size as an organising principle for knots, alternative to the crossing number.
Read the full abstract

General Relativity and Quantum Cosmology

From massless wormholes to massive black bounces: Shadows and multiple light rings

We develop a general framework for constructing massive black bounce geometries from massless wormhole seeds by introducing a position-dependent mass function while preserving the underlying areal-radius profile. We apply this procedure to the generalized Ellis-Bronnikov wormhole and obtain a new family of generalized Bardeen-like black bounce space-times, which continuously interpolates between traversable wormholes and regular black holes. We investigate the motion of massive particles and photons and show that, in contrast with the simpler orbital structure of the massless generalized Ellis-Bronnikov geometry, the generalized Bardeen-like space-time can exhibit multiple circular orbits and a rich light ring structure, including configurations with two unstable circular photon orbits separated by a stable one. We determine the corresponding photon sphere and shadow radii and compare our predictions with Event Horizon Telescope observations of Sgr A*, deriving observational constraints on the parameter space of the model. We further investigate the optical appearance produced by a geometrically and optically thin accretion disk through ray tracing. Multiple light rings generate characteristic nested structures in the high-resolution intensity profiles, whose relative brightness is strongly affected by the mass deformation and gravitational redshift. However, after modeling the finite angular resolution of the EHT with a Gaussian beam convolution, these fine structures are largely washed out, revealing a strong observational degeneracy between these exotic compact objects and standard black hole geometries at current EHT resolution.
Read the full abstract

All authors G. Alencar, Kirill A. Bronnikov, T. M. Crispim, Diego Sáez-Chillón Gómez, Marcos V. de S. Silva

Robotics

Novel Ex-vivo Calf Brain Model with Integrated Sub-Skull Force Sensors to Access Simulated Neurosurgical Procedures

Surgical tissue manipulation demands precision; however, tool-tissue manipulation force magnitudes under realistic conditions are rarely quantified. To address this gap, we proposed and validated a portable ex-vivo force-sensing platform that measures tool-tissue interaction forces across the skull-brain interface during simulated neurosurgery. The system involves fresh calf brain tissue, used as a biological surrogate for brain parenchyma, placed in a 3D-printed human skull model equipped with a 6 degree-of-freedom force/torque sensor and a real-time data acquisition system. Five validation protocols assessed the accuracy and dynamic fidelity of the platform against ground-truth measurement, static accuracy and linearity using calibrated weights (0.5-50 g), minimum detectable force, spatial consistency across different anatomical regions, effect of surgical draping, and long-duration stability. Across protocols, measured forces showed excellent agreement with reference loads (correlation R = 0.9997), with RMSE < 0.005 N and mean relative error under 2%. The platform reliably detected low-magnitude forces down to 1 g (9.8 mN), while surgical drapes introduced no meaningful signal distortion and prolonged recordings exhibited minimal drift. Overall, the proposed framework provides objective, high-fidelity force quantification for skill training and performance assessment using fresh calf brain tissue and may serve as a foundation for force-based evaluation across other surgical procedures. Future work will integrate clinically used surgical instruments to increase procedural realism and will progress toward clinical trials to evaluate usability, educational impact, and translational relevance in practice-adjacent settings.
Read the full abstract

All authors Hamad Binhammad, Matheus Ballestero, Mohammed Babgi, Seana Shaka, Nima Hemati, Rothaina Saeedi, Aiden Mazidi, Bianca Giglio, Rukun Dou, Houssem-Eddine Gueziri, Amir Hooshiar, Rolando F. Del Maestro

Quantum Physics

Fast CZ gate in hybrid fluxonium-transmon systems with tunable couplers

Hybrid superconducting architectures combining different types of qubits offer a promising platform for exploiting their complementary advantages, yet high-fidelity entangling gates remain challenging because of strong nonlinearities and residual qubit-qubit interactions. Here, we propose a high-fidelity controlled-Z (CZ) gate for a hybrid circuit comprising a fluxonium qubit, a fixed-frequency transmon qubit, and a flux-tunable transmon coupler. By modulating only the external magnetic flux applied to the coupler, the qubit-qubit interaction is dynamically engineered for conditional-phase accumulation while the residual interaction is suppressed at idle, mitigating spectator-induced errors. We employ a low-dimensional Fourier-cosine pulse parameterization and a physically motivated cost function to independently suppress conditional-phase errors and leakage from the computational subspace. Numerical simulations demonstrate that a microwave-free CZ gate can be realized within $25 \mathrm{ns}$, with an average gate fidelity exceeding $99.99\%$ and leakage below $10^{-5}$. Using experimentally relevant superconducting-qubit parameters and accounting for decoherence, the proposed scheme maintains a CZ-gate fidelity of approximately $99.9\%$. We further extend the analysis to larger coupled architectures and find that the CZ-gate infidelity remains below $10^{-4}$ in the presence of spectator qubits. These results establish single-parameter flux control as a simple and robust approach for realizing high-fidelity entangling gates in heterogeneous superconducting quantum architectures.
Read the full abstract

All authors Peng Xu, Yunlong Wang, Yuechen Mu, Ling Jiang, Peng Zhao, Shengjun Wu, Xiaohong Yan

Numerical Analysis

Controlled B-series, controlled Runge-Kutta methods and controlled rough differential equations

We develop controlled B-series and controlled Runge-Kutta methods as extensions of classical B-series and Runge-Kutta theory to controlled-driven rough differential equations. The driving signal is a path controlled by an underlying $\alpha$-Hölder step-$2$ rough path, with $\alpha\in(1/3,1/2]$, as arises when the output of one rough system drives another. Controlled B-series retain the classical rooted-tree and elementary-differential structure, while incorporating driver-dependent coefficients defined recursively through controlled rough integration. We establish finite-order expansions of the exact solution and its controlled Runge-Kutta approximation, and derive corresponding tree-based order conditions. Under suitable smoothness, solvability, stability, and boundedness assumptions, matching through tree order $p$ yields local error $O(|t-s|^{(p+1)\alpha})$ and global error $O(h^{(p+1)\alpha-1})$, provided $(p+1)\alpha>1$. The standard rough differential equation formulation is recovered when the controlled driver is the reference path itself, and the classical time-driven case recovers the usual B-series and Runge-Kutta methods. We further construct a simplified method using only increments of the controlled driver. Segmentwise canonical lifting of its piecewise linear interpolation gives explicit tree coefficients and reduces the third-order conditions to the classical ones. Assuming a Wong-Zakai solution-approximation rate $r_0>0$, the simplified method has global error $O(h^{\min\{r_0,(p+1)\alpha-1\}})$. Numerical experiments with fractional Brownian controlled drivers illustrate the resulting convergence behaviour.
Read the full abstract

Saturday 12 September

Artificial Intelligence

Who May Overrule the Agent? Evidence-Gated Authority in LLM Review Institutions

Multi-agent language-model systems often add a reviewer to improve an upstream agent's decision. Yet a reviewer can both repair errors and replace decisions that were already correct. We study this as a problem of institutional jurisdiction: conditional on the same proposal, task information, model, and review output, when is the reviewer authorized to make its recommendation binding? We compare broad override authority with an evidence gate that permits replacement only after the reviewer produces a mechanically valid record of a binding-constraint violation and a compliant repair. Across two locally run open-weight models, 96 spatial-policy tasks, and a 96-task portfolio-transfer benchmark, the gate sharply reduces corruption of correct proposals while retaining most repairs of violations. The directions of this tradeoff are partly implied by the rule; its magnitude depends on reviewer transitions and upstream proposal states. A prospective validation then gives the reviewer an explicit choice to retain, replace, or escalate. This eliminates correct-proposal corruption for Qwen, but Mistral still replaces all 48 correct proposals; Qwen also declines every welfare-only repair that Mistral frequently attempts. Thus interface design changes reviewer behavior but is not a model-independent safeguard. The result is not that restricted review is universally better. It is that reviewer competence, action interface, and binding jurisdiction jointly determine both the correction domain and the corruption surface.
Read the full abstract

Statistics Applications

Reconstructing the Human Development Index at the Individual Level from Survey Microdata: Development and Validation of a Methodology

This study proposes and validates a methodology for reconstructing the Human Development Index (HDI) from individual-level survey microdata, enabling disaggregated estimates for demographic subpopulations while maintaining coherence with the official HDI. Data from 40,185 respondents in 21 countries from the European Social Survey (ESS7, 2014) were analysed, combined with World Bank indicators for life expectancy, gross national income per capita, and expected years of schooling. The health dimension was estimated from national life expectancy, adjusted by self-rated health; income, by a lognormal multiplier calibrated by the Gini coefficient; and education, by combining observed and expected years of schooling. The dimensions were aggregated by geometric mean, weighted by sampling weights, with confidence intervals estimated via the delta method. Among the 39,706 individuals with valid data (98.8%), the reconstructed HDI showed high agreement with the official 2014 HDI, with a mean absolute error of 0.0099 and a Pearson correlation of 0.917. Consistent differences across subgroups evidenced the methodology's convergent validity and its capacity to produce disaggregated estimates of human development, expanding the HDI's potential for analyses of socioeconomic and demographic inequalities.
Read the full abstract

Probability

Accelerating Langevin Dynamics with Weighted Laplacian Flow: Global Well-Posedness and Exponential Convergence

We study an accelerated Langevin equation in which the classical overdamped Langevin drift is supplemented by a nonlocal gradient velocity determined through a target-weighted Poisson equation. The target $p$ is only assumed to be strictly positive and need not be normalized. Writing the dynamics in terms of $\omega=\log(p/q)$ yields a coupled parabolic-elliptic system whose parabolic component contains the usual Langevin diffusion, whereas the elliptic component generates a global transport. The system is invariant under multiplication of $p$ by a positive constant. On a bounded smooth domain with homogeneous Neumann boundary conditions, we establish global existence and uniqueness of classical solutions for strictly positive $C^{2+\alpha}$ target weights and compatible $C^{2+\alpha}$ initial data. For long-time behavior, the oscillation of $\omega$ decays at the explicit rate $e^{-t}$ and the solution density exponentially converges to target density. Moreover, an exact entropy-dissipation identity holds relative to the target density, in which the relative Fisher information and the Jeffreys divergence give the two dissipation mechanisms associated with the Langevin and weighted-Poisson components. In particular, KL divergence also converges to zero with rate $e^{-t}$ without a convexity assumption on the target.
Read the full abstract

All authors Ziyue Cai, Weiye Gan, Borui Miao, Zuoqiang Shi

General Relativity and Quantum Cosmology

Signature Failure and Minimum Spatial Quanta: Shear-Induced Quantum Boundaries for Gravitational Path Integrals

We investigate whether quantum metric fluctuations can destroy the differentiable Lorentzian support required for spacetime. We conjecture that non-Lorentzian metric elements are absent from the physical manifold and restrict admissible histories to a single continuing, causally connected four-dimensional geometry. To explore this proposal, we extrapolate the Gaussian transverse-traceless graviton vacuum to an additive metric ensemble with physical Fourier cutoff $k_{\max}=1/q$. A lattice model with local repair and selection of periodically winding differentiable-state components gives a minimum surviving scale $q_{\min}\simeq1.9\,\ell_{\rm P}$ over the simulated duration. We then examine two complementary curvature-induced deformations. For the Schwarzschild electric Weyl field, the smallest boundary radius at the center of a black hole, occurring when $q\simeq2.5\,\ell_{\rm P}$, is $r_{\rm qb}\simeq2.62\,C_W^{1/3}(r_g\ell_{\rm P}^2)^{1/3} \simeq1.91\times10^{-22}\, C_W^{1/3}\left(\rm M/\rm M_\odot\right)^{1/3}\mathrm{m}$, where $r_g=GM/c^2$ and $C_W$ parameterizes the finite-$q$ Weyl response. For homogeneous radiation, a supplementary Gaussian four-metric ensemble subject to linearized de Donder conditions gives $\rho_{\rm qb}/\rho_{\rm P}\simeq1.31\times10^{-2}/C_R$ at $q=2.5\,\ell_{\rm P}$, where $C_R$ is the corresponding Ricci-response coefficient. The local homogeneous criterion is unchanged under reversal of the expansion rate. These model-dependent thresholds motivate a possible replacement of classical singular continuations by finite-curvature quantum boundaries.
Read the full abstract

Neurons and Cognition

Causal discovery identifies pathways linking physical activity to dementia risk in the UK BioBank

Physical Activity (PA) is consistently associated with lower risk of dementia, yet the mechanism linking PA to dementia prevention remain incomopletely understood. Here, we integrate large language model (LLM)-guided causal discovery with mediation analysis in 42,293 older adults aged 60 years or older from the UK Biobank to systematically identify pathways connecting objectively measured moderate-to-vigorous physical activity (MVPA) to dementia risk. Across behavioral, psychological, functional, and clinical domains, causal discovery consistently identified interconnected pathways linking higher MVPA to lower dementia risk through depression, functional capacity, smoking behavior, hypertension, cardiovascular disease, chronic kidney disease, and brain injury. Chain mediation analyses further identified depression as a central pathway, accounting for 15.1% of the overall association between MVPA and dementia risk. Sex-stratified analyses revealed distinct mechanistic patterns, with females exhibiting predominantly metabolic and functional pathways, while males showed behavioral and cardiometabolic cascades involving smoking and cardiovascular disease. Together, these findings suggest that the protective association between PA and dementia is mediated through interconnected behavioral, psychological, and cardiometabolic processes rather than a single pathway. Depression emerged as a prominent and potentially modifiable pathway, highlighting opportunities for integrating dementia prevention strategies that combine PA promotion with mental health and cardiovascular risk management.
Read the full abstract

All authors Wasif Khan, Panayiotis V. Benos, Joshua K. Wong, Ruogu Fang

Neurons and Cognition

Clustering without clusters: the meta-criterion and centroid reliability mistake continuous dynamics for discrete states

Microstate analysis starts with clustering and the meta-criterion is a heuristic to find an optimum cluster number. We address the following questions: (i) what number is found for non-cluster-forming dynamical systems, (ii) do centroids fall in random attractor regions, (iii) do EEG topographies form clusters or a single connected structure in sensor space? We find that (i) the meta-criterion suggests spurious optimal cluster numbers (4-8) with high confidence on different attractor geometries, (ii) cluster centroids reliably fall in the same attractor regions, (iii) topological analysis of dynamical systems and resting-state EEG suggests that all form a single connected structure in their respective phase space, not clusters. We conclude that the meta-criterion should be used with caution and its results should not be taken as representing a ground truth. Cluster numbers deviating from the meta-criterion should not be discarded. A more far-reaching implication is that evidence for the existence of clusters in resting-state EEG data is still lacking. Microstate clustering may correspond to the partitioning of a single connected structure.
Read the full abstract

Optimization and Control

Global Output Lifting and Surjectivity in Invertible Nonlinear MIMO Systems

Global inversion of nonlinear multivariable systems raises the question of whether every target value of the selected output derivatives can be realized by a plant state. We prove that, under globally regular modified inversion with fixed row selection and finite termination at full input rank, every fixed homogeneous linear output assignment yields a surjective output-derivative map with a smooth global section. The result requires a state bound on each finite interval in terms of the initial state and finitely many output derivatives, uniformly over inputs. This condition is strictly weaker than weak uniform zero-state detectability, making the separate surjectivity requirement in a global inversion approach to stabilization a consequence of detectability under the stated inversion hypotheses. The section selects a realizing state smoothly for every derivative target, including in the presence of internal dynamics, and is constructed through complete lifting of compatible smooth references. For known plants, the same lifting method yields a smooth dynamic controller using full state feedback and current reference derivatives, with initialization from the plant state. From any initial state, it achieves exact tracking of any smooth desired output after any prescribed positive time.
Read the full abstract

Game Theory

Maximin Share Allocations Beyond Weakly Lexicographic Valuations

We study the fair division of indivisible goods among agents with nonnegative additive valuations. An agent's maximin share (MMS) is the value she can guarantee by partitioning the goods into as many bundles as there are agents and receiving a least-valued bundle. We prove the existence of exact MMS allocations for a valuation domain that generalizes several few-valued domains as well as weakly lexicographic valuations. For each agent, the lower-valued goods, after a positive rescaling, may take values in $\{0,1,d,d+1\}$, $\{0,1,2,2e\}$, or $\{0,1,2,3,4\}$, where $d,e\ge 2$ are integers. Above these goods, the valuation may contain arbitrarily many value classes, subject to the condition that a single good in each class is worth at least the total value of all strictly lower-valued goods. The value classes, scaling factors, and parameters may vary across agents. We give an algorithm that computes an MMS allocation in $O(nm\log^2(2+m))$ time, where $n$ is the number of agents and $m$ is the number of goods.
Read the full abstract

Machine Learning

Typed Temporal Interaction Features for Simulation-Backed Forecasting of Open-Source Game Release Incidents

Open-source video-game quality depends on inter-actions among code, assets, configuration, tests, contributors, and issue workflows, yet conventional defect predictors usually flatten or omit these relations. We investigate release-level forecasting of a quality incident within thirty days using GAMEQUALGRAPH-Pilot, a typed temporal feature pipeline with calibrated risk estimates and effort-aware ranking. Because the accessible OS-SGameBench materials do not provide manually audited release dates and outbreak labels, the executed evaluation is explicitly simulation-backed rather than an empirical claim about real games. Five seeded worlds each contain 120 projects and 24 releases, with project-disjoint validation and future cross-project testing. The pilot obtains an AUPRC of 0.520, AUROC of 0.673, Brier score of 0.207, and 29.68% effort-aware recall at a twenty-percent testing budget. Its closest local comparator, Static-Hetero-Reimpl, reaches 0.522 AUPRC; the -0.002 difference is not statistically significant after Holm correction. Inference requires 0.023 milliseconds per release in the measured environment. Ablations and controlled missingness, drift, engine, project-size, alert-threshold, and attribution analyses expose where typed interactions help and where they fail. Results support the reproducibility of the proposed protocol, not deployment effectiveness. Real OSSGameBench release reconstruction, stratified label audits, and official graph-model comparisons remain mandatory before journal submission or operational use in practice. This boundary protects research integrity and supports credible evaluation.
Read the full abstract