arXiv subjects

Sirui Liu

Publications and source records attributed to Sirui Liu.

11 recordsLinked to original sources

arXiv2026

A Session Interaction Framework for The Multiple-Unicast Conjecture

The multiple-unicast conjecture asserts that network coding offers no throughput advantage over routing in undirected networks. Its validity is known to imply fundamental lower bounds in computational complexity. We propose a Session Interaction Framework that reduces the conjecture to a central equivalence: the conjecture holds universally if and only if every irreducible core is independent. This result transforms the global feasibility problem into a two-stage process. First, to make the reduction phase tractable, we provide simplified sufficient conditions for session dominance, offering geometric criteria to iteratively simplify complex session sets. Second, for the remaining "irreducible core," we propose a Session Decoupling Theorem, reducing the conjecture's validity for a session set to its independent subsets. Topologically, we prove that sessions separated by high-cost cuts or cut-vertices are guaranteed to be independent. By integrating these reduction and decomposition mechanisms, our framework offers a systematic methodology to verify the conjecture across general network topologies.

cs.IT↗

arXiv2026

On the Multiple-Unicast Conjecture: Beyond Cut Metrics

Network coding allows intermediate nodes to encode received messages before transmission. The multiple-unicast conjecture asserts that coding has no throughput advantage over fractional routing for independent unicast sessions in any undirected network. Despite more than two decades of sustained study, this central open problem remains unresolved. The conjecture is deeply connected to computational complexity: a proof would yield long-sought lower bounds for fundamental problems. To study the conjecture, this paper develops a unified metric framework from the perspective that the basic objects behind the comparison between coding and routing are not cuts alone, but graph metrics. Using this framework, we prove the conjecture for three new classes of undirected networks: (a) networks with at most five terminal locations; (b) planar networks whose terminal locations lie on the boundaries of at most three designated faces, with each session's endpoints on one such face; and (c) networks with arbitrarily many nodes and terminal locations under a structural restriction on session endpoints. We give a new proof that the conjecture holds for networks with at most six coding nodes, without computer-aided search, and show that if the conjecture holds on $\Gamma_{3,3}$, then it holds whenever no three sessions have six distinct terminal locations.

cs.IT↗

arXiv2026

Fleet: Few Shots Lead Effective AI-generated Image Detection

AI-generated image (AIGI) detection is undergoing a critical transition from laboratory benchmarks to open-world adversarial defense. The prevalent paradigm focuses on finding static feature spaces, assuming that some invariant artifacts learned from historical data can achieve universal zero-shot generalization. While achieving saturation on several AIGI benchmarks, this static hypothesis suffers a severe performance drop against rapidly evolving generators (e.g., SD3, Nano Banana Pro). To address these limitations, we propose that the field should expand beyond "static generalization" to a new paradigm of "dynamic adaptation". We introduce Fleet, a framework that pioneers a dynamic paradigm of continuous few-shot evolution, enabling rapid alignment with emerging generative threats. Fleet improves few-shot adaptation by replacing unconstrained feature updates with constrained routing correction, where avoidance routing redirects novel AI samples away from Non-AI-dominated routes within decoupled subspaces. To validate this, we present Treasure, a benchmark spanning 64 models and 360k images, featuring diverse architectures and 20 closed-source commercial engines. Experiments reveal that while static SOTA methods fail catastrophically on modern generators, Fleet restores performance from 20.4% to 73.1% with only 10-shot adaptation on "Doubao Seedream 4.0". Code and data are available at https://github.com/ICTMCG/Fleet .

cs.CV↗

arXiv2025

Taming polymorphism of tubule self-assembly using templated growth

Self-closing assembly is prone to polymorphism due to thermally-excited bending fluctuations, which permit the formation of off-target assemblies at the point of self-closure. One way to overcome this source of polymorphism is to use templated growth, a process in which assembly initiates from a precisely-defined seed rather than by spontaneous nucleation. We explore this approach to quelling polymorphism in the self-closing assembly of cylindrical tubules assembled from DNA-origami subunits with user-specified inter-subunit binding angles and specific interactions. We develop two strategies to create seeds with precisely-defined diameters and helicity: 1) using multicomponent assembly; and 2) purifying a specific seed-type from a polymorphic mixture using gel electrophoresis and gel extraction. By tuning the seed and monomer concentrations, and adjusting the assembly temperature, we determine the conditions under which tubules grow from the seed while avoiding spontaneous nucleation. We observe that templated tubules tend to follow the guidance of the seed, thereby increasing the selectivity of the target geometry. Also, we find that by tuning the diameter of the seed, one can template the growth of monodisperse tubules over a range of target diameters, even while using a single monomer type with a single preferred local curvature. Our results demonstrate that employing precisely defined seeds to guide assembly can significantly decrease polymorphism in self-closing assembly in a controllable and economical way.

