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 "ergodic fading interference channels sum capacity and separability"):
  Abstract: The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of uniformly strong (every fading state is strong) and ergodic very strong two-sided IFCs (a mix of strong and weak fading states satisfying specific fading averaged conditions) the optimality of completely decoding the interference, i.e., converting the IFC to a compound multiple access channel (C-MAC), is proved. It is also shown that this capacity-achieving scheme requires encoding and decoding jointly across all fading states. As an achievable scheme and also as a topic of independent interest, the capacity region and the corresponding optimal power policies for an ergodic fading C-MAC are developed. For the sub-class of uniformly weak IFCs (every fading state is weak), genie-aided outer bounds are developed. The bounds are shown to be achieved by treating interference as noise and by separable coding for one-sided fading IFCs. Finally, for the sub-class of one-sided hybrid IFCs (a mix of weak and strong states that do not satisfy ergodic very strong conditions), an achievable scheme involving rate splitting and joint coding across all fading states is developed and is shown to perform at least as well as a separable coding scheme.

Includes members:
  Member "capacity regions and sum rate capacities of vector gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "signal processing and optimal resource allocation for the interference channel")
  Member "noisy interference sum rate capacity of parallel gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interference channel with an out of band relay")
  Member "ergodic interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-5 (induced by source paper "interference channel with an out of band relay")
  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 "multiple access outerbounds and the inseparability of parallel interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the ergodic capacity of phase fading interference networks")
  Member "the two user gaussian interference channel a deterministic view":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")

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)