Distributed Computing
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 7 September
Byzantine Reliable Broadcast (BRB) and Message-Adversary-Tolerant Byzantine Reliable Broadcast (MBRB) are reliable-dissemination abstractions for fault-tolerant distributed systems. Yet their operational behavior is shaped not only by specifications and asymptotic communication bounds, but also by serialization, cryptography, buffering, orchestration, deployment environment, and fault-injection semantics. This paper implements and evaluates Bracha [Information and Computation, 1987], AFRT by Albouy et al. [TCS, 2023], and Coded MBRB by Albouy et al. [OPODIS, 2024]. We implement the algorithms in a shared Go codebase with common orchestration, instrumentation, parser-based specification checks, fault injection, and an open-source reproducibility artifact. The evaluation uses single-shot broadcasts in the Shadow network simulator, native profiling, a Google Cloud Platform deployment, and a distributed FABRIC testbed, covering controlled experiments up to 30 nodes, payloads up to 40 MB, 92,190 runs, and 2,361,600 parser-checked entries. The results show that Coded MBRB reduces transmitted data and improves latency in the evaluated cloud setting for larger payloads, but shifts cost to cryptographic and coding computation. Bracha and AFRT incur lower CPU costs at smaller payloads, but their full-payload dissemination increases processing, allocation, and network costs as payloads grow. Across the tested configurations, the parser found no duplicate deliveries, conflicting deliveries, or deliveries of values different from the sender's payload. The paper contributes implementation-level evidence and an extensible artifact for benchmarking BRB and MBRB as executable distributed-system components, exposing bottlenecks and operational trade-offs that are hidden by algorithmic descriptions alone.
Computer Vision
Topologically Consistent Agricultural Parcel Vectorization with Semantic-Guided Diffusion and Topology-Aware Polygonization
Agricultural parcel polygons play a fundamental role in geospatial applications such as precision agriculture, land administration, and crop monitoring. Beyond regular polygon geometry and low vertex redundancy, practical parcel maps should avoid topological conflicts and preserve common boundaries between adjacent fields. Yet this requirement remains largely unresolved: segmentation-based methods mainly produce parcel masks or raster boundary cues and rely on heuristic raster-to-vector conversion, instance- and contour-based methods reconstruct parcels independently, and recent vector-oriented methods improve polygon regularity but do not explicitly recover adjacent parcels from a shared topological structure. To address this gap, we propose a semantic-guided diffusion framework for topologically consistent agricultural parcel vectorization. It couples joint edge–vertex latent diffusion with supervised multi-cue conditioning to generate geometrically regularised parcel-boundary and vertex primitives while suppressing false-positive responses. A topology-aware parcel polygon reconstruction method then converts these primitives into regular polygons by reconstructing parcel faces from a common planar graph, enabling adjacent predicted parcels to reuse shared boundaries and avoid mutual interior intrusion. Extensive experiments on the AI4SmallFarms and iFLYTEK datasets evaluate parcel vectorization in terms of pixel-level coverage, geometric fidelity, object-level correctness, and topological consistency. The results show strong and competitive performance, with zero measured intrusion ratio and the highest shared-edge recall, demonstrating the potential of the proposed framework for accurate, regular, and topologically consistent agricultural parcel vectorization.
Read the full abstract
Networking
Perception-Aware Joint Power and Sub-Band Allocation for 6G In-Body Subnetworks
In-body subnetworks (IBSs) are expected to become a key enabler of immersive eXtended Reality (XR) services in sixth-generation (6G) networks by providing ultra-short-range, low-latency wireless connectivity around the human body. However, the dense coexistence of multiple IBSs leads to severe co-channel interference, requiring increased transmit power to satisfy the stringent latency requirements of XR applications. Existing interference management approaches allocate radio resources solely according to application-level Quality-of-Service (QoS) requirements, overlooking the perceptual limitations of human users. This paper proposes perception-aware joint power control and sub-band allocation framework that integrates users' delay perception into radio resource allocation for XR-oriented IBSs. A learning-based perception model is first developed by combining Gaussian mixture modeling (GMM) with supervised learning to develop a statistical model of the delay perception threshold. The learned perception model is then incorporated into a stochastic radio resource allocation problem, which is reformulated using a Lyapunov drift-plus-penalty and solved through a low-complexity per-slot resource allocation procedure. System-level simulations under realistic intra- and inter-IBS propagation conditions demonstrate that the proposed approach substantially improves radio resource efficiency, achieving up to 26% transmit power reduction under stringent latency requirements and approximately 60% power savings in dense IBS deployments, while maintaining the required Quality of Experience (QoE).
Read the full abstract
Nuclear Experiment
Precision Neutron Skins of $^{208}$Pb and $^{48}$Ca from Parity-Violating Electron Scattering
We have measured the parity-violating elastic electron scattering asymmetry in the PREX and CREX experiments on ${}^{208}$Pb and ${}^{48}$Ca respectively; these are both doubly-magic nuclei whose excited states can be discriminated from the ground state by the high resolution spectrometers in Hall A at Jefferson Lab. This asymmetry provides a precise determination of the weak charge form factor at one $Q^2$ and pins down the neutron radius in these two nuclei in a relatively clean and model-independent way. This is because the $Z^0$ boson of the weak interaction couples primarily to neutrons. The heavier lead nucleus, with a neutron excess, provides an interpretation of the neutron skin thickness in terms of properties of bulk neutron matter. For the lighter ${}^{48}$Ca nucleus, which is also rich in neutrons, comparisons to microscopic nuclear theory calculations are sensitive to poorly constrained 3-neutron forces. The weak neutral form factors $F_W(Q^2)$ were extracted to be $0.368 \pm 0.013$ at $Q = 0.3977 {\rm\ fm}^{-1}$ for $^{208}$Pb from PREX-2 and $0.1304 \pm 0.0055$ at $Q = 0.8733 {\rm\ fm}^{-1}$ for $^{48}$Ca. The form factor differences $(F_{ch}-F_W)(Q^2)$ were calculated to be $0.041 \pm 0.013$ at $Q = 0.3977 {\rm fm}^{-1}$ for $^{208}$Pb from PREX-2 and $0.0277 \pm 0.0055$ at $Q = 0.8733 {\rm fm}^{-1}$ for $^{48}$Ca. Correcting for Coulomb distortions and using nuclear model information, we find the neutron skin thicknesses to be $R^{208}_{\rm skin} = 0.283 \pm 0.071$ fm combining PREX-1 and PREX-2 and $R^{48}_{\rm skin} = 0.121 \pm 0.035$ fm. This paper provides a full description of the special experimental and data analysis techniques employed for precisely measuring these small asymmetries.
Read the full abstract
Quantum Physics
Achieving the Quantum Limits with Twin-Field Sensors
Continuous measurements play a fundamental role in quantum experiments, yet understanding and extracting the maximal possible information in a continuous probe signal remains a significant challenge. In this work, we show that for a wide class of sensors, the quantum Fisher information bound can be saturated through a combined measurement of signals from the original sensor and a suitable system copy. We elucidate the physical mechanism of such a twin-field sensor (TFS) and study its performance across diverse implementations, ranging from two-level atoms to a hybrid quantum Rabi model. In all of these cases, we find that simple photon counting or homodyne detection saturates the theoretical quantum limit. We further prove that the TFS achieves the quantum limits for the joint sensing of pairs of parameters as quantified by the quantum Fisher information matrix.
Read the full abstract
Robotics
P$^2$Calib: Utilizing Pattern Priors for LiDAR-Camera Extrinsic Calibration
Target-based LiDAR-camera extrinsic calibration is a prerequisite for multi-sensor fusion in robotics. However, in the widely adopted four-hole pipeline, \rt{calibration accuracy is limited by hole-center extraction in the LiDAR side, where sparse angular coverage and mixed-pixel returns displace the estimated centers}. This paper presents P$^2$Calib, which exploits pattern priors, geometric constraints specified by the CAD model of the target board, to improve calibration accuracy. First, we incorporate the known hole radius as a fitting constraint to prevent center estimates from degrading under sparse angular coverage. Building on the improved hole estimates, we further enforce the rigid rectangular layout of the four holes as a global consistency constraint to correct residual errors across holes. Both priors are integrated into an \rt{interactive tool that runs the pipeline from target detection to the final extrinsic}. Experiments on simulated and real datasets show that P$^2$Calib reduces the joint registration residual by 90% and 82% and the held-out reprojection error by 96% and 77% over the baseline. \rt{We will release the code and data\codelink{} to facilitate future research.
Read the full abstract
Computer Vision
PICANet: Physics-Informed Cascaded Asymmetric Network for Infrared Small Target Detection
Infrared small target detection (ISTD) is an important research direction in image processing. However, existing methods are limited by severe background noise propagation and target degradation in high-level semantic features. To address these limitations, this paper proposes a plug-and-play physics-informed cascaded asymmetric network, named PICANet. Specifically, we construct a hierarchical prior decoupling module to explicitly extract low-level and high-level physical information, thereby characterizing target features at different levels rather than relying solely on convolutional extraction. Furthermore, a dual-prior interactive fusion module is developed to dynamically refine target representations while suppressing complex background clutter. Unlike previous work, a multi-level cross-feature attention module with the cascaded asymmetric mechanism is introduced to achieve precise alignment between high-level semantics and low-level spatial details. Extensive experiments demonstrate that the proposed PICANet outperforms state-of-the-art ISTD methods, showing satisfactory detection accuracy even against complex backgrounds. Our code is available at https://github.com/xianchaoxiu/PICANet.
Read the full abstract
High Energy Physics (Theory)
Can one hear the shape of a black hole singularity?
We compute the large overtone quasinormal frequencies $\omega_n$ of asymptotically AdS black holes with interior near-singularity Kasner epochs. We show that the Kasner exponents can be extracted cleanly from the large $n$ behaviour of the dispersion $\partial \omega_n/\partial k^2$ at $k=0$, where $k$ is a boundary momentum. We show that Kasner transitions, as occur in BKL near-singularity chaos, are audible in the quasinormal frequencies and reveal a map between overtone number $n$ and proper time to the singularity. Our results are obtained using a WKB analysis that isolates non-analytic exponents, determined by the near-singularity spacetime, from non-universal data such as the optical distance from the boundary to the singularity. We check our formulae in several numerical models.
Read the full abstract
Classical Analysis and ODEs
Boundedness of Multilinear Hilbert Transforms Along Moment Curves
We prove the boundedness of multilinear Hilbert transforms along moment curves by establishing uniform estimates for both translated and untranslated multilinear paraproducts and by applying a Sobolev smoothing inequality. As a byproduct of our method, we obtain the same bounds for multilinear maximal functions along moment curves.
Read the full abstract
Machine Learning
Statistical versus machine learning-based spatial interpolation of post-processed ensemble weather forecasts
Statistical post-processing improves ensemble weather forecasts, but generating calibrated predictions at locations without observations remains challenging. This study compares statistical and machine-learning-based methods for post-processing ECMWF 2-m temperature and 10-m wind speed forecasts at observed and unobserved stations in Germany. We consider EMOS-based approaches, distributional regression networks, Transformers, and graph neural networks under both limited and extended predictor settings. For temperature, we also investigate linear forecast combinations and propose an altitude-aware linear pool (ALP). The results show that post-processing improves upon the raw ensemble in most settings, but no single method performs best across all variables, station groups, and evaluation metrics. The proposed ALP provides a small but significant improvement over the standard linear pool at unobserved locations.
Read the full abstract
Robotics
Generation of Vectorized Maps Beyond Vehicle View
Autonomous driving relies on High Definition (HD) maps for safe navigation. Traditional HD maps construction is costly in hardware, data and human resources, which together with its update limitations hinders scalability. Recent works have proposed online alternatives for HD vectorized mapping from onboard sensors. However, sensor field of view is limited, and the range of the reconstructed maps ahead of the vehicle is insufficient for safe planning. This paper aims to address this limitation by proposing the novel beyond-view vectorized map generation problem: given vectorized maps of the area sensed by the vehicle (in-view), to generate plausible map continuations. To experimentally assess its feasibility, we propose BeyondFormer, which, to the best of out knowledge, is the first work designed towards beyond-view map generation. Given the novelty of the problem, we generate the first dataset specifically designed for it and evaluate the proposed approach. The results demonstrate consistent performance across diverse scenarios, establishing learning-based methods as a promising direction for map forecasting in autonomous driving. Beyond demonstrating the feasibility of the task, we provide an extensive discussion of the method's limitations and identify key future research directions for scaling it to more complex driving conditions. Code is available at https://git-autopia.car.upm-csic.es/beyondformer.
Read the full abstract
Superconductivity
Nearly Isotropic Vortex Solid in $\mathbf{(La,Pr)_{3}Ni_{2}O_{7}}$ Thin Films
The discovery of superconductivity in bulk bilayer nickelates has established a new platform for exploring high-$T_c$ superconductivity beyond the cuprates. The role of the Ni $3d_{z^2}$-derived $\gamma$ band in the superconductivity of bilayer nickelates remains unresolved. By performing simultaneous resistance and diamagnetism measurements on (La,Pr)$_3$Ni$_2$O$_7$ thin films, we map the vortex melting phase diagram for both in-plane and out-of-plane magnetic fields. For $H\parallel c$, the geometric confinement effect gives rise to pancake vortices. Remarkably, the anisotropy parameter of the vortex melting field $\gamma_{H_m} \equiv H_m^{ab}/H_m^c$ decreases monotonically with decreasing temperature and approaches unity at low temperatures. Within the anisotropic Ginzburg–Landau scaling, $H_m^{ab}/H_m^c = \sqrt{\rho_s^{ab}/\rho_s^c}$ tracks the superfluid-density anisotropy. Such a vortex solid implies a nearly isotropic superfluid density, which is irreconcilable with the strictly two-dimensional $3d_{x^2-y^2}$-derived bands, but naturally explained by a substantial interlayer superfluid contribution from the $3d_{z^2}$-derived $\gamma$ band. Our results provide thermodynamic evidence for a substantial contribution of the $\gamma$ band to superconductivity in bilayer nickelate thin films.
Read the full abstract
Biological Physics
Acceleration of energy dissipation by biological systems
A general scheme of evolution from autocatalytic processes to socio-technological system is discussed from the perspective of maximum energy dissipation principle. The scheme treats the emergence of biological systems as an initial stage in the acceleration of global free energy dissipation. The sequential emergence of qualitatively new levels of organisation (biological cell, multicellular organism, social system) has been proposed, the levels are suggested as the results of cooperation (symbiosis) of the dissipative systems at the previous levels. The cooperation/symbiosis provides sufficient complexity for development of the next, essentially a new level of energy dissipation, leading to a new form of free energy utilization and a new form of information mapping. From a thermodynamic perspective, every qualitatively new level of biological organisation provides an additional step to increase the rate of energy dissipation from qualitatively new sources, essentially widening the number of these sources involved in the utilization.
Read the full abstract
Neurons and Cognition
Homeostasis Revisited and Reformulated Through Hidden Markov Model Control
A common formalization of homeostasis is the free energy principle, a framework that defines a set of desired observation values, or critical states, that the agent should reach or remain close to. Under the free energy principle, an agent should act to maximize the probability of receiving the desired observations. Here we revisit the common approach of solving the problem of maximizing the log probability of the desired observations by maximizing a variational lower bound, the so-called negative free energy. We show that, instead, an approach directly maximizing that probability under the agent's policy is better suited to, and provides a better solution for, the original homeostatic control problem. This is done using hidden Markov model (HMM) control by allowing the policy to act over hidden states or noisy versions thereof while trying to maximize the probability of repeatedly having the desired observations. HMM control largely improves performance over the variational, or free energy, approach. We also show that the optimal policy is strictly deterministic, while the variational approach leads to a stochastic policy approximation. We finally provide a homeostatic reinterpretation of the maximum occupancy principle -a principle proposing that agents ought to maximize the occupancy of action-state path space -by defining homeostatic states as any states that do not immediately entail the termination or death of the agent.
Read the full abstract
Computers and Society
What a Model Refuses, a State Fears: How Authoritarian Information Control Reproduces in Language-Model Guardrails
As large language models increasingly mediate access to political information, their refusal behavior creates a new site of information control. We ask whether political distinctions identified in theories of authoritarian information control remain visible in model guardrails, and how their enforcement changes when implemented through general-purpose AI. Across ten models, we combine cross-model comparisons with within-model experiments that manipulate political referent, collective-action potential, and political valence. Aggregate differences in political refusal across developer origins are sensitive to model composition, but the within-model experiments reveal a more specific structure. Chinese-developed models are substantially more likely to refuse otherwise identical political requests when they concern China rather than foreign or fictional settings, and refusal responds more strongly to collective-action potential than to political valence, including for peaceful pro-government mobilization. Yet these political distinctions are enforced imperfectly: refusal extends to some low-coordination political criticism even though models can distinguish criticism from coordination; the form of non-compliance varies across languages; and high native refusal does not imply adversarial robustness. These findings show that general-purpose AI can preserve recognizable political boundaries while transforming the breadth, form, and robustness with which those boundaries are enforced. More broadly, they demonstrate why refusal rates alone provide an incomplete measure of political control in language models.
Read the full abstract
Dynamical Systems
Solutions to 6 problems in recurrence and Van der Corput sets
We present solutions to six problems concerning sets of nice recurrence and van der Corput (vdC) sets. We answer a question of Moreira, repeated by Fish and Skinner, by showing that every set of ergodic nice recurrence is a set of nice recurrence. We answer questions of Bergelson as well as Bergelson and Lesigne by showing that every set of nice recurrence is a nice vdC-set, that the family of nice vdC-sets is partition regular, and that the family of sets of nice recurrence is partition regular. We mention that Chapman independently proved that sets of nice recurrence are partition regular. We answer a question of Kelly and Lê, a special case of which was previously asked by Peres, and show that for every nontrivial compact metrizable group $K$, every $K$-vdC set is also a vdC set. Lastly, we answer a question of Farhangi, Rodríguez, and Tucker-Drob and show that for any countably infinite discrete group $G$, a vdC set in $G$ is a set of operatorial recurrence in $G$. The initial solutions to these problems were produced by an AI system. The authors checked their correctness, simplified and reformulated them as clear, human-readable proofs, and situated the resulting contributions within the existing literature.
Read the full abstract
Quantum Physics
Stationary states for a particle in a box with slanted walls
The quantum mechanical problem of a particle in a infinite potential well with slanted walls is studied. The energy eigenvalues are determined by a transcendental equation involving the Airy function of the first kind. Two limiting cases are discussed. Next, the allowed energies are found by graphical and numerical methods. The graphical analysis hints that for large quantum numbers the consecutive energy levels get arbitrarily close together. This asymptotic behavior of the energy spectrum actually holds, as shown by means of an intuitive argument and confirmed by resorting to basic properties of Airy functions. In a sense, Bohr's correspondence principle is more accurately fulfilled than in the cases of the standard particle in a box or the harmonic oscillator. A state is regarded the more confined the less the probability of finding the particle in the classically forbidden region. For some stationary states the confinement degree is calculated and a comparison is made with the harmonic oscillator, for which the ground state is the least confined of all stationary states. In the symmetric case — right and left walls of equal slope — something unexpected happens: beyond a certain critical slope the ground state is no longer the least confined eigenstate. Over and above its interesting physical features, this problem provides students with the opportunity to get acquainted with Airy functions, which do not belong to the standard mathematical repertoire of physics undergraduates.
Read the full abstract
Computer Vision
Mitigating Shortcut Learning: Texture-Penalized Prototype Networks
Standard Convolutional Neural Networks (CNNs) exhibit severe performance degradation due to a strong inductive texture bias that prioritizes local, high-frequency patterns over global structural shapes. This dependency causes confident misclassifications during textural changes or environmental effects. To address this flaw, this study introduces the Texture-Penalized Prototype Network (TPPN), a novel architectural framework that shifts this inherent bias without depending on resource-intensive augmented datasets. Specifically, a Texture-Penalization Branch (TPB) imposes a penalty to suppress the extraction of local texture proxies, forcing the network backbone to discard high-frequency cues and extract purified, shape-biased representations. By evaluating similarities within a prototype-based hypersphere derived from the final convolutional features, the approach enforces strict geometric constraints, treating objects as compositions of essential parts to achieve robust classification. Evaluations on texture-shape cue-conflict datasets and synthetic noise benchmarks demonstrate the stronger shape bias of this structural disentanglement. The proposed framework reduces the inherent texture bias of a baseline ResNet-50 from 55.11% to 29.73%, surpassing the texture-suppression capabilities of an off-the-shelf Vision Transformer (ViT-B/16). Furthermore, the approach demonstrates robust generalization under cue-conflict conditions, resisting textural shortcut learning when encountering Out-of-Distribution (OOD) shapes. The model maintains stronger shape accuracy against elevated perturbations. On clean validation data, the architecture incurs a minimal drop in accuracy of 0.90 percentage points. This provides a structural, efficient solution to CNN texture bias.
Read the full abstract
General Physics
The modified Newtonian dynamics with an extra anti-dissipation term can yield the MOND model
In this work, we introduced a positive viscosity coefficient into Newtonian dynamics to explore the rotational properties of disk galaxies. Our results show that the rotational behaviors of disk galaxies predicted by this modified Newtonian dynamics share notable similarities with those from the well-known MOND model. Specifically, the modified framework naturally recovers the deep-MOND limit postulated in MOND. Furthermore, we derived an explicit interpolation function relating centripetal acceleration to Newtonian acceleration-a relation that is purely empirical within the MOND model. We also identify key differences from MOND: the critical acceleration a0, regarded as a universal constant in MOND, actually varies with galactic mass and increases for more massive galaxies. Additionally, driven by the anti-dissipation effect of the viscosity coefficient, disk galaxies undergo extremely slow radial expansion over cosmic time, analogous to the expansion of the Universe. But regrettably, the fundamental physical origin of the viscosity coefficient introduced here remains unclear for us. But relevant hints can be found in existing literature, pointing to a promising direction for our future research.
Read the full abstract
Probability
Higher-order hyperuniformity of random measures
We study higher-order hyperuniformity through the large-scale variance of local $k$-point patterns, and write $\HU_k$ for the resulting condition; $\HU_1$ is ordinary hyperuniformity. The conditions $\HU_k$ need not coincide: for every $k\geq1$ there exists an $\mathbb R$-invariant weakly mixing simple point process that belongs to $\HU_j$ for all $j\leq k$ but not to $\HU_{k+1}$. Randomly translated lattices belong to $\HU_k$ for every $k$, whereas sufficiently small non-degenerate iid perturbations of lattices and projection determinantal point processes already belong to $\HU_1\setminus\HU_2$. For regular Euclidean cut-and-project processes we give an exact criterion for $\HU_k$. For ball windows, $\HU_k$ is equivalent to $\HU_1$ in internal dimensions two and three, whereas in every internal dimension $m\geq4$ we construct ball-window examples in $\HU_1\setminus\HU_2$. Finally, the nonperiodic Kurasov–Sarnak Fourier-quasicrystalline point process is stealthy—its first-order spectrum has a gap at the origin—yet does not belong to $\HU_2$.
Read the full abstract
Computational Geometry
A new O(n log n) approach for the Euclidean maximum weight matching problem
In a weighted graph $G = (V, E)$, the maximum weight matching problem (MWM) asks for a matching (i.e. pairing) of its vertices, such that each vertex is paired with at most one other vertex and the total sum of weights of all edges connecting paired vertices is maximised. If the vertices of the graph correspond to points in the Euclidean plane and the weights to their pairwise Euclidean distances, we get the Euclidean maximum weight matching problem (Euclidean MWM). The best optimum-solution algorithm for this problem runs in $O(n^{2.5})$. Furthermore, there exists an FPTAS guaranteeing a $(1 - \epsilon)$-approximation ratio, which runs in $O(m \epsilon^{-1} \log \epsilon^{-1})$ time. Heuristics with a subquadratic running time (with respect to the number of vertices $|V|$) are known, but often yield solutions of a modest quality. In this paper, we present a novel algorithm for solving the Euclidean MWM running in $O(n \log n)$ time and providing excellent solution quality, especially for larger instances. In particular, in our computational tests, the algorithm yielded optimum or near-optimum solutions for all test instances; the worst observed optimality gap was less than $1.38\%$. This makes the algorithm highly attractive for practical applications, especially when exact methods become computationally prohibitive due to the size of the instance.
Read the full abstract
Genomics
Human mutation field reveals an equilibrium-like structure with irreversible circulation
The evolution of DNA sequences can be viewed as stochastic dynamics on a high-dimensional discrete space, but it is unclear when empirical transition biases reduce to an effective energy landscape versus retain irreducible non-equilibrium circulation. Human context-dependent mutation probabilities offer a direct test: every single-nucleotide substitution in a local context has a reverse substitution, so the logarithm of the forward-to-reverse probability ratio defines an antisymmetric field-the human mutation field. We show this field has a dominant gradient component and a smaller but reproducible curl component. Using seven-base human germline substitution probabilities, we infer an effective mutational landscape with a Siamese neural network constrained to predict only energy differences. This model predicts forward-to-reverse log-ratios for held-out mutations with a correlation of about 0.93, close to both an unconstrained predictive reference (0.948) and the empirical reversible ceiling from Hodge projection (about 0.96). Although trained only on mutation probabilities, the inferred landscape largely recovers short-word genomic composition and Chargaff reverse-complement symmetry for sequences up to length four. Deviations from equilibrium structure reveal a small but detectable nonequilibrium component: a residual irreversible circulation violating the Kolmogorov cycle condition for detailed balance, reproducible across African, Asian, and European populations, and strongest in CpG-linked cycles and CpG-transition edges, consistent with methylcytosine deamination. These results give a thermodynamic decomposition of the human mutation field: most mutation bias is organized by a local equilibrium-like energy landscape aligned with genome composition, while the residual circulation points to specific directional mutational mechanisms.
Read the full abstract
Computer Vision
CrACK: Adversarial Attacks on Cross-Model Consistency in Collaborative Vision Foundation Models
Training-free collaborative pipelines that integrate Vision Foundation Models such as CLIP, SAM, and DINO achieve strong open-vocabulary dense prediction and are increasingly deployed in safety-critical applications. The security of these systems is commonly assumed to follow from the robustness of their individual models. We challenge this assumption. We identify a vulnerability shared by every collaborative pipeline: each model consumes the intermediate output of another without verifying semantic consistency, an unverified premise that we term the semantic-spatial alignment dependency. Existing adversarial attacks target a single model and overlook this premise, leaving the inter-model interface entirely unguarded. We propose CrACK (Cross-model Adversarial Consistency attack), an inference-time attack that exploits this interface without modifying any input pixel, model weight, or training data. CrACK operates in two stages: Adversarial Affinity Contradiction Injection corrupts the cross-modal affinity matrix by inverting SAM encoder features under the guidance of CLIP patch-level semantics, and Semantic Interface Poisoning steers the prediction through a max-distance label permutation derived from CLIP text embeddings. Experiments on four collaborative pipelines across eight benchmarks show that CrACK causes catastrophic degradation while every individual model continues to produce its unchanged standalone output, rendering per-model defenses structurally blind. The corruption further cascades into large vision-language model reasoning, driving models such as LLaVA to produce erroneous responses from visually intact inputs. Our results show that the security of a collaborative AI system cannot be reduced to the robustness of its components, and that inter-model feature interfaces must be treated as first-class security boundaries.
Read the full abstract
Robotics
CosmoH2G: A Hand-to-Gripper Transfer Dataset and Baseline Method for Object Manipulation with Complex Spatial Movements
Transferring human hand demonstrations to robotic grippers has recently emerged as a cost-effective solution for robot learning. However, existing methods are largely confined to simple, planar tasks and fail to handle complex spatial movements (e.g., intricate trajectories involving rotations or flips) that are essential for robot manipulation. Motivated by this gap, we adopt an implicit, data-driven approach guided by fine-grained hand-pose motions. To this end, we introduce a scalable acquisition pipeline to collect hand-gripper paired demonstrations, governed by a rigorous protocol that prioritizes motion complexity and leverages a handheld gripper for seamless action mimicry. This yields a large-scale paired dataset comprising 6,189 episodes across 1,254 unique objects, exhibiting significantly higher spatial complexity than existing benchmarks. However, learning such complex mappings remains challenging. We observe that naive end-to-end generation of full gripper pose sequences is insufficient, as minor trajectory deviations compound rapidly under intricate dynamics. To address this, we propose a two-stage framework: Stage I predicts sparse gripper keyframes (initial and terminal) to simplify the mapping objective, while Stage II generates the full continuous action sequence conditioned on these keyframes. Furthermore, to mitigate cumulative drift, we keep the gripper's orientation being learned while post-optimizing its translation based on the grasping heuristic and kinematic consistency. In both simulation and real-robot experiments, our framework enables stable and precise hand-to-gripper transfer of complex spatial manipulations, significantly outperforming traditional baselines. Project page: https://cosmoh2g.github.io.
Read the full abstract
Robotics
Functional-SLAM: Interaction-Aware Mapping with Online Functional Scene Graphs
Existing SLAM systems lack modeling of the functional relations required for fine-grained robotic interaction. Functional 3D scene graphs can represent relations between objects and interaction elements, but existing methods rely on offline reconstruction, making them inadequate for real-time interaction in real-world exploration. To address this limitation, we propose Functional-SLAM, the first framework that continuously and recursively maintains a functional scene graph as an online SLAM state. The framework combines anchor-keyframe geometry with functional-context constraints for persistent node maintenance, accumulates multi-frame evidence through temporal relations to commit stable functional edges, and supplements visual loop-closure candidates with functional topology in scenes with repetitive appearance or degraded texture. Experiments show that Functional-SLAM efficiently constructs stable functional maps online, substantially improving runtime over offline methods while maintaining highly competitive accuracy. Compared with peer SLAM systems, it further improves pose estimation accuracy through functional-topology-assisted loop closure. The code is publicly available at https://github.com/Hbelief1998/Functional-SLAM-CoRL_2026.
Read the full abstract
Statistical Mechanics
Exact Hamiltonian Dynamics of Rare Events in Active Matter
Active systems navigate complex environments through non-equilibrium fluctuations, rendering standard equilibrium transition-rate theories inadequate. Moreover, transition rates provide only partial information on how stochastic dynamics explore metastable states, whereas knowledge of the optimal paths offers deeper physical insight. Using an active Ornstein-Uhlenbeck particle, i.e., a particle driven by exponentially correlated noise, as a paradigmatic model, we establish an exact mapping of the non-Markovian optimal path onto a higher-dimensional Hamiltonian dynamical system so that, for arbitrary force fields, optimal paths can be computed systematically by solving the corresponding Hamilton equations. Tuning the conserved energy allows us to explore diverse dynamical regimes, ranging from classical instanton trajectories strictly confined to the zero-energy surface to finite-time optimal paths at non-zero energies, which can spiral around shoulders of the energy landscape, a distinct signature of the non-Markovian active dynamics.
Read the full abstract
Robotics
Wearable Multimodal Human-Machine Interface for Integrated Hand Intentions Decoding in Dynamic Teleoperation
Under ubiquitous teleoperation environments with optically challenging conditions, an interface for tele-operated grasping that combines wearability with precise decoding of hand intentions (hand pose, gestures, and grasping force) is essential. Yet, existing interfaces often fall short in meeting these demands, compromising either the diversity of multiple intentions decoding or wearability. To address this, we developed a novel Multiple Intentions Decoding Human-Machine Interface (MI-DHMI) that integrates high-throughput surface electromyography (sEMG) sensors with hand-mounted and forearm-mounted inertial measurement units (IMUs). The developed interface is supported by a unified framework for simultaneous multiple intentions decoding. By employing multimodal deep learning and hardware design with a low noise floor, the decoding framework selectively focuses on the sEMG components that are genuinely associated with finger movements. This effectively reduces decoding errors caused by sEMG variability during unconstrained upper-limb motions, thereby significantly enhancing robustness. Even under unconstrained wrist and forearm motion, the interface achieves a gesture recognition accuracy exceeding 97%, grasping force estimation with $R^2 = 0.95$, and hand pose decoding consistent with the actual hand pose, outperforming baseline devices and algorithms. Ablation studies further validate the effectiveness of the proposed decoding framework. Finally, two online experiments were conducted to validate the device, demonstrating its superior performance in high-stability tasks, including a pouring task and object grasping. The developed interface provides a new solution of a fully wearable, multiple intentions decoding system, offering effective support for ubiquitous teleoperation and contributing to the advancement of human-machine interaction research.
Read the full abstract
Differential Geometry
Curvature growth and holomorphic splitting for Kähler metrics with cone singularities
We study Kähler metrics with cone angle $2\pi\beta$ along a smooth divisor, in the range $1/2<\beta<1$. We show that bounded Riemann curvature near the divisor forces the normal bundle sequence to split holomorphically, confirming a condition proposed by Donaldson.
Machine Learning
Improving Multivariate Time Series Classification with Class-Wise Training and Model Aggregation
In this paper, we propose a class-wise dimension (channel) selection framework for Multivariate Time Series Classification (MTSC). Rather than applying a single global dimension selection process, the proposed approach independently identifies informative dimensions for each class. A dedicated learning process is subsequently performed for each class, followed by a fusion stage for final prediction. The objective is to improve the generation of discriminative feature representations while reducing the influence of noisy or non-informative dimensions. The proposed framework is evaluated using MiniRocket, a random kernel-based baseline method. Experimental results indicate that class-wise dimension selection improves the quality of extracted representations and can enhance classification performance, particularly in high-dimensional settings. These findings suggest that incorporating class-specific information into the training process represents a promising direction for MTSC, improving robustness through consistent gains across heterogeneous datasets, and interpretability through the explicit identification of class-relevant dimensions.
Read the full abstract
Software Engineering
FPScan: An Automated Constraint-Based Analyzer for Floating-Point Anomaly Detection
Writing error-free floating-point programs is a challenging task, especially for programmers who lack a strong background in numerical analysis and rounding-error propagation. State-of-the-art techniques typically aim to bound such errors using static or dynamic analysis. However, only a few tools explicitly address critical floating-point pitfalls such as absorption and catastrophic cancellation. These anomalies represent situations in which rounding errors are significantly amplified, causing the semantics of the finite-precision computation to deviate substantially from the real-number semantics. In this article, we present FPScan, a novel tool to formally define and detect both catastrophic cancellation and absorption in floating-point programs. Our approach starts with a custom static analyzer based on abstract interpretation to infer the order of magnitude of all program variables. This magnitude information is then used to build a set of first-order constraints that model error propagation and numerical precision within the program. Finally, we employ an off-the-shelf SMT solver to determine whether the program exhibits any of these critical numerical pitfalls. Experiments were conducted on FPBench, a well-known benchmark suite of floating-point programs, to evaluate the effectiveness of our tool. We also present a comparison with state-of-the-art tools regarding soundness and analysis time.