arXiv subjects

Jianbin Li

Publications and source records attributed to Jianbin Li.

16 recordsLinked to original sources

arXiv2026

Some constructions of restricted Kakeya sets

In this paper, we consider Kakeya sets with the additional restriction that centers of the unit line segments belong to a given set. In particular, for every uncountable Borel set $A\subset\mathbb{R}^d$, $d\geq 2$, we construct a compact subset of $\mathbb{R}^d$ of Lebesgue measure zero that contains, in every direction, a unit line segment whose center lies in $A$. Notice that every such Kakeya set (not even necessarily compact) must have positive Lebesgue measure if $A$ is countable. So our result shows that the countability is in fact the only obstruction.

math.CA↗

arXiv2026

FAST Ultra-Deep Survey: the baryonic Tully-Fisher relation in FUDS0 field

The Baryonic Tully-Fisher relation (BTFR) is one of the tightest scaling relations for disk galaxies in the local Universe, and therefore is an important tool for studying the fomation and evolution of galaxies. However, the evolution of the BTFR over cosmic time is poorly understood due to the limited sample of HI galaxies beyond the local Universe, limitations of optically-derived rotation curves, and selection effects. In this work, we explore the BTFR at redshifts up to $z=0.42$ from galaxies detected in the pilot FAST Ultra-Deep Survey (FUDS) field, FUDS0. As found in previous work, we identify two components in the plane of baryonic mass versus rotational velocity, $C_{\rm BTFR}$ (tight) and $C_{\rm Outlier}$ (dispersed). A Gaussian mixture model is employed to recover the BTFR, yielding the best fit parameters for the slope $k=3.32_{-0.11}^{+0.12}$, zero point $b=10.07_{-0.03}^{+0.03}$, and intrinsic scatter $\sigma_{\rm BTFR}=0.036_{-0.009}^{+0.010}$. A random forest classifier is used to investigate the origin of the outlier component. We find that low signal significance and inaccurate inclinations are the key factors that contribute to the outlier population, indicating that observational effects are the dominant origin. Evolutionary trends are examined in three different redshift bins. Both the slope and zero point show consistency within 1-$\sigma$ uncertainty in the two low redshift bins, indicating no significant evolution. The indirectly inferred BTFR parameters from the $C_{\rm Outlier}$ component in the highest redshift bin aligns with the conclusion. The ongoing full FUDS survey will provide a larger sample to enable more accurate constraints on BTFR evolution.

astro-ph.GA↗

arXiv2026

Privacy-Preserving RAG via Multi-Agent Semantic Rewriting: Achieving Confidentiality Without Compromising Contextual Fidelity

Retrieval-Augmented Generation enhances large language models by incorporating external knowledge, but deploying it in sensitive scenarios risks privacy leakage via malicious prompts. To address this, we propose a multi-agent framework that sanitizes retrieved content through semantic rewriting. By employing three specialized agents for privacy extraction, semantic analysis, and reconstruction, our approach collaboratively removes sensitive identifiers while preserving the semantic core. We evaluate the framework on the ChatDoctor and Wiki-PII datasets across six large language models. Experimental results demonstrate a significant reduction in privacy leakage under targeted attacks. For instance, we reduced targeted information exposure in LLaMA-3-8B from 144 instances in the baseline to just 1. Furthermore, we maintain strong contextual fidelity with a BLEU-1 score of 0.122, outperforming the existing SAGE method's 0.117. Finally, the framework operates as an asynchronous preprocessing module, introducing no additional latency to online inference, as all rewriting is executed as a one-time offline preprocessing step. To promote reproducibility, the source code of this work is publicly available at https://github.com/foursoils/Privacy-Preserving-RAG.

cs.CL↗

arXiv2025

Ev-Trust: An Evolutionarily Stable Trust Mechanism for Decentralized LLM-Based Multi-Agent Service Economies

