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: "a coding approach to guarantee information integrity against a byzantine relay"
  Abstract: This paper presents a random coding scheme with which two nodes can exchange information with guaranteed integrity over a two-way Byzantine relay. This coding scheme is employed to obtain an inner bound on the capacity region with guaranteed information integrity. No pre-shared secret or secret transmission is needed for the proposed scheme. Hence the inner bound obtained is generally larger than those achieved based on secret transmission schemes. This approach advocates the separation of supporting information integrity and secrecy.

Connected through hyperedge HE-1 (induced by source paper "detecting arbitrary attacks using continuous secured side information in wireless networks"):
  with members:
    - "detecting byzantine attacks without clean reference"
    - "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-2 (induced by source paper "detecting byzantine attacks for gaussian two way relay system"):
  with members:
    - "detecting byzantine attacks without clean reference"
    - "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 without clean reference"):
  with members:
    - "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-4 (induced by source paper "keyless authentication in the presence of a simultaneously transmitting adversary"):
  with members:
    - "using the physical layer for wireless authentication in time variant channels"

Connected through hyperedge HE-5 (induced by source paper "link adaptation with untrusted relay assignment design and performance analysis"):
  with members:
    - "secrecy is cheap if the adversary must reconstruct"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "joint adaptive modulation coding and cooperative arq for wireless relay networks"
    - "a simple cooperative diversity method based on network path selection"
    - "applications of ldpc codes to the wiretap channel"

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)