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: "broadcast cooperation strategies for two colocated users"
  Abstract: This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocation nature of the users allows cooperation, which increases the overall achievable rate, from the transmitter to the destined user. The transmitter is ignorant of the fading coefficients, while receivers have access to perfect channel state information (CSI). This gives rise to the multi-layer broadcast approach used by the transmitter. The broadcast approach allows, in our network setting, to improve the cooperation between the colocated users. That is due to the nature of broadcasting, where the better the channel quality, the more layers that can be decoded. The cooperation between the users is performed over an additive white Gaussian channels (AWGN), with a relaying power constraint, and unlimited bandwidth. Three commonly used cooperation techniques are studied: amplify-forward (AF), compress-forward (CF), and decode-forward (DF). These methods are extended using the broadcast approach, for the case of relaxed decoding delay constraint. For this case a separated processing of the layers, which includes multi-session cooperation is shown to be beneficial. Further, closed form expressions for infinitely many AF sessions and recursive expressions for the more complex CF are given. Numerical results for the various cooperation strategies demonstrate the efficiency of multi-session cooperation.

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 "broadcast approaches to the diamond channel"):
  with members:
    - "maximum throughput in multiple antenna systems"
    - "experiment driven characterization of full duplex wireless systems"
    - "proof of the outage probability conjecture for miso channels"
    - "pushing the limits of full duplex design and real time implementation"
    - "an efficient adaptive distributed space time coding scheme for cooperative relaying"
    - "asymptotic analysis of amplify and forward relaying in a parallel mimo relay network"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-3 (induced by source paper "broadcast approach and oblivious cooperative strategies for the wireless relay channel part i sequential decode and forward sdf"):
  with members:
    - "interaction strictly improves the wyner ziv rate distortion function"

Connected through hyperedge HE-4 (induced by source paper "on the role of estimate and forward with time sharing in cooperative communications"):
  with members:
    - "broadcast channels with cooperating decoders"
    - "an achievability result for the general relay 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)