BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Xu Pan

Xu Pan contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Information Theorymath.ITArtificial Intelligencehep-phRobotics

Trust snapshot

Quick read

Trust 17 - UnverifiedVerification L1Unclaimed author
4works
0followers
5topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

4 published item(s)

preprint2026arXiv

Towards Backdoor-Based Ownership Verification for Vision-Language-Action Models

Vision-Language-Action models (VLAs) support generalist robotic control by enabling end-to-end decision policies directly from multi-modal inputs. As trained VLAs are increasingly shared and adapted, protecting model ownership becomes essential for secure deployment and responsible open-source usage. In this paper, we present GuardVLA, the first backdoor-based ownership verification framework specifically designed for VLAs. GuardVLA embeds a stealthy and harmless backdoor watermark into the protected model during training by injecting secret messages into embodied visual data. For post-release verification, we propose a swap-and-detect mechanism, in which the trigger projector and an external classifier head are used to activate and detect the embedded backdoor based on prediction probabilities. Extensive experiments across multiple datasets, model architectures, and adaptation settings demonstrate that GuardVLA enables reliable ownership verification while preserving benign task performance. Further results show that the embedded watermark remains detectable under post-release model adaptation.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Generalized $b$-symbol weights of Linear Codes and $b$-symbol MDS Codes

Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan \cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information in the symbol-pair read wire-tap channels of type II. In this paper, we introduce the notion of generalized $b$-symbol weights of linear codes over finite fields, which is a generalization of generalized Hamming weights and generalized pair weights. We obtain some basic properties and bounds of generalized $b$-symbol weights which are called Singleton-like bounds for generalized $b$-symbol weights. As examples, we calculate generalized weight matrices for simplex codes and Hamming codes. We provide a necessary and sufficient condition for a linear code to be a $b$-symbol MDS code by using the generator matrix and the parity check matrix of this linear code. Finally, a necessary and sufficient condition of a linear isomorphism preserving $b$-symbol weights between two linear codes is obtained. As a corollary, we get the classical MacWilliams extension theorem when $b=1$.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Constraining $U(1)_{L_μ-L_τ}$ charged dark matter model for muon $g-2$ anomaly with AMS-02 electron and positron data

Very recently, the Fermi-Lab reported the new experimental combined results on the magnetic momentum of muon with a 4.2$σ$ discrepancy compared with the expectation of the Standard Model \cite{Fermi_Lab}. A new light gauge boson $X$ in the $L_μ-L_τ$ model provides a good explanation for the $g-2$ anomaly. A Dirac fermion dark matter with a large $L_μ-L_τ$ charge can explain both the $g-2$ anomaly and the dark matter relic density \cite{Asai_2021}. In this work, we focus on the case that the mass of the dark matter is larger than the mass of muon (i.e. $m_Ψ > m_μ$) for which the channel $ΨΨ\rightarrow μ^- μ^+$ opens. Although the cross section $(σv)_{μ^{-}μ^{+}}$ is smaller by a factor of $1/q_Ψ^2$ ($q_Ψ$ represents the $L_μ-L_τ$ charge of the dark matter) compared with the channel $ΨΨ\rightarrow XX \rightarrow νν\barν\barν$, the resulting secondary electrons and positrons could imprint on their spectra above GeV energies due to the reacceleration effect of cosmic ray propagation. We use the AMS-02 measurements of electrons and positrons to constrain the annihilation cross section of the channel $ΨΨ\rightarrow μ^{-}μ^{+}$, which rules out part of the parameter space of the large $L_μ-L_τ$ charged dark matter model to account for the muon $g-2$ anomaly.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Generalized Pair Weights of Linear Codes and Linear Isomorphisms Preserving Pair Weights

In this paper, we first introduce the notion of generalized pair weights of an $[n, k]$-linear code over the finite field $\mathbb{F}_q$ and the notion of pair $r$-equiweight codes, where $1\le r\le k-1$. Some basic properties of generalized pair weights of linear codes over finite fields are derived. Then we obtain a necessary and sufficient condition for an $[n,k]$-linear code to be a pair equiweight code, and we characterize pair $r$-equiweight codes for any $1\le r\le k-1$. Finally, a necessary and sufficient condition for a linear isomorphism preserving pair weights between two linear codes is obtained.

0 citations0 reviewsNo code linkedOpen access