Decentralized LLM-based multi-agent service economies face three vulnerabilities that undermine traditional trust mechanisms: reduced cost of fraud, difficulty in evaluating service quality, and instability of service content. These compounding vulnerabilities can trigger population-level trust collapse and the proliferation of short-sighted strategies. We propose Ev-Trust, an evolutionarily stable trust mechanism that addresses these vulnerabilities through three targeted designs: a cross-validation gate leveraging requestor semantic comprehension to assess response validity, a variance-standardized drift measure filtering endogenous stochasticity from genuine behavioral anomalies, and an embedding of trust signals into the expected revenue function that converts trustworthiness into an evolutionary survival advantage. Based on replicator dynamics with a noisy best response micro-foundation, we prove the asymptotic stability of cooperative evolutionarily stable strategies and derive explicit threshold conditions for maintaining cooperative equilibria. We evaluate Ev-Trust through 100-round simulations with at least 100 heterogeneous LLM-driven agents covering seven behavioral types. The experiments are conducted on TruthfulQA and TriviaQA, two factual question-answering benchmarks. Compared to baselines based on transitive trust aggregation, reinforcement-learning reputation, and pure evolutionary imitation, Ev-Trust reduces malicious agent participation by approximately 60%, suppresses the fraudulent service rate by approximately 50%, and maintains stable trust differentiation under a 30% adversarial mutation. These results demonstrate that coupling semantic trust evaluation with evolutionary incentives provides a principled foundation for securing cooperation in decentralized LLM-based multi-agent systems.

cs.MA↗

arXiv2025

The diverse morphology of gravitational wave signals from merging neutron-star white-dwarf binaries

In sufficiently compact neutron star-white dwarf (NSWD) binary systems, orbital decay means the white dwarf eventually fills its shrinking Roche lobe, initiating a phase of mass transfer. The exchange of angular momentum-both internal and external-plays a critical role in determining the binary's evolutionary outcome. For neutron stars with relatively low magnetic fields and spin frequencies, whether the orbital separation continues to shrink depends on the interplay between gravitational wave (GW) radiation and mass transfer dynamics. We compute the orbital evolution of NSWD binaries across a broad parameter space, incorporating four key variables. Our results reveal distinct boundaries in the NS-WD mass-mass diagram: binaries with white dwarf masses above these thresholds undergo rapid orbital decay and direct coalescence. The dependence of these boundaries on system parameters indicates that Roche-lobe-filling NSWD binaries can follow multiple evolutionary pathways -- a phenomenon we refer to as branched or polymorphic evolution. NSWD binary systems emit strong and diverse GW signals, many of which would be detectable by space-based GW observatories. The morphology of the evolving GW waveform provides a direct diagnostic for the NSWD binary configuration, including any contribution from an accretion disk. Our models can provide critical waveform templates for identifying merging binary signals in real-time GW data.

astro-ph.HE↗

arXiv2025

SSCL-BW: Sample-Specific Clean-Label Backdoor Watermarking for Dataset Ownership Verification

The rapid advancement of deep neural networks (DNNs) heavily relies on large-scale, high-quality datasets. However, unauthorized commercial use of these datasets severely violates the intellectual property rights of dataset owners. Existing backdoor-based dataset ownership verification methods suffer from inherent limitations: poison-label watermarks are easily detectable due to label inconsistencies, while clean-label watermarks face high technical complexity and failure on high-resolution images. Moreover, both approaches employ static watermark patterns that are vulnerable to detection and removal. To address these issues, this paper proposes a sample-specific clean-label backdoor watermarking (i.e., SSCL-BW). By training a U-Net-based watermarked sample generator, this method generates unique watermarks for each sample, fundamentally overcoming the vulnerability of static watermark patterns. The core innovation lies in designing a composite loss function with three components: target sample loss ensures watermark effectiveness, non-target sample loss guarantees trigger reliability, and perceptual similarity loss maintains visual imperceptibility. During ownership verification, black-box testing is employed to check whether suspicious models exhibit predefined backdoor behaviors. Extensive experiments on benchmark datasets demonstrate the effectiveness of the proposed method and its robustness against potential watermark removal attacks.

cs.CR↗

arXiv2025

DSSmoothing: Toward Certified Dataset Ownership Verification for Pre-trained Language Models via Dual-Space Smoothing

