Ruilin Xing

Mrs. Ruilin Xing


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 October 2026 in Electronics
Verified
Journal Article
Open access
PDF file
RXRuilin Xing
Ruilin Xing
FLFeihong Li
Feihong Li
JLJiayue Liu
Jiayue Liu
JZJiali Zheng
Jiali Zheng
WLWei Liu
Wei Liu
WXWanzhi Xie
Wanzhi Xie
Large Language Model (LLM) interaction records are increasingly being used as digital evidence for forensics and compliance. However, traditional linear tamper-evident logs cannot capture the complex nonlinear conversation evolution, such as prompt-editing, response regeneration, session deletion, multi-device concurrency, and selective sharing. This study proposes the Verifiable Conversation Transcript (VCT), which models these operations as authenticated account-level state transitions across a three-layer cryptographic structure: Q&A pairs form branch hash chains and branch tails aggregate into session-level Merkle roots (MTRcon). These session-level roots are further aggregated into the account-level Merkle root (MTRacc), which is jointly authenticated by both user and server signatures. The VCT also introduces a serialized deletion protocol, a deterministic merge protocol that preserves concurrent non-deletion updates, a gossip-based fork detection mechanism that produces non-repudiable forensic evidence, and a verifiable sharing protocol that constructs an independent dual-signed share hash chain across disclosed nodes. Based on standard cryptographic assumptions, the VCT guarantees integrity, consistency, share verifiability, and non-repudiation of account-level conversation records. A Python prototype achieves sub-millisecond mean latency under minimal state with short synthetic payloads. With 21 KB per-node payloads, the estimated metadata-to-content ratio is approximately 0.9% across the tested account scales. These results support the computational feasibility of the prototype under the tested conditions and provide practical guidance for the engineering design and optimization of verifiable LLM conversation systems.

23 December 2024 in arXiv
Verified
Preprint
Open access
PDF file
JXJinming Xing
Jinming Xing
DLDongwen Luo
Dongwen Luo
QCQisen Cheng
Qisen Cheng
CXChang Xue
Chang Xue
RXRuilin Xing
Ruilin Xing
Fuzzy Graph Attention Network (FGAT), which combines Fuzzy Rough Sets and Graph Attention Networks, has shown promise in tasks requiring robust graph-based learning. However, existing models struggle to effectively capture dependencies from multiple perspectives, limiting their ability to model complex data. To address this gap, we propose the Multi-view Fuzzy Graph Attention Network (MFGAT), a novel framework that constructs and aggregates multi-view information using a specially designed Transformation Block. This block dynamically transforms data from multiple aspects and aggregates the resulting representations via a weighted sum mechanism, enabling comprehensive multi-view modeling. The aggregated information is fed into FGAT to enhance fuzzy graph convolutions. Additionally, we introduce a simple yet effective learnable global pooling mechanism for improved graph-level understanding. Extensive experiments on graph classification tasks demonstrate that MFGAT outperforms state-of-the-art baselines, underscoring its effectiveness and versatility.