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: "superposition coded concurrent decode and forward relaying"
  Abstract: In this paper, a superposition-coded concurrent decode-and-forward (DF) relaying protocol is presented. A specific scenario, where the inter-relay channel is sufficiently strong, is considered. Assuming perfect source-relay transmissions, the proposed scheme further improves the diversity performance of previously proposed repetition-coded concurrent DF relaying, in which the advantage of the inter-relay interference is not fully extracted.

Connected through hyperedge HE-1 (induced by source paper "relay pair selection in buffer aided successive opportunistic relaying using a multi antenna source"):
  with members:
    - "decoupled uplink and downlink in a wireless system with buffer aided relaying"
    - "virtual full duplex buffer aided relaying in the presence of inter relay interference"
    - "a buffer aided successive opportunistic relay selection scheme with power adaptation and inter relay interference cancellation for cooperative diversity systems"
    - "selective cooperative relaying over time varying channels"
    - "recovering multiplexing loss through successive relaying using repetition coding"
    - "a simple cooperative diversity method based on network path selection"
    - "towards the optimal amplify and forward cooperative diversity scheme"

Connected through hyperedge HE-2 (induced by source paper "relay pair selection with source precoding in buffer aided successive opportunistic relaying"):
  with members:
    - "decoupled uplink and downlink in a wireless system with buffer aided relaying"
    - "virtual full duplex buffer aided relaying in the presence of inter relay interference"
    - "a buffer aided successive opportunistic relay selection scheme with power adaptation and inter relay interference cancellation for cooperative diversity systems"
    - "selective cooperative relaying over time varying channels"
    - "recovering multiplexing loss through successive relaying using repetition coding"
    - "a simple cooperative diversity method based on network path selection"
    - "towards the optimal amplify and forward cooperative diversity scheme"

Connected through hyperedge HE-3 (induced by source paper "a buffer aided successive opportunistic relay selection scheme with power adaptation and inter relay interference cancellation for cooperative diversity systems"):
  with members:
    - "buffer aided relaying with adaptive link selection"
    - "opportunistic buffered decode wait and forward obdwf protocol for mobile wireless relay networks"
    - "relay selection for two way relaying with amplify and forward protocols"
    - "splitting algorithms for fast relay selection generalizations analysis and a unified view"
    - "recovering multiplexing loss through successive relaying using repetition coding"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-4 (induced by source paper "relay selection with network coding in two way relay channels"):
  with members:
    - "physical network coding in two way wireless relay channels"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-5 (induced by source paper "protocols and performance limits for half duplex relay networks"):
  with members:
    - "analysis of a mixed strategy for multiple relay 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.IT(Information Theory)