cond-mat.soft↗

arXiv2025

CryoDyna: Multiscale end-to-end modeling of cryo-EM macromolecule dynamics with physics-aware neural network

Single-particle cryo-EM has transformed structural biology but still faces challenges in resolving conformational heterogeneity at atomic resolution. Existing cryo-EM heterogeneity analysis methods either lack atomic details or tend to subject to overfitting due to image noise and limited information in single views. To obtain atomic detailed multiple conformations and make full use of particle images of different orientations, we present here CryoDyna, a deep learning framework to infer macromolecular dynamics directly from 2D projections by integrating cross-view attention and multi-scale deformation modeling. Combining coarse-grained MARTINI representation with atomic backmapping, CryoDyna achieves near-atomic interpretation of protein conformational landscapes. Validated on multiple simulated and experimental datasets, CryoDyna demonstrates improved modeling accuracy and robustly recovers multi-scale complex structure changes hidden in the cryo-EM particle stacks. As examples, we generated protein-RNA coordinated motions, resolved dynamics in the unseen region of RAG signal end complex, mapped translocating ribosome states in a one-shot manner, and revealed step-wise closure of a membrane-anchored protein multimer. This work bridges the gap between cryo-EM heterogeneity analysis and atomic-scale structural dynamics, offering a promising tool for exploration of complex biological mechanisms.

q-bio.BM↗

arXiv2024

Vulnerabilities Analysis and Secure Controlling for Unmanned Aerial System Based on Reactive Synthesis

Complex Cyber-Physical System (CPS) such as Unmanned Aerial System (UAS) got rapid development these years, but also became vulnerable to GPS spoofing, packets injection, buffer-overflow and other malicious attacks. Ensuring the behaviors of UAS always keeping secure no matter how the environment changes, would be a prospective direction for UAS security. This paper aims at introducing a pattern-based framework to describe the security properties of UAS, and presenting a reactive synthesis-based approach to implement the automatic generation of secure UAS controller. First, we study the operating mechanism of UAS and construct a high-level model consisting of actuator and monitor. Besides, we analyze the security threats of UAS from the perspective of hardware, software and cyber physics, and then summarize the corresponding specification patterns of security properties with LTL formulas. With the UAS model and security specification patterns, automatons for controller can be constructed by General Reactivity of Rank 1 (GR(1)) synthesis algorithm, which is a two-player game process between Unmanned Aerial Vehicle (UAV) and its environment. Finally, we experimented under the Ardupilot simulation platform to test the effectiveness of our method.

cs.FL↗

arXiv2024

Non-Hermitian entanglement dip from scaling-induced exceptional criticality

It is well established that the entanglement entropy of a critical system generally scales logarithmically with system size. Yet, in this work, we report a new class of non-Hermitian critical transitions that exhibit dramatic divergent dips in their entanglement entropy scaling, strongly violating conventional logarithmic behavior. Dubbed scaling-induced exceptional criticality (SIEC), it transcends existing non-Hermitian mechanisms such as exceptional bound states and non-Hermitian skin effect (NHSE)-induced gap closures, which are nevertheless still governed by logarithmic entanglement scaling. Key to SIEC is its strongly scale-dependent spectrum, where eigenbands exhibit an exceptional crossing only at a particular system size. As such, the critical behavior is dominated by how the generalized Brillouin zone (GBZ) sweeps through the exceptional crossing with increasing system size, and not just by the gap closure per se. We provide a general approach for constructing SIEC systems based on the non-local competition between heterogeneous NHSE pumping directions, and show how a scale-dependent GBZ can be analytically derived to excellent accuracy. Beyond 1D free fermions, SIEC is expected to occur more prevalently in higher-dimensional or even interacting systems, where antagonistic NHSE channels generically proliferate. SIEC-induced entanglement dips generalize straightforwardly to kinks in other entanglement measures such as Renyi entropy, and serve as spectacular demonstrations of how algebraic and geometric singularities in complex band structures manifest in quantum information.

quant-ph↗

arXiv2023

Double Dome and Reemergence of Superconductivity in Pristine 6R-TaS2 under Pressure

Investigating the implications of interlayer coupling on superconductivity is essential for comprehending the intrinsic mechanisms of high temperature superconductors. Van der Waals heterojunctions have attracted extensive research due to their exotic interlayer coupling. Here, we present a natural heterojunction superconductor of 6R-TaS2 that demonstrates a double-dome of superconductivity, in addition to, the reemergence of superconducting under high pressures. Our first principles calculation shows that the first dome of superconductivity in 6R-TaS2 can be attributed to changes in interlayer coupling and charge transfer. The second superconducting dome and the reemergence of superconductivity can be ascribed to changes in the density of states resulting from Fermi surface reconstruction, in which the DOS of T-layer and S p-orbitals play a crucial role. We have reported the first observation in TMDs that non-metallic atoms playing a dominant role in the reemergence of superconducting and the influence of two Lifshitz transitions on superconducting properties.

cond-mat.supr-con↗

arXiv2023

Higher-order protection of quantum gates: Hamiltonian engineering coordinated with dynamical decoupling

Dynamical decoupling represents an active approach towards the protection of quantum memories and quantum gates. Because dynamical decoupling operations can interfere with a system's own time evolution, the protection of quantum gates is more challenging than that of quantum states. In this work, we put forward a simple but general approach towards the realization of higher-order protection of quantum gates and further execute the first cloud-based demonstration of dynamical-decoupling-protected quantum gates at the first order and the second order. The central idea of our approach is to engineer (hence regain the control of) the gate Hamiltonian in coordination with higher-order dynamical decoupling sequences originally proposed for the protection of quantum memories. The physical demonstration on an IBM quantum processor indicates the effectiveness and potential of our approach on noisy intermediate scale quantum computers.

quant-ph↗

arXiv2023

Unsupervisedly Prompting AlphaFold2 for Few-Shot Learning of Accurate Folding Landscape and Protein Structure Prediction

Data-driven predictive methods which can efficiently and accurately transform protein sequences into biologically active structures are highly valuable for scientific research and medical development. Determining accurate folding landscape using co-evolutionary information is fundamental to the success of modern protein structure prediction methods. As the state of the art, AlphaFold2 has dramatically raised the accuracy without performing explicit co-evolutionary analysis. Nevertheless, its performance still shows strong dependence on available sequence homologs. Based on the interrogation on the cause of such dependence, we presented EvoGen, a meta generative model, to remedy the underperformance of AlphaFold2 for poor MSA targets. By prompting the model with calibrated or virtually generated homologue sequences, EvoGen helps AlphaFold2 fold accurately in low-data regime and even achieve encouraging performance with single-sequence predictions. Being able to make accurate predictions with few-shot MSA not only generalizes AlphaFold2 better for orphan sequences, but also democratizes its use for high-throughput applications. Besides, EvoGen combined with AlphaFold2 yields a probabilistic structure generation method which could explore alternative conformations of protein sequences, and the task-aware differentiable algorithm for sequence generation will benefit other related tasks including protein design.

cs.LG↗

arXiv2022

PSP: Million-level Protein Sequence Dataset for Protein Structure Prediction

Proteins are essential component of human life and their structures are important for function and mechanism analysis. Recent work has shown the potential of AI-driven methods for protein structure prediction. However, the development of new models is restricted by the lack of dataset and benchmark training procedure. To the best of our knowledge, the existing open source datasets are far less to satisfy the needs of modern protein sequence-structure related research. To solve this problem, we present the first million-level protein structure prediction dataset with high coverage and diversity, named as PSP. This dataset consists of 570k true structure sequences (10TB) and 745k complementary distillation sequences (15TB). We provide in addition the benchmark training procedure for SOTA protein structure prediction model on this dataset. We validate the utility of this dataset for training by participating CAMEO contest in which our model won the first place. We hope our PSP dataset together with the training benchmark can enable a broader community of AI/biology researchers for AI-driven protein related research.

q-bio.BM↗