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 "outage analysis of block fading gaussian interference channels"):
  Abstract: This paper considers the asymptotic behavior of two-source block-fading single-antenna Gaussian interference channels in the high-SNR regime by means of the diversity-multiplexing tradeoff. We consider a general setting where the users and the average channel gains are not restricted to be symmetric. Our results are not just extensions of previous results for symmetric networks, as our setting covers scenarios that are not possible under the symmetric assumption, such as the case of "mixed" interference, i.e., when difference sources have different distances from their intended receivers. We derive upper and lower bounds on the diversity. We show that for a fairly large set of channel parameters the two bounds coincides.

Includes members:
  Member "diversity multiplexing tradeoff of the two user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the diversity multiplexing tradeoff of the mimo z interference channel")
  Member "on the achievable diversity multiplexing tradeoff in interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "diversity multiplexing tradeoff of the two user interference channel")
  Member "the diversity multiplexing tradeoff for interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a diversity multiplexing delay tradeoff of arq protocols in the z interference channel")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "multiple access outerbounds and the inseparability of parallel interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ergodic fading interference channels sum capacity and separability")
  Member "sum capacity of ergodic fading interference and compound multiaccess channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ergodic fading interference channels sum capacity and separability")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)