human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "capacity of a class of broadcast relay channels"):
  Abstract: Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast #R##N#channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with #R##N#five nodes involves all the problems encountered in relay and broadcast channels. New inner bounds on the capacity #R##N#region of this class of channels are derived. These results can be seen as a generalization and hence unification of #R##N#previous work in this topic. Our bounds are based on the idea of recombination of message bits and various effective #R##N#coding strategies for relay and broadcast channels. Capacity result is obtained for the semi-degraded BRC-CR, where #R##N#one relay channel is degraded while the other one is reversely degraded. An inner and upper bound is also presented #R##N#for the degraded BRC with common relay (BRC-CR), where both the relay and broadcast channel are degraded which is #R##N#the capacity for the Gaussian case. Application of these results arise in the context of opportunistic cooperation #R##N#of cellular networks.

Includes members:
  Member "the capacity of a class of 3 receiver broadcast channels with degraded message sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "three receiver broadcast channels with side information")
  Member "rate regions for relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sharp bounds for mutual covering")
  Member "cooperative relay broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperative rate splitting for miso broadcast channel with user relaying and performance benefits over cooperative noma")

Question: Please tell me which class the source paper 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)