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: "broadcasting over the relay channel with oblivious cooperative strategy"
  Abstract: This paper investigates the problem of information transmission over the simultaneous relay channel with two users (or two possible channel outcomes) where for one of them the more suitable strategy is Decode-and-Forward (DF) while for the other one is Compress-and-Forward (CF). In this setting, it is assumed that the source wishes to send common and private informations to each of the users (or channel outcomes). This problem is relevant to: (i) the transmission of information over the broadcast relay channel (BRC) with different relaying strategies and (ii) the transmission of information over the conventional relay channel where the source is oblivious to the coding strategy of relay. A novel coding that integrates simultaneously DF and CF schemes is proposed and an inner bound on the capacity region is derived for the case of general memoryless BRCs. As special case, the Gaussian BRC is studied where it is shown that by means of the suggested broadcast coding the common rate can be improved compared to existing strategies. Applications of these results arise in broadcast scenarios with relays or in wireless scenarios where the source does not know whether the relay is collocated with the source or with the destination.

Connected through hyperedge HE-1 (induced by source paper "mixed noisy network coding and cooperative unicasting in wireless networks"):
  with members:
    - "short message noisy network coding with a decode forward option"
    - "a unified relay framework with both d f and c f relay nodes"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "selective coding strategy for unicast composite networks"
    - "wireless network information flow a deterministic approach"
    - "the degrees of freedom of compute and forward"
    - "short message quantize forward network coding"
    - "slepian wolf coding over cooperative relay networks"

Connected through hyperedge HE-2 (induced by source paper "selective coding strategy for unicast composite networks"):
  with members:
    - "on the optimal compressions in the compress and forward relay schemes"
    - "noisy network coding"

Connected through hyperedge HE-3 (induced by source paper "cooperative strategies for simultaneous and broadcast relay channels"):
  with members:
    - "a note on outer bounds for broadcast channel"
    - "capacity of a class of broadcast relay channels"
    - "compute and forward harnessing interference through structured codes"
    - "the impact of csi and power allocation on relay channel capacity and cooperation strategies"
    - "capacity of a class of modulo sum relay channels"
    - "rate regions for relay broadcast channels"
    - "broadcast channels with cooperating decoders"
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-4 (induced by source paper "cooperative strategies for interference limited wireless networks"):
  with members:
    - "an overview of the transmission capacity of wireless 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)