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 "an upper bound on the sum capacity of the downlink multicell processing with finite backhaul capacity"):
  Abstract: In this paper, we study upper bounds on the sum capacity of the downlink multicell processing model with finite backhaul capacity for the simple case of 2 base stations and 2 mobile users. It is modelled as a two-user multiple access diamond channel. It consists of a first hop from the central processor to the base stations via orthogonal links of finite capacity, and the second hop from the base stations to the mobile users via a Gaussian interference channel. The converse is derived using the converse tools of the multiple access diamond channel and that of the Gaussian MIMO broadcast channel. Through numerical results, it is shown that our upper bound improves upon the existing upper bound greatly in the medium backhaul capacity range, and as a result, the gap between the upper bounds and the sum rate of the time-sharing of the known achievable schemes is significantly reduced.

Includes members:
  Member "capacity bounds for diamond networks with an orthogonal broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity regions of cloud radio access networks with limited orthogonal fronthaul")
  Member "capacity bounds for a class of diamond networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity bounds on the downlink of symmetric multi relay single receiver c ran networks")
  Member "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm")
  Member "compute and forward strategies for cooperative distributed antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "private information retrieval over gaussian mac")
  Member "the gaussian multiple access diamond channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized compression strategy for the downlink cloud radio access network")
  Member "an extremal inequality motivated by multiterminal information theoretic problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "vector gaussian successive refinement with degraded side information")

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)