human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "detecting byzantine attacks for gaussian two way relay system"
  Abstract: This paper focuses on Byzantine attack detection for Gaussian two-way relay network. In this network, two source nodes communicate with each other with the help of an amplify-and-forward relay which may perform Byzantine attacks by forwarding altered symbols to the sources. For simple investigating the detectability of attacks conducted in Gaussian channels, we focus on the MA channel of the network, while assuming the BC channel is noiseless. Upon such model, we propose a attack detection scheme implemented in the sources. Specifically, we consider a open wireless propagation environment that allows the symbols, forwarded by the relay, to go through a continuous channel and arrive to the sources. With the observations of the source, we develop a detection scheme for the source by comparing the joint empirical distribution of its received and transmitted signals with the known channel statistics. The main contribution of this paper is to prove that if and only if the Gaussian relay network satisfies a non-manipulable channel condition, the proposed detection scheme can detect arbitrary attacks that allows the stochastic distributions of altered symbols to vary arbitrarily and depend on each other. No pre-shared secret or secret transmission is needed for the detection. Furthermore, we also prove that for the considered Gaussian two-way relay networks, the non-manipulable channel condition is always satisfied. This result indicates that arbitrary attacks conducted in MA Gaussian channels are detectable by only using observations, while providing a base for attack detection in more general Gaussian networks.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CR(Cryptography and Security)