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 without clean reference"
  Abstract: We consider an amplify-and-forward relay network composed of a source, two relays, and a destination. In this network, the two relays are untrusted in the sense that they may perform Byzantine attacks by forwarding altered symbols to the destination. Note that every symbol received by the destination may be altered, and hence, no clean reference observation is available to the destination. For this network, we identify a large family of Byzantine attacks that can be detected in the physical layer. We further investigate how the channel conditions impact the detection against this family of attacks. In particular, we prove that all Byzantine attacks in this family can be detected with asymptotically small miss detection and false alarm probabilities by using a sufficiently large number of channel observations  if and only if  the network satisfies a non-manipulability condition. No pre-shared secret or secret transmission is needed for the detection of these attacks, demonstrating the value of this physical-layer security technique for counteracting Byzantine attacks.

Connected through hyperedge HE-1 (induced by source paper "robust beamforming and jamming for enhancing the physical layer security of full duplex radios"):
  with members:
    - "a new design paradigm for secure full duplex multiuser systems"
    - "iterative distributed minimum total mse approach for secure communications in mimo interference channels"
    - "secrecy transmit beamforming for heterogeneous networks"
    - "robust beamforming for secure communication in systems with wireless information and power transfer"
    - "secure beamforming for mimo broadcasting with wireless information and power transfer"
    - "security versus reliability analysis of opportunistic relaying"
    - "in band full duplex wireless challenges and opportunities"
    - "robust secure transmission in miso channels based on worst case optimization"

Connected through hyperedge HE-2 (induced by source paper "detecting arbitrary attacks using continuous secured side information in wireless networks"):
  with members:
    - "a coding approach to guarantee information integrity against a byzantine relay"
    - "detectability of symbol manipulation by an amplify and forward relay"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"

Connected through hyperedge HE-3 (induced by source paper "detecting byzantine attacks for gaussian two way relay system"):
  with members:
    - "a coding approach to guarantee information integrity against a byzantine relay"
    - "detectability of symbol manipulation by an amplify and forward relay"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"

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.IT(Information Theory)