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: "capacity bounds of half duplex gaussian cooperative interference channel"
  Abstract: In this paper, we investigate the half-duplex cooperative communication scheme of a two user Gaussian interference channel. We develop achievable region and outer bound for the case when the system allow either transmitter or receiver cooperation. We show that by using our transmitter cooperation scheme, there is significant capacity improvement compare to the previous results, especially when the cooperation link is strong. Further, if the cooperation channel gain is infinity, both our transmitter and receiver cooperation rates achieve their respective outer bound. It is also shown that transmitter cooperation provides larger achievable region than receiver cooperation under the same channel and power conditions.

Connected through hyperedge HE-1 (induced by source paper "cooperative relaying under spatially and temporally correlated interference"):
  with members:
    - "managing interference correlation through random medium access"
    - "effect of spatial interference correlation on the performance of maximum ratio combining"
    - "dual branch mrc receivers under spatial interference correlation and nakagami fading"
    - "cooperative relaying in a poisson field of interferers a diversity order analysis"
    - "diversity loss due to interference correlation"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"
    - "outage local throughput and capacity of random wireless networks"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-2 (induced by source paper "interference channels with half duplex source cooperation"):
  with members:
    - "partial decode forward binning schemes for the causal cognitive relay channels"
    - "wireless network information flow a deterministic approach"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "interference mitigation through limited receiver cooperation"
    - "capacity bounds for two hop interference networks"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-3 (induced by source paper "partial decode forward binning schemes for the causal cognitive relay channels"):
  with members:
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "study of gaussian relay channels with correlated noises"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "interference channels with source cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "on achievable rate regions for half duplex causal cognitive radio channels"
    - "interference channels with one cognitive transmitter"
    - "an achievable rate region for interference channels with conferencing"

Connected through hyperedge HE-4 (induced by source paper "achievable rates and outer bound for the half duplex mac with generalized feedback"):
  with members:
    - "a half duplex cooperative scheme with partial decode forward relaying"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"

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)