Large web-scale datasets have driven the rapid advancement of pre-trained language models (PLMs), but unauthorized data usage has raised serious copyright concerns. Existing dataset ownership verification (DOV) methods typically assume that watermarks remain stable during inference; however, this assumption often fails under natural noise and adversary-crafted perturbations. We propose the first certified dataset ownership verification method for PLMs under a gray-box setting (i.e., the defender can only query the suspicious model but is aware of its input representation module), based on dual-space smoothing (i.e., DSSmoothing). To address the challenges of text discreteness and semantic sensitivity, DSSmoothing introduces continuous perturbations in the embedding space to capture semantic robustness and applies controlled token reordering in the permutation space to capture sequential robustness. DSSmoothing consists of two stages: in the first stage, triggers are collaboratively embedded in both spaces to generate norm-constrained and robust watermarked datasets; in the second stage, randomized smoothing is applied in both spaces during verification to compute the watermark robustness (WR) of suspicious models and statistically compare it with the principal probability (PP) values of a set of benign models. Theoretically, DSSmoothing provides provable robustness guarantees for dataset ownership verification by ensuring that WR consistently exceeds PP under bounded dual-space perturbations. Extensive experiments on multiple representative web datasets demonstrate that DSSmoothing achieves stable and reliable verification performance and exhibits robustness against potential adaptive attacks. Our code is available at https://github.com/NcepuQiaoTing/DSSmoothing.

cs.CR↗

arXiv2025

CertDW: Towards Certified Dataset Ownership Verification via Conformal Calibration

Deep neural networks (DNNs) rely heavily on high-quality open-source datasets (e.g., ImageNet) for their success, making dataset ownership verification (DOV) crucial for protecting public dataset copyrights. In this paper, we find existing DOV methods (implicitly) assume that the verification process is faithful, where the suspicious model will directly verify ownership by using the verification samples as input and returning their results. However, this assumption may not necessarily hold in practice and their performance may degrade sharply when subjected to intentional or unintentional perturbations. To address this limitation, we propose the first certified dataset watermark (i.e., CertDW) and CertDW-based certified dataset ownership verification method that ensures reliable verification even under malicious attacks, under certain conditions (e.g., constrained pixel-level perturbation). Specifically, inspired by conformal prediction, we introduce two statistical measures, including principal probability (PP) and watermark robustness (WR), to assess model prediction stability on benign and watermarked samples under noise perturbations. We derive provable certification conditions relating WR to a PP-based calibration threshold, and a high-probability upper bound on the false positive rate, enabling ownership verification when a suspicious model's WR value significantly exceeds the PP values of multiple benign models trained on watermark-free datasets. If the number of PP values smaller than WR exceeds a threshold determined via conformal calibration, the suspicious model is regarded as having been trained on the protected dataset. Extensive experiments on benchmark datasets verify the effectiveness of our CertDW method and its resistance to potential adaptive attacks. Our codes are at \href{https://github.com/NcepuQiaoTing/CertDW}{GitHub}.

cs.LG↗

arXiv2025

Cert-SSBD: Certified Backdoor Defense with Sample-Specific Smoothing Noises

Deep neural networks (DNNs) are vulnerable to backdoor attacks, where an attacker manipulates a small portion of the training data to implant hidden backdoors into the model. The compromised model behaves normally on clean samples but misclassifies backdoored samples into the attacker-specified target class, posing a significant threat to real-world DNN applications. Currently, several empirical defense methods have been proposed to mitigate backdoor attacks, but they are often bypassed by more advanced backdoor techniques. In contrast, certified defenses based on randomized smoothing have shown promise by adding random noise to training and testing samples to counteract backdoor attacks. In this paper, we reveal that existing randomized smoothing defenses implicitly assume that all samples are equidistant from the decision boundary. However, it may not hold in practice, leading to suboptimal certification performance. To address this issue, we propose a sample-specific certified backdoor defense method, termed Cert-SSB. Cert-SSB first employs stochastic gradient ascent to optimize the noise magnitude for each sample, ensuring a sample-specific noise level that is then applied to multiple poisoned training sets to retrain several smoothed models. After that, Cert-SSB aggregates the predictions of multiple smoothed models to generate the final robust prediction. In particular, in this case, existing certification methods become inapplicable since the optimized noise varies across different samples. To conquer this challenge, we introduce a storage-update-based certification method, which dynamically adjusts each sample's certification region to improve certification performance. We conduct extensive experiments on multiple benchmark datasets, demonstrating the effectiveness of our proposed method. Our code is available at https://github.com/NcepuQiaoTing/Cert-SSB.

cs.CR↗

arXiv2025

A Trust-Aware and Cost-Optimized Blockchain Oracle Selection Model with Deep Reinforcement Learning

