human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "at every corner determining corner points of two user gaussian interference channels"):
  with members:
    - "yet another proof of the entropy power inequality"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "on the corner points of the capacity region of a two user gaussian interference channel"
    - "information theoretic proofs of entropy power inequalities"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-2 (induced by source paper "the capacity of mixed and one sided gaussian interference channels"):
  with members:
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-3 (induced by source paper "optimal point to point codes in interference channels an incremental i mmse approach"):
  with members:
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "on the corner points of the capacity region of a two user gaussian interference channel"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-4 (induced by source paper "wasserstein continuity of entropy and outer bounds for interference channels"):
  with members:
    - "optimal point to point codes in interference channels an incremental i mmse approach"
    - "dissipation of information in channels with input constraints"
    - "on the corner points of the capacity region of a two user gaussian interference channel"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-5 (induced by source paper "codewords with memory improve achievable rate regions of the memoryless gaussian interference channel"):
  with members:
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "on the corner points of the capacity region of a two user gaussian interference channel"

Connected through hyperedge HE-6 (induced by source paper "multiple access gaussian channels with arbitrary inputs optimal precoding and power allocation"):
  with members:
    - "multi cell processing with limited cooperation a novel framework to timely designs and reduced feedback with general inputs"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-7 (induced by source paper "on the corner points of the capacity region of a two user gaussian interference channel"):
  with members:
    - "the han kobayashi region for a class of gaussian interference channels with mixed interference"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

Question: Please tell me which class the center node 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)