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 symmetric k user gaussian very strong interference channels"):
  Abstract: This paper studies a symmetric K user Gaussian interference channel with K transmitters and K receivers. A "very strong" interference regime is derived for this channel setup. A "very strong" interference regime is one where the capacity region of the interference channel is the same as the capacity region of the channel with no interference. In this regime, the interference can be perfectly canceled by all the receivers without incurring any rate penalties. A "very strong" interference condition for an example symmetric K user deterministic interference channel is also presented.

Includes members:
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "gaussian interference networks sum capacity in the low interference regime and new outer bounds on the capacity region":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "extended generalized dof optimality regime of treating interference as noise in the x channel")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "the case for structured random codes in network capacity theorems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information")
  Member "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "interference alignment and the degrees of freedom for the k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on off switched interference alignment for diversity multiplexing tradeoff improvement in the 2 user x network with two antennas")

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)