The rapid development of blockchain technology has driven the widespread application of decentralized applications (DApps) across various fields. However, DApps cannot directly access external data and rely on oracles to interact with off-chain data. As a bridge between blockchain and external data sources, oracles pose potential risks of malicious behavior, which may inject incorrect or harmful data, leading to trust and security issues. Additionally, with the surge in data requests, the disparity in oracle trustworthiness and costs has increased, making the dynamic selection of the most suitable oracle for each request a critical challenge. To address these issues, this paper proposes a Trust-Aware and Cost-Optimized Blockchain Oracle Selection Model with Deep Reinforcement Learning (TCO-DRL). The model incorporates a comprehensive trust management mechanism to evaluate oracle reputation from multiple dimensions and employs an improved sliding time window to monitor reputation changes in real time, enhancing resistance to malicious attacks. Moreover, TCO-DRL uses deep reinforcement learning algorithms to dynamically adapt to fluctuations in oracle reputation, ensuring the selection of high-reputation oracles while optimizing node selection, thereby reducing costs without compromising data quality. We implemented and validated TCO- DRL on Ethereum. Experimental results show that, compared to existing methods, TCO-DRL reduces the allocation rate to malicious oracles by more than 39.10% and saves over 12.00% in costs. Furthermore, simulated experiments on various malicious attacks further validate the robustness and effectiveness of TCO-DRL

cs.CE↗

arXiv2024

SE-GCL: An Event-Based Simple and Effective Graph Contrastive Learning for Text Representation

Text representation learning is significant as the cornerstone of natural language processing. In recent years, graph contrastive learning (GCL) has been widely used in text representation learning due to its ability to represent and capture complex text information in a self-supervised setting. However, current mainstream graph contrastive learning methods often require the incorporation of domain knowledge or cumbersome computations to guide the data augmentation process, which significantly limits the application efficiency and scope of GCL. Additionally, many methods learn text representations only by constructing word-document relationships, which overlooks the rich contextual semantic information in the text. To address these issues and exploit representative textual semantics, we present an event-based, simple, and effective graph contrastive learning (SE-GCL) for text representation. Precisely, we extract event blocks from text and construct internal relation graphs to represent inter-semantic interconnections, which can ensure that the most critical semantic information is preserved. Then, we devise a streamlined, unsupervised graph contrastive learning framework to leverage the complementary nature of the event semantic and structural information for intricate feature data capture. In particular, we introduce the concept of an event skeleton for core representation semantics and simplify the typically complex data augmentation techniques found in existing graph contrastive learning to boost algorithmic efficiency. We employ multiple loss functions to prompt diverse embeddings to converge or diverge within a confined distance in the vector space, ultimately achieving a harmonious equilibrium. We conducted experiments on the proposed SE-GCL on four standard data sets (AG News, 20NG, SougouNews, and THUCNews) to verify its effectiveness in text representation learning.

cs.CL↗

arXiv2024

Contrastive Multi-graph Learning with Neighbor Hierarchical Sifting for Semi-supervised Text Classification

Graph contrastive learning has been successfully applied in text classification due to its remarkable ability for self-supervised node representation learning. However, explicit graph augmentations may lead to a loss of semantics in the contrastive views. Secondly, existing methods tend to overlook edge features and the varying significance of node features during multi-graph learning. Moreover, the contrastive loss suffer from false negatives. To address these limitations, we propose a novel method of contrastive multi-graph learning with neighbor hierarchical sifting for semi-supervised text classification, namely ConNHS. Specifically, we exploit core features to form a multi-relational text graph, enhancing semantic connections among texts. By separating text graphs, we provide diverse views for contrastive learning. Our approach ensures optimal preservation of the graph information, minimizing data loss and distortion. Then, we separately execute relation-aware propagation and cross-graph attention propagation, which effectively leverages the varying correlations between nodes and edge features while harmonising the information fusion across graphs. Subsequently, we present the neighbor hierarchical sifting loss (NHS) to refine the negative selection. For one thing, following the homophily assumption, NHS masks first-order neighbors of the anchor and positives from being negatives. For another, NHS excludes the high-order neighbors analogous to the anchor based on their similarities. Consequently, it effectively reduces the occurrence of false negatives, preventing the expansion of the distance between similar samples in the embedding space. Our experiments on ThuCNews, SogouNews, 20 Newsgroups, and Ohsumed datasets achieved 95.86\%, 97.52\%, 87.43\%, and 70.65\%, which demonstrates competitive results in semi-supervised text classification.

