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: "half duplex or full duplex relaying a capacity analysis under self interference"
  Abstract: In this paper multi-antenna half-duplex and full-duplex relaying are compared from the perspective of achievable rates. Full-duplexing operation requires additional resources at the relay such as antennas and RF chains for self-interference cancellation. Using a practical model for the residual self-interference, full-duplex achievable rates and degrees of freedom are computed for the cases for which the relay has the same number of antennas or the same number of RF chains as in the half-duplex case, and compared with their half-duplex counterparts. It is shown that power scaling at the relay is necessary to maximize the the degrees of freedom in the full-duplex mode.

Connected through hyperedge HE-1 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation"):
  with members:
    - "enhancing multiuser mimo through opportunistic d2d cooperation"
    - "on the achievable rates of multihop virtual full duplex relay channels"
    - "noisy network coding with partial df"
    - "a survey on device to device communication in cellular networks"
    - "massive mimo multicasting in noncooperative cellular networks"
    - "spectrum sharing for device to device communication in cellular networks"
    - "modeling analysis and optimization of multicast device to device transmissions"
    - "short message noisy network coding with rate splitting"

Connected through hyperedge HE-2 (induced by source paper "partial duplex amplify and forward relaying spectral efficiency analysis under self interference"):
  with members:
    - "on the capacity of narrowband plc channels"
    - "capacity of the gaussian two hop full duplex relay channel with residual self interference"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"

Connected through hyperedge HE-3 (induced by source paper "half duplex or full duplex communications a capacity analysis under self interference"):
  with members:
    - "self interference in full duplex multi user mimo channels"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"
    - "broadcast capacity region of two phase bidirectional relaying"

Connected through hyperedge HE-4 (induced by source paper "relay assisted multiple access with full duplex multi packet reception"):
  with members:
    - "effect of energy harvesting on stable throughput in cooperative relay systems"
    - "stability and performance issues of a relay assisted multiple access scheme with mpr capabilities"
    - "on the stability region of a relay assisted multiple access scheme"
    - "network level cooperation in energy harvesting wireless networks"
    - "relay assisted multiple access with multi packet reception capability and simultaneous transmission and reception"
    - "cellular systems with full duplex compress and forward relaying and cooperative base stations"

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)