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 "a new sum rate outer bound for interference channels with three source destination pairs"):
  Abstract: This paper derives a novel sum-rate outer bound for the general memoryless interference channel with three users. The derivation is a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel. For the three-user Gaussian channel the proposed sum-rate outer bound outperforms known bounds for certain channel parameters.

Includes members:
  Member "on achievability of gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a new rate region for general interference channel improved hk region")
  Member "interference channels with source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "k user interference channels general outer bound and sum capacity for certain gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels")
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "sum capacity of k user gaussian degraded interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity bounds for the k user gaussian interference channel")
  Member "outer bounds for the interference channel with a cognitive relay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for a class of interference relay channels")
  Member "interference channel with generalized feedback a k a with source cooperation part i achievable region":
    also connected through other hyperedges:
      (none)
  Member "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")

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)