Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
A graph $G$ is minimal Ramsey for a graph $H$ if every $2$-colouring of the edges of $G$ contains a monochromatic copy of $H$, but for every proper subgraph of $G$, there is a $2$-colouring that does not contain such a monochromatic copy. Characterizing minimal Ramsey graphs is a widely studied problem. Recent research in this field includes the characterization of the size of the set $\mathcal{M}_2(H)$ of all minimal Ramsey graphs for $H$, or finding the smallest minimum degree among all graphs in $\mathcal{M}_2(H)$. In this paper, we introduce a game theoretic analogue of the above concept by considering the Maker-Breaker $H$-game on a graph $G$. In this game, two players, Maker and Breaker, alternately claim unclaimed edges of $G$, and Maker wins if in the end of the game the graph spanned by Maker's edges contains a copy of $H$. Otherwise, Breaker wins the game. We call a graph $G$ winnable for $H$ if Maker has a winning strategy for the Maker-Breaker $H$-game on $G$, and we call it minimal winnable if additionally Breaker wins the $H$-game on every proper subgraph of $G$. Along the lines of minimal-Ramsey theory, we characterize all graphs $H$ for which there exist infinitely many minimal winnable graphs, and we prove tight bounds for the smallest minimum degree among all these minimal winnable graphs. Amongst others, we obtain precise results for trees, cycles, cliques, and complete bipartite graphs. In general, we find many similarities between the Ramsey setting and the Maker-Breaker setting, but we also show substantial differences.
Systems and Control
Zonotope-Based Active Exposure of Stealthy Deception Attacks in Sensor-Fusion Systems
This paper investigates the stealthy attack detection for sensor-fusion cyber-physical systems with unknown-but-bounded noises through the control channel. The detection framework is particularly applicable to sensor-fusion scenarios in which multiple suspicious sensors contributing to the fused estimate may be compromised simultaneously. First, we construct an admissible output set using secure sensors and an attack output set for each attack hypothesis. Then, we introduce a receding-horizon optimization framework to design exposure inputs, namely bounded auxiliary control perturbations injected through the control channel, so as to enlarge the separation between the admissible output set and the attack output sets according to the separation tendency. A sufficient detection condition is further derived, showing that set separation guarantees detectability of the compromised sensors. Moreover, an offline exposure budget guidance is developed to support budget selection before online exposure starts. Simulations on a UAV navigation system under stealthy GNSS and LiDAR attacks validate the proposed method.
Read the full abstract
Statistical Mechanics
Memory-driven Topological Defects and Unconventional Long-Range Order
We investigate many-body systems with time-delayed self-interactions mediated by a memory-feedback mechanism. We show that such temporal interactions generate non-equilibrium orders and unique topological defects absent in equilibrium-specifically, helical vortices wherein opposite vorticities propagate in reverse directions along domain walls. In one dimension, memory feedback stabilizes true long-range order against weak noise, thereby circumventing the Mermin-Wagner theorem and resulting in an unconventional finite-temperature phase transition with a dynamical exponent $z = 4$. Physical realizations of these memory-driven non-equilibrium systems using active mechatronic metamaterials has also been proposed. These results demonstrate engineered temporal interactions as a powerful paradigm for non-equilibrium many-body physics.
Read the full abstract
Combinatorics
Extremal Asymmetric Depth of Planar Graphs and Hidden Near-Mirror Symmetries of IPR Fullerenes
Although almost all graphs are asymmetric – having no nontrivial global automorphisms – they may still possess local symmetries in the form of isomorphisms between induced subgraphs, i.e., partial automorphisms. We study such local symmetries via asymmetric depth, defined in terms of the maximum rank of a nontrivial partial automorphism. We prove a tight upper bound on asymmetric depth in the class of planar graphs and identify the extremal graphs: duals of IPR fullerenes attain the maximum already on $47$ vertices. Our main structural result concerns the IPR fullerenes that are neither maximally asymmetric nor symmetric. In such a cage no purely local action realises a low asymmetric depth, and we show that the map which does realise it cannot be confined to a small part of the cage either: neither to a single face, nor behind an interface of at most $5-k$ edges, $k \le 3$ being the deficiency. A cage of asymmetric depth $2$ or $3$ is therefore not asymmetric in one place; it carries a broken symmetry invisible to its automorphism group. Such cages are rare – under $2\%$ of the asymmetric IPR fullerenes at $n = 118$. In all $727$ of them the largest partial automorphism is a near-mirror reflection, which we state as an explicit conjecture. We also extend the asymmetric depth bound to graphs of higher genus.
Read the full abstract
High Energy Physics (Experiment)
Measurement of inelastic scattering $\Lambda(\overline{\Lambda})+p\to\Sigma^{0}(\overline{\Sigma}^{0})+p$ via $e^+e^-\to J/\psi\to\Lambda\overline{\Lambda}$
Using a sample of $(10087\pm44)\times10^{6}$ $J/\psi$ events collected with the BESIII detector, we investigate the inelastic scattering processes $\Lambda+p\to\Sigma^{0}+p$ and $\overline{\Lambda}+p\to\overline{\Sigma}^{0}+p$, exploiting hyperons from $J/\psi\to\Lambda\overline{\Lambda}$ decays as an effective beam and the beam-pipe materials as targets. The processes $\Lambda+{}^{9}\mathrm{Be}\to\Sigma^{0}+p+{}^{8}\mathrm{Li}$ and $\overline{\Lambda}+{}^{9}\mathrm{Be}\to\overline{\Sigma}^{0}+p+{}^{8}\mathrm{Li}$ are measured at a hyperon momentum of $1.074~\mathrm{GeV}/c$, with cross sections of $(10.1\pm1.4_{\rm stat}\pm0.7_{\rm syst})$ mb and $(1.7\pm0.6_{\rm stat}\pm0.4_{\rm syst})$ mb, respectively. Under the assumption of surface-dominated hyperon-nucleus scattering, these measurements are used to extract the corresponding proton-target cross sections. Independently, direct measurements using the hydrogen component of the beam-pipe oil yield $(3.2\pm1.1_{\rm stat}\pm0.5_{\rm syst})$ mb for $\Lambda+p\to\Sigma^{0}+p$ and $(1.5\pm0.5_{\rm stat}\pm0.1_{\rm syst})$ mb for $\overline{\Lambda}+p\to\overline{\Sigma}^{0}+p$, consistent with the indirect determinations. The combined cross sections are $(4.7\pm0.7)$ mb and $(1.1\pm0.3)$ mb, respectively. The $\overline{\Lambda}+p\to\overline{\Sigma}^{0}+p$ signal constitutes the first evidence for anti-hyperon inelastic scattering with baryonic final states, with a significance of $3.1\sigma$. The pronounced difference between the $\Lambda p$ and $\overline{\Lambda}p$ inelastic scattering cross sections provides new experimental constraints on hyperon-nucleon and anti-hyperon-nucleon interactions.
Read the full abstract
Numerical Analysis
Computational study of Proper Orthogonal Decomposition methods for parametric approximations
This paper studies the computational implementation of proper orthogonal decomposition reduced-order models (POD-ROMs) for evolutionary parametric time-dependent partial differential equations (PDEs). For a one-parameter model, many papers in the literature build the correlation matrix by projecting onto $L^2(\Omega)$ even though optimal pointwise error estimates are proved when projecting onto $H^1_0(\Omega)$. We compare both scenarios and observe the similar performance in practice. Additionally, to get the POD approximation it is necessary to compute the nonlinear term in the reduced equations. This requires a high computational cost that increases when the problem gets more complex. Numerical results in this paper show different approaches to address this issue. Discrete Empirical Interpolation Method (DEIM) is the most efficient approach. It reduces computational time by approximately half compared to computing the whole FEM formulation by a tensor construction while maintaining the same accuracy. For a multiparameter model, we analyze the new and standard method proposed in \cite{newmethod} using a two-dimensional Brusselator model to complement the results and support the error analysis with a more complex system.
Read the full abstract
Human-Computer Interaction
EEG-based Visual Retrieval and Reconstruction: From Neurally Visible Optimal Layer to Hierarchical Diffusion Generation
Decoding visual perception from electroencephalography (EEG) is important for non-invasive brain-computer interfaces (BCIs). However, most existing visual decoding pipelines directly align EEG features with semantic features from pretrained vision models. Those EEG signals carry information at more than one level and this practice disregards the varying neural visibility of different visual components in EEG signals, leading to cross modal mismatches and incomplete information use. In this work, we address this limitation through layer-wise contrastive learning. For each subject, the intermediate CLIP layer that maximizes retrieval performance is selected as the Neural Visibility Optimal Layer (NVOL). Built on NVOL, a hierarchical framework couples retrieval and generation through a shared intermediate representation. The retrieval branch fuses multi-NVOL features, aligns them to image embeddings via contrastive learning, and applies cross-domain similarity local scaling (CSLS) at test time to mitigate hubness. The generation branch reconstructs subject-specific NVOL features from EEG using a conditional diffusion prior, maps them to CLIP space through a lightweight adapter, and drives a pretrained Stable Diffusion XL model. Experimental validation on THINGS-EEG showed that, NVOL-based retrieval achieves 78.1% mean Top-1 accuracy in 200-way retrieval, rising to 86.4% with CSLS. Two-stage NVOL-to-semantic reconstruction also outperforms single-stage final-layer diffusion on semantic and structural metrics. By aligning EEG with layer-wise neural visibility rather than fixed high-level semantics, the proposed framework improves both retrieval accuracy and image reconstruction in EEG-based visual decoding.
Read the full abstract
Analysis of PDEs
Interior Curvature Estimates for the Graphical Scalar Curvature Equation in All Dimensions
We resolve the long-standing problem of establishing interior \(C^2\) estimates for admissible solutions of the graphical scalar curvature equation in every dimension \(n\ge 3\). More precisely, we prove interior curvature estimates for admissible solutions to the constant graphical scalar curvature equation. The proof combines Jacobi inequalities with a two-surface maximum principle and a two-surface Pogorelov estimate.
Read the full abstract
Multiagent Systems
Competitive Market Behavior of LLMs
Large language models (LLMs) are increasingly deployed as economic agents, yet there is little evidence whether LLM agents are suited for participating in market mechanisms designed for humans, and whether these mechanisms deliver desired outcomes when faced with LLM agents. We address this question by replicating seminal economic experiments, replacing human subjects with LLM agents. We place agents in a double auction environment, which is a widely-used market mechanism. We check whether such a market is able to deliver an efficient allocation of resources, thereby testing a novel dimension of alignment of LLM agents – their compatibility with a fundamental market mechanism. We find that markets populated by LLM agents exhibit slower or no convergence towards market equilibrium, thus providing less efficient allocations than markets populated by humans. We then analyze agents' individual trading decisions and find substantial heterogeneity both across model families and market roles. We also run a lexical analysis of Chain-of-Thought (CoT) traces generated by the agents. We find that the decision to execute a trade rather than continue incrementally adjusting prices is associated with a shift from strategic considerations toward urgency. We publicly release our testing framework, which can be used for future evaluations.
Read the full abstract
Quantum Physics
Long-lived telecom-heralded single-photon storage in an absorptive spin-rephased quantum memory
Long-lived storage of single photons under the form of atomic excitations is at the foundation of long-distance entanglement distribution in quantum networks. To mitigate decoherence effects induced by the environment, rephasing of the hyperfine coherences using microwave pulses have been implemented in a variety of single-emitter and ensemble-based solid-state systems. However, the demonstration of storage of single photons in an absorptive quantum memory including such spin rephasing mechanism remains elusive. In this work, we show non-classical storage of telecom-heralded single photons in a Pr$^{3+}$:Y$_2$SiO$_5$ rare-earth ion doped crystal quantum memory using the atomic frequency comb (AFC) spin-wave protocol combined with a XY4 spin rephasing sequence. Long-lived AFC photon echoes are first observed in the classical regime for storage times of up to approximately 3 ms. We then demonstrate non-classical correlations between heralding photons and stored signal photons generated by a cavity-enhanced parametric photon-pair source for storage times of up to 180 $\mu$s and with measured cross-correlation values as high as 4.6(4). Together with the capacity of Pr$^{3+}$:Y$_2$SiO$_5$ QMs to support highly efficient and multiplexed storage, this result represents a significant step towards scalable long-distance quantum repeater links.
Read the full abstract
Numerical Analysis
Reduced order model for parametric Boltzmann equation and its application to inverse problems
The Boltzmann equation plays an important role in modeling mesoscopic behavior in a wide range of scientific and engineering applications. However, its numerical solution is computationally expensive due to the high dimensionality of the model and the nonlinear nonlocal collision operator, especially for steady-state problems that require iterative solvers. This cost becomes prohibitive for inverse problems, where the induced optimization problem requires repeated forward solves. In this work, we propose a reduced-order model (ROM) for the parametric Boltzmann equation to address this computational challenge. The ROM constructs a low-dimensional approximation space for the parameter-induced solution manifold through a residual-based greedy strategy, and the reduced solution is then obtained via residual minimization over the reduced space, subject to mass conservation. The overall efficiency of the ROM is achieved by exploiting the quadratic structure of the collision operator and a precomputed separable approximation of the collision kernel. The resulting ROM is further applied to a thermally-driven inverse problem for reconstructing collision parameters from the observed macroscopic temperature data. This is accomplished either by directly replacing the PDE constraint with the ROM, leading to a bilevel optimization formulation, or by reformulating the task as a single-level optimization problem through the Karush–Kuhn–Tucker (KKT) conditions. Numerical experiments in both collision-dominated and transport-dominated cases are performed to demonstrate the efficiency and accuracy of the proposed ROM and its effectiveness in inverse problems. In particular, the resulting inverse problem is computationally much more tractable, achieving speedups of several orders of magnitude over that based on the full-order model while maintaining comparable accuracy.
Read the full abstract
Instrumentation and Methods for Astrophysics
3.5-meter Segmented-Mirror Robotic Space Telescope Mission White Paper III. Key Scientific Mission: Exoplanet Science with a Coronagraph
This volume defines the exoplanet science program enabled by the dedicated high-contrast coronagraph in the baseline science payload of the 3.5-meter Segmented-Mirror Robotic Space Telescope. The observatory architecture incorporates the optical interfaces, wavefront sensing and control, pointing stability, and operations software required for coronagraphic observations from the outset. The observing strategy gives priority to the nearest stellar systems because they provide the most accessible laboratories for planetary exploration and the most likely destinations of future interstellar missions. The diffraction limit sets a reflected-light horizon of roughly 10–15 pc for planets at 1 AU and roughly 50–80 pc for Jupiter analogs. Within those horizons, the telescope can image nearby giant planets, obtain reflected-light spectra of their atmospheres, survey young systems and circumstellar disks, and support the habitability and biosignature programs that larger future missions will pursue. The wide-field imager complements the coronagraph through transit photometry, occurrence-rate statistics, and long-term monitoring of stellar magnetic activity. A systematic census of the nearest stellar neighbors provides a lasting reference for exoplanet science and future space exploration.
Read the full abstract
Classical Analysis and ODEs
Sharp estimates for the Jacobi and trigonometric Dunkl heat kernels
We prove sharp both-sided estimates for the $W$-invariant trigonometric Dunkl heat kernel in rank one case, including root systems $A_1$ and $BC_1$. Consequently, we obtain sharp bounds for the non-compact Jacobi heat kernel in the full range of the type parameters.
Robotics
Pre-Lane-change Signal in Transitional Autonomous Vehicles: Results from Controlled Experiments
This paper investigates how a production transitional autonomous vehicle (tAV) develops and executes mandatory lane-change decisions. Using 150 controlled mandatory lane changes from the NC-tALC experiments, the study examines whether the eventual target gap is observable before lateral movement begins and how the tAV progresses longitudinally from that pre-lane-change state to lane-change start. Signal time (SigT) is defined as an operational pre-lane-change-start reference point. A Firth logistic regression predicts whether the tAV eventually merges in front of or behind its nearest target-lane vehicle using relative position and relative speed at SigT. Longitudinal progression from SigT to lane-change start is then examined separately for in-position and repositioning cases. The traffic state at SigT contains substantial information about eventual target-gap choice and provides meaningful lead time before lateral movement begins. The proposed formulation predicts whether the tAV remains with its current gap or repositions to a neighboring gap by moving forward or dropping back, including cases with longitudinal overlap and ambiguous current-gap geometry. The model achieves an average five-fold cross-validated accuracy of 0.89. Results also provide preliminary evidence that in-position and repositioning cases follow different longitudinal pathways from SigT to lane-change start. These findings support a two-stage conjecture of the observable lane-change process: longitudinal preparation from SigT to lane-change start, followed by lateral maneuver execution. The formulation applies to in-position, repositioning, and longitudinally overlapping cases, and can support lane-change models that distinguish target-gap choice from lateral-onset timing while representing longitudinal preparation before lateral movement begins.
Read the full abstract
Instrumentation and Methods for Astrophysics
3.5-meter Segmented-Mirror Robotic Space Telescope Mission White Paper II. Key Scientific Mission: Wide-Field Cosmology and Galaxy Evolution
The 3.5-meter Segmented-Mirror Robotic Space Telescope uses an image slicer for all spectroscopic observations. The planning baseline uses $R \simeq 1000$ for the wide survey and retains selectable $R \simeq 5000$ bands for precision line measurements. The central science case is a dense emission-line galaxy redshift survey for baryon acoustic oscillations and redshift-space distortions. Supernova and quasar programs exploit the stability, multiplexing, and repeatability of space operations. The supernova tier measures rest-frame U and near-ultraviolet magnitudes that separate optical twins at subgroup precision to $z \simeq 0.9$–$1.1$ in standard visits and to $z \simeq 1.3$–$1.5$ in ten-hour stacks. Every wide-survey tile receives three spectroscopic orientations, and a joint scene reconstruction uses their different overlap geometries to recover the spectra. The flagship survey covers 100–300 deg$^2$ and targets $10^6$–$3 \times 10^6$ emission-line galaxies. A deep pencil-beam tier and a supernova time-domain tier complement the wide survey. The same observations provide a census of ultra-diffuse and low-surface-brightness galaxies, map intracluster light, and test cold, self-interacting, and fuzzy dark matter through dwarf-galaxy structure and low-mass halo abundance.
Read the full abstract
Computer Vision
Deeply Interleaved Text-Image Contexts for Multimodal LLMs Assessment
Current evaluations and training of multimodal models predominantly focus on multi-image tasks, largely overlooking interleaved text-image scenarios. In such multi-image tasks, text typically serves merely as task instructions, lacking deep semantic interaction with the visual content. In contrast, realworld applications like text-image co-creation, character tracking, and spatial reconstruction require constant interaction between text and images. Consequently, models must possess a deep understanding of these interleaved contexts. To bridge this gap, we introduce a novel benchmark, TIC-Bench (deeply interleaved Text-Image Contexts), designed to evaluate the capability of models to integrate text-image clues and recover the ground truth facts within deeply interleaved contexts. This benchmark encompasses three core domains: Logical, Temporal, and Spatial Association, which are further categorized into eight specific types, comprising a total of 2,280 questions. We evaluated 10 state-of-the-art MLLMs and observed a substantial performance gap compared to human experts, together with persistent difficulties in integrating evidence distributed across interleaved visual and textual inputs. Ultimately, this benchmark provides a valuable analytical tool for assessing and advancing the ability of multimodal models to effectively integrate text and image information in deeply interleaved contexts. TIC-Bench is publicly available at https://huggingface.co/datasets/pino10010/TIC-Bench
Read the full abstract
Quantum Gases
Magnetic-Field-Calibration-Free Determination of the Hyperfine Constant $A$ in Ultracold Fermi gases of $^{40}$K
Hyperfine constant $A$ is a key parameter of the hyperfine structure and underpins precision spectroscopy and metrology. In this Letter, we develop a magnetic-field-calibration-free method for determining the ground-state hyperfine constant $A$ in an ultracold $^{40}$K Fermi gas by utilizing a pair of magnetically insensitive ("clock") transitions. This overcomes the stringent magnetic-field calibration requirements of conventional methods. We measure the transition frequency between these two magnetically insensitive transitions with Hz-level resolution over a range of magnetic fields, and obtain the ground-state hyperfine constant $A = -h\times 285.730536(2)\,\mathrm{MHz}$, corresponding to an absolute uncertainty of about $2\,\mathrm{Hz}$. Our value reduces the uncertainty by nearly three orders of magnitude compared with previous determinations, providing a substantially improved reference for high-precision spectroscopy and metrology with $^{40}$K.
Read the full abstract
Instrumentation and Methods for Astrophysics
3.5-meter Segmented-Mirror Robotic Space Telescope Mission White Paper I. Overall Architecture and Scientific Mission
We present the preliminary science concept and mission architecture of a 3.5-meter segmented-mirror robotic space telescope currently under study. The observatory is conceived as a versatile platform supporting wide-field cosmology and galaxy evolution, direct imaging and characterization of nearby planetary systems, time-domain and multi-messenger observations, compact-object studies, and Solar-System small-body science. These programs share requirements for angular resolution, photometric stability, rapid target acquisition, spectroscopy, and long-term observing efficiency. The telescope employs an 18-segment 3.5-meter primary mirror for high-angular-resolution imaging from the near-ultraviolet through the optical and near-infrared. The current baseline covers 0.2–1.5 $\mu$m, with the wavelength for diffraction-limited performance to be set by the final wavefront-error budget. Wide-field imaging is intended for deep surveys, precision photometry, and repeated monitoring over approximately 10' $\times$ 10' to 30' $\times$ 30'. Spectroscopic modes with $R \sim 1000$ and higher-resolution options approaching $R \sim 5000$ are being considered for galaxy surveys, transient classification, compact-object spectroscopy, and targeted studies. A dedicated coronagraph is also being studied for direct observations of nearby exoplanetary systems, with a current raw-contrast goal of order $10^{-8}$ and further gains expected from calibration and post-processing. Candidate mission configurations include the Sun–Earth L2 region and alternative Earth orbits, with the final choice driven by science performance, thermal stability, communications, operations, and mission cost. This paper defines the current science requirements, baseline technical configuration, and engineering trade space for further development of the 3.5mST concept.
Read the full abstract
Statistics Theory
Probability-Maximizing Change Detection: Finite-Window Optimality
This paper investigates probability-maximizing sequential change detection, a formulation in which performance is measured by the probability of stopping within an admissible interval of duration $\xi$ after a change rather than by the expected detection delay. Earlier work introduced this viewpoint in a Bayesian setting and subsequently formalized it under Lorden- and Pollak-type minimax criteria for the case in which successful detection must occur on the first post-change observation, i.e., $\xi=1$. This paper generalizes this framework in two directions. First, the decision maker is allowed to stop within a prescribed window of $\xi\in\mathbb{N}$ post-change observations. Second, the monitored process is allowed to experience multiple, non-overlapping transient change episodes with unknown onset times and durations, so that success consists of stopping within the admissible window associated with any one of these episodes. False alarms are controlled through an average run-length constraint. For exact finite-sample analysis, the paper introduces a survival-weighted average success criterion, which represents the probability of successfully detecting a randomly encountered change opportunity conditional on the detector being active at its onset. It is established that this criterion admits an exact representation as the expected truncated Shiryaev–Roberts (TSR) statistic at the stopping time normalized by the average run length, and it characterizes its exactly optimal stopping rule. The optimal procedure has finite memory and aggregates the likelihood-ratio evidence corresponding to all possible change onsets within the most recent window and compares the resulting TSR statistic with a state-dependent continuation boundary obtained from an optimal-stopping formulation.
Read the full abstract
Quantum Physics
Thouless pumping and generation of squeezed Fock-state superpositions in a Fock-state lattice
In this paper, Thouless pumping in a one-dimensional semi-infinite Fock-state lattice is investigated. A distinctive feature of such lattices is the intrinsic $\sqrt{n}$-dependent coupling arising from the bosonic mode, which leads to spatially nonuniform hopping amplitudes. In the dimer limit, the topological invariants and the quantized transport dynamics in the Fock-state basis are numerically evaluated and analyzed. By introducing an additional inter-cell coupling and applying a squeezing transformation, the framework is then extended to Thouless pumping in the squeezed Fock-state basis, where a topologically protected scheme for preparing superpositions of squeezed Fock states is proposed. This study establishes Thouless pumping in Fock-state lattices as a useful tool for quantum state engineering, shifting the focus from observing topological transport to harnessing it for the preparation of non-classical states of the bosonic mode.
Read the full abstract
Cryptography and Security
Learning-Based Reconstruction Attacks on Coordinate-Obfuscated Point Clouds
Volumetric video based on point cloud representations enables immersive virtual and augmented reality applications but introduces significant challenges for efficient and secure content delivery. Prior work proposed a selective coordinate encryption framework for point clouds that encrypts only a subset of coordinates, reducing computational costs while visually degrading unauthorized content. However, it remains unclear whether the remaining unencrypted information is sufficient to enable content reconstruction. In this paper, we evaluate the robustness of selective coordinate encryption against machine learning-based reconstruction attacks. We consider an attacker with access to selectively encrypted point clouds attempting to recover encrypted coordinates without decryption by exploiting spatial and geometric correlations in the unencrypted data. We evaluate PointNet and Random Forest models under two encryption granularities: X, where all $X$ coordinates are encrypted, and 2X, where every second $X$ coordinate is encrypted. Our results show that reconstructing fully encrypted $X$ coordinates remains challenging, whereas the 2X scheme leaks sufficient information through neighboring coordinates to enable accurate reconstruction. These findings demonstrate that the security of selective coordinate encryption depends strongly on encryption granularity.
Read the full abstract
Mesoscale and Nanoscale Physics
Direct Observation of the Zigzag Edge States of a Supramolecular Diatomic Kagome Lattice
Lattice geometry plays a fundamental role in the behavior of Bloch electrons in a crystal. The diatomic Kagome lattice, an extension of the honeycomb and Kagome lattices, is predicted to give rise to emergent and topological phenomena, but its experimental investigation has been limited thus far. Here, we fabricate a diatomic Kagome lattice through self-assembly of a triptycene derivative with phenazine moieties (Trip-Phz)—a $\mathrm{C_3}$-symmetric, non-planar $\pi$-conjugated molecule. Our scanning tunneling microscopy (STM) observations show that Trip-Phz forms a highly ordered diatomic Kagome lattice terminated by zigzag-type edges on the Pb(111) surface. Combined STM measurements and tight-binding calculations provide direct evidence for the existence of the edge states that correspond to those of graphene. These states are topological edge states dictated by the quantization of the Zak phase and the bulk-edge correspondence.This work reveals an ideal platform for exploring quantum materials with unique lattice geometries using supramolecular technology.
Read the full abstract
Machine Learning
Online Reinforcement Learning in the Met Office Unified Model through Distributed Model-Agent Coupling
Machine-learnt corrections can complement numerical weather prediction provided that they operate stably within an evolving numerical model. In this study, we couple the Met Office (UKMO) Unified Model (UM) with distributed reinforcement-learning agents through rank-local tensors. A column-aware deep deterministic policy gradient (DDPG) actor uses local vertical structure together with full-column context to apply bounded corrections to potential temperature and horizontal wind. During training, we perform ten nudged 6-hr 12-min forecasts, with nudging towards the UKMO operational analysis providing an immediate counterfactual target from which the policy learns. The resulting actor is then frozen and applied to a non-nudged forecast without access to analysis inputs or further weight updates. Relative to a matched non-nudged native forecast at +6 h, the corrected forecast reduces global latitude-weighted MAE by 2.85% for $Z_{500}$, 2.16% for MSLP, 5.16% for $T_{500}$ and 2.27% for $T_{1.5\textrm{m}}$, with an observed 3.57% wall-time overhead compared to native execution. Even though training and inference share the same initialisation, this single-case experiment demonstrates significant promise and feasibility, laying the groundwork for RL-based bias correction and parametrisations within operational systems.
Read the full abstract
Computer Vision
MARS: What Retrieval Signals Are Hidden in Multimodal Large Language Models for Text-Video Retrieval?
Text-video retrieval requires representations that can distinguish videos with similar scenes, actions, and temporal patterns. Recent multimodal large language models have been adapted as embedding models, but they often represent each input using a single token from the final layer. This can compress diverse video-text cues into a single vector and limit fine-grained retrieval. To address this limitation, we propose MARS, a multi-layer and multi-slot embedding framework for text-video retrieval. MARS constructs multiple adaptive representation slots by combining hidden states from different decoder layers, compares corresponding text and video slots, and aggregates their similarities for retrieval. To better handle confusing candidates, we further introduce a hard-negative-aware slot specialization objective that encourages the slots to capture discriminative matching cues. Experiments on four text-video retrieval benchmarks show that MARS achieves state-of-the-art results in both direct similarity-based retrieval and reranking settings. Ablation studies and analyses demonstrate that multi-layer fusion, multiple slots, and hard-negative-aware slot specialization provide complementary gains. Code is available at https://github.com/sejong-rcv/MARS.
Read the full abstract
Cryptography and Security
A Finger on the Scale: Covert Policy Steering through Agentic Skills
Reusable agent skills extend large language model (LLM) agents with task procedures, tool-use guidance, and output constraints. Yet these skills also act as externalized behavioral policies, which create a supply-chain risk: a third-party skill may preserve the declared task and valid output interface while covertly redirecting agent decisions toward an undisclosed objective. We formalize Skill Policy Integrity, which requires a Skill-induced policy to remain aligned with its declared functionality and the user-authorized objective. We further present SkillShift, a constrained black-box framework for covert policy steering without explicit target command injection or task hijacking. It combines semantically plausible policy edits with hierarchical validation, failure-guided optimization, and strategy compression to preserve effectiveness, output validity, transferability, and inconspicuousness. We instantiate this threat in agentic commerce and software dependency use, with SkillShift achieving attacker-favored selection rates of 81.33% and 63.33% while maintaining a 100% utility-preserving rate. The frozen policies also transfer without further optimization across heterogeneous LLM backends and agent environments. Moreover, the evaluated scanners fail to detect the constructed skills, motivating behavioral auditing of reusable skills as agent policy artifacts.
Read the full abstract
Earth and Planetary Astrophysics
Photometric characterization of near-Earth asteroids: rotation, taxonomy, and candidate evidence for internal cohesion
We present the results of a survey of previously uncharacterized near-Earth asteroids (NEAs) conducted between the second half of 2024 and the first months of 2026 using broadband $BVR_{c} I_{c}$ photometry and time-resolved lightcurve observations. Color indices were obtained for 14 NEAs of the 15 observed, with a dimension range between 0.11 and 2.5 km, and used to derive taxonomic classifications through comparison of a sample of reference reflectance curves. The sample appears to be dominated by S-, X-, and C-complex and V-type asteroids; absolute magnitudes and effective diameters were estimated using taxonomically appropriate albedos. Rotation periods were determined or constrained for several targets. Some large objects appear to rotate faster than the classical cohesionless spin barrier at $P\simeq 2.2$~h, although in some cases the period determinations remain tentative due to limited temporal coverage. A cohesive rubble-pile model provides a plausible explanation for the observed rapid rotation within the uncertainties of the derived physical parameters, and modest cohesive strengths of order $10^{2}$–$10^{4}$~Pa are sufficient to account for the observed rotation rates.
Read the full abstract
Quantum Physics
Combinatorial optimization of connected UAV communication bridges for emergency response
We present a combinatorial optimization problem for the strategic deployment of UAVs equipped with 5G antennas to assist rescue operations in regions hit by natural disasters. Our goal is to optimize the placement of UAVs to provide coverage in flying ad-hoc networks among given candidate sites. Our formulation aims to maximize signal coverage and minimize interference while ensuring network connectivity. To mitigate interference effects, we incorporate the use of multiple frequencies. We formulate this problem as an integer quadratic program (IQP). We present numerical solutions obtained via the CPLEX solver and conduct a preliminary analysis of the problem's scalability in realistic network configurations. Our findings reveal a significant exponential increase in Time-to-Solution (TTS) as the number of sites grows, which poses a critical challenge in urgent, time-sensitive scenarios. To address this issue, approximate suboptimal solutions can be produced by enforcing a time limit on the solver. Although these solutions are not optimal, they preserve connectivity in most cases, providing a practical trade-off between solution quality and computational times that remain within feasible limits for real-time UAV redeployment. Recognizing the limitations of classical solvers in these contexts, we explore quantum computing as a promising alternative. Specifically, we reformulate the problem as a quadratic unconstrained binary optimization (QUBO) problem, suitable for most quantum algorithms. Through high-performance computing emulation, we show that the quantum adiabatic algorithm (QAA) can accurately solve small-scale instances, paving the way for future application of quantum computing to large-scale, time-critical optimization problems in disaster response.
Read the full abstract
Algebraic Geometry
Non-nef loci in mixed characteristic
We introduce relative versions of non-nef loci and restricted base loci, and investigate a relative version of Boucksom–Broustet–Pacienza's conjecture that these two loci coincide. We prove the conjecture holds for normal integral schemes projective and flat over a Dedekind domain of characteristic zero with mild singularities, such as BCM-regularity. This result is a mixed characteristic analogue of results of Cacciola–Di Biagio in characteristic zero and Sato in positive characteristic. To prove this result, we show that BCM-regularity is preserved under perturbations by divisors with small vanishing order.
Read the full abstract
Computer Vision
Stereo 4D Radar for 3D Object Detection: Integrating Geometric Alignment and Absolute Velocity Estimation
Four-dimensional (4D) Radar is a powerful sensing modality capable of detecting surrounding three-dimensional (3D) objects under diverse weather conditions and providing Doppler-based motion information. However, raw 4D Radar signals contain significant clutter from road surfaces, guardrails, and surrounding vehicles, along with multipath-induced ghost reflections and the receiver's inherent noise floor. Consequently, preprocessing algorithms designed to remove such invalid measurements often make the Radar data excessively sparse. Moreover, the Doppler measurements provided by 4D Radar describe only the radial component of an object's velocity, limiting their ability to recover the full motion state. In this paper, we introduce a stereo 4D Radar-based 3D object detection framework that exploits the geometric disparity between left and right Radars to estimate the absolute velocity of objects and achieve more robust perception through the fusion of their complementary features. The effectiveness of the proposed framework is validated on our in-house stereo 4D Radar dataset, demonstrating performance gains of 8.82 points in AP 3D and 9.0 points in AP BEV over state-of-the-art mono 4D Radar baselines. These results demonstrate that absolute velocity estimation combined with stereo geometry-aware feature fusion leads to substantial improvements in 3D object detection.
Read the full abstract
Quantum Physics
Optimal Fusion Strategies for Quantum Computation
Logical fusions are important for a number of tasks in quantum information, such as quantum error correction and quantum repeaters. In the photonic setting one must contend with the fact that physical fusions can fail, i.e. individual qubits are measured in a user-controlled product state basis with some probability, which can lead to a failure on the logical level. The choice of failure basis of each qubit is known as a fusion strategy, and finding good fusion strategies is important for optimizing performance of fusion-based quantum computation. Here we provide a complete characterization when $k=1$ qubits are encoded, and in particular characterize those codes and fusion strategies such that all but one physical fusion can fail, i.e.~perfect fusion strategies. In doing so, we recover previously known perfect fusion strategies, and find perfect fusion strategies for quantum parity-check codes, answering an open question. We furthermore show that perfect fusion strategies are generic: random $[[n, 1, d]]$ graph codes admit a perfect fusion strategy with probability exponentially close to $1$. Additionally we motivate the study of a new graph parameter, namely the maximum degree of a graph at a given vertex taken over all LC-equivalent graphs, by giving a new operationally meaningful interpretation of it.