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 "k user interference channels general outer bound and sum capacity for certain gaussian channels"):
  Abstract: This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derived bound is the first known outer bound region valid for any memoryless channel besides the cut-set bound, which is loose even in the two-user case. In Gaussian noise, classes of channels for which the proposed bound gives the sum-rate capacity are identified, including degraded channels and a class of Z-channels.

Includes members:
  Member "a new sum rate outer bound for interference channels with three source destination pairs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for the k user gaussian interference channel")
  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 "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-5 (induced by source paper "capacity bounds for a class of interference relay channels")
  Member "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi phase smart relaying and cooperative jamming in secure cognitive radio networks")
  Member "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "three user cognitive interference channel capacity region with strong interference")
  Member "on the degrees of freedom of the k user gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "real interference alignment exploiting the potential of single antenna systems")

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)