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: "on the sum capacity of many to one and one to many gaussian interference channels"
  Abstract: In this paper, we obtain new sum capacity results for the Gaussian many-to-one and one-to-many interference channels. Simple Han-Kobayashi (HK) schemes, i.e., HK schemes with Gaussian signaling, no time-sharing, and no common-private power splitting, achieve sum capacity under the channel conditions for which the new results are obtained. First, by careful Fourier-Motzkin elimination, we obtain the HK achievable rate region for the K-user Gaussian many-to-one and one-to-many channels in simplified form, i.e., only in terms of the K rates $R_1$, $R_2$,..., $R_K$. We also obtain the achievable sum rate using Fourier-Motzkin elimination. Then, to obtain sum capacity results, we derive genie-aided upper bounds that match the achievable sum rate of simple HK schemes under certain channel conditions.

Connected through hyperedge HE-1 (induced by source paper "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels"):
  with members:
    - "on the gaussian many to one x channel"
    - "capacity bounds for the k user gaussian interference channel"
    - "on the sum capacity of k user cascade gaussian z interference channel"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "capacity bounds for the gaussian interference channel"
    - "new outer bounds on the capacity region of gaussian interference channels"
    - "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)