cs.CL↗

arXiv2024

SEG:Seeds-Enhanced Iterative Refinement Graph Neural Network for Entity Alignment

Entity alignment is crucial for merging knowledge across knowledge graphs, as it matches entities with identical semantics. The standard method matches these entities based on their embedding similarities using semi-supervised learning. However, diverse data sources lead to non-isomorphic neighborhood structures for aligned entities, complicating alignment, especially for less common and sparsely connected entities. This paper presents a soft label propagation framework that integrates multi-source data and iterative seed enhancement, addressing scalability challenges in handling extensive datasets where scale computing excels. The framework uses seeds for anchoring and selects optimal relationship pairs to create soft labels rich in neighborhood features and semantic relationship data. A bidirectional weighted joint loss function is implemented, which reduces the distance between positive samples and differentially processes negative samples, taking into account the non-isomorphic neighborhood structures. Our method outperforms existing semi-supervised approaches, as evidenced by superior results on multiple datasets, significantly improving the quality of entity alignment.

cs.CL↗

arXiv2024

Graph Contrastive Learning via Cluster-refined Negative Sampling for Semi-supervised Text Classification

Graph contrastive learning (GCL) has been widely applied to text classification tasks due to its ability to generate self-supervised signals from unlabeled data, thus facilitating model training. However, existing GCL-based text classification methods often suffer from negative sampling bias, where similar nodes are incorrectly paired as negative pairs. This can lead to over-clustering, where instances of the same class are divided into different clusters. To address the over-clustering issue, we propose an innovative GCL-based method of graph contrastive learning via cluster-refined negative sampling for semi-supervised text classification, namely ClusterText. Firstly, we combine the pre-trained model Bert with graph neural networks to learn text representations. Secondly, we introduce a clustering refinement strategy, which clusters the learned text representations to obtain pseudo labels. For each text node, its negative sample set is drawn from different clusters. Additionally, we propose a self-correction mechanism to mitigate the loss of true negative samples caused by clustering inconsistency. By calculating the Euclidean distance between each text node and other nodes within the same cluster, distant nodes are still selected as negative samples. Our proposed ClusterText demonstrates good scalable computing, as it can effectively extract important information from from a large amount of data. Experimental results demonstrate the superiority of ClusterText in text classification tasks.

cs.LG↗

arXiv2020

The Tianlai Cylinder Pathfinder Array: System Functions and Basic Performance Analysis

The Tianlai Cylinder Pathfinder is a radio interferometer array designed to test techniques for 21 cm intensity mapping in the post-reionization Universe, with the ultimate aim of mapping the large scale structure and measuring cosmological parameters such as the dark energy equation of state. Each of its three parallel cylinder reflectors is oriented in the north-south direction, and the array has a large field of view. As the Earth rotates, the northern sky is observed by drift scanning. The array is located in Hongliuxia, a radio-quiet site in Xinjiang, and saw its first light in September 2016. In this first data analysis paper for the Tianlai cylinder array, we discuss the sub-system qualification tests, and present basic system performance obtained from preliminary analysis of the commissioning observations during 2016-2018. We show typical interferometric visibility data, from which we derive the actual beam profile in the east-west direction and the frequency band-pass response. We describe also the calibration process to determine the complex gains for the array elements, either using bright astronomical point sources, or an artificial on site calibrator source, and discuss the instrument response stability, crucial for transit interferometry. Based on this analysis, we find a system temperature of about 90 K, and we also estimate the sensitivity of the array.

astro-ph.IM↗

arXiv2010

Observation of Interplanetary Scintillation with Single-Station Mode at Urumqi

The Sun affects the Earth's physical phenomena in multiple ways, in particular the material in interplanetary space comes from coronal expansion in the form of inhomogeneous plasma flow (solar wind), which is the primary source of the interplanetary medium. Ground-based Interplanetary Scintillation (IPS) observations are an important and effective method for measuring solar wind speed and the structures of small diameter radio sources. We discuss one mode of ground-based single-station observations: Single-Station Single-Frequency (SSSF) mode. To realize the SSSF mode, a new system has been established at Urumqi Astronomical Observatory (UAO), China, and a series of experimental observations were carried out successfully from May to December, 2008.

astro-ph.SR↗