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 region of k user discrete memoryless interference channels with a mixed strong very strong interference"):
  Abstract: The capacity region of the 3-user Gaussian Interference Channel (GIC) with mixed strong-very strong interference was established in \cite{ChS}. The mixed strong-very strong interference conditions considered in \cite{ChS} correspond to the case where, at each receiver, one of the interfering signals is strong and the other is very strong. In this paper, we derive the capacity region of $K$-user $(K\geq 3)$ Discrete Memoryless Interference Channels (DMICs) with a mixed strong-very strong interference. This corresponds to the case where, at each receiver one of the interfering signals is strong and the other $(K-2)$ interfering signals are very strong. This includes, as a special case, the 3-user DMIC with mixed strong-very strong interference. The proof is specialized to the 3-user GIC case and hence an alternative simpler derivation for the capacity region of the 3-user GIC with mixed strong-very strong interference is provided.

Includes members:
  Member "two user gaussian interference channel with finite constellation input and fdma":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on precoding for constant k user mimo gaussian interference channel with finite constellation inputs")
  Member "achievable rates in two user interference channels with finite inputs and very strong interference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a novel power allocation scheme for two user gmac with finite input constellations")
  Member "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  Member "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "three user cognitive interference channel capacity region with strong interference")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "capacity of symmetric k user gaussian very strong interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "strong interference alignment")
  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")

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)