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 effect of maximal rate codes on the interfering message rate"):
  Abstract: The effect of "good", point-to-point capacity achieving, code sequences on an additional signal, of bounded variance, transmitted over the additive Gaussian noise channel is examined. For such code sequences, it is shown that their effect, in terms of mutual information, on the additional bounded variance signal, is as if additional additive Gaussian noise has been transmitted. Moreover, the analysis shows that for reliable communication the bounded variance signal must be completely estimated by the receiver (i.e., the minimum mean-square error tends to zero). This result resolves the "Costa Conjecture" regarding the corner points of the two-user Gaussian interference channel for code sequences of bounded variance, and shows that both messages must be reliably decoded.

Includes members:
  Member "on mmse properties of codes for the gaussian broadcast and wiretap channels":
    also connected through other hyperedges:
      (none)
  Member "sub optimality of the han kobayashi achievable region for interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "trade off between communication and cooperation in the interference channel")
  Member "random coding error exponents for the two user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exact error and erasure exponents for the asymmetric broadcast channel")
  Member "wasserstein continuity of entropy and outer bounds for interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a lower bound on the expected distortion of joint source channel coding")
  Member "on the two user interference channel with lack of knowledge of the interference codebook at one receiver":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "uplink non orthogonal multiple access with finite alphabet inputs")
  Member "sub optimality of treating interference as noise in the cellular uplink with weak interference":
    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 "on discrete alphabets for the two user gaussian interference channel with one receiver lacking knowledge of the interfering codebook":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the capacity of cloud radio access networks with oblivious relaying")
  Member "on the optimality of treating interference as noise general message sets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")

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)