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 "the k user interference channel strong interference regime"):
  Abstract: This paper presents a solution for one of the open problems in network information theory: “What is the generalization of the strong interference regime to the K-user interference channel?” A new approach is developed based on which one can obtain strong interference regimes not only for the multi-user interference channels but also for other interference networks with any arbitrary topology. To this development, some new lemmas are proved which have a central role in our derivations. As a result, this paper establishes the first non-trivial capacity result for the general multi-user classical interference channel (for both discrete and Gaussian channels).

Includes members:
  Member "fundamental limits of communications in interference networks part iii information flow in strong interference regime":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interference alignment with diversity for the 2 times 2 x network with four antennas")
  Member "how much rate splitting is required for a random coding scheme a new achievable rate region for the broadcast channel with cognitive relays":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity region of the two user interference channel")
  Member "fundamental limits of communications in interference networks part i basic structures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit")
  Member "fundamental limits of communications in interference networks part ii information flow in degraded networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit")
  Member "fundamental limits of communications in interference networks part iv networks with a sequence of less noisy receivers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "how much rate splitting is required for a random coding scheme a new achievable rate region for the broadcast channel with cognitive relays")
  Member "interference networks with general message sets a random coding scheme":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for wireless ergodic fading broadcast channels with partial csit")
  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")
  Member "capacity of symmetric k user gaussian very strong interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "strong interference alignment")

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)