Skip to content

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

Stable Implicit Conditioning With Residual Statistics for Multivariate Time-Series Anomaly Detection in Industrial IoT Monitoring

Timely anomaly detection in Industrial Internet of Things (IIoT) monitoring requires robust modeling of noisy multivariate sensor streams. Although decomposition-derived residuals provide a potentially useful auxiliary view for multivariate time-series anomaly detection (MTSAD), they are not clean anomaly surrogates in unsupervised settings, as they also contain normal fluctuations, sensor noise, and decomposition artifacts. Therefore, the key challenge is not simply whether residual evidence is useful, but how it can be integrated stably without disturbing the backbone’s native anomaly discrimination process. To address this issue, we propose stable implicit conditioning (SIC), a lightweight and general framework for decomposition-aware unsupervised MTSAD. Instead of reusing residual evidence through explicit downstream intervention, SIC converts compact residual statistics into a bounded sample-dependent channelwise calibration signal for mild representation-level adaptation. When instantiated on the anomaly Transformer (AT), the resulting AT-SIC improves upon the reproduced backbone on four out of five public benchmarks. Additional analyses on decomposition choices, structured disturbances, boundary cases, and cross-backbone transfer show that SIC provides a more reliable evidence utilization path than several intuitive explicit reuse strategies, while introducing only negligible efficiency overhead. These results suggest that decomposition-derived residual evidence is better exploited implicitly than explicitly in this setting.

Guangxia Xu, Zhuo Ye, Xing Huang et al. · 0 citations
2026

GNN-OSS: A Capacity-Feasible Graph Learning Framework for Secure Blockchain Sharding in IIoT

Effective scaling of blockchain-enabled Industrial Internet of Things (IIoT) requires sharding that simultaneously ensures transaction locality, strict committee-size feasibility, and robustness against malicious node concentration. Existing methods often fail to balance this trilemma, risking either infeasible deployments or increased shard-takeover vulnerabilities. To address this, we propose GNN-OSS, a deployable sharding framework that decouples topology-aware preference learning from hard constraint enforcement. It first employs a trust-repulsion graph neural network to learn locality-aware preferences while discouraging low-trust nodes from collapsing into the same representation region. A Post-Hoc Capacity-Constrained Projection (PH-CCP) then maps these soft preferences into strictly feasible shard assignments. Finally, an entropy-driven Overlapping Sparse Scheme (OSS) selectively replicates boundary nodes to reduce residual cross-shard overhead without altering primary consensus membership. Evaluations demonstrate that, under the evaluated settings, GNN-OSS achieves a favorable performance–security trade-off. Against 20% malicious nodes, it substantially mitigates shard-takeover risks. Furthermore, it improves throughput by up to 33% over strictly feasible baselines and lowers the cross-shard ratio from 6.4% to 4.4% with minimal per-epoch overhead. Overall, GNN-OSS provides a practical sharding framework for open or hybrid blockchain-enabled IIoT environments.

Guangxia Xu, Zhuo Ye, Lu Wang et al. · 0 citations