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 fading interference channels the ergodic very strong case"):
  Abstract: Sufficient conditions required to achieve the interference-free capacity region of ergodic fading K-user interference channels (IFCs) are obtained. In particular, this capacity region is shown to be achieved when every receiver decodes all K transmitted messages such that the channel statistics and the waterfilling power policies for all K (interference-free) links satisfy a set of K(K-1) ergodic very strong conditions. The result is also of independent interest in combinatorics.

Includes members:
  Member "noisy interference sum rate capacity of parallel gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ergodic fading interference channels sum capacity and separability")
  Member "ergodic interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "on the separability of parallel gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ergodic fading interference channels sum capacity and separability")
  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-5 (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-6 (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-7 (induced by source paper "strong interference alignment")
  Member "new outer bounds on the capacity region of gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